(Enter summary)
Abstract: We describe how the PVS verification system has been used to verify
a safety property of a garbage collection algorithm. The safety property
basically says that "nothing but garbage is ever collected". The proof is
based on refinement mappings as suggested by Lamport. Although the algorithm
is relatively simple, its parallel composition with a "user" program
that (nearly) arbitrarily modifies the memory makes the verification quite
challenging. The garbage collection algorithm and its... (Update)
Cited by: More
B vs. Coq to prove a Garbage Collector - Burdy Gemplus Avenue
(Correct)
Similar documents (at the sentence level):
29.1%: A Mechanized Refinement Proof for a Garbage Collector - Klaus Havelund (1998)
(Correct)
13.2%: Mechanical Verification of a Garbage Collector - Havelund (1996)
(Correct)
Active bibliography (related documents): More All
0.2: Experience with Predicate Abstraction - Das, Dill, Park (1999)
(Correct)
0.2: the Garbage Collection Bibliography - Richard Jones (2003)
(Correct)
0.2: The Derivation of Distributed Termination Detection Algorithms .. - Tel, Mattern (1993)
(Correct)
Similar documents based on text: More All
0.5: Experiments in Theorem Proving and Model Checking for.. - Havelund, Shankar (1996)
(Correct)
0.2: Principles and Pragmatics of Subtyping in PVS - Shankar, Owre (1999)
(Correct)
0.2: Unifying Verification Paradigms (Extended Abstract) - Shankar (1996)
(Correct)
Related documents from co-citation: More All
7: Verifying a garbage collection algorithm
- Jackson - 1998
5: A Construction of Distributed Reference Counting
- Moreau, Duprat - 1999
5: fly garbage collection: An exercise in cooperation (context) - Dijkstra, Lamport et al. - 1978
BibTeX entry: (Update)
K. Havelund and N. Shankar. A Mechanized Refinement Proof for a Garbage Collector. Submitted to the journal: Formal Aspects of Computing, 1998. http://citeseer.ist.psu.edu/article/havelund97mechanized.html More
@techreport{ havelund97mechanized,
author = "Klaus Havelund and N. Shankar",
title = "A Mechanized Refinement Proof for a Garbage Collector",
year = "1997",
url = "citeseer.ist.psu.edu/article/havelund97mechanized.html" }
Citations (may not include all citations):
716
Parallel Program Design: A Foundation (context) - Chandy, Misra - 1988
274
The existence of refinement mappings
- Abadi, Lamport - 1991
270
Formal verification for fault-tolerant architectures: Proleg..
- Owre, Rushby et al. - 1995
129
fly garbage collection: An exercise in cooperation (context) - Dijkstra, Lamport et al. - 1978
100
Digital Equipment Corporation (context) - Lamport, Logic et al. - 1994
92
Experiments in theorem proving and model checking for protoc..
- Havelund, Shankar - 1996
65
Powerful techniques for the automatic generation of invarian..
- Bensalem, Lakhnech et al. - 1996
11
Algorithms for on-the-fly garbage collection (context) - Ben-Ari - 1984
11
An incremental garbage collection algorithm for multimutator.. (context) - Pixley - 1988
11
A mechanically verified incremental garbage collector (context) - Russinoff - 1994
10
Mechanical verification of a garbage collector
- Havelund - 1996
7
algorithms for on-the-fly garbage collection (context) - Snepscheut - 1987
6
Mechanized verification of real-time systems using PVS (context) - Shankar - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.auc.dk/~havelund/): More
Formal Verification of an Audio/Video Power Controller.. - Havelund, Larsen, Skou (1999)
(Correct)
Formal Modeling and Analysis of an Audio/Video.. - Havelund, Skou.. (1997)
(Correct)
Experiments in Theorem Proving and Model Checking for.. - Havelund, Shankar (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC