Abstract
After motivating the introduction of nondeterministic operators into algebraic specifications, a language L with two primitive predicates, identity and inclusion, for specifying nondeterministic operations is introduced. It is given a multialgebraic semantics which captures the singular (call-time-choice) strategy of passing nondeterministic parameters. A calculus NEQ, with restricted substitutivity rules, is introduced. NEQ is sound and complete wrt. the multialgebraic semantics.
A language L + is obtained by a slight modification of L admitting plural (run-time-choice) parameters. The multialgebraic semantics is not sufficient for modeling such parameters and it is generalized to power algebras. Augmenting NEQ with one rule for unrestricted substitutivity for the plural variables yields NEQ* which is sound and complete wrt. to the power algebra semantics.
This work has been partially supported by the Architectural Abstraction project under NFR (Norway), by CEC under ESPRIT-II Basic Reearch Working Group No. 6112 COMPASS, by the US DARPA under ONR contract N00014-92-J-1928, N00014-93-1-1335 and by the US Air Force Office of Scientific Research under Grant AFOSR-91-0354.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Brock, J.D., Ackermann, W.B., “Scenarios: A model of non-determinate computation”, in Formalization of Programming Concepts, LNCS, vol. 107, Springer, 1981.
Clinger, W., “Nondeterministic call by need is neither lazy nor by name”, Proc. ACM Symp. LISP and Functional Programming, 226–234, 1982.
Engelfriet, J., Schmidt, E.M., “IO and OI. 1”, Journal of Computer and System Sciences, vol. 15, 328–353, 1977
Engelfriet, J., Schmidt, E.M., “IO and 01. 2”, Journal of Computer and System Sciences, vol. 16, 67–99, 1978.
Goguen, J.A., Meseguer, J., “Completeness of Many-Sorted Equational Logic”, SIGPLAN Notices, vol. 16, no. 7, 1981.
Goguen, J.A., Meseguer, J., “Remarks on Remarks on Many-Sorted Equational Logic”, SIGPLAN Notices, vol. 22, no. 4, 41–48, April 1987.
Hayes, I., Jones, C., “Specifications are not (necessarily) executable”, in Software Engineering Journal, 4(6): 330–338. 1989.
Hennessy, M.C.B., “The semantics of call-by-value and call-by-name in a non-deterministic environment”, SIAM J. Comput., vol. 9, no. 1, 1980.
Hesselink, W.H., “A Mathematical Approach to Nondeterminism in Data Types”, ACM: Transactions on Programming Languages and Systems, vol. 10, 1988.
Hoare, C.A.R., Communicating Sequential Processes, Prentice-Hall International Ltd., 1985.
Huet, G., Oppen, D., “Equations and Rewrite Rules: A Survey”, in Formal Language Theory: Perspectives and Open Problems, Academic Press, 1980.
Hußmann, H., Nondeterminism in Algebraic Specifications and Algebraic Programs, Birkhäuser, 1993.
Kapur, D., Towards a theory of abstract data types, Ph.D. thesis, Laboratory for CS, MIT, 1980.
Keller, R.M., “Denotational models for parallel programs with indeterminate operators”, in Formal Descriptions of Programming Concepts, North-Holland, Amsterdam, 1978.
Manber, U., Introduction to Algorithms, Addison-Wesley, 1989.
Meseguer, J., “Conditional rewriting logic as a unified model of concurrency”, TCS, no. 96, 73–155, 1992.
Meseguer, J., “Conditional Rewriting Logic: Deduction, Models and Concurrency”, in Proceedings of CTRS'90, LNCS vol. 516, 1990.
Milner, R., Communication and Concurrency, Prentice Hall International, 1989.
Mosses, P.D., “Unified Algebras and Action Semantics”, in STACS'89, LNCS, vol. 349, Springer, 1989.
Mosses, P.D., “Unified Algebras and Institutions”, in Proceedings of LICS'89, Fourth Annual Symposium on Logic in Computer Science, 1989.
Nipkow, T., “Non-deterministic Data Types: Models and Implementations”, Acta Informatica, vol. 22, 629–661, 1986.
Qian, X., Goldberg, A., “Referential Opacity in Nondeterministic Data Refinement”, in ACM LoPLAS, vol.2, no. 1–4, 1993.
Schwartz, R.L., “An axiomatic treatment of ALGOL 68 routines”, in Proceedings of Sixth Colloquium on Automata, Languages and Programming, vol. 71, Springer, 1979.
S0ndergaard, H., Sestoft, P., Non-Determinacy and Its Semantics, Tech. Rep. 86/12, Datalogisk Institut, Københavns Universitet, January 1987.
Walicki, M., Algebraic Specifications of Nondeterminism, Ph.D. thesis, University of Bergen, Department of Informatics, 1993.
Walicki, M., Singular and Plural Nondeterministic Parameters: Multialgebras, Power Algebras and Complete Reasoning Systems, Tech. Rep. 96, Department of Informatics, University of Bergen, 1994.
Ward, N., “A Refinement Calculus for Nondeterminisitc Expressions”, PhD Thesis, Dept. of Computer Science, The University of Queensland, submitted February 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Walicki, M., Meldal, S. (1995). Multialgebras, power algebras and complete calculi of identities and inclusions. In: Astesiano, E., Reggio, G., Tarlecki, A. (eds) Recent Trends in Data Type Specification. ADT COMPASS 1994 1994. Lecture Notes in Computer Science, vol 906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014444
Download citation
DOI: https://doi.org/10.1007/BFb0014444
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59132-0
Online ISBN: 978-3-540-49198-9
eBook Packages: Springer Book Archive