Write a Blog >>
SPLASH 2019
Sun 20 - Fri 25 October 2019 Athens, Greece
Tue 22 Oct 2019 12:00 - 12:15 at Abbey - Session #2 Chair(s): Anthony Canino

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 Oct

Displayed time zone: Beirut change

11:00 - 12:30
Session #2VMIL at Abbey
Chair(s): Anthony Canino SUNY Binghamton
11:00
30m
Full-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
30m
Full-paper
Efficient Fail-Fast Dynamic Subtype Checking
VMIL
Rohan Padhye University of California, Berkeley, Koushik Sen University of California, Berkeley
Pre-print
12:00
15m
Talk
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
15m
Talk
Formal Verification of JIT by Symbolic Execution
VMIL