Unblocking dynamic partial order reduction

DOI10.1007/978-3-031-37706-8_12zbMATH Open1547.68122MaRDI QIDQ6535634FDOQ6535634

Authors: Michalis Kokologiannakis, Iason Marmanis, Viktor Vafeiadis 

Publication date: 1 February 2024

Recommendations

• Quasi-optimal partial order reduction
• Quasi-optimal partial order reduction
• Optimal dynamic partial order reduction
• Context-sensitive dynamic partial order reduction
• Constrained 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
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Optimal dynamic partial order reduction with observers
• Context-sensitive dynamic partial order reduction
• Optimal dynamic partial order reduction
• Stateless model checking under a reads-value-from equivalence
• Constrained dynamic partial order reduction
• Stateless model checking for TSO and PSO

Cited In (2)

• Unfolding-based dynamic partial order reduction of asynchronous distributed programs
• Reconciling preemption bounding with DPOR

This page was built for publication: Unblocking dynamic partial order reduction

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