Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability
Proceedings of the ACM on Programming Languages (PACMPL), Volume 8, Issue POPLArticle No.: 42, Pages 1239–1268https://doi.org/10.1145/3632884Dyck reachability is a principled, graph-based formulation of a plethora of static analyses. Bidirected graphs are used for capturing dataflow through mutable heap data, and are usual formalisms of demand-driven points-to and alias analyses. The best (...
- research-articleJanuary 2024
How Hard Is Weak-Memory Testing?
Proceedings of the ACM on Programming Languages (PACMPL), Volume 8, Issue POPLArticle No.: 66, Pages 1978–2009https://doi.org/10.1145/3632908Weak-memory models are standard formal specifications of concurrency across hardware, programming languages, and distributed systems. A fundamental computational problem is consistency testing: is the observed execution of a concurrent program in ...
Optimal Reads-From Consistency Checking for C11-Style Memory Models
- Hünkar Can Tunç,
- Parosh Aziz Abdulla,
- Soham Chakraborty,
- Shankaranarayanan Krishna,
- Umang Mathur,
- Andreas Pavlogiannis
Proceedings of the ACM on Programming Languages (PACMPL), Volume 7, Issue PLDIArticle No.: 137, Pages 761–785https://doi.org/10.1145/3591251Over the years, several memory models have been proposed to capture the subtle concurrency semantics of C/C++. One of the most fundamental problems associated with a memory model M is consistency checking: given an execution X, is X consistent with M? ...