Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis
- 5 November 2002
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- SAT Based Abstraction-Refinement Using ILP and Machine Learning TechniquesPublished by Springer Nature ,2002
- Using Combinatorial Optimization Methods for Quantification SchedulingPublished by Springer Nature ,2001
- Formal property verification by abstraction refinement with formal, simulation and hybrid enginesPublished by Association for Computing Machinery (ACM) ,2001
- Counterexample-Guided Abstraction RefinementPublished by Springer Nature ,2000
- Symbolic Model Checking without BDDsPublished by Springer Nature ,1999
- NuSMV: A New Symbolic Model VerifierLecture Notes in Computer Science, 1999
- Stepwise CTL Model Checking of State/Event SystemsPublished by Springer Nature ,1999
- Incremental CTL model checking using BDD subsettingPublished by Association for Computing Machinery (ACM) ,1998
- SATO: An efficient propositional proverLecture Notes in Computer Science, 1997
- An iterative approach to language containmentPublished by Springer Nature ,1993