Using integer programming to verify general safety and liveness properties

DOI10.1007/BF01384316zbMath0829.68051OpenAlexW2047375390MaRDI QIDQ1346653

James C. Corbett, George S. Avrunin

Publication date: 10 April 1995

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01384316

zbMATH Keywords

concurrent systemsstate explosion problem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (2)

Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving ⋮ On a decision procedure for quantified linear programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebra of communicating processes with abstraction
• The equal flow problem
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• Graph-Based Algorithms for Boolean Function Manipulation
• How to assign votes in a distributed system

This page was built for publication: Using integer programming to verify general safety and liveness properties