Dynamic Path Reduction for Software Model Checking

DOI10.1007/978-3-642-00255-7_22zbMath1211.68103OpenAlexW1570017391MaRDI QIDQ3605478

Scott A. Smolka, Bashar al-Rawi, Karem A. Sakallah, Radu Grosu, Zi-Jiang Yang, Xiaowan Huang

Publication date: 24 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00255-7_22

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• veriSoft
• DART
• STP

Cites Work

• Unnamed Item
• Efficient SAT-based bounded model checking for software verification
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Whodunit? Causal Analysis for Counterexamples
• Interpolants and Symbolic Model Checking

This page was built for publication: Dynamic Path Reduction for Software Model Checking