ACM Home Page
Please provide us with feedback. Feedback
Algorithms for on-the-fly garbage collection
Full text PdfPdf (679 KB)
Source ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 6 ,  Issue 3  (July 1984) table of contents
Pages: 333 - 344  
Year of Publication: 1984
ISSN:0164-0925
Author
Mordechai Ben-Ari  Tel Aviv University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 62,   Citation Count: 35
Additional Information:

references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/579.587
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
FRANCEZ, N. An application of a method for analysis of cyclic programs. IEEE Trans. $ofiw. Eng. SE-4(5), (1978), 371-378.
 
4
FRANCEZ, N. AND PNUELI, A. A proof method for cyclic programs. Acta In{. 9 (1978), 133-157.
5
 
6
KuNO, H.T. AND SONG, S.W. An efficient parallel garbage collection system and its correctness proof. In Proceedings o{ the IEEE Symposium on Foundations of Computer Science (Providence, R.I.). IEEE, New York, 1977, pp. 120-131.
 
7
LAMPORT, L. Proving the correctness of multiprocess programs. IEEE Trans. So{tw. Eng. SE- 3, (1977), 125-143.
 
8
OWlCKI, S. ANO GRIE$, D. An axiomatic proof technique for parallel programs I. Acta in{. 6 (1976), 319-340.
9
 
10
PNEULI, A. The temporal semantics of concurrent programs. Theor. Comput. Sci. 13 (1981), 45-60.

CITED BY  35


REVIEW

"John Gauntlett Benedict Heal : Reviewer"

On-the-fly garbage collectors provide an interesting class of concurrent algorithms for study, as they are quintessentially concurrent, rather than sequential algorithms which manage to work despite the concurrency. Dijstra et al. [1] present a  more...