Skip to main content
SpringerLink
Log in

Abstract implementation of algebraic specifications in a temporal logic language

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

A formal technique for incorporating two specification paradigms is presented in which an algebraic specification is implemented by a set of abstract procedures specified in pre- and post-condition style. The link between the two level specifications is provided via a translation from terms of algebraic specifications into temporal logic formulae representing abstract programs. In terms of translation, a criterion for an abstract implementation satisfying its specification is given, which allows one to check the consistency between the two levels of specifications. The abstract implementations can be refined into executable code by refining each abstract procedure in it. It is proved that the satisfication relation between a specification and its implementations is preserved by such refinement steps.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. A. Goguen, J. W. Thatcher, and E. G. Wagner, An initial algebra approach to the specification, correctness, and implementation of abstract data types. InCurrent Trends in Programming Methodology. IV: Data Structuring (R. T. Yeh, Ed.), Prentice-Hall, Englewood, Cliffs, N. J., 1978, 80–149.

    Google Scholar 

  2. R. M. Burstall, and J. A. Goguen, The Semantics of Clear, A specificaion language. In Proc. of Advanced Course on Software specifications, Lecture Notes in Computer Science 86, Springer-Verlag, 1980, 292–332.

  3. H.-D. Ehrich, On the theory of specification, implementation, and parameterization of abstract data types,J. ACM,29: 1 (1982), 206–227.

    Article  MATH  MathSciNet  Google Scholar 

  4. H. Erig, H.-J. Kreowski, B. Mahr, and P. Padawitz, Algebraic implementation of abstract data types,Theor. Comput. Sci., 20 (1982), 209–263.

    Article  Google Scholar 

  5. H. Erig, B. Mahr, Fundamentals of Algebraic Specification I: Equations and Initial Semantics. EATCS Monograph on Theoretical Computer Science, Springer 1985.

  6. K. Futatsugi, J. A., Goguen, J.-P., Jouannaud, and J. Meseguer, Principleś of OBJ2. Proc. 12th ACM Symposium on Principles of Programming La guages, 1985, 52–66.

  7. Y. Feng, H. Lin, and C. S. Tang, A proof system for temporal logic programs.Computer Research and Development (in Chinese), Oct. 1985, 1–9.

  8. J. V. Guttag, J. J. Horning, and J. M. Wing, Larch in five easy pieces, SRC Report # 5, Digital System Research Center, 1985.

  9. C. A. R. Hoare, Proving correctness of data representations,Acta Informatica,1: 1 (1972), 271–281.

    Article  MATH  Google Scholar 

  10. C. B. Jones, Systematic Software Development Using VDM. Prentice-Hall, 1986.

  11. S. Kamin and M. Atcher, Partial implementation of abstract data types: A dissenting view on errors. InSemantics of Data Types, Lecture Notes in Computer Science 173, Springer-Verlag, 1984, 317–336.

  12. Z. Manna, and A. Pnueli, Verification of concurrent programs, part 1: The temporal framework. Tech, Rept. STAN-CS-81-836, Dept. of Computer Science, Stanford Univ., 1981.

  13. C. C. Morgan, The specification statement.ACM Trans. Program. Lang. Syst,10: 3 (1988), 403–419.

    Article  MATH  Google Scholar 

  14. C. S. Tang, An introduction to XYZ system. Tech. Rept. IS-CAS-XYZ-88-1, Institute of Software, Chinese Academy of Sciences, 1988.

  15. M. Wand, Final algebra semantics and data type extensions.J. Comput. Syst. Sci.,19: 1 (1979), 27–44.

    Article  MATH  MathSciNet  Google Scholar 

  16. M. Wand, Specification, models, and implementation of data abstraction.Theor. Comput. Sci., 20 (1982), 3–32.

    Article  MATH  MathSciNet  Google Scholar 

  17. J. M. Wing, Writing Larch Interface Language specifications.ACM Trans. Program. Lang. Syst.,9: 1 (1987) 1–24.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Software, Academia Sinica, 100080, Beijing

    Lin Huimin, Gong Chun & Xie Hongliang

Authors
  1. Lin Huimin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gong Chun
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xie Hongliang
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This project is supported bu National Natural Science Foundation of China.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lin, H., Gong, C. & Xie, H. Abstract implementation of algebraic specifications in a temporal logic language. J. of Compt. Sci. & Technol. 6, 11–20 (1991). https://doi.org/10.1007/BF02943403

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02943403

Keywords

Search

Navigation