Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists
- 1 January 2005
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- The Boundary Between Decidability and Undecidability for Transitive-Closure LogicsLecture Notes in Computer Science, 2004
- Numeric Domains with Summarized DimensionsLecture Notes in Computer Science, 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 CheckingLecture Notes in Computer Science, 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 RefinementLecture Notes in Computer Science, 2000
- A Decidable Logic for Describing Linked Data StructuresLecture Notes in Computer Science, 1999
- Construction of abstract state graphs with PVSLecture Notes in Computer Science, 1997