Partial-order reduction is hard

DOI10.4230/LIPICS.CONCUR.2025.22MaRDI QIDQ7310294zbMATH OpenFDO

Authors Frédéric Herbreteau, Sarah Larroze-Jardiné, Igor Walukiewicz

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2025.22

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A pragmatic approach to stateful partial order reduction
• Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
• Commutativity in automated verification
• Dynamic partial-order reduction for model checking software
• scientific article; zbMATH DE number 177513 (Why is no real title available?)
• Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
• Partial-Order Reduction
• Peephole Partial Order Reduction
• Quasi-optimal partial order reduction
• Source sets: a foundation for optimal dynamic partial order reduction
• Stateless model checking under a reads-value-from equivalence
• Unblocking dynamic partial order reduction
• Unfolding-based partial order reduction
• Verification of distributed programs using representative interleaving sequences

This page was built for publication: Partial-order reduction is hard

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