On relations between programs

  • M. Broy
  • P. Pepper
  • M. Wirsing
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 83)


Equivalence relations between programs are strongly connected to the formal definition of the semantics of programming languages. In addition they provide a basis for the formal justification of the development of programs by transformations. Besides equivalences there are various other relations on programs and computational structures, which help to get a better understanding of both programming languages and the programming activity. In particular, the study of relations between nondeterministic programs allows to compare different concepts of nondeterminism.


Equivalence Relation Programming Language Transformation Rule Congruence Relation Computational Structure 
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.


  1. /ADJ 78/.
    J. A. Goguen, J. W. Thatcher, E. G. Wagner: An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types. In: R. T. Yeh (ed.): Current Trends in Programming Methodology, Vol. 3, Data Structuring, Englewood Cliffs: Prentice Hall 1978Google Scholar
  2. /de Bakker 76/.
    J. W. de Bakker: Semantics and Termination of Nondeterministic Recursive Programs. 3rd Int. Symp. on Automata, Languages and Programming, Edinburgh 1976Google Scholar
  3. /Blikle 78/.
    A. Blikle: Specified Programming. In: Mathematical Studies in Information Processing, Proc. Int. Conf., Kyoto, Aug. 1978Google Scholar
  4. /Broy 80/.
    M. Broy: Transformation parallel ablaufender Programme. Technische Universität München, Dissertation an der Fakultät für Mathematik, Februar 1980Google Scholar
  5. /Burstall, Darlington 75/.
    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: J. ACM 24, 1, 44–67 (1977)Google Scholar
  6. /CIP 78/.
    M. Broy, R. Gnatz, M. Wirsing: Semantics of Nondeterministic and Noncontinuous Constructs. In: F. L. Bauer, M. Broy (eds.): Program Construction. (Proc. Int. Summer School, Marktoberdorf 1978) Lecture Notes in Computer Science 69, 553–592, Berlin: Springer 1979Google Scholar
  7. /CIP 79/.
    M. Broy, W. Dosch, H. Partsch, P. Pepper, M. Wirsing: Existential Quantifiers in Abstract Data Types. In: H. A. Maurer (ed.): Proc. of the Sixth Colloquium on Automata, Languages and Programming, Graz, Lecture Notes in Computer Science 71, 73–87, Berlin: Springer 1979Google Scholar
  8. /CIP 80 a/.
    M. Broy, M. Wirsing: Programming Languages as Abstract Data Types. To appear in the Proc. of the 5th Colloquium on "Arbres en Algèbre et en Programmation". Lille 1980Google Scholar
  9. /CIP 80 b/.
    F. L. Bauer, H. Wössner: Algorithmic Language and Program Development. (to appear)Google Scholar
  10. /Courcelle, Guessarian 78/.
    B. Courcelle, I. Guessarian: On Some Classes of Interpretations. JCSS 17: 3, 388–413 (1978)Google Scholar
  11. /Courcelle, Nivat 78/.
    B. Courcelle, M. Nivat: The Algebraic Semantics of Recursive Program Schemes. In: Proc. Math. Foundations of Comp. Sc., Zakopane 1978Google Scholar
  12. /Dijkstra 76/.
    E. W. Dijkstra: A Discipline of Programming. Englewood Cliffs: Prentice Hall, 1976Google Scholar
  13. /Floyd 67/.
    R. W. Floyd: Nondeterministic Algorithms. J. ACM 14, 636–644, (1967)Google Scholar
  14. /Guttag 75/.
    J. V. Guttag: The Specification and Application to Programming of Abstract Data Types. Ph. D. Thesis, Univ. of Toronto, Dept. of Comp. Sc., Rep. CSRG-59, 1975Google Scholar
  15. /Hoare 78/.
    C. A. R. Hoare: Some Properties of Predicate Transformers. J. ACM 25, 3, 461–480, (1978)Google Scholar
  16. /Kott 78/.
    L. Kott: About a Transformation System: A Theoretical Study. In: B. Robinet (ed.): Program Transformations, Proc. 3rd Int. Symp. on Programming, Paris: Dunod 1978Google Scholar
  17. /Liskov, Zilles 74/.
    B. Liskov, S. Zilles: Programming with Abstract Data Types. Proc. ACM SIGPLAN Conf. on Very High Level Languages, SIGPLAN Notices 9, 4, 50–59 (1974)Google Scholar
  18. /Luckham et al. 70/
    D. Luckham, D. Park, M. Paterson: On Formalized Computer Programs. J. CSS 4 (1970)Google Scholar
  19. /McCarthy 62/.
    J. McCarthy: A Basis for a Mathematical Theory of Computation. In: P. Braffort, D. Hirschberg (eds.): Computer Programming and Formal Systems. Amsterdam: North-Holland 1963Google Scholar
  20. /Pepper 78/.
    P. Pepper: A Study on Transfomational Semantics. In: F. L. Bauer, M. Broy (eds.): Program Construction. (Proc. Int. Summer School, Marktoberdorf 1978) Lecture Notes in Computer Science 69, 322–405, Berlin: Springer 1979. (Also: Dissertation, Techn. Univ. München 1979)Google Scholar
  21. /Shoenfield 67/.
    J. R. Shoenfield: Mathematical Logic. Reading: Addison-Wesley 1967Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • M. Broy
  • P. Pepper
  • M. Wirsing
    • 1
  1. 1.Institut für InformatikTechnische Universität MünchenMünchen 2Germany

Personalised recommendations