Algorithms for on-the-fly garbage collection

Description d'un nouvel algorithme pour la collecte d'informations parasites. Le nouvel algorithme utilise seulement deux couleurs et a une simple preuve de justesse. Deux variations sur cet algorithme sont alors derivees: l'une essaie de minimiser la quantite de corrections qui doivent etre faites et l'autre est un controleur incremental d'informations parasites

[1]  H. T. Kung,et al.  An efficient parallel garbage collection system and ITS correctness proof , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[2]  Leslie Lamport,et al.  Proving the Correctness of Multiprocess Programs , 1977, IEEE Transactions on Software Engineering.

[3]  A. Pnueli.  The Temporal Semantics of Concurrent Programs , 1979, Theor. Comput. Sci..

[4]  Amir Pnueli.  The Temporal Semantics of Concurrent Programs , 1981, Theor. Comput. Sci..

[5]  Jacques Cohen,et al.  Garbage Collection of Linked Data Structures , 1981, CSUR.

[6]  Leslie Lamport,et al.  On-the-fly garbage collection: an exercise in cooperation , 1975, CACM.

[7]  David Gries.  An exercise in proving parallel programs correct , 1977, CACM.

[8]  Konrad Lai,et al.  Supporting ada memory management in the iAPX-432 , 1982, ASPLOS I.

[9]  Nissim Francez,et al.  An Application of a Method for Analysis of Cyclic Prog rams , 1978, IEEE Transactions on Software Engineering.