Program logic and equivalence in the presence of garbage collection

Theoretical Computer Science

Volumn 298, Issue 3, 2003, Pages 557-581

  Calcagno, Cristiano ^a   O'Hearn, Peter ^a   Bornat, Richard ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; DIGITAL STORAGE; HIGH LEVEL LANGUAGES; SEMANTICS;

GARBAGE DATA COLLECTION;

LOGIC PROGRAMMING;

EID: 0037432671     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00868-X     Document Type: Conference Paper

References (15)

1. Benedikt M., Reps T., Sagiv M. A decidable logic for describing linked data structures. Swierstra S.D. ESOP '99. European Symp. on Programming Lecture Notes in Computer Science. Vol. 1576:1999;2-19 Springer, New York, NY.
2. C. Calcagno, Semantic and logical properties of stateful programming, Ph.D. Thesis, University of Genova, 2002.
3. Calcagno C., Ishtiaq S., O'Hearn P.W. Semantic analysis of pointer aliasing, allocation and disposal in Hoare logic. ACM-SIGPLAN Second Int. Conf. on Principles and Practice of Declarative Programming (PPDP 2000). September 2000;ACM, New York.
4. Cohen P. Set Theory and the Continuum Hypothesis. 1966;Benjamin, San Fancisco.
5. P. Cousot, Methods and logics for proving programs, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B, Elsevier, Amsterdam, MIT Press, Cambridge, MA, 1990, pp. 843-993.
6. F. de Boer, A WP calculus for OO, in: Proceedings of FOSSACS'99, LNCS 1578, 1999, pp. 135-149.
7. Hoare C.A.R., He J. A trace model for pointers and objects. Guerraoui R. ECCOP'99 - Object-Oriented Programming, 13th European Conf. Lecture Notes in Computer Science. Vol. 1628:1999;1-17 Springer, Berlin.
8. Honsell F., Mason I.A., Smith S., Talcott C. A variable typed logic of effects. Inform. Comput. 119(1):1995;55-90.
9. Ishtiaq S., O'Hearn P. BI as an assertion language for mutable data structures. Proc. 28th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages (POPL). January, 2001;14-26 ACM, New York.
10. Jones R. Garbage Collection. Algorithm for Automatic Dynamic Memory Management:1997;Wiley, New York.
11. Mac Lane S., Moerdijk I. Sheaves in Geometry and Logic. 1992;Springer, Berlin.
12. O'Hearn P., Reynolds J., Yang H. Local reasoning about programs that alter data structures. Fribourg L. Computer Science Logic. Lecture Notes in Computer Science. Vol. 2142:2001;1-19 Springer, Berlin.
13. D.C. Oppen, S.A. Cook, Proving assertions about programs that manipulate data structures, in: Conf. Record of Seventh Ann. ACM Symp. on Theory of Computation, Albuquerque, New Mexico, 5-7 May 1975, pp. 107-116.
14. Reynolds J.C. Intuitionistic reasoning about shared mutable data structure. Davies J., Roscoe B., Woodcock J. Millennial Perspectives in Computer Science. 2000;303-321 Palgrave, Houndsmill, Hampshire.
15. Reynolds J.C. Separation logic. a logic for shared mutable data structures, Invited Paper, Lecture Notes in Computer Science:2002;Springer, Berlin.