Combining Abstraction Refinement and SAT-Based Model Checking

DOI10.1007/978-3-540-71209-1_31MaRDI QIDQ5758121zbMATH OpenOpenAlexFDO

Authors Nina Amla, K. L. McMillan

Publication date 3 September 2007

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71209-1_31

Mathematics Subject Classification ID

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

Recommendations

• Tools and Algorithms for the Construction and Analysis of Systems
• A satisfiability-based approach to abstraction refinement in model checking
• Interpolation and SAT-based model checking.
• scientific article; zbMATH DE number 1956569
• scientific article; zbMATH DE number 1979542

Cited in

(8)

• Combining search space partition and abstraction for LTL model checking
• Predicate Elimination for Preprocessing in First-Order Theorem Proving
• A satisfiability-based approach to abstraction refinement in model checking
• Splitting via Interpolants
• scientific article; zbMATH DE number 1956569 (Why is no real title available?)
• scientific article; zbMATH DE number 1979542 (Why is no real title available?)
• Computer Aided Verification
• An efficient approach for abstraction-refinement in model checking

Describes a project that uses

Uses Software

• SATIRE
• Chaff

This page was built for publication: Combining Abstraction Refinement and SAT-Based Model Checking

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