Skip to main content
Log in

A specification technique based on predicate transformers

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

This paper proposes a formal specification technique based on the notion of predicate transformers. Several approaches to showing the completeness are investigated. A method for proving the correctness of an implementation with respect to a formal specification is described.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Parnas, D.L.: The use of precise specifications in the development of software. Proc. IFIP Congress 1977, Toronto, pp. 861–868. Amsterdam: North-Holland 1977

    Google Scholar 

  2. Ambler, A.I.: GYPSY: A language for specification and implementation of verifiable programs. SIGPLAN Notices, 12, 1–10 (1977)

    Google Scholar 

  3. Guttag, J.V.: The Specification and application to programming of abstract data types. Techn. Report CSRG-59, Univ. of Toronto, 1975

  4. Liskov, B., Zilles, B.: Specification techniques for data abstractions. IEEE Trans. Software Engrg. 1, 7–19 (1975)

    Google Scholar 

  5. Neumann, P.G., Robinson, L., Levitt, K.N., Saxena, A.R.: On attaining reliable software for a secure operating system. Proc. of the Int. Conf. on Reliable Software, 21–23 April 1975, Los Angeles, California. Los Angeles: IEEE

    Google Scholar 

  6. Dijkstra, E.W.: A discipline of programming. Englewood Cliffs, N.J.: Prentice Hall, 1976

    Google Scholar 

  7. Parnas, D.L.: A technique for software module specification with examples. CACM 15, 330–336 (1972)

    Google Scholar 

  8. Floyd, R.W.: Assigning meaning to programs. (J.T. Schwartz, ed.) Mathematical Aspects of Computer Science 19, 19–32 (1968)

  9. Hoare, C.A.R.: An axiomatic basis for computer programming. CACM 12, 576–585 (1969)

    Google Scholar 

  10. Parnas, D.L.: Some hypotheses about the ‘Uses’-hierarchy for operating systems. Research Report BS I 76/1, FB Informatik, TH Darmstadt, 1976

    Google Scholar 

  11. Parnas, D.L.: Handzel, G., Würges, H.: The design and specification of the minimal subset of an operating system family, IEEE Trans Software Engrg. SE-2, 301–307 (1976)

    Google Scholar 

  12. Parnas, D.L.: Bartussek, W., Handzel, G., Würges, H.: Using predicate transformers to verify the effects of ‘Real’ programs. Research Report BS I 76/3, FB Informatik, TH Darmstadt (1976)

    Google Scholar 

  13. Bartussek, W., Würges, H.: Proving that an implementation meets its abstract specification. Research Report BS I 76/2, FB Informatik, TH Darmstadt (1976)

    Google Scholar 

  14. Würges, H.: Das minimale Teilsystem von BSF: Entwurf, Realisierung und Beweismethode, Angewandte Informatik 20, 1–8 (1978)

    Google Scholar 

  15. Parnas, D.L., Handzel, G.: More on specification techniques for software modules. Research Report BS I 75/1, FB Informatik, TH Darmstadt (1976)

    Google Scholar 

  16. Hoare, C.A.R.: Proof of correctness of data representations. Acta Informat. 1, 271–281 (1972)

    Google Scholar 

  17. Robinson, L., Levitt, K.N.: Proof, techniques for hierarchically structured programs. CACM 20, 271–283 (1977)

    Google Scholar 

  18. Parnas, D.L., Siewiorek, D.P.: The concept of transparency in the design of hierarchically structured systems. CACM, 18, 401–408 (1975)

    Google Scholar 

  19. Price, W.R.: Implication of a virtual memory mechanism for implementing protection in a family of operating systems. Ph.D. Thesis, Dept. of Computer Science, Carnegie-Mellon University, Pittsburgh/PA, 1973

    Google Scholar 

  20. Minsky, M.: Computation: finite and infinite machines. Englewood Cliffs, N.J.: Prentice Hall, 1967

    Google Scholar 

  21. Würges, H.: Reaktion auf unerwünschte Ereignisse in hierarchisch strukturierten Software Systemen. Dissertation, FB Informatik, TH Darmstadt, 1977

    Google Scholar 

  22. Robinson, L., Roubine, O.: SPECIAL — a specification and assertion language. Technical Report CSL-46, SRI, Menlo Park, CA, 1977

    Google Scholar 

  23. Rosen, B.K.: Tree manipulating systems and Church-Rosser Theorems. JACM 20, 30–38 (1973)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

The work presented in this paper was performed while the author was with the University of Hamburg, Germany

Rights and permissions

Reprints and permissions

About this article

Cite this article

Würges, H. A specification technique based on predicate transformers. Acta Informatica 15, 425–445 (1981). https://doi.org/10.1007/BF00264537

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords