Exploring The Design Space For Runtime Enforcement of Dynamic Capabilities
summary
Dala implements three safe object flavours—ISO (isolated), immutable, local—and the paper enumerates six enforcement axes that yield 2,880 combinations and distills them into five designs implemented on a Grace-derived VM (GraceKit). It compares concrete enforcement choices (destructive-read moves, borrow-on-access with runtime reference-count checks, flavor assignment and possible flavor changes), aims for data-race freedom, and reports a student prototype of five variants for empirical exploration (no broad usability results yet).
AI-written summary · about
chapters (7)
- 0:00Introduction
- 10:34Motivation for concurrency
- 12:21Dala model flavors
- 21:47Code examples and language design
- 24:36Enforcement axes and design choices
- 28:46Implementation and evaluation
- 30:30Conclusion
related talks
14mDala: A Simple Capability-Based Dynamic Language Design For Data Race-Freedom
01h 11mProgramming language memory models: Problems, solutions, and directions
18mDynamic Region Ownership for Concurrency Safety
49mAdventures on the Road to Valhalla
19mAn Axiomatic Basis for Computer Programming on the Relaxed Arm-A Architecture: T...
25mOn the need for available, functional, and reusable memory models
18mSound Static Data Race Verification for C: Is the Race Lost?
24mTaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Pr