Counterexample Driven Refinement for Abstract Interpretation
- 1 January 2006
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 474-488
- https://doi.org/10.1007/11691372_34
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Loop Invariants on DemandLecture Notes in Computer Science, 2005
- Modular verification of software components in CIEEE Transactions on Software Engineering, 2004
- Widening Operators for Powerset DomainsLecture Notes in Computer Science, 2004
- Constraint-Based Linear-Relations AnalysisLecture Notes in Computer Science, 2004
- Precise Widening Operators for Convex PolyhedraLecture Notes in Computer Science, 2003
- Automatically validating temporal safety properties of interfacesLecture Notes in Computer Science, 2001
- Counterexample-Guided Abstraction RefinementLecture Notes in Computer Science, 2000
- Dynamic Partitioning in Analyses of Numerical PropertiesLecture Notes in Computer Science, 1999
- Construction of abstract state graphs with PVSLecture Notes in Computer Science, 1997
- Abstract interpretation by dynamic partitioningJournal of Functional Programming, 1992