Partially Disjunctive Heap Abstraction
Authors:
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 265-279
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Widening Operators for Powerset DomainsLecture Notes in Computer Science, 2004
- Automated Verification of Concurrent Linked Lists with CountersLecture Notes in Computer Science, 2002
- ESP2002
- Parametric shape analysis via 3-valued logicACM Transactions on Programming Languages and Systems, 2002
- TVLA: A System for Implementing Static Analyses2000
- Optimal domains for disjunctive abstract interpretationScience of Computer Programming, 1998
- Solving shape-analysis problems in languages with destructive updatingACM Transactions on Programming Languages and Systems, 1998
- A lattice for abstract interpretation of dynamic (LISP-like) structuresInformation and Computation, 1992
- Scanning list structures without stacks or tag bitsInformation Processing Letters, 1973