Dynamic Partial Order Reduction Using Probe Sets

DOI10.1007/978-3-540-85361-9_21MaRDI QIDQ3541021zbMATH OpenOpenAlexFDO

Authors Harmen Kastenberg, Arend Rensink

Publication date 25 November 2008

Published in CONCUR 2008 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85361-9_21

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

• Optimal dynamic partial order reduction
• Dynamic partial-order reduction for model checking software
• Quasi-optimal partial order reduction
• Model Checking Software
• Quasi-optimal partial order reduction

Cites work

• scientific article; zbMATH DE number 4018370 (Why is no real title available?)
• scientific article; zbMATH DE number 140240 (Why is no real title available?)
• Dynamic partial-order reduction for model checking software
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Structure of concurrency
• Using partial orders for the efficient verification of deadlock freedom and safety properties

Cited in

(2)

• Approximate partial order reduction
• Comparing Source Sets and Persistent Sets for Partial Order Reduction

Describes a project that uses

Uses Software

• GROOVE

This page was built for publication: Dynamic Partial Order Reduction Using Probe Sets

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