Skip to main content
SpringerLink
Log in

Systematics of transformation rules

  • III. Program Development By Transformation
  • Chapter
  • First Online:
Program Construction

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 69))

Abstract

There are essentially two ways to attack the problem of the "correctness" of program transformations: transformation rules can be given as axioms — thus determining (parts of) the semantics of the language — or they can be verified with respect to a particular definition of the semantics. This classification is taken here as a guide-line for a systematic survey of transformation rules.

This research was carried out within the Sonderforschungsbereich 49, Programmiertechnik, München

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature

  1. J. Arsac: La Construction de Programmes Structurés. Paris: Dunod 1977

    MATH  Google Scholar 

  2. J. W. de Bakker: Semantics of Programming Languages. In: J. T. Tou (ed.): Advances in Information System Sciences 2, New York: Plenum Press 1969, 173–227

    Chapter  Google Scholar 

  3. R. M. Balzer: Correct and Efficient Software Implementation via Semi-Automatic Transformations (Research Proposal, unpublished)

    Google Scholar 

  4. F. L. Bauer: A Philosophy of Programming. A Course of three Lectures given at the University of London, October 1973. Also in: Proc. Intern. Summer School on Language Hierarchies and Interfaces, Marktoberdorf 1975. Lecture Notes in Computer Science 46. Berlin, Heidelberg, New York: Springer 1976

    Google Scholar 

  5. F. L. Bauer: Programming as an Evolutionary Process. Technische Universität München, Institut für Informatik, Rep. No. 7617, 1976. Also: Proc 2nd Int. Conf. on Software Engineering, Oct, 1976, San Francisco, Ca., 223–234

    Google Scholar 

  6. F. L. Bauer, H. Partsch, P. Pepper, H. Wössner: Techniques for Program Development. Technische Universität München, Institut für Informatik, Interner Bericht, Sept. 1976. Also in: Software Engineering Techniques. Infotech State of the Art Report 34, 1977, 27–50

    Google Scholar 

  7. F. L. Bauer, H. Partsch, P. Pepper, H. Wössner: Notes on the Project CIP: Outline of a Transformation System. Technische Universität München, Institut für Informatik, TUM-INFO-7729, 1977

    Google Scholar 

  8. F. L. Bauer, M. Broy, R. Gnatz, W. Hesse, B. Krieg-Brückner, H. Partsch, P. Pepper, H. Wössner: Towards a Wide Spectrum Language to Support Program Specification and Program Development. SIGPLAN Notices 13 (12), 15–24 (1978). See also this volume.

    Article  Google Scholar 

  9. F. L. Bauer: Program Development by Stepwise Transformations — the Project CIP. This volume

    Google Scholar 

  10. F. L. Bauer: Detailization and Lazy Evaluation, Infinite Objects and Pointer Representation. This volume

    Google Scholar 

  11. F. L. Bauer, H. Wössner: Algorithmic Language and Program Development. London: Prentice-Hall International 1979

    Google Scholar 

  12. M. Broy: A Case Study in Program Development: Sorting. Technische Universität München, Institut für Informatik, TUM-INFO-7831, 1978

    Google Scholar 

  13. M. Broy, R. Gnatz, M. Wirsing: Problemspezifikation — eine Grundlage für Programmentwicklung. Workshop on Reliable Software, Bonn University, September 22–23, 1978. To appear in Hanser Verlag.

    Google Scholar 

  14. M. Broy, R. Gnatz, M. Wirsing: Semantics for Nondeterministic and Noncontinuous Constructs. This volume.

    Google Scholar 

  15. R. M. Burstall, J. Darlington: Some Transformations for Developing Recursive Programs. Proc. of 1975 Int. Conf. on Reliable Software, Los Angeles 1975, 465–472. Also (revised version) J. ACM 24, 1, 44–67 (1977)

    Article  Google Scholar 

  16. R. Burstall, M. Feather: Program Development by Transformations: an Overview. Proc. of Toulouse CREST Course on Programming, Toulouse, 1978

    Google Scholar 

  17. D. C. Cooper: The Equivalence of Certain Computations. Comp. J. 9, 45–52 (1966)

    Article  MathSciNet  Google Scholar 

  18. B. Courcelle, M. Nivat: Algebraic Families of Interpretations. 17th Symposium on Foundations of Computer Science, Houston 1976

    Google Scholar 

  19. J. Darlington, R. M. Burstall: A System which Automatically Improves Programs. Acta Informatica 6, 41–60 (1976)

    Article  Google Scholar 

  20. J. Darlington: A Synthesis of Several Sorting Algorithms. D.A.I. Research Report no. 23, Dept. of Artificial Intelligence, University of Edinburgh, 1976

    Google Scholar 

  21. F. L. DeRemer: Transformational Grammars. In: F.L. Bauer, J. Eickel (eds.): Compiler Construction. An Advanced Course. Lecture Notes in Computer Science 21. Berlin, Heidelberg, New York: Springer 1974, 121–145

    Chapter  Google Scholar 

  22. D. P. Friedman, D. S. Wise: Functional Combination. Computer Languages 3, 31–35 (1978)

    Article  Google Scholar 

  23. M. S. Feather: Program Transformations Applied to the Telegram Problem. In: B. Robinet (ed.): Program Transformations. Proc. of the 3rd International Symposium on Programming, March 28–30, 1978, Paris: Dunod 1978, 173–186

    Google Scholar 

  24. S. L. Gerhart: Correctness-Preserving Program Transformations. Conf. Rec. Second ACM Symp. on Principles of Programming Languages, Jan. 1975, 54–66

    Google Scholar 

  25. S. L. Gerhart: Control Structure Abstractions of the Backtracking Programming Technique. 2nd Int. Conf. on Software Engineering, 1976, 44–49

    Google Scholar 

  26. S. Igarashi: An Axiomatic Approach to the Equivalence Problems of Algorithms with Applications. PhD Thesis, University of Tokyo (1964). Reprinted in: Report of the Computer Center Univ. of Tokyo, 1, 1–101 (1968)

    MathSciNet  Google Scholar 

  27. D. B. Loveman: Program Improvement by Source-to-Source Transformation. J. ACM 24: 1, 121–145 (1977)

    Article  MathSciNet  Google Scholar 

  28. H. Partsch, P. Pepper: A Family of Rules for Recursion Removal Related to the Towers of Hanoi Problem. Technische Universität München, Institut für Informatik, Rep. No. 7612, 1976. Also Inf. Proc. Letter 5: 6, 174–177 (1976)

    Article  Google Scholar 

  29. H. Partsch, P. Pepper: Program Transformations on Different Levels of Programming. Technische Universität München, Institut für Informatik, TUM-INFO-7715, 1977

    Google Scholar 

  30. H. Partsch, M. Broy: Examples for Change of Types and Object Structures. This volume.

    Google Scholar 

  31. M. S. Paterson, C. E. Hewitt: Comparative Schematology. In: Record of the Project MAC Conf. on Concurrent Systems and Parallel Computation, New York: ACM 1970, 119–127

    Google Scholar 

  32. P. Pepper: A Study on Transformational Semantics. Dissertation, Munich 1978. See also this volume

    Google Scholar 

  33. P. Pepper, H. Partsch, H. Wössner, F. L. Bauer: A Transformational Approach to Programming. In: B. Robinet (ed.): Program Transformations. Proc. of the 3rd International Symposium on Programming, March 28–30, 1978, Paris: Dunod 1978

    Google Scholar 

  34. B. K. Rosen: Tree-Manipulating Systems and Church-Rosser Theorems. Journal ACM 20: 1, 160–187 (1973)

    Article  MathSciNet  Google Scholar 

  35. T. A. Standish, D. C. Harriman, D. F. Kibler, J. M. Neighbors: The Irvine Program Transformation Catalogue. Dep. Inform. and Comp. Sc., University of California at Irvine, Irvine, Calif., Jan. 1976

    Google Scholar 

  36. T. A. Standish, D. C. Harriman, D. F. Kibler, J. M. Neighbors: Improving and Refining Programs by Program Manipulation. Proc. 1976 ACM Annual Conf., Oct. 1976, 509–516

    Google Scholar 

  37. H. R. Strong: Translating Recursion Equations into Flow Charts. In: Proc. 2nd Annual ACM Symposium on Theory of Computing, New York 1970, 184–197. Also J. CSS 5, 254–285 (1971)

    MathSciNet  MATH  Google Scholar 

  38. J. Weber: Programmtransformationen mit Attributierten Transformationsgrammatiken. Technische Universität München, Institut für Informatik, Rep. No. 7604, 1976

    Google Scholar 

  39. B. Wegbreit: Goal-Directed Program Transformation. IEEE Transactions on Software Engineering, vol. SE-2, no. 2, 69–80 (1976)

    Article  MathSciNet  Google Scholar 

  40. H. Wössner, P. Pepper, H. Partsch, F. L. Bauer: Special Transformation Techniques. This volume

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, Postfach 20 24 20, D - 8000, München, Germany

    F. L. Bauer, M. Broy, H. Partsch, P. Pepper & H. Wössner

Authors
  1. F. L. Bauer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Broy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. Partsch
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. P. Pepper
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. H. Wössner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Friedrich L. Bauer Manfred Broy E. W. Dijkstra S. L. Gerhart D. Gries M. Griffiths J. V. Guttag J. J. Horning S. S. Owicki C. Pair H. Partsch P. Pepper M. Wirsing H. Wössner

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bauer, F.L., Broy, M., Partsch, H., Pepper, P., Wössner, H. (1979). Systematics of transformation rules. In: Bauer, F.L., et al. Program Construction. Lecture Notes in Computer Science, vol 69. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014672

Download citation

  • DOI: https://doi.org/10.1007/BFb0014672

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09251-3

  • Online ISBN: 978-3-540-35312-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation