3 citations · 4 across the 2 of their papers we have counts for
4 papers · 1 filter
Rely-Guarantee Reasoning for Causally Consistent Shared Memory (Extended Version)
Ori Lahav, Brijesh Dongol, Heike Wehrheim
Rely-guarantee (RG) is a highly influential compositional proof technique for concurrent programs, which was originally developed assuming a sequentially consistent shared memory.…
Two-sorted algebraic decompositions of Brookes's shared-state denotational semantics
Yotam Dvir, Ohad Kammar, Ori Lahav +1
We use a two sorted equational theory of algebraic effects to model concurrent shared state with preemptive interleaving, recovering Brookes's seminal 1996 trace-based model precis…
Dynamic Robustness Verification Against Weak Memory (Extended Version)
Roy Margalit, Michalis Kokologiannakis, Shachar Itzhaky +1
Dynamic race detection is a highly effective runtime verification technique for identifying data races by instrumenting and monitoring concurrent program runs. However, standard dy…
Extending the C/C++ Memory Model with Inline Assembly
Paulo EmÃlio de Vilhena, Ori Lahav, Viktor Vafeiadis +1
Programs written in C/C++ often include inline assembly: a snippet of architecture-specific assembly code used to access low-level functionalities that are impossible or expensive…