Unfolding-based dynamic partial order reduction of asynchronous distributed programs

DOI10.1007/978-3-030-21759-4_13MaRDI QIDQ6190188zbMATH OpenFDO

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

Publication date 6 February 2024

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

Full work available at URL https://doi.org/10.1007/978-3-030-21759-4_13

zbMATH Keywords

asynchronousdistributed programpartial orderunfolding

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)

Recommendations

• Unfolding-based partial order reduction
• Context-sensitive dynamic partial order reduction
• Unblocking dynamic partial order reduction
• Optimal dynamic partial order reduction
• A pragmatic approach to stateful partial order reduction

Cites work

• A sound reduction of persistent-sets for deadlock detection in MPI applications
• Constrained dynamic partial order reduction
• Dynamic partial-order reduction for model checking software
• Dynamic symbolic verification of MPI programs
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Optimal dynamic partial order reduction
• Optimal dynamic partial order reduction with observers
• Parallel program schemata
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Properties of Conflict-Free and Persistent Petri Nets
• Quasi-optimal partial order reduction
• Unfolding-based partial order reduction
• Unfoldings: A partial-order approach to model checking.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190188)