Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
SPORE: Combining Symmetry and Partial Order Reduction
Proceedings of the ACM on Programming Languages (PACMPL), Volume 8, Issue PLDIArticle No.: 219, Pages 1781–1803https://doi.org/10.1145/3656449Symmetry reduction (SR) and partial order reduction (POR) aim to scale up model checking by exploiting the underlying program structure: SR avoids exploring executions equivalent up to some permutation of symmetric threads, while POR avoids exploring ...
- ArticleJuly 2023
Unblocking Dynamic Partial Order Reduction
AbstractExisting dynamic partial order reduction (DPOR) algorithms scale poorly on concurrent data structure benchmarks because they visit a huge number of blocked executions due to spinloops.
In response, we develop Awamoche, a sound, complete, and ...
- ArticleApril 2023
Reconciling Preemption Bounding with DPOR
Tools and Algorithms for the Construction and Analysis of SystemsApr 2023, Pages 85–104https://doi.org/10.1007/978-3-031-30823-9_5AbstractThere 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 accesses, and preemption bounding, which only explores executions ...
- ArticleFebruary 2023
SMT-Based Verification of Persistency Invariants of Px86 Programs
Verified Software. Theories, Tools and Experiments.Oct 2022, Pages 92–110https://doi.org/10.1007/978-3-031-25803-9_6AbstractWhile non-volatile memory (NVM) promises to be both performant and durable, the semantics provided by the hardware architectures are rather subtle and significantly complicate reasoning about the possible observed state after a crash.
Starting from ...
Truly stateless, optimal dynamic partial order reduction
Proceedings of the ACM on Programming Languages (PACMPL), Volume 6, Issue POPLArticle No.: 49, Pages 1–28https://doi.org/10.1145/3498711Dynamic partial order reduction (DPOR) verifies concurrent programs by exploring all their interleavings up to some equivalence relation, such as the Mazurkiewicz trace equivalence. Doing so involves a complex trade-off between space and time. Existing ...