Program logic and equivalence in the presence of garbage collection

Authors:
Cristiano Calcagno;Peter O'Hearn;Richard Bornat
Affiliations:
Department of Computer Science, University of London, Queen Mary, Mile End Road, London E1 4NS, UK;Department of Computer Science, University of London, Queen Mary, Mile End Road, London E1 4NS, UK;Department of Computer Science, University of London, Queen Mary, Mile End Road, London E1 4NS, UK
Venue:
Theoretical Computer Science - Foundations of software science and computation structures
Year:
2003

Citing 7
Cited 13

Methods and logics for proving programs

Handbook of theoretical computer science (vol. B)
A variable typed logic of effects

Information and Computation
Garbage collection: algorithms for automatic dynamic memory management

Garbage collection: algorithms for automatic dynamic memory management
Semantic analysis of pointer aliasing, allocation and disposal in Hoare logic

Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
BI as an assertion language for mutable data structures

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Proving assertions about programs that manipulate data structures

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing

Local reasoning about a copying garbage collector

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A compositional logic for polymorphic higher-order functions

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Observational purity and encapsulation

Theoretical Computer Science
A general framework for certifying garbage collectors and their mutators

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Local reasoning about a copying garbage collector

ACM Transactions on Programming Languages and Systems (TOPLAS)
An Overview of Separation Logic

Verified Software: Theories, Tools, Experiments
Regional Logic for Local Reasoning about Global Invariants

ECOOP '08 Proceedings of the 22nd European conference on Object-Oriented Programming
Datatypes in memory

CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Assertion-based encapsulation, object invariants and simulations

FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Controlling object allocation using creation guards

FM'05 Proceedings of the 2005 international conference on Formal Methods
Observational purity and encapsulation

FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
BI hyperdoctrines and higher-order separation logic

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Local Reasoning for Global Invariants, Part I: Region Logic

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is generally thought that reasoning about programs in memory safe, garbage collected languages is much easier than in languages where the programmer has more explicit control over memory. Paradoxically, existing program logics are based on a low-level view of storage that is sensitive to the presence or absence of unreachable cells, and Reynolds has pointed out that the Hoare triples derivable in these logics are even incompatible with garbage collection. We present a study of a small language whose operational semantics includes a rule for reclaiming garbage. Our main results include an analysis of propositions that are garbage insensitive, and full abstraction results connecting partial and total correctness to two natural notions of observational equivalence between programs.