Colimits for concurrent collectors

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

Volumn 2772, Issue , 2004, Pages 568-597

  Pavlovic, Dusko ^a   Pepper, Peter ^b   Smith, Doug ^a  

^a KESTREL INSTITUTE   (United States)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

CONCURRENT GARBAGE COLLECTION; DECLARATIVE PROGRAMMING; FORMAL PROGRAM DEVELOPMENT; SPECIFICATION REFINEMENTS;

SPECIFICATIONS;

EID: 35248872124     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (21)

1. E. Dijkstra, L. Lamport, A. Martin, C. Scholten, and E. Steffens. On-the-fly garbage collection: An exercise in cooperation. Comm. ACM, 21(11):965-975, Nov. 1978.
2. P. Hudak. The Haskell School of Expression. Cambridge University Press, 2000.
3. R. Jones and R. Lins. Garbage Collection. John Wiley and Sons, 1996.
4. H. Kung and S. Song. An efficient parallel garbage collection system and its corectness proof. In IEEE Symp. on Foundations of Comp. Sc., pages 120-131. IEEE Press, 1977.
5. L. Lamport. Simple approach to specifying concurrent systems. Comm. ACM, 32(1):32-45, 1989.
6. G. W. Leibnitz. Vernunftprinzipien der Natur und der Gnade - Monadologie. Felix meiner Verlag, 1982.
7. Z. Manna. Mathematical Theory of Computation. McGraw-Hill, 1974.
8. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer Verlag, 1992.
9. J. McCarthy. Towards a mathematical science of computation. In C. Popplewell, editor, Information Processing 6, pages 21-28. North-Holland, 1963.
10. J. McDonald and J. Anton. Specware - producing software correct by construction. Technical Report KES.U.01.4, Kestrel Institute, Palo Alto, March 2001.
11. E. Moggi. Notions of computation and monad. Information and Computing, 93:55-92, 1991.
12. D. Pavlovic and D. R. Smith. Composition and refinement of behavioral specifications. In Proceedings of Sixteenth International Conference on Automated Software Engineering, pages 157-165. IEEE Computer Society Press, 2001.
13. P. Pepper. Funktionale Programmierung in Opal, ML, Haskell und Gofer. Springer Verlag, 2002.
14. J. Reynolds. On the relation between direct and continuation semantics. In J. Loeckx, editor, Proc. 2nd Coll. on Automata, Languages, and programming, Lecture Notes in Computer Science 14, pages 141-156. Springer Verlag, 1974.
15. D. Smith. Designware: Software development by refinement. In Proc. Eighth Int. Conf. on Category Theory and Computer Science, Edinburgh, Sept. 1999.
16. Specware. Documentation www.specware.org/doc.html. 2002.
17. G. Steele. Multiprocessing compactifying garbage collection. Comm. ACM, 18(9):495-508, Sep. 1975.
18. G. Tel, R. Tan, and J. van Leeuwen. The derivation of graph marking algorithms from distributed termination detection protocols. Science of Comp.Progr., (10):107-137, 1988.
19. P. Wadler. How to declare an imperative. ACM Computing Surveys, 29(3):240-263, 1997.
20. M. Wand. Continuation-based program transformation strategies. J.ACM, 27(1):164-180, 1980.
21. T. Yuasa. Real-time garbage collection on general-purpose machines. Journal of Software and Systems, 11(3):181-190, 1990.