Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists

@inproceedings{Manevich2005PredicateAA,
  title={Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists},
  author={Roman Manevich and Eran Yahav and G. Ramalingam and Shmuel Sagiv},
  booktitle={VMCAI},
  year={2005}
}
Predicate abstraction and canonical abstraction are two finitary abstractio ns used to prove properties of programs. We study the relationship between these two abstractions by considering a very limited case: abstraction of (potentially cyclic) singlylinked lists. We provide a new and rather precise family of abstractions for potentially c yclic singlylinked lists. The main observation behind this family of abstractions is that the n umber of shared nodes in linked lists can be statically… CONTINUE READING
Highly Cited
This paper has 111 citations. REVIEW CITATIONS

11 Figures & Tables

Topics

Statistics

0102030'05'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

111 Citations

Semantic Scholar estimates that this publication has 111 citations based on the available data.

See our FAQ for additional information.