Reconciling preemption bounding with DPOR

DOI10.1007/978-3-031-30823-9_5MaRDI QIDQ6535344zbMATH OpenFDO

Authors Iason Marmanis, Michalis Kokologiannakis, Viktor Vafeiadis

Publication date 13 December 2023

Copyright license Creative Commons Attribution 4.0 International

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Optimal dynamic partial order reduction
• Source sets: a foundation for optimal dynamic partial order reduction
• A pragmatic approach to stateful partial order reduction
• Context-sensitive dynamic partial order reduction
• Unblocking dynamic partial order reduction

Cites work

• A load-buffer semantics for total store ordering
• Context-bounded analysis of TSO systems
• Dynamic partial-order reduction for model checking software
• Optimal dynamic partial order reduction
• Stateless model checking for TSO and PSO
• Stateless model checking for TSO and PSO
• Stateless model checking under a reads-value-from equivalence
• The topological structure of asynchronous computability
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: Reconciling preemption bounding with DPOR

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