12 citations · 30 across the 10 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.PL2021
Visibility Reasoning for Concurrent Snapshot Algorithms
Joakim Öhman, Aleksandar Nanevski
Visibility relations have been proposed by Henzinger et al. as an abstraction for proving linearizability of concurrent algorithms that obtains modular and reusable proofs. This is…
cs.PL2021
Contextual Modal Types for Algebraic Effects and Handlers
Nikita Zyuzin, Aleksandar Nanevski
Programming languages with algebraic effects often track the computations' effects using type-and-effect systems. In this paper, we propose to view an algebraic effect theory of a…