SAT based abstraction-refinement using ILP and machine learning techniques
From MaRDI portal
Recommendations
- SAT-based counterexample guided abstraction refinement
- A satisfiability-based approach to abstraction refinement in model checking
- Computer Aided Verification
- Counterexample-guided abstraction refinement
- Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis
Cited in
(14)- The voice of optimization
- Partial predicate abstraction and counter-example guided refinement
- Compositional SCC analysis for language emptiness
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
- Incremental learning-based testing for reactive systems
- Abstraction and abstraction refinement
- A Probabilistic Learning Approach for Counterexample Guided Abstraction Refinement
- SAT-based counterexample guided abstraction refinement
- Computer Aided Verification
- Machine learning and logic: a new frontier in artificial intelligence
- An efficient approach for abstraction-refinement in model checking
- The modal logic of abstraction refinement
- Verifying time partitioning in the DEOS scheduling kernel
- A canonical form based decision procedure and model checking approach for propositional projection temporal logic
This page was built for publication: SAT based abstraction-refinement using ILP and machine learning techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4804901)