Comparing Source Sets and Persistent Sets for Partial Order Reduction

DOI10.1007/978-3-319-63121-9_26MaRDI QIDQ5217316zbMATH OpenOpenAlexFDO

Authors Stavros Aronis, Parosh A. Abdulla, Bengt Jonsson, K. Sagonas

Publication date 24 February 2020

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

Full work available at URL https://doi.org/10.1007/978-3-319-63121-9_26

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)

Recommendations

• Source sets: a foundation for optimal dynamic partial order reduction
• Dynamic Partial Order Reduction Using Probe Sets
• Exploring the scope for partial order reduction
• Context-sensitive dynamic partial order reduction
• Partial-Order Reduction
• Unfolding-based partial order reduction
• An efficient partial order reduction algorithm with an alternative proviso implementation

Cited in

(3)

• Quasi-optimal partial order reduction
• A pragmatic approach to stateful partial order reduction
• Synthesizing partial orders given comparability information: Partitive sets and slack in critical path networks

This page was built for publication: Comparing Source Sets and Persistent Sets for Partial Order Reduction

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