Advertisement

Calculating a garbage collector

  • Ulrich Berger
  • Werner Meixner
  • Bernhard Möller
Part III. Case Studies in Development
  • 117 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 544)

Keywords

Garbage Collection Finite Chain Chained Representation Funct Reach Kind Funct 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bauer, Wössner 82]
    F.L. Bauer, H. Wössner: Algorithmic language and program development. New York: Springer 1982Google Scholar
  2. [Bauer et al. 85]
    F.L. Bauer et al.: The Munich project CIP. Volume I: The wide spectrum language CIP-L. Lecture Notes in Computer Science 183. New York: Springer 1985Google Scholar
  3. [Berghammer, Ehler 90]
    R. Berghammer, H. Ehler: On the use of elements of functional programming in program development by transformations. This volumeGoogle Scholar
  4. [Berghammer et al. 87]
    R. Berghammer, H. Ehler, H. Zierer: Development of graph algorithms by program transformation. In: H. Göttler, H.-J. Schneider (eds.): Graph-theoretic concepts in computer science. Lecture Notes in Computer Science 314. Berlin: Springer 1988, 206–218Google Scholar
  5. [Broy, Pepper 82]
    M. Broy, P. Pepper: Combining algebraic and algorithmic reasoning: An approach to the Schorr-Waite-Algorithm. ACM TOPLAS 4, 362–381 (1982)Google Scholar
  6. [Dewar, McCann 77]
    R. Dewar, A. McCann: MACRO SPITBOL — a SNOBOL4 compiler. Software — Practice and Experience 7, 95–113 (1977)Google Scholar
  7. [Dewar et al. 82]
    R. Dewar, M. Sharir, E. Weixelbaum: Transformational derivation of a garbage collection algorithm. ACM TOPLAS 4, 650–667 (1982)Google Scholar
  8. [van Diepen, de Roever 86]
    N. van Diepen, W. de Roever: Program derivation through transformations: The evolution of list-copying algorithms. Science of Computer Programming 6, 213–272 (1986)Google Scholar
  9. [Möller 87]
    B. Möller: Entwicklung eines Speicherbereinigungsalgorithmus. Institut für Informatik der TU München, Manuscript, October 1987Google Scholar
  10. [Möller 89]
    B. Möller: Applicative assertions. In: J.L.A. van de Snepscheut (ed.): Mathematics of Program Construction, Groningen, 26–30 June 1989. Lecture Notes in Computer Science 375. Berlin: Springer 1989, 348–362Google Scholar
  11. [Möller 90]
    B. Möller: Formal derivation of pointer algorithms. In: M. Broy (ed.): Informatik im Kreuzungspunkt von Numerischer Mathematik, Rechnerentwurf, Programmierung, Algebra und Logik. Festkolloquium, München, 12.–14. Juni 1989. Lecture Notes in Computer Science (to appear)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Ulrich Berger
    • 1
  • Werner Meixner
    • 2
  • Bernhard Möller
    • 2
  1. 1.Mathematisches InstitutLudwig-Maximilians-UniversitätMünchen 2Fed. Rep. Germany
  2. 2.Institut für InformatikTechnische Universität MünchenMünchen 2Fed. Rep. Germany

Personalised recommendations