A Hybrid of Counterexample-Based and Proof-Based Abstraction
- 1 January 2004
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Automatic Abstraction without CounterexamplesPublished by Springer Nature ,2003
- Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial EvaluationPublished by Springer Nature ,2003
- Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict AnalysisPublished by Springer Nature ,2002
- SAT Based Abstraction-Refinement Using ILP and Machine Learning TechniquesPublished by Springer Nature ,2002
- ChaffPublished by Association for Computing Machinery (ACM) ,2001
- Formal property verification by abstraction refinement with formal, simulation and hybrid enginesPublished by Association for Computing Machinery (ACM) ,2001
- Model Checking of Safety PropertiesFormal Methods in System Design, 2001
- Counterexample-Guided Abstraction RefinementPublished by Springer Nature ,2000
- An iterative approach to language containmentPublished by Springer Nature ,1993
- Checking that finite state concurrent programs satisfy their linear specificationPublished by Association for Computing Machinery (ACM) ,1985