TY - GEN

T1 - A logic of reachable patterns in linked data-structures

AU - Yorsh, Greta

AU - Rabinovich, Alexander

AU - Sagiv, Mooly

AU - Meyer, Antoine

AU - Bouajjani, Ahmed

PY - 2006

Y1 - 2006

N2 - We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The main feature of this logic is the ability to limit the neighborhood of a node that is reachable via a regular expression from a designated node. The logic is closed under boolean operations (entailment, negation) and has a finite model property. The key technical result is the proof of decidability. We show how to express precondition, postconditions, and loop invariants for some interesting programs. It is also possible to express properties such as disjointness of data-structures, and low-level heap mutations. Moreover, our logic can express properties of arbitrary data-structures and of an arbitrary number of pointer fields. The latter provides a way to naturally specify postconditions that relate the fields on entry to a procedure to the fields on exit. Therefore, it is possible to use the logic to automatically prove partial correctness of programs performing low-level heap mutations.

AB - We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The main feature of this logic is the ability to limit the neighborhood of a node that is reachable via a regular expression from a designated node. The logic is closed under boolean operations (entailment, negation) and has a finite model property. The key technical result is the proof of decidability. We show how to express precondition, postconditions, and loop invariants for some interesting programs. It is also possible to express properties such as disjointness of data-structures, and low-level heap mutations. Moreover, our logic can express properties of arbitrary data-structures and of an arbitrary number of pointer fields. The latter provides a way to naturally specify postconditions that relate the fields on entry to a procedure to the fields on exit. Therefore, it is possible to use the logic to automatically prove partial correctness of programs performing low-level heap mutations.

UR - http://www.scopus.com/inward/record.url?scp=33745790035&partnerID=8YFLogxK

U2 - 10.1007/11690634_7

DO - 10.1007/11690634_7

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:33745790035

SN - 3540330453

SN - 9783540330455

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 94

EP - 110

BT - Foundations of Software Science and Computation Structures - 9th International Conf., FOSSACS 2006. Held as Part of the Joint European Conf. on Theory and Practice of Software, ETAPS 2006, Proc.

Y2 - 25 March 2006 through 31 March 2006

ER -