Skip to main content

A Final Algebra Semantics for Errors and Exceptions

  • Conference paper
Recent Trends in Data Type Specification

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 116))

Abstract

Algebraic specifications allowing equations and inequations are studied. A characterisation of the existence of models and initial algebras as well as a criterion for the existence of final algebras for such specifications are given. As an application it is shown, how the result can be applied to yield maximal error propagation preserving error recovery in abstract data types.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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, R.T. Yeh, ed. Prentice Hall, Englewood Cliffs, 1978, pp.80–149.

    Google Scholar 

  2. Ehrig, H./Kreowski, H.-J./Thatcher, J.W./Wagner, E.G./Wright, J.B.: Parameter passing in algebraic specification languages. Proc. Workshop on Program Specification, LNCS 134, Berlin 1982, pp.322–369.

    Article  Google Scholar 

  3. Bidoit, M.: Algebraic specification of exception handling and error recovery by means of equations and declarations. Proc. 11th ICALF, LNCS 172, pp.95–109, 1984.

    Google Scholar 

  4. Boisson, F./Guiho, G./Pavot, D.: Multioperator algebras. Report, L.R.I., Orsay, 1982.

    Google Scholar 

  5. Broy, M. /Wirsing, M.: Generalized heterogeneous algebras and partial interpretations. Proceedings 8th GAAP 1983, L’Aquila, pp.1–34.

    Google Scholar 

  6. Enrich, H.-D.: On the theory of specification, implementation and parametrization of abstract data types. JACM, Vol.29, 1982, pp.206–227.

    Article  Google Scholar 

  7. Ehrig, H./Kreowski, H.-J./Mahr, B./Padawitz, P.: Algebraic implementation of abstract data types. TCS, Vol.20, 1982, pp.209–263.

    Article  MATH  Google Scholar 

  8. Engels, G./Pletäa, U./Ehrich, H.-D.: An operational semantics for specifications of abstract data types with error handling. Acta Informatica 19, pp.235–253, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  9. Ganzinger, H.: Parametrized specification s Parameter passing and implementation. ACM TOPLAS, Vol.5, No.3, pp. 318–354, 1983.

    Article  MATH  Google Scholar 

  10. Gogolla, M./Drosten, K./Lipeck, U./Enrich, H.-D.: Algebraic and operational semantics of specifications allowing exceptions and errors. TCS, Vol.34, 1984, pp.289–313.

    Article  MATH  Google Scholar 

  11. Gogolla, M.: Partially ordered sorts in algebraic specifications. Proc. 9th CAAP Bordeaux, Cambridge University Press, B. Courcelle, ed. pp.139–153, 1984.

    Google Scholar 

  12. Goguen, J.A.: Abstract errors for abstract data types. Proc. Conference on Formal Description of Programming Concepts, E.J. Neuhold, ed. North Holland, Amsterdam, 1978.

    Google Scholar 

  13. Goguen, J.A.: Order sorted algebras s Exception and error sorts, coercions and overloaded operators. Semantics and theory of computation report No.14, UCLA, 1978.

    Google Scholar 

  14. Guttag, J.V.: The specification and application to programming of abstract data types. Technical Report CSRG-59 University of Toronto, 1975.

    Google Scholar 

  15. Hornung, G./Raulefs, P.: Terminal algebra semantics and retractions for abstract data types. Proc. 7th ICALP, LNCS 85, pp.310–323, 1980.

    Google Scholar 

  16. Klaeren, H.: A constructive method for abstract algebraic software specification. TCS, Vol.30, No.2, pp.139–204, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  17. Liskov, B. /Zi1les S.: Programming with abstract data types. SIGPLAN Notices, Vol.9, No.4, pp.50–59.

    Google Scholar 

  18. Plaisted, D.: An initial algebra semantics -for error presentations. Technical Report, 1982.

    Google Scholar 

  19. Poigne, A.: Another look at parametrization using algebras with subsorts. Proc. MFCS 1984 Praha, LNCS 176.

    Google Scholar 

  20. Sannella, D./Tarlecki, A.: On observational equivalence and algebraic specification. Proc. 10th GAAP, Berlin 1985.

    Google Scholar 

  21. Wand, M.: Final algebra semantics and data type extensions. JCSS, Vol.19, No.1, pp.27–44, 1979.

    MathSciNet  MATH  Google Scholar 

  22. Wirsing, M. /Pepper, P. /Partsch, H. /Dosch, W. /Broy, M.: On hierachies of abstract data types. Acta Informatica 20, pp.1–33, 1983.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gogolla, M. (1985). A Final Algebra Semantics for Errors and Exceptions. In: Kreowski, HJ. (eds) Recent Trends in Data Type Specification. Informatik-Fachberichte, vol 116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-09691-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-09691-8_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16077-9

  • Online ISBN: 978-3-662-09691-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics