Optimal dynamic partial order reduction

DOI10.1145/2535838.2535845zbMath1284.68377OpenAlexW2008078972WikidataQ58967544 ScholiaQ58967544MaRDI QIDQ5408432

Stavros Aronis, Bengt Jonsson, Parosh Aziz Abdulla, Konstantinos Sagonas

Publication date: 10 April 2014

Published in: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2535838.2535845

zbMATH Keywords

concurrencysoftware model checkingdynamic partial order reductionsource setssystematic testingwakeup trees

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Specification and verification (program logics, model checking, etc.) (68Q60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (12)

Global Reproducibility Through Local Control for Distributed Active Objects ⋮ Stateless model checking under a reads-value-from equivalence ⋮ Automated Synthesis of Distributed Controllers ⋮ On Distributed Monitoring and Synthesis ⋮ POR for security protocol equivalences. Beyond action-determinism ⋮ Stateless model checking for TSO and PSO ⋮ Quantifiability: a concurrent correctness condition modeled in vector space ⋮ Unfolding-based dynamic partial order reduction of asynchronous distributed programs ⋮ Unnamed Item ⋮ Analysis of correct synchronization of operating system components ⋮ Approximate partial order reduction ⋮ Quasi-optimal partial order reduction

Uses Software

• Erlang

This page was built for publication: Optimal dynamic partial order reduction