SPLASH 2019 (series) / VMIL 2019 (series) / VMIL 2019 /
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
Tue 22 Oct
Displayed time zone: Beirut change
11:00 - 12:30 | |||
11:00 30mFull-paper | Which of my Transient Type Checks are not (Almost) Free? VMIL Isaac Oscar Gariano Victoria University of Wellington, Richard Roberts Victoria University of Wellington, Stefan Marr University of Kent, Michael Homer Victoria University of Wellington, James Noble Victoria University of Wellington | ||
11:30 30mFull-paper | Efficient Fail-Fast Dynamic Subtype Checking VMIL Pre-print | ||
12:00 15mTalk | Towards Gradual Checking of Reference Capabilities VMIL Kiko Fernandez-Reyes Uppsala University, Isaac Oscar Gariano Victoria University of Wellington, James Noble Victoria University of Wellington, Tobias Wrigstad Uppsala University Pre-print | ||
12:15 15mTalk | Formal Verification of JIT by Symbolic Execution VMIL Boris Shingarov LabWare |