Relative Completeness of Abstraction Refinement for Software Model Checking
- 14 March 2002
- book chapter
- Published by Springer Nature
- p. 158-172
- https://doi.org/10.1007/3-540-46002-0_12
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Comparing the Galois connection and widening/narrowing approaches to abstract interpretationPublished by Springer Nature ,2005
- Successive approximation of abstract transition relationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Virtual Storytelling Using Virtual Reality Technologies for StorytellingPublished by Springer Nature ,2001
- Automatic predicate abstraction of C programsPublished by Association for Computing Machinery (ACM) ,2001
- Counterexample-Guided Abstraction RefinementPublished by Springer Nature ,2000
- Verification of Infinite-State Systems by Combining Abstraction and Reachability AnalysisPublished by Springer Nature ,1999
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Systematic design of program analysis frameworksPublished by Association for Computing Machinery (ACM) ,1979
- Soundness and Completeness of an Axiom System for Program VerificationSIAM Journal on Computing, 1978
- Automatic discovery of linear restraints among variables of a programPublished by Association for Computing Machinery (ACM) ,1978