Skip to main content

Demonstrating the Compliance of Ada Programs with Z Specifications

  • Conference paper
5th Refinement Workshop

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

This paper describes a notation for presenting a claim that a program written in Ada satisfies a specification written in Z. The notation has both formal and informal elements: the formal elements follow the style of the refinement calculus, while the informal elements follow Knuth’s literate programming style. The combination of formal and informal elements allows for selective verification, an important requirement for practical use of formal refinement.

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

  • Back, R J R (1988). A calculus of refinements for program derivations. Acta Informatica, 25, 593–624.

    Article  MathSciNet  MATH  Google Scholar 

  • Dahl, O-J, Dijkstra, E W and Hoare, C A R (1972). Structured programming, Academic Press, London and New York.

    MATH  Google Scholar 

  • Dijkstra, E W (1976). A discipline of programming, Prentice Hall, Englewood Cliffs.

    MATH  Google Scholar 

  • Carre, B A (1989). Reliable programming in standard languages. In High Integrity Software, Sennett, C T (ed), Pitman, London.

    Google Scholar 

  • Carre, B A, Jennings, T J, Maclennan, F J, Farrow, P F and Gamsworthy, J R (1990). SPARK - The SPADE Ada Kernel. Program Validation Ltd, 26 Queens Terrace, Southampton SOl 1BQ.

    Google Scholar 

  • Good, D I (1986). Report of Gypsy 2. 05, Institute for Computer Science, University of Texas at Austin.

    Google Scholar 

  • King S, Sorensen I H, Woodcock J, (1988). Z: grammar and concrete and abstract syntaxes, Programming Research Group Technical Monograph PRG-68, University of Oxford.

    Google Scholar 

  • Knuth, D E, (1984). Literate programming, Computer Journal, 27, 2, pp 97–111.

    Article  MATH  Google Scholar 

  • Luckham, D C (1990). Programming with specifications. Springer Verlag Texts and Monographs in Computer Science.

    Google Scholar 

  • Morgan C C (1988). The specification statement, TOPLAS 10, 3.

    Article  Google Scholar 

  • Morgan C C (1990). Programming from specifications. Prentice Hall International Series in Computer Science.

    Google Scholar 

  • Smith, P and Bleech, N (1989). Practical experience with a formal verification system, in High Integrity Software Sennett, C T (ed ), Pitman London.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Âİ 1992 Springer-Verlag London

About this paper

Cite this paper

Sennett, C.T. (1992). Demonstrating the Compliance of Ada Programs with Z Specifications. In: Jones, C.B., Shaw, R.C., Denvir, T. (eds) 5th Refinement Workshop. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3550-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3550-0_5

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19752-2

  • Online ISBN: 978-1-4471-3550-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics