(Enter summary)
Abstract: .
We describe how the PVS verification system has been used to verify a safety
property of a widely studied garbage collection algorithm. The safety property
asserts that "nothing but garbage is ever collected." The garbage collection algorithm
and its composition with the user program can be regarded as a concurrent
system with two processes working on a shared memory. Such concurrent systems
are encoded in PVS as state transition systems using a model similar to
TLA [Lam94]. The safety... (Update)
Cited by: More
B vs. Coq to prove a Garbage Collector - Burdy Gemplus Avenue
(Correct)
Similar documents (at the sentence level):
48.5%: A Mechanized Refinement Proof for a Garbage Collector - Havelund, Shankar (1997)
(Correct)
7.4%: 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.3: Experiments in Theorem Proving and Model Checking for.. - Havelund, Shankar (1996)
(Correct)
0.2: EAGLE Monitors by Collecting Facts and Generating.. - Barringer, Goldberg.. (2003)
(Correct)
0.2: EAGLE does Space Efficient LTL Monitoring - Barringer, Goldberg, Havelund, Sen (2003)
(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/havelund98mechanized.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/havelund98mechanized.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 faulttolerant architectures: Prolego..
- Owre, Rushby et al. - 1995
168
The temporal logic of actions
- Lamport - 1994
129
fly garbage collection: An exercise in cooperation (context) - Dijkstra, Lamport et al. - 1978
92
Experiments in theorem proving and model checking for protoc..
- Havelund, Shankar - 1996
11
Algorithms for on-the-fly garbage collection (context) - Ben-Ari - 1984
11
A mechanically verified incremental garbage collector (context) - Russinoff - 1994
11
An incremental garbage collection algorithm for multi-mutato.. (context) - Pixley - 1988
10
Mechanical verification of a garbage collector
- Havelund - 1996
7
algorithms for on-the-fly garbage collection (context) - Snepscheut - 1987
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)
A Mechanized Refinement Proof for a Garbage Collector - Havelund, Shankar (1997)
(Correct)
Formal Modeling and Analysis of an Audio/Video.. - Havelund, Skou.. (1997)
(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