Truly stateless, optimal dynamic partial order reduction
M Kokologiannakis, I Marmanis, V Gladstein… - Proceedings of the …, 2022 - dl.acm.org
Dynamic partial order reduction (DPOR) verifies concurrent programs by exploring all their
interleavings up to some equivalence relation, such as the Mazurkiewicz trace equivalence …
interleavings up to some equivalence relation, such as the Mazurkiewicz trace equivalence …
Coarser Equivalences for Causal Concurrency
Trace theory (formulated by Mazurkiewicz in 1987) is a principled framework for defining
equivalence relations for concurrent program runs based on a commutativity relation over …
equivalence relations for concurrent program runs based on a commutativity relation over …
Unblocking Dynamic Partial Order Reduction
Existing dynamic partial order reduction (DPOR) algorithms scale poorly on concurrent data
structure benchmarks because they visit a huge number of blocked executions due to …
structure benchmarks because they visit a huge number of blocked executions due to …
Dynamic partial order reduction for checking correctness against transaction isolation levels
A Bouajjani, C Enea, E Román-Calvo - Proceedings of the ACM on …, 2023 - dl.acm.org
Modern applications, such as social networking systems and e-commerce platforms are
centered around using large-scale databases for storing and retrieving data. Accesses to the …
centered around using large-scale databases for storing and retrieving data. Accesses to the …
How Hard Is Weak-Memory Testing?
Weak-memory models are standard formal specifications of concurrency across hardware,
programming languages, and distributed systems. A fundamental computational problem is …
programming languages, and distributed systems. A fundamental computational problem is …
Optimal stateless model checking for causal consistency
We present a framework for efficient stateless model checking (SMC) of concurrent
programs under three prominent models of causal consistency, CCv, CM, CC. Our approach …
programs under three prominent models of causal consistency, CCv, CM, CC. Our approach …
Optimal Reads-From Consistency Checking for C11-Style Memory Models
Over 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 …
concurrency semantics of C/C++. One of the most fundamental problems associated with a …
Consistency-preserving propagation for SMT solving of concurrent program verification
The happens-before orders have been widely adopted to model thread interleaving
behaviors of concurrent programs. A dedicated ordering theory solver, usually composed of …
behaviors of concurrent programs. A dedicated ordering theory solver, usually composed of …
Reconciling preemption bounding with DPOR
There are two major techniques for scaling up stateless model checking: dynamic partial
order reduction (DPOR), which only explores executions that differ in the ordering of racy …
order reduction (DPOR), which only explores executions that differ in the ordering of racy …
Enhancing GenMC's Usability and Performance
M Kokologiannakis, R Majumdar… - … Conference on Tools and …, 2024 - Springer
GenMC is a state-of-the-art stateless model checker that can verify safety properties of
concurrent C/C++ programs under a wide range of memory consistency models, such as …
concurrent C/C++ programs under a wide range of memory consistency models, such as …