Local reasoning about a copying garbage collector

ACM SIGPLAN Notices

Volumn 39, Issue 1, 2004, Pages 220-231

  Birkedal, Lars ^a   Torp Smith, Noah ^a   Reynolds, John C ^b  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Copying garbage collector; Local reasoning; Separation logic

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SIMULATION; DATA STRUCTURES; FORMAL LANGUAGES; LOGIC DESIGN; RESPONSE TIME (COMPUTER SYSTEMS); STORAGE ALLOCATION (COMPUTER);

CHENEYS COPYING GARBAGE COLLECTOR; COPYING GARBAGE COLLECTOR; LOCAL REASONING; MEMORY MANAGEMENT SYSTEMS; SEPARATION LOGICS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 1442263140     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/982962.964020     Document Type: Conference Paper

References (28)

1. A. Ahmed, L. Jia, and D. Walker. Reasoning about hierarchical storage. In Proc. LICS'03, 2003.
2. A. W. Appel. Foundational proof carrying code. In Proc. LICS'01, 2001.
3. M. Ben-Ari. Algorithms for on-the-fly garbage collection. ACM Transactions of Principles on Programming Languages and Systems, 6(3):333 - 344, 1984.
4. L. Birkedal, N. Torp-Smith, and J.C. Reynolds. Correctness of a garbage collector via local reasoning. Technical report TR-2003-30, The IT University of Copenhagen, Copenhagen, Denmark, July 2003. Available at http://www.itu.dk/English/research/publications/.
5. R. Bornat. Correctness of copydag via local reasoning. Private Communication, Mar 2003.
6. R. Bornat. Local Reasoning, Separation and Aliasing. Submitted to the SPACE'04 workshop. Available at http://www.cs.mdx.ac.uk/staffpages/r_bornat.
7. C. Calcagno, P. O'Hearn, and R. Bornat. Program logic and equivalence in the presence of garbage collection. Theoretical Computer Science, 298(3):557-581, 2003.
8. C. J. Cheney. A nonrecursive list compacting algorithm. Comm. ACM, 13 (11), November 1970.
9. K. Crary, D. Walker, and G. Morrisett. Typed memory management in a calculus of capabilities. In Proc. of POPL'99, pages 262-275, 1999.
10. E. W. Dijkstra, L. Lamport, A. J. Martin, G. S. Scholten, and E. M. F. Steffens. On-the-fly garbage collection: an exercise in cooperation. Comm. ACM, 21(11):966-975, 1978.
11. C. A. R. Hoare. An axiomatic approach to computer programming. Comm. ACM. 12(583):576-580, 1969.
12. F. Mehta and T. Nipkow. Proving pointer programs in higher-order logic. In Automated Deduction - CADE-19, 2003.
13. S. Monnier and Z. Shao. Typed regions. Technical Report YALEU/DCS/TR-1242, Dept. of Computer Science, Yale University, New Haven, CT, 2002.
14. G. Morrisett, D. Walker, K. Crary, and N. Glew. From system F to typed assembly language. ACM Transactions on Programming Languages and Systems, 21(3):527-568, 1999.
15. G. C. Necula. Proof-carrying code. In Proc. POPL '97, pages 106-119, 1997.
16. G. C. Necula and P. Lee. Safe kernel extensions without run-time checking. In OSDI'96, pages 229-243, Berkeley, CA, USA, 1996.
17. S. Nettles. A Larch specification of copying garbage collection. Technical Report CMU-CS-92-219, Carnegie Mellon University, Pittsburgh, PA 15213, Dec 1992.
18. P. W. O'Hearn, J. C. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In CSL 2001, Berlin, 2001.
19. S. Owicki and D. Gries. An axiomatic proof technique for parallel programs. Acta Informatica, 6(4):319 - 340, 1976.
20. L. Petersen, R. Harper, K. Crary, and F. Pfenning. A type theory for memory allocation and data layout. In POPL'03, January 2003.
21. C. Pixley. An incremental garbage collection algorithm for multimutator systems. Distributed Computing, 3(1):41 - 50, 1988.
22. D. Pym. The Semantics and Proof Theory of the Logic of Bunched Implications, volume 26 of Applied Logics Series. Kluwer, 2002.
23. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In Proc. of LICS'02, pages 55-74, 2002.
24. D. M. Russinoff. A mechanically verified incremental garbage collector. Formal Aspects of Computing, 6:359 - 390, 1994.
25. F. Smith, D. Walker, and G. Morrisett. Alias types. In European Symposium on Programming, March 2000.
26. M. Tofte and J.-P. Talpin. Implementing the call-by-value lambda-calculus using a stack of regions. In Proc. POPL'94, pages 188-201, 1994.
27. D. Wang and A. W. Appel. Type preserving garbage collectors. In Proc. POPL'01, pages 166 - 178, 2001.
28. H. Yang. Local Reasoning for Stateful Programs. PhD thesis, University of Illinois, Urbana-Champaign, 2001.