Verifying a garbage collection algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1479, Issue , 1998, Pages 225-244

  Jackson, Paul B ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BEHAVIORAL RESEARCH; COMPUTER CIRCUITS; REFUSE COLLECTION; TEMPORAL LOGIC;

DEGREE OF AUTOMATION; GARBAGE COLLECTION ALGORITHM; INTERACTIVE THEOREM PROVER; LINEAR TEMPORAL LOGIC; LIVENESS PROPERTIES; OBJECT ALLOCATION; QUALITY OF INTERACTION; STATE TRANSITION SYSTEMS;

THEOREM PROVING;

EID: 84947776098     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055139     Document Type: Conference Paper

References (18)

1. Rajeev Alur and Thomas A. Henzinger, editors. Computer Aided Verification : 8th International Conference, volume 1102 of Lecture Notes in Computer Science. Springer, July 1996.
2. Mordechai Ben-Ari. Algorithms for on-the-fly garbage collection. ACM Transactions on Programming Languages and Systems, 6(3):333-344, July 1984.
3. Glenn Bruns. Distributed Systems Analysis with CCS. Prentice Hall Europe, 1997.
4. K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison Wesley, 1988.
5. Ching-Tsun Chou. Predicates, temporal logic, and simulations. In Jeffrey J. Joyce and Carl-Johan H. Seger, editors, Higher Order Logic Theorem Proving and Its Applications: 6th International Workshop, HUG '93., volume 780 of Lecture Notes in Computer Science, pages 310-323. Springer-Verlag, August 1993.
6. Edsger W. Dijkstra, Leslie Lamport, A. J. Martin, C. S. Scholten, and E. F. M. Steffens. On-the-fly garbage collection: An exercise in cooperation. Communications of the ACM, 21(11):966-975, November 1978.
7. Dov M. Gabbay. Labelled deductive systems, volume 1 of Oxford Logic Guides. Oxford University Press (Imprint: Clarendon Press), 1996.
8. Georges Gonthier. Verifying the safety of a practical concurrent garbage collector. In Alur and Henzinger [1].
9. Klaus Havelund. Mechanical verification of a garbage collector. Available from http ://www. cs. auc. dk/~havelund/, May 1996.
10. Klans Havelund and Natarajan Shankar. A mechanized refinement proof for a garbage collector. Available from http://~a~, cs. auc. dk/~havelund/, December 1996.
11. Richard Jones and Rafael Lins. Garbage Collection: Algorithms for Automatic Dynamic memory Management. John Wiley &5 Sons, 1996.
12. Leslie Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872-923, May 1994.
13. Zohar Manna and Amir Pnueli. Completing the temporal picture. Theoretical Computer Science, 83:97-130, 1991.
14. Zohar Manna and Amir Pnueli. Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, 1991.
15. Stephan Merz. Yet another encoding of TLA in Isabelle. Available from http://~w4.informatik.tu-muenchen.de/~merz/isabelle/. The encoding described by this note accompanies the Isabelle98 release.
16. Susan Owicki and Leslie Lamport. Proving liveness properties of concurrent programs. A CM Transactions on Programming Languages and Systems, 4(3):455-495, July 1982.
17. S. Owre, J. M. Rushby, and N. Shankar. PVS: A prototype verification system. In D. Kapur, editor, 11th Conference on Automated Deduction, volume 607 of Lecture Notes in Artificial Intelligence, pages 748-752. Springer-Verlag, 1992. See http ://w~a. csl. sri. com/pvs, html for up-to-date information on PVS.
18. David M. Russinoff. A mechanically verified garbage collector. Formal Aspects of Computing, 6:359-390, 1994.