Unfolding-based dynamic partial order reduction of asynchronous distributed programs

DOI10.1007/978-3-030-21759-4_13MaRDI QIDQ6190188

Thierry Jéron, Martin Quinson, the-Anh Pham

Publication date: 6 February 2024

Published in: Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)

zbMATH Keywords

partial orderunfoldingasynchronousdistributed program

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Dynamic symbolic verification of MPI programs
• Optimal dynamic partial order reduction with observers
• Unfoldings: A partial-order approach to model checking.
• Parallel program schemata
• Properties of Conflict-Free and Persistent Petri Nets
• A Sound Reduction of Persistent-Sets for Deadlock Detection in MPI Applications
• Dynamic partial-order reduction for model checking software
• Unfolding-based Partial Order Reduction
• Optimal dynamic partial order reduction
• Quasi-optimal partial order reduction
• Constrained dynamic partial order reduction

This page was built for publication: Unfolding-based dynamic partial order reduction of asynchronous distributed programs