Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists
- 1 January 2005
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- The Boundary Between Decidability and Undecidability for Transitive-Closure LogicsPublished by Springer Nature ,2004
- Numeric Domains with Summarized DimensionsPublished by Springer Nature ,2004
- A static analyzer for large safety-critical softwarePublished by Association for Computing Machinery (ACM) ,2003
- New results on the computability and complexity of points--to analysisPublished by Association for Computing Machinery (ACM) ,2003
- Shape Analysis through Predicate Abstraction and Model CheckingPublished by Springer Nature ,2002
- Lazy abstractionPublished by Association for Computing Machinery (ACM) ,2002
- Automatic predicate abstraction of C programsPublished by Association for Computing Machinery (ACM) ,2001
- Counterexample-Guided Abstraction RefinementPublished by Springer Nature ,2000
- A Decidable Logic for Describing Linked Data StructuresPublished by Springer Nature ,1999
- Construction of abstract state graphs with PVSPublished by Springer Nature ,1997