Reconciling preemption bounding with DPOR

DOI10.1007/978-3-031-30823-9_5zbMATH Open1543.68224MaRDI QIDQ6535344FDOQ6535344

Authors: Iason Marmanis, Michalis Kokologiannakis, Viktor Vafeiadis 

Publication date: 13 December 2023

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

Mathematics Subject Classification ID

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

Cites Work

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

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)