Computability and complexity results for a spatial assertion language for data structures

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

Volumn 2245, Issue , 2001, Pages 108-119

  Calcagno, Cristiano ^a,b   Yang, Hongseok ^c   O’Hearn, Peter W ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF GENOA   (Italy)

^c Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; MODEL CHECKING;

ASSERTION LANGUAGE; COMPLEXITY RESULTS; POINTER STRUCTURES; PRIME NUMBER;

COMPUTABILITY AND DECIDABILITY;

EID: 84944044399     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45294-x_10     Document Type: Conference Paper

References (9)

1. 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.
2. W. Charatonik, S. DalZil io, A. Gordon, S. Mukhopadhyay, and J.M. Talbot. The complexity of model checking mobile ambients. In FoSSaCS, April 2001.
3. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995. ISBN 3-540-60149-X.
4. D. Galmiche and D. Méry. Proof-search and countermodelgeneration in propositionalBI logic. In TACS, 2001. LNCS to appear.
5. S. Ishtiaq and P. O’Hearn. BI as an assertion language for mutable data structures. In Principles of Programming Languages, January 2001.
6. 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).
7. 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.
8. P. W. O’Hearn and D. J. Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5(2):215–244, June 99.
9. J. C. Reynolds. Intuitionistic reasoning about shared mutable data structure. In Millennial Perspectives in Computer Science. Palgrave, 2000.