Acta Informatica

, Volume 19, Issue 3, pp 235–253 | Cite as

An operational semantics for specifications of abstract data types with error handling

  • G. Engels
  • U. Pletat
  • H. -D. Ehrich


A new approach to an operational treatment of errors and exceptions in specifications of abstract data types is presented. Considering a specification as a term rewriting system, we define an operational semantics and give conditions that are sufficient for its well-definedness (Church-Rosser property). Also, we give conditions that are sufficient for the termination of reduction strategies, respecting the specified error and exception handling.


Information System Operating System Data Structure Communication Network Information Theory 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Goguen, J.A., Thatcher, J.W., Wagner, E.G.: An Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types. Current Trends in Programming Methodology, Vol. IV. Yeh, R.T. (ed.). Prentice Hall, pp. 80–149, 1978Google Scholar
  2. 2.
    Burstall, R.M., Goguen, J.A.: Putting Theories Together to Make Specifications. Proc. 5th Int Joint Conf. Artificial Intelligence, MIT, Cambridge, MA, 1977Google Scholar
  3. 3.
    Burstall, R.M., Goguen, J.A.: The Semantics of CLEAR, a Specification Language. Proc. 1979 Copenhagen Winter School Abstr. Software Specifications. Bjorner, D. (ed.). LNCS 86, pp. 292–331. Berlin, Heidelberg, New York: Springer, 1980Google Scholar
  4. 4.
    Ehrich, H.-D.: Extensions and Implementations of Abstract Data Type Specifications. Proc. 7th Symp. MFCS 78. Winkowski, J. (ed.). LNCS 64, pp. 155–164, Berlin, Heidelberg, New York:Springer, 1978Google Scholar
  5. 5.
    Ehrich, H.-D.: On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types. Bericht Nr. 82/79, Abt. Informatik, Universität DortmundGoogle Scholar
  6. 6.
    Ehrig, H., Kreowski, H.-J., Padawitz, P.: Stepwise Specification and Implementation of Abstract Data Types. Internal Report, TU Berlin, FB 20, Inst. Software Theor. Inform., 1977Google Scholar
  7. 7.
    Ehrig, H., Kreowski, H.-J., Thatcher, J.W., Wagner, E.G., Wright, J.B.: Parameter Passing in Algebraic Specification Languages. Internal Report, FB 20, TU Berlin, 1980Google Scholar
  8. 8.
    Ehrig, H., Kreowski, H.-J., Weber, H.: Algebraic Specification Schemes for Data Base Systems. Hahn-Meitner-Institut f. Kernforschung Berlin GmbH, HMI-B 266, Februar 1978Google Scholar
  9. 9.
    Engels, G., Pletat, U.: Analyse von Regelschemata für Unterbaumersetzungssysteme. Diplomarbeit, Abt. Informatik, Univ. Dortmund, März 1980Google Scholar
  10. 10.
    Engels, G., Pletat, U., Ehrich, H.-D.: Handling Errors and Exceptions in the Algebraic Specification of Data Types. Osnabrücker Schriften zur Mathematik, Reihe Informatik, OSM 13, 1981Google Scholar
  11. 11.
    Ganzinger, H.: Parameterized Specifications: Parameter Passing and Implementation. Internal Report, EECS-Comp. Sc. Division, UC Berkeley, September 1980Google Scholar
  12. 12.
    Goguen, J.A.: Abstract Errors for Abstract Data Types. Proc. Conf. on Formal Description of Programming Concepts. Neuhold, E.J. (ed.). Amsterdam: North-Holland, 1978Google Scholar
  13. 13.
    Goguen, J.A.: Order Sorted Algebras: Exception and Error Sorts, Coercions, and Overloaded Operators. Semantics and Theory of Computation Reports No. 14, University of California, Los Angeles, December 1978Google Scholar
  14. 14.
    Guttag, J.V., Horowitz, E., Musser, D.R.: Abstract Data Types and Software Validation. Information Sciences Institute, Report RR-76-48, Marina del Rey, CA, August 1976Google Scholar
  15. 15.
    Huet, G.: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. 18th IEEE Symp. Foundations Comput Sci., pp. 30–45, 1977Google Scholar
  16. 16.
    Knuth, D., Bendix, P.: Simple word problems in universal algebras, Computational Problems in Abstract Data Types. Leech, J. (ed.), Pergamon Press, pp. 263–297, 1970Google Scholar
  17. 17.
    Kraus, T., Wiegand, J.: Entwurf und Implementierung einer Spezifikationssprache für abstrakte Datentypen. Diplomarbeit, Abt. Informatik, Universität Dortmund, 1980Google Scholar
  18. 18.
    Majster, M.E.: Treatment of Partial Operations in the Algebraic Specification Technique. Institut für Informatik, München, In: Proc. Specifications of Reliable Software, IEEE, 1979Google Scholar
  19. 19.
    O'Donnell, M.J.: Computing in Systems Described by Equations. LNCS 58, Berlin, Heidelberg, New York: Springer, 1977Google Scholar
  20. 20.
    Pletat, U., Engels, G., Ehrich, H.-D.: An Operational Approach to Conditional Algebraic Specifications. In: Proc. 7eme Colloque sur les Arbres en Algebre et en Programmation, caap 82, Lille, 1982 (to appear)Google Scholar
  21. 21.
    Rosen, B.K.: Tree-Manipulating Systems and Church-Rosser Theorems. JACM 20, 160–187 (1973)Google Scholar
  22. 22.
    Wand, M.: Algebraic Theories and Tree Rewriting Systems. Technical Report No. 66, Bloomington, IN: Indiana Univ., 1977Google Scholar

Copyright information

© Springer-Verlag 1983

Authors and Affiliations

  • G. Engels
    • 1
  • U. Pletat
    • 2
  • H. -D. Ehrich
    • 3
  1. 1.Institut für Angewandte InformatikUniversität OsnabrückOsnabrückFed. Rep.
  2. 2.Institut für InformatikUniversität StuttgartStuttgart 1Fed. Rep.
  3. 3.Lehrstuhl B für InformatikBraunschweigFed. Rep.

Personalised recommendations