Formal Verification of an Incremental Garbage Collector

Journal of Logic and Computation

Volumn 13, Issue 6, 2003, Pages 815-833

  Coupet Grimal, Solange ^a   Nouvet, Catherine ^b  

^a UNIVERSITÉ DE PROVENCE   (France)

^b TELECOM PARISTECH   (France)

Author keywords

Co induction; Formal methods; Garbage collectors; Temporal logics; Type theory

Indexed keywords

ALGORITHMS; CACHE MEMORY; FORMAL LOGIC; LINEAR PROGRAMMING; MULTI AGENT SYSTEMS;

FORMAL METHODS; GARBAGE COLLECTORS; TEMPORAL LOGICS;

JAVA PROGRAMMING LANGUAGE;

EID: 0346868988     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/13.6.815     Document Type: Review

References (19)

1. M. Ben-Ari. Algorithms for on-the-fly garbage collection. ACM Toplas, 6, 1984.
2. T. Coquand and G. Huet. Constructions: a higher order proof system for mechanizing mathematics. EUROCAL 85, vol 203 of Lecture Notes in Computer Science, Springer-Verlag, 1985.
3. S. COUPET-GRIMAL. An axiomatization of linear temporal logic in the calculus of inductive constructions. Journal of Logic and Computation, 13, 801-813, 2003.
4. S. Courcambeck. Mécanismes Avancés de Gestion de Mémoire dans les Systèmes Ouverts pour Cartes à Puce. Technical report, Gemplus Researh Lab., BP 100-13881 Gemenos Cedex France, 2000.
5. E. W. Dijkstra, L. 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, 966-975, 1978.
6. E. Giménez. Un Calcul de Constructions Infinies et son application a la vérification de systèmes communicants. Thèse d'université, Ecole Normale Supérieure de Lyon, December 1996.
7. H. Goguen, R. Brooksby, and R. Burstall. An abstract approach to memory management. In Proceedings of TYPES, volume 1956. Springer-Verlag, 1999.
8. G. Gonthier. Verifying the safety of a practical concurrent garbage collector. In Computer Aided Verification CAV'96, pp. 462-465, volume 1102 of Lecture Noten in Computer Science, Springer-Verlag, 1996.
9. J. Goubault-Larrecq. The Coq Standard Library. http://pauillac.inria.fr/coq/library/MAPS/.
10. K. Havelund and N. Shankar. A mechanized refinement proof for a garbage collector. Unpublished manuscript, 1997.
11. G. Huet and G. Kahn. The Coq Standard Library. http://pauillac.inria.fr/coq/library/SETS/, 1995.
12. P. B. Jackson. Verifying a garbage collection algorithm. In TPHOL'98 (11th International Conference on Theorem Proving in Higher Order Theory), volume 1479 of Lecture Notes in Computer Science, Springer-Verlag, 1998.
13. Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems, Springer-Verlag, 1991.
14. L. Moreau and J. Duprat. A Construction of distributed reference counting. Acta Informatica, 37, 563-595, 2001.
15. C. Paulin-Mohring. Definitions Inductives en Théorie des Types d'Ordre Supérieur. Habilitation à diriger les recherches, Université Claude Bernard Lyon I, December 1996.
16. D. M. Russinoff. A verification system for concurrent programs based on the Boyer-Moore prover. Formal Aspects of Computing, 4, 597-611, 1992.
17. D. M. Russinoff. A mechanically verified incremental garbage collector. Formal Aspects of Computing, 6, 359-390, 1994.
18. The Coq Development Team. The Coq Proof Assistant Reference Manual - Version V7.1. Technical report, Logical Project-INRIA, 2001.
19. K. Neeraj Verma, J. Goubault-Larrecq, S. Prasad, and S. Arun-Kumar. Reflecting BDDs in Coq. In 6th Asian Computing Science Conference (ASIAN'2000), pp. 162-181, volume 1961 of Lecture Notes in Computer Science, Springer-Verlag, 2000.