|
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
|
Fred J. Pollack , George W. Cox , Dan W. Hammerstrom , Kevin C. Kahn , Konrad K. Lai , Justin R. Rattner, Supporting ada memory management in the iAPX-432, Proceedings of the first international symposium on Architectural support for programming languages and operating systems, p.117-131, March 01-03, 1982, Palo Alto, California, United States
|
| |
10
|
PNEULI, A. The temporal semantics of concurrent programs. Theor. Comput. Sci. 13 (1981), 45-60.
|
CITED BY 35
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Damien Doligez , Georges Gonthier, Portable, unobtrusive garbage collection for multiprocessor systems, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.70-83, January 16-19, 1994, Portland, Oregon, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
David F. Bacon , Perry Cheng , David Grove , Michael Hind , V. T. Rajan , Eran Yahav , Matthias Hauswirth , Christoph M. Kirsch , Daniel Spoonhower , Martin T. Vechev, High-level real-time programming in Java, Proceedings of the 5th ACM international conference on Embedded software, September 18-22, 2005, Jersey City, NJ, USA
|
|
|
|
|
|
|
|
|
|
|
|
Stephen M. Blackburn , Richard L. Hudson , Ron Morrison , J. Eliot B. Moss , David S. Munro , John Zigman, Starting with termination: a methodology for building distributed garbage collection algorithms, Australian Computer Science Communications, v.23 n.1, p.20-28, January-February 2001
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
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...
|