Verifying properties of well-founded linked lists
- 11 January 2006
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 41 (1) , 115-126
- https://doi.org/10.1145/1111037.1111048
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Predicate Abstraction and Canonical Abstraction for Singly-Linked ListsPublished by Springer Nature ,2005
- Shape Analysis by Predicate AbstractionPublished by Springer Nature ,2005
- The Boundary Between Decidability and Undecidability for Transitive-Closure LogicsPublished by Springer Nature ,2004
- Constructing Quantified Invariants via Predicate AbstractionPublished by Springer Nature ,2004
- Zing: Exploiting Program Structure for Model Checking Concurrent SoftwarePublished by Springer Nature ,2004
- CVC Lite: A New Implementation of the Cooperating Validity CheckerPublished by Springer Nature ,2004
- Indexed Predicate Discovery for Unbounded System VerificationPublished by Springer Nature ,2004
- Solving shape-analysis problems in languages with destructive updatingACM Transactions on Programming Languages and Systems, 1998
- Incremental and Decremental Evaluation of Transitive Closure by First-Order QueriesInformation and Computation, 1995
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979