67 citations · 123 across the 37 of their papers we have counts for
23 papers · 1 filter
On the Decidability of Verification under Release/Acquire
Giovanna Kobus Conrado, Andreas Pavlogiannis
The verification of concurrent programs under weak-memory models is a burgeoning effort, owing to the increasing adoption of weak memory in concurrent software and hardware. Releas…
Fast Atomicity Monitoring
Hünkar Can Tun, Yifan Dong, Andreas Pavlogiannis
Atomicity is a fundamental abstraction in concurrency, specifying that program behavior can be understood by considering specific code blocks executing atomically. However, atomici…
The Complexity of Testing Message-Passing Concurrency
Zheng Shi, Lasse Møldrup, Umang Mathur +1
A key computational question underpinning the automated testing and verification of concurrent programs is the consistency question - given a partial execution history, can it be c…
AWDIT: An Optimal Weak Database Isolation Tester
Lasse Møldrup, Andreas Pavlogiannis
In order to achieve low latency, high throughput, and partition tolerance, modern databases forgo strong transaction isolation for weak isolation guarantees. However, several produ…
Program Analysis via Multiple Context Free Language Reachability
Giovanna Kobus Conrado, Adam Husted Kjelstrøm, Andreas Pavlogiannis +1
Context-free language (CFL) reachability is a standard approach in static analyses, where the analysis question is phrased as a language reachability problem on a graph wrt a C…
CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis
Hünkar Can Tunç, Ameya Prashant Deshmukh, Berk Çirisci +2
Dynamic analyses are a standard approach to analyzing and testing concurrent programs. Such techniques observe program traces and analyze them to infer the presence or absence of b…