Abstract
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.
This research was partially sponsored by the Sonderforschungsbereich 49 — Programmiertechnik — Munich.
Chapter PDF
Similar content being viewed by others
Keywords
- 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.
References
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 1978
J. W. de Bakker: Semantics and Termination of Nondeterministic Recursive Programs. 3rd Int. Symp. on Automata, Languages and Programming, Edinburgh 1976
A. Blikle: Specified Programming. In: Mathematical Studies in Information Processing, Proc. Int. Conf., Kyoto, Aug. 1978
M. Broy: Transformation parallel ablaufender Programme. Technische Universität München, Dissertation an der Fakultät für Mathematik, Februar 1980
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)
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 1979
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 1979
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 1980
F. L. Bauer, H. Wössner: Algorithmic Language and Program Development. (to appear)
B. Courcelle, I. Guessarian: On Some Classes of Interpretations. JCSS 17: 3, 388–413 (1978)
B. Courcelle, M. Nivat: The Algebraic Semantics of Recursive Program Schemes. In: Proc. Math. Foundations of Comp. Sc., Zakopane 1978
E. W. Dijkstra: A Discipline of Programming. Englewood Cliffs: Prentice Hall, 1976
R. W. Floyd: Nondeterministic Algorithms. J. ACM 14, 636–644, (1967)
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, 1975
C. A. R. Hoare: Some Properties of Predicate Transformers. J. ACM 25, 3, 461–480, (1978)
L. Kott: About a Transformation System: A Theoretical Study. In: B. Robinet (ed.): Program Transformations, Proc. 3rd Int. Symp. on Programming, Paris: Dunod 1978
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)
D. Luckham, D. Park, M. Paterson: On Formalized Computer Programs. J. CSS 4 (1970)
J. McCarthy: A Basis for a Mathematical Theory of Computation. In: P. Braffort, D. Hirschberg (eds.): Computer Programming and Formal Systems. Amsterdam: North-Holland 1963
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)
J. R. Shoenfield: Mathematical Logic. Reading: Addison-Wesley 1967
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Broy, M., Pepper, P., Wirsing, M. (1980). On relations between programs. In: Robinet, B. (eds) International Symposium on Programming. Programming 1980. Lecture Notes in Computer Science, vol 83. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09981-6_5
Download citation
DOI: https://doi.org/10.1007/3-540-09981-6_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09981-9
Online ISBN: 978-3-540-39233-0
eBook Packages: Springer Book Archive