A satisfiability-based approach to abstraction refinement in model checking
From MaRDI portal
Recommendations
Cited in
(20)- Lattice-based refinement in bounded model checking
- \textsc{HaifaSat}: a SAT solver based on an abstraction/refinement model
- Abstraction and Refinement in Model Checking
- scientific article; zbMATH DE number 1948409 (Why is no real title available?)
- scientific article; zbMATH DE number 1956569 (Why is no real title available?)
- scientific article; zbMATH DE number 1979542 (Why is no real title available?)
- Automata-Based Abstraction Refinement for µHORS Model Checking
- scientific article; zbMATH DE number 2087616 (Why is no real title available?)
- scientific article; zbMATH DE number 1903358 (Why is no real title available?)
- A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Automated Technology for Verification and Analysis
- A type-directed abstraction refinement approach to higher-order model checking
- Boolean Abstraction for Temporal Logic Satisfiability
- A Forward-Backward Abstraction Refinement Algorithm
- Computer Aided Verification
- Combining Abstraction Refinement and SAT-Based Model Checking
- Concrete abstractions. Formalizing and analyzing discrete theories and algorithms with the RISCAL model checker
- An efficient approach for abstraction-refinement in model checking
This page was built for publication: A satisfiability-based approach to abstraction refinement in model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845512)
