Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking
- 4 July 2001
- book chapter
- Published by Springer Nature
- p. 356-373
- https://doi.org/10.1007/3-540-47764-0_20
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Partial Completeness of Abstract Fixpoint CheckingPublished by Springer Nature ,2000
- Counterexample-Guided Abstraction RefinementPublished by Springer Nature ,2000
- Refining Model Checking by Abstract InterpretationAutomated Software Engineering, 1999
- Abstract interpretation of reactive systemsACM Transactions on Programming Languages and Systems, 1997
- Types as abstract interpretationsPublished by Association for Computing Machinery (ACM) ,1997
- Refining and compressing abstract domainsPublished by Springer Nature ,1997
- A unifying view of abstract domain designACM Computing Surveys, 1996
- Model checking and abstractionACM Transactions on Programming Languages and Systems, 1994
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977