Using partial orders for the efficient verification of deadlock freedom and safety properties

DOI10.1007/3-540-55179-4_32MaRDI QIDQ6493552

Pierre Wolper, Patrice Godefroid

Publication date: 29 April 2024

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Adequate proof principles for invariance and liveness properties of concurrent programs
• The complementation problem for Büchi automata with applications to temporal logic
• Recognizing safety and liveness
• A partial approach to model checking
• Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Proving Liveness Properties of Concurrent Programs
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Using partial orders for the efficient verification of deadlock freedom and safety properties