메뉴 건너뛰기




Volumn 31, Issue , 2004, Pages 220-231

Local reasoning about a copying garbage collector

Author keywords

Copying Garbage Collector; Local Reasoning; Separation Logic

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COPYING; DATA STRUCTURES; STORAGE ALLOCATION (COMPUTER); THEOREM PROVING;

EID: 2442501539     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/964001.964020     Document Type: Conference Paper
Times cited : (28)

References (28)
  • 2
    • 0005440582 scopus 로고    scopus 로고
    • Foundational proof carrying code
    • A. W. Appel. Foundational proof carrying code. In Proc. LICS'01, 2001.
    • (2001) Proc. LICS'01
    • Appel, A.W.1
  • 4
    • 1442332539 scopus 로고    scopus 로고
    • Correctness of a garbage collector via local reasoning
    • The IT University of Copenhagen, Copenhagen, Denmark, July
    • 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/.
    • (2003) Technical Report , vol.TR-2003-30
    • Birkedal, L.1    Torp-Smith, N.2    Reynolds, J.C.3
  • 6
    • 67650192311 scopus 로고    scopus 로고
    • Local Reasoning, Separation and Aliasing
    • Submitted
    • R. Bornat. Local Reasoning, Separation and Aliasing. Submitted to the SPACE'04 workshop. Available at http://www.cs.mdx.ac.uk/staffpages/r_bornat.
    • SPACE'04 Workshop
    • Bornat, R.1
  • 7
    • 0037432671 scopus 로고    scopus 로고
    • Program logic and equivalence in the presence of garbage collection
    • 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.
    • (2003) Theoretical Computer Science , vol.298 , Issue.3 , pp. 557-581
    • Calcagno, C.1    O'Hearn, P.2    Bornat, R.3
  • 8
    • 84976673799 scopus 로고
    • A nonrecursive list compacting algorithm
    • November
    • C. J. Cheney. A nonrecursive list compacting algorithm. Comm. ACM, 13(11), November 1970.
    • (1970) Comm. ACM , vol.13 , Issue.11
    • Cheney, C.J.1
  • 9
    • 0032670229 scopus 로고    scopus 로고
    • Typed memory management in a calculus of capabilities
    • K. Crary, D. Walker, and G. Morrisett. typed memory management in a calculus of capabilities. In Proc. of POPL'99, pages 262-275, 1999.
    • (1999) Proc. of POPL'99 , pp. 262-275
    • Crary, K.1    Walker, D.2    Morrisett, G.3
  • 11
    • 84945708698 scopus 로고
    • An axiomatic approach to computer programming
    • C. A. R. Hoare. An axiomatic approach to computer programming. Comm. ACM, 12(583):576 - 580, 1969.
    • (1969) Comm. ACM , vol.12 , Issue.583 , pp. 576-580
    • Hoare, C.A.R.1
  • 13
    • 1442357058 scopus 로고    scopus 로고
    • Typed regions
    • Dept. of Computer Science, Yale University, New Haven, CT
    • S. Monnier and Z. Shao. Typed regions. Technical Report YALEU/DCS/TR-1242, Dept. of Computer Science, Yale University, New Haven, CT, 2002.
    • (2002) Technical Report , vol.YALEU-DCS-TR-1242
    • Monnier, S.1    Shao, Z.2
  • 15
    • 0030685617 scopus 로고    scopus 로고
    • Proof-carrying code
    • G. C. Necula. Proof-carrying code. In Proc. POPL '97, pages 106-119, 1997.
    • (1997) Proc. POPL '97 , pp. 106-119
    • Necula, G.C.1
  • 16
    • 85084097858 scopus 로고    scopus 로고
    • Safe kernel extensions without run-time checking
    • Berkeley, CA, USA
    • G. C. Necula and P. Lee. Safe kernel extensions without run-time checking. In OSDI'96, pages 229-243, Berkeley, CA, USA, 1996.
    • (1996) OSDI'96 , pp. 229-243
    • Necula, G.C.1    Lee, P.2
  • 17
    • 25944435365 scopus 로고
    • A Larch specification of copying garbage collection
    • Carnegie Mellon University, Pittsburgh, PA 15213, Dec
    • S. Nettles. A Larch specification of copying garbage collection. Technical Report CMU-CS-92-219, Carnegie Mellon University, Pittsburgh, PA 15213, Dec 1992.
    • (1992) Technical Report , vol.CMU-CS-92-219
    • Nettles, S.1
  • 18
    • 84944269268 scopus 로고    scopus 로고
    • Local reasoning about programs that alter data structures
    • Berlin
    • P. W. O'Hearn, J. C. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In CSL 2001, Berlin, 2001.
    • (2001) CSL 2001
    • O'Hearn, P.W.1    Reynolds, J.C.2    Yang, H.3
  • 19
    • 0017173886 scopus 로고
    • An axiomatic proof technique for parallel programs
    • S. Owicki and D. Gries. An axiomatic proof technique for parallel programs. Acta Informatica, 6(4):319 - 340, 1976.
    • (1976) Acta Informatica , vol.6 , Issue.4 , pp. 319-340
    • Owicki, S.1    Gries, D.2
  • 20
    • 0038304978 scopus 로고    scopus 로고
    • A type theory for memory allocation and data layout
    • January
    • L. Petersen, R. Harper, K. Crary, and F. Pfenning. A type theory for memory allocation and data layout. In POPL'03, January 2003.
    • (2003) POPL'03
    • Petersen, L.1    Harper, R.2    Crary, K.3    Pfenning, F.4
  • 21
    • 0004019962 scopus 로고
    • An incremental garbage collection algorithm for multimutator systems
    • C. Pixley. An incremental garbage collection algorithm for multimutator systems. Distributed Computing, 3(1):41 - 50, 1988.
    • (1988) Distributed Computing , vol.3 , Issue.1 , pp. 41-50
    • Pixley, C.1
  • 23
    • 0036051192 scopus 로고    scopus 로고
    • Separation logic: A logic for shared mutable data structures
    • J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In Proc. of LICS'02, pages 55 - 74, 2002.
    • (2002) Proc. of LICS'02 , pp. 55-74
    • Reynolds, J.C.1
  • 24
    • 33746250640 scopus 로고
    • A mechanically verified incremental garbage collector
    • D. M. Russinoff. A mechanically verified incremental garbage collector. Formal Aspects of Computing, 6:359 - 390, 1994.
    • (1994) Formal Aspects of Computing , vol.6 , pp. 359-390
    • Russinoff, D.M.1
  • 26
    • 0002934986 scopus 로고
    • Implementing the call-by-value lambda-calculus using a stack of regions
    • 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.
    • (1994) Proc. POPL'94 , pp. 188-201
    • Tofte, M.1    Talpin, J.-P.2
  • 27
    • 0035042878 scopus 로고    scopus 로고
    • Type preserving garbage collectors
    • D. Wang and A. W. Appel. Type preserving garbage collectors. In Proc. POPL'01, pages 166 - 178, 2001.
    • (2001) Proc. POPL'01 , pp. 166-178
    • Wang, D.1    Appel, A.W.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.