A satisfiability-based approach to abstraction refinement in model checking
From MaRDI portal
Recommendations
- Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis
- Combining Abstraction Refinement and SAT-Based Model Checking
- SAT-based counterexample guided abstraction refinement
- Automatic abstraction without counterexamples
- Tools and Algorithms for the Construction and Analysis of Systems
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
- Refinement of LTL formulas for abstract model checking
- Automatic abstraction without counterexamples
- Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis
- Automata-Based Abstraction Refinement for µHORS Model Checking
- SAT-based counterexample guided abstraction refinement
- SAT based abstraction-refinement using ILP and machine learning techniques
- 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
- Concrete model checking with abstract matching and refinement
- 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)