research
∙
07/10/2023
Visibility and Separability for a Declarative Linearizability Proof of the Timestamped Stack: Extended Version
Linearizability is a standard correctness criterion for concurrent algor...
share
research
∙
07/10/2023
Declarative Linearizability Proofs for Descriptor-Based Concurrent Helping Algorithms
Linearizability is a standard correctness criterion for concurrent algor...
research
∙
10/06/2021
Visibility Reasoning for Concurrent Snapshot Algorithms
Visibility relations have been proposed by Henzinger et al. as an abstra...
research
∙
03/04/2021
Contextual Modal Types for Algebraic Effects and Handlers
Programming languages with algebraic effects often rely on effect annota...
research
∙
10/23/2020
On Algebraic Abstractions for Concurrent Separation Logics
Concurrent separation logic is distinguished by transfer of state owners...
research
∙
10/02/2020
Proving Highly-Concurrent Traversals Correct
Modern highly-concurrent search data structures, such as search trees, o...
research
∙
04/15/2019
Specifying Concurrent Programs in Separation Logic: Morphisms and Simulations
In addition to pre- and postconditions, program specifications in recent...
research
∙
09/22/2017
