A pragmatic approach to stateful partial order reduction

DOI10.1007/978-3-031-24950-1_7zbMath1529.68156arXiv2211.11942OpenAlexW4316662751MaRDI QIDQ6132490

Suha Orhun Mutluergil, Berk Çirisci, Azadeh Farzan, Constantin Enea

Publication date: 17 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.11942

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• From invariant checking to invariant inference using randomized search
• Prespecification in data refinement
• Verification of distributed programs using representative interleaving sequences
• LCF considered as a programming language
• Stateless model checking for TSO and PSO
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• State space reduction using partial order techniques
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Bounded Phase Analysis of Message-Passing Programs
• Source Sets
• Comparing Source Sets and Persistent Sets for Partial Order Reduction
• Dynamic partial-order reduction for model checking software
• Delay-bounded scheduling
• Tools and Algorithms for the Construction and Analysis of Systems
• Automated hypersafety verification

This page was built for publication: A pragmatic approach to stateful partial order reduction