A Logic of Reachable Patterns in Linked Data-Structures

@article{Yorsh2006ALO,
  title={A Logic of Reachable Patterns in Linked Data-Structures},
  author={Greta Yorsh and Alexander Moshe Rabinovich and Shmuel Sagiv and Antoine Meyer and Ahmed Bouajjani},
  journal={J. Log. Algebr. Program.},
  year={2006},
  volume={73},
  pages={111-142}
}
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… CONTINUE READING
Highly Cited
This paper has 80 citations. REVIEW CITATIONS

11 Figures & Tables

Topics

Statistics

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

80 Citations

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

See our FAQ for additional information.