Skip to main content
Log in

Specification and proving of command programs

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

In this paper a method is described by which command languages can be specified in a precise and comprehensive way and which allows the correctness of command programs to be proven automatically. The described technique is based on an abstract command processor (ACP) which was developed both from principles of abstract interpreters and of axiomatic definitions.

A formal description of a sample command language (SCL) is given by identifying in an axiomatic manner the set of ACP state transformations arising during the execution of the commands and by defining interpretatively which of these transformations are chosen in a given context. Using this definition the correctness of a command program can be proven in a nonheuristic manner. The technique is demonstrated on a SCL example.

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

Access this article

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. Bandat, K.: Semantik von Betriebssystemen (Semantics of Operating Systems). NTG-Fachtagung über Betriebssysteme, Darmstadt, 1972. Berlin: VDE-Verlag, 1972, p. 106–115

    Google Scholar 

  2. See for example the review article: Elspas, B., Levitt, K., Waldinger, R., Waksman, A.: An assessment of techniques for proving program correctness. Computing Surveys 4, 97–147 (1972)

    Article  MathSciNet  Google Scholar 

  3. Floyd, R.W.: Assigning meanings to programs. In: Schwartz, J.T. (ed.): Mathematical aspects of computer science 19. Providence (R.I.): Amer. Math. Soc., 1967, p. 19–32

    Chapter  Google Scholar 

  4. Hoare, C.A.R., Wirth, N.: An axiomatic definition of the programming language Pascal. Acta Informatica 2, 335–355 (1973)

    Article  Google Scholar 

  5. King, J.C.: A new approach to program testing. Proceedings of the Int. ACM Conference on Reliable Software, Los Angeles, 1975, p. 228–233

  6. Lee, J.A.N.: Computer semantics. London: van Nostrand Reinhold 1972

    Google Scholar 

  7. Lucas, P., Walk, K.: On the formal description of PL/I. Annual Review in Automatic Programming 6, 105–182 (1969)

    Article  Google Scholar 

  8. Neuhold, E. J.: The formal description of programming languages. IBM Systems Journal 10, 86–112 (1971)

    Article  Google Scholar 

  9. Niggemann, N.: A method for the semantic description of command languages. In: Unger, C. (ed.): Command languages. Proceedings of the IFIP Working Conference on Command Languages 1975. Amsterdam: North-Holland 1975, P. 223–236

    Google Scholar 

  10. Remark of T.B. Steel, during the IFIP Working Conference. In: Unger, C. (ed.): Command languages. Proceedings of the IFIP Working Conference on Command Languages 1975. Amsterdam: North-Holland 1975, p. 205

  11. Weller, T.: On the user-oriented semantics of command languages. In: Unger, C. (ed.): Command languages. Proceedings of the IFIP Working Conference on Command Languages 1975. Amsterdam: North-Holland 1975, P. 237–246

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Neuhold, E.J., Weller, T. Specification and proving of command programs. Acta Informatica 6, 15–40 (1976). https://doi.org/10.1007/BF00263741

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Navigation