1 citations · 1 across the 1 of their papers we have counts for
5 papers
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.…
A Programming Model for Disaggregated Memory over CXL
Gal Assa, Moritz Lumme, Lucas Bürgi +2
CXL (Compute Express Link) is an emerging open industry-standard interconnect between processing and memory devices that is expected to revolutionize the way systems are designed.…
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…
Discovering Strong Gravitational Lenses in the Dark Energy Survey with Interactive Machine Learning and Crowd-sourced Inspection with Space Warps
J. Gonzalez, P. Holloway, T. Collett +70
We conduct a search for strong gravitational lenses in the Dark Energy Survey (DES) Year 6 imaging data. We implement a pre-trained Vision Transformer (ViT) for our machine learnin…