Abstract
An observational approach to the modular construction of algebraic implementations is presented. Based on the theory of parameterized observational specifications an implementation relation is defined which formalizes the intuitive idea that an implementation is correct if it produces correct observable output. It is shown that observational implementations compose vertically and (under appropriate conditions) horizontally. To be useful in practice proof theoretic criteria for parameterized observational implementations are given which are based on the notion of observable parameter context.
Chapter PDF
Similar content being viewed by others
References
M. Broy, C. Pair und M. Wirsing: A systematic study of models of abstract data types. Theoretical Computer Science 33, 139–174 (1984).
M. Broy, B. Möller, P. Pepper und M. Wirsing: Algebraic implementations preserve program correctness. Science of Computer Programming 7, 1, 35–54 (1986).
R.M. Burstall, J.A. Goguen: The semantics of Clear, a specification language. Proc. of Advanced Course on Abstract Software Specifications, Kopenhagen. Springer Lecture Notes in Computer Science 86, 292–332 (1980).
H. Ehrig, H.J. Kreowski: Parameter passing commutes with implementation of parameterized data types. In: M. Nielsen, E.M. Schmidt (eds.): Proc. ICALP 82, 9th Coll. on Automata, Languages and Programming, Aarhus, July 1982. Springer Lecture Notes in Computer Science 140, 197–211 (1982).
H. Ehrig, B. Mahr: Fundamentals of algebraic specification 1. EATCS Monographs on Theor. Comp. Science, Vol. 6, Springer Verlag (1985).
H. Ehrig, H.J. Kreowski, B. Mahr und P. Padawitz: Algebraic implementation of abstract data types. Theoretical Computer Science 20, 209–263 (1982).
K. Futatsugi, J.A. Goguen, J.P. Jouannaud und J. Meseguer: Principles of OBJ2. Proc. 12th ACM Symposium on Principles of Programming Languages, New Orleans, 52–66 (1985).
H. Ganzinger: Parameterized specifications: parameter passing and implementation with respect to observability. ACM Trans. on Prog. Lang. and Systems 5, 3, 318–354 (1983).
A. Geser, H. Hussmann: Experiences with the RAP system — a specification interpreter combining term rewriting and resolution. In: B. Robinet, R. Wilhelm (eds.): Proc. ESOP 86, Europ. Symp. on Programming, Saarbrücken, March 1986. Springer Lecture Notes in Computer Science 213, 339–350
V. Giarratana, F. Gimona und U. Montanari: Observability concepts in abstract data type specification. In: A. Mazurkiewicz (ed.): Proc. MFCS 76, 5th Internat. Symp. on Mathematical Foundations of Comp. Science, Gdansk, Sept. 1976. Springer Lecture Notes in Computer Science 45, 576–587 (1976).
J.A. Goguen, R.M. Burstall: CAT, a system for the structured elaboration of correct programs from structured specifications. Technical report CSL-118, Computer Science Laboratory, SRI International
J.A. Gouen, J. Meseguer: Universal realization, persistent interconnection and implementation of abstract modules. In: M. Nielsen, E.M. Schmidt (eds.): Proc. ICALP 82, 9th Coll. on Automata, Languages and Programming, Aarhus, July 1982. Springer Lecture Notes in Computer Science 140, 265–281 (1982).
R. Hennicker: Beobachtungsorientierte Spezifikationen. Dissertation, Fakultät für Mathematik und Informatik, Universität Passau (1988).
R. Hennicker, M. Wirsing: Observational specification: a Birkhoff-theorem. In: H.J. Kreowski (ed.): Recent Trends in Data Type Specification. 3rd Workshop on Theory and Appl. of Abstract Data Types, Selected Papers. Informatik Fachberichte 116, 119–135, Springer Verlag (1985).
Ma P. Nivela, F. Orejas: Initial behaviour semantics for algebraic specifications. Proc. 5th Workshop on Algebraic Specifications of Abstract Data Types, Gullane, September 1987, Springer Lecture Notes in Computer Science 332, 184–207 (1988).
P. Pepper: On the correctness of type transformations. Talk at 2nd Workshop on Theory and Appl. of Abstract Data Types, Passau, May 1984.
H. Reichel: Behavioural equivalence — a unifying concept for initial and final specification methods. In: M. Arato, L. Varga (eds.): Math. Models in Comp. Systems, Proc. 3rd Hungarian Computer Science Conf., Budapest, January 1981, 27–39 (1981).
D.T. Sannella, A. Tarlecki: On observational equivalence and algebraic specification. In: H. Ehrig, C. Floyd, M. Nivat, J. Thatcher (eds.): Proc. TAPSOFT 85, Joint Conf. on Theory and Practice of Software Development, Berlin, March 1985. Springer Lecture Notes in Computer Science 185, 308–322 (1985).
D.T. Sannella, A. Tarlecki: Toward formal development of programs from algebraic specifications: implementations revisited. Proc. TAPSOFT 87, Joint Conf. on Theory and Practice of Software Development, Pisa, March 1986. Springer Lecture Notes in Computer Science 249, 96–110 (1987).
D.T. Sannella, M. Wirsing: Implementation of parameterized specification: In: M. Nielsen, E.M. Schmidt (eds.): Proc. ICALP 82, 9th Coll. on Automata, Languages and Programming, Aarhus, July 1982. Springer Lecture Notes in Computer Science 140, 473–488 (1982).
O. Schoett: Data abstraction and the correctness of modular programming. Ph.D. thesis, CST-42-87, Department of Comp. Science, University of Edinburgh (1987).
A. Selman: Completeness of calculii for axiomatically defined classes of algebras. Algebra universalis 2
M. Wirsing: Structured algebraic specifications: a kernel language. Theoretical computer science 42, 123–249 (1986).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hennicker, R. (1989). Implementation of parameterized observational specifications. In: Díaz, J., Orejas, F. (eds) TAPSOFT '89. CAAP 1989. Lecture Notes in Computer Science, vol 351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50939-9_139
Download citation
DOI: https://doi.org/10.1007/3-540-50939-9_139
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50939-4
Online ISBN: 978-3-540-46116-6
eBook Packages: Springer Book Archive