Garbage collector verification for proof-carrying code

Authors:
Chun-Xiao Lin;Yi-Yun Chen;Long Li;Bei Hua
Affiliations:
Department of Computer Science and Technology, University of Science and Technology of China, Hefei, China;Department of Computer Science and Technology, University of Science and Technology of China, Hefei, China;Department of Computer Science and Technology, University of Science and Technology of China, Hefei, China;Department of Computer Science and Technology, University of Science and Technology of China, Hefei, China
Venue:
Journal of Computer Science and Technology
Year:
2007

Citing 19
Cited 1

Algorithms for on-the-fly garbage collection

ACM Transactions on Programming Languages and Systems (TOPLAS)
Garbage collection in an uncooperative environment

Software—Practice & Experience
Garbage collection: algorithms for automatic dynamic memory management

Garbage collection: algorithms for automatic dynamic memory management
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From system F to typed assembly language

ACM Transactions on Programming Languages and Systems (TOPLAS)
On-the-fly garbage collection: an exercise in cooperation

Communications of the ACM
Type-preserving garbage collectors

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Principled scavenging

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Inductive Definitions in the system Coq - Rules and Properties

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Verifying a Garbage Collection Algorithm

Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Foundational Proof-Carrying Code

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Local reasoning about a copying garbage collector

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modular verification of assembly code with stack-based control abstractions

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
A garbage-collecting typed assembly language

TLDI '07 Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation
An open framework for foundational proof-carrying code

TLDI '07 Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation
A general framework for certifying garbage collectors and their mutators

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Foundational Typed Assembly Language with Certified Garbage Collection

TASE '07 Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering
Formal verification of the heap manager of an operating system using separation logic

ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering

Reasoning about memory layouts

Formal Methods in System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the verification of the machine-level implementation of a conservative variant of the standard marksweep garbage collector in a Hoare-style program logic. The specification of the collector is given on a machine-level memory model using separation logic, and is strong enough to preserve the safety property of any common mutator program. Our verification is fully implemented in the Coq proof assistant and can be packed immediately as foundational proof-carrying code package. Our work makes important attempt toward building fully certified production-quality garbage collectors.