Skip to main content
SpringerLink
Log in

The stratified loose approach: A generalization of initial and loose semantics

  • Conference paper
  • First Online:
Recent Trends in Data Type Specification (ADT 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 332))

Included in the following conference series:

Abstract

Besides the respective advantages and drawbacks of the initial and loose approaches to algebraic semantics, the choice of either initial semantics or loose semantics for a given specification language often relies on methodological considerations. In this paper, we briefly recall the main features of the Pluss specification language, the semantics of which was originally designed following the loose approach. Then we study how far some basic concerns, such as modularity and reusability, interact with the design of the semantics of the Pluss specification-building primitives. We show that neither the initial approach nor the loose one is powerful enough to reflect our intuition and needs about software reusability and modularity, and we introduce a more sophisticated framework, the stratified loose semantics, which can be considered as a generalization of both loose and initial semantics.

This work is partially supported by ESPRIT Project 432 METEOR and C.N.R.S. GRECO de Programmation.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. The programming language Ada. Reference Manual. United States Department of Defense, January 1983.

    Google Scholar 

  2. E. Astesiano and M. Wirsing. An introduction to ASL. In Proc. of the IFIP WG2.1 Working Conference on Program Specifications and Transformations, 1986.

    Google Scholar 

  3. F.L. Bauer et al. The Munich Project CIP. Volume I: The wide spectrum language CIP-L. Springer-Verlag L.N.C.S. 183, 1985.

    Google Scholar 

  4. G. Bernot. Good functors... are those preserving philosophy ! In Proc. of the Summer Conference on Category Theory and Computer Science, pages 182–195, Springer-Verlag L.N.C.S. 283, September 1987.

    Google Scholar 

  5. G. Bernot, M. Bidoit, and C. Choppy. Abstract data types with exception handling: an initial approach based on a distinction between exceptions and errors. Theoretical Computer Science, 46(1):13–45, 1986.

    Google Scholar 

  6. G. Bernot, M. Bidoit, and C. Choppy. Abstract implementations and correctness proofs. In Proc. of the 3rd STACS, pages 236–251, Springer-Verlag L.N.C.S. 210, January 1986.

    Google Scholar 

  7. M. Bidoit. Algebraic specification of exception handling and error recovery by means of declarations and equations. In Proc. of the 11th ICALP, pages 95–108, Springer-Verlag L.N.C.S. 172, July 1984.

    Google Scholar 

  8. M. Bidoit. Une méthode de présentation des types abstraits: Applications. Thèse de 3° Cycle, Université Paris-Sud, June 1981.

    Google Scholar 

  9. M. Bidoit, B. Biebow, M.-C. Gaudel, C. Gresse, and G. Guiho. Exception handling: formal specification and systematic program construction. I.E.E.E. Transactions on Software Engineering, SE-11(3):242–252, 1985.

    Google Scholar 

  10. M. Bidoit and C. Choppy. The ALEX-PLUSS Specification Language. Technical Report, ESPRIT Project FOR-ME-TOO, January 1986.

    Google Scholar 

  11. M. Bidoit, C. Choppy, and F. Voisin. The ASSPEGIQUE specification environment: motivations and design. In Proc. of the 3rd Workshop on Theory and Applications of Abstract Data Types, pages 54–72, Springer-Verlag I.F.B. 116, November 1984.

    Google Scholar 

  12. M. Bidoit, M.-C. Gaudel, and A. Mauboussin. How to make algebraic specifications more understandable ? An experiment with the Pluss specification language. Technical Report 343, L.R.I., April 1987.

    Google Scholar 

  13. B. Biebow. Application d'un langage de spécification algébrique à des exemples téléphoniques. Thèse de 3° Cycle, Université Paris VI, February 1984.

    Google Scholar 

  14. B. Biebow, N. Choquet, and A. Mauboussin. Spécification par types abstraits algébriques de fonctions caractéristiques d'une unité de raccordement d'abonnés téléphoniques. Technical Report, DAII Contract 84.35.087, September 1985.

    Google Scholar 

  15. B. Biebow and J. Hagelstein. Algebraic specification of synchronisation and errors: a telephonic example. In Proc. of the TAPSOFT Conference, pages 294–308, Springer-Verlag L.N.C.S. 186, March 1985.

    Google Scholar 

  16. M. Broy and M. Wirsing. Partial abstract data types. Acta Informatica, 18(1):47–64, 1982.

    Google Scholar 

  17. F. Capy. ASSPEGIQUE: un environnement d'exceptions... Thèse de 3° Cycle, Université Paris-Sud, December 1987.

    Google Scholar 

  18. C. Choppy. Formal specifications, prototyping and integration tests. In Proc. of the 1st European Software Engineering Conference, pages 185–192, September 1987.

    Google Scholar 

  19. M.-A. Choquer. Specification of the evaluation tool: leftmost outermost reduction strategy in the equational case. Technical Report, ESPRIT Project METEOR, November 1986.

    Google Scholar 

  20. J. Despeyroux-Savonitto. An algebraic specification of a Pascal compiler. SIGPLAN, 18(12):34–48, 1983.

    Google Scholar 

  21. H. Ehrig, W. Fey, and H. Hansen. ACT ONE: An algebraic specification language with two levels of semantics. Technical Report 83-03, Department of Computer Science, TU Berlin, 1983.

    Google Scholar 

  22. H. Ehrig, H. Kreowski, B. Mahr, and P. Padawitz. Algebraic implementation of abstract data types. Theoretical Computer Science, October 1980.

    Google Scholar 

  23. H. Ehrig, H. Kreowski, J.W. Thatcher, E.G. Wagner, and J.B. Wright. Parameterized data types in algebraic specification languages. In Proc. of the 7th ICALP, 1980.

    Google Scholar 

  24. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1. Springer-Verlag, 1985.

    Google Scholar 

  25. K. Futatsugi, J.A. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Proc. of the 12th ACM Symposium on Principles of Programming Languages, pages 52–66, January 1985.

    Google Scholar 

  26. M.-C. Gaudel and Th. Moineau. A theory of software reusability. In Proc. of ESOP'88, to appear in Springer-Verlag L.N.C.S., March 1988.

    Google Scholar 

  27. J.A. Goguen and J. Meseguer. Order-Sorted Algebra I: Partial and Overloaded Operators, Errors and Inheritance. Technical Report, S.R.I., October 1986. Unpublished Draft.

    Google Scholar 

  28. J.A. Goguen, J.W. Thatcher, and E.G. Wagner. An initial approach to the specification, correctness, and implementation of abstract data types. Volume 4 of Current Trends in Programming Methodology, Prentice Hall, 1978.

    Google Scholar 

  29. J.V. Guttag, J.J. Horning, and J.M. Wing. Larch in five easy pieces. Technical Report 5, Digital Systems Research Center, 1985.

    Google Scholar 

  30. R. Harper. Introduction to Standard ML. Technical Report ECS-LFCS-86-14, LFCS, Edinburgh, November 1986.

    Google Scholar 

  31. S. Kaplan. Fair conditional term rewrite systems. Journal of Symbolic Computation, 1987.

    Google Scholar 

  32. B. Liskov et al. CLU Reference Manual. Technical Report MIT-LCS-TR-225, M.I.T., October 1979.

    Google Scholar 

  33. D. MacQueen and D.T. Sannella. Completeness of proof systems for equational specifications. I.E.E.E. Transactions on Software Engineering, SE-11(5), 1985.

    Google Scholar 

  34. D.T. Sannella. Implementations revisited. In Abstracts of the 5th Workshop on Specification of Abstract Data Types, September 1987.

    Google Scholar 

  35. D.T. Sannella and A. Tarlecki. Building specifications in an arbitrary institution. In Proc. of the Intl. Symp. on Semantics of Data Types, Springer-Verlag L.N.C.S. 173, 1984.

    Google Scholar 

  36. D.T. Sannella and M. Wirsing. A kernel language for algebraic specification and implementation. In Proc. of FCT'83, Springer-Verlag L.N.C.S. 158, 1983.

    Google Scholar 

  37. Oliver Schoett. Data abstraction and the correctness of modular programming. PhD thesis, University of Edinburg, 1987.

    Google Scholar 

  38. J.W. Thatcher, E.G. Wagner, and J.B. Wright. Data type specification: parameterization and the power of specification techniques. In Proc. of the 10th Annual Symposium on Theory of Computing, 1979.

    Google Scholar 

  39. M. Wirsing. Structured Algebraic Specifications: A Kernel Language. PhD thesis, Techn. Univ. Munchen, 1983.

    Google Scholar 

  40. M. Wirsing and M. Broy. Abstract data types as lattices of finitely generated models. In Proc. of the 9th Intl. Symp. on Mathematical Foundations of Computer Science, Springer-Verlag L.N.C.S., September 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratorie de Recherche en Informatique C.N.R.S. U.A. 410 “Al Khowarizmi”, Université Paris-Sud, Bât. 490, F — 91405, Orsay Cedex, France

    Michel Bidoit

Authors
  1. Michel Bidoit
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

D. Sannella A. Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bidoit, M. (1988). The stratified loose approach: A generalization of initial and loose semantics. In: Sannella, D., Tarlecki, A. (eds) Recent Trends in Data Type Specification. ADT 1987. Lecture Notes in Computer Science, vol 332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50325-0_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-50325-0_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50325-5

  • Online ISBN: 978-3-540-45970-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation