Abstract
This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication connectives. We investigate computability and complexity properties of a subset of the language, which allows statements about the shape of pointer structures (such as “there is a link from x to y”) to be made, but not statements about the data held in cells (such as “x is a prime number”). We show that validity, even for this restricted language, is not r.e., but that the quantifierfree sublanguage is decidable. We then consider the complexity of model checking and validity for several fragments.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Benedikt, T. Reps, and M. Sagiv. A decidable logic for describing linked data structures. In ESOP’ 99: European Symposium on Programming, pages 2–19. Lecture Notes in Computer Science, Vol. 1576, S.D. Swierstra (ed.), Springer-Verlag, New York, NY, 1999.
W. Charatonik, S. Dal Zilio, A. Gordon, S. Mukhopadhyay, and J.M. Talbot. The complexity of model checking mobile ambients. In FoSSaCS, April 2001.
H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995. ISBN 3-540-60149-X.
D. Galmiche and D. Méry. Proof-search and countermodel generation in propositional BI logic. In TACS, 2001. LNCS to appear.
S. Ishtiaq and P. O’Hearn. BI as an assertion language for mutable data structures. In Principles of Programming Languages, January 2001.
J. Jenson, M. Jorgensen, N. Klarkund, and M. Schwartzback. Automatic verification of pointer programs using monadic second-order logic. In Proceedings of the ACM SIGPLAN’97 Conference on Programming Language Design and Implementation, pages 225–236, 1997. SIGPLAN Notices 32(5).
P. O’Hearn, J. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In L. Fribourg, editor, Proceedings of 15th Annual Conference of the European Association for Computer Science Logic: CSL 2001, pages 1–19. Springer-Verlag, 2001. LNCS 2142.
P. W. O’Hearn and D. J. Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5(2):215–244, June 1999.
J. C. Reynolds. Intuitionistic reasoning about shared mutable data structure. In Millennial Perspectives in Computer Science. Palgrave, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calcagno, C., Yang, H., O’Hearn, P.W. (2001). Computability and Complexity Results for a Spatial Assertion Language for Data Structures. In: Hariharan, R., Vinay, V., Mukund, M. (eds) FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2001. Lecture Notes in Computer Science, vol 2245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45294-X_10
Download citation
DOI: https://doi.org/10.1007/3-540-45294-X_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43002-5
Online ISBN: 978-3-540-45294-2
eBook Packages: Springer Book Archive