Dynamic Partial Order Reduction Using Probe Sets

DOI10.1007/978-3-540-85361-9_21zbMath1160.68442OpenAlexW1562244326MaRDI QIDQ3541021

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)

Uses Software

• GROOVE

Cites Work

• Unnamed Item
• Unnamed Item
• Structure of concurrency
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Dynamic partial-order reduction for model checking software

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