A Decidable Logic for Describing Linked Data Structures

@inproceedings{Benedikt1999ADL,
  title={A Decidable Logic for Describing Linked Data Structures},
  author={Michael Benedikt and Thomas W. Reps and Shmuel Sagiv},
  booktitle={ESOP},
  year={1999}
}
This paper aims to provide a better formalism for describing properties of linked data structures (e.g., lists, trees, graphs), as well as the intermediate states that arise when such structures are destructively updated. The paper deenes a new logic that is suitable for these purposes (called Lr, for \logic of reachability expressions"). We show that Lr is decidable, and explain how Lr relates to two previously deened structure-description formalisms (\path matrices" and \static shape graphs… CONTINUE READING
Highly Cited
This paper has 85 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
53 Citations
25 References
Similar Papers

Citations

Publications citing this paper.

86 Citations

051015'00'03'07'11'15
Citations per Year
Semantic Scholar estimates that this publication has 86 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 25 references

Automatic veri cation of pointer programs using monadic second-order logic

  • J. L. Jensen, M. E. Joergensen, N.Klarlund, M. I. Schwartzbach
  • In SIGPLAN Conf. on Prog. Lang. Design and Impl…
  • 1997
Highly Influential
4 Excerpts

Analysis of Recursive Types in an Imperative Language

  • E.Y.-B. Wang
  • PhD thesis, Univ. of Calif., Berkeley, CA,
  • 1994
1 Excerpt

Similar Papers

Loading similar papers…