Towards Gradual Checking of Reference Capabilities
Concurrent and parallel programming is difficult due to the presence of memory side-effects, which may introduce data races. Type qualifiers, such as reference capabilities, can remove data races by restricting sharing of mutable data.
Unfortunately, reference capability languages are an all-in or nothing game, i.e., all the types must be annotated with reference capabilities. In this work in progress, we propose to mix the ideas from the reference capability literature with gradual typing, leading to gradual reference capabilities.
Tue 22 OctDisplayed time zone: Beirut change
11:00 - 12:30
|Which of my Transient Type Checks are not (Almost) Free?|
|Efficient Fail-Fast Dynamic Subtype Checking|
|Towards Gradual Checking of Reference Capabilities|
Kiko Fernandez-Reyes Uppsala University, Isaac Oscar Gariano Victoria University of Wellington, James Noble Victoria University of Wellington, Tobias Wrigstad Uppsala UniversityPre-print
|Formal Verification of JIT by Symbolic Execution|
Boris Shingarov LabWare