Skip to main content
SpringerLink
Log in

A sound and complete HOARE axiomatization of the ADA-rendezvous

Extended abstract

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1982)

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

Included in the following conference series:

Abstract

A HOARE-axiomatization is constructed for the ADA rendezvous, embedded in a subset of the ADA concurrency section. The well-known CSP proof system of Apt, Francez and de Roever is taken as a starting point. We prove the axiomatization to be sound and relatively complete.

The author is supported by the Dutch Organization for the Advancement of Pure Research (ZWO).

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

Access this chapter

Log in via an institution
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

  1. Apt, K.: Formal Justification of a Proof System for Communicating Sequential Processes. to appear

    Google Scholar 

  2. Apt, K.: Ten Years of Hoare's Logic: A Survey — Part 1. TOPLAS 3–4 p.431–484, 1981.

    Article  Google Scholar 

  3. Apt, K., N. Francez, W.P. de Roever: A Proof System for Communicating Sequential Processes. TOPLAS 2–3 p.359–385, 1980.

    Article  Google Scholar 

  4. The Programming Language ADA. Reference manual. LNCS 106, Springer Verlag, New York, 1981.

    Google Scholar 

  5. Barringer, H., I.Mearns: Axioms and Proof Rules for ADA Tasks. Technical report, Dept. of Computer Science, University of Manchester, 1981.

    Google Scholar 

  6. Francez, N., E.M.Clarke, C.Nikolaou: Extended Naming Conventions for Communicating Processes and their Proof Rules. Proc. 9th Symp. on POPL, 1982.

    Google Scholar 

  7. Gerth, R.: A Proof System for a Subset of the Concurrency Section of ADA. Technical report RUU-CS-81-17, Dept. of Computer Science, University of Utrecht, 1981.

    Google Scholar 

  8. Gerth, R., W.P. de Roever, M. Roncken: Procedures and Concurrency: A Study in Proof. Proc. Vth International Symposium on Programming, Turijn, 1982.

    Google Scholar 

  9. Gerth, R.: A Sound and Complete Hoare Axiomatization of the ADA Rendezvous. Technical report, Dept. of Computer Science, University of Utrecht, 1982.

    Google Scholar 

  10. Gries, D., G.Levin: Assignment and Procedure Call Proof Rules. TOPLAS 2–4 p.564–580, 1980.

    Article  Google Scholar 

  11. Owicki, S., D.Gries: An Axiomatic Proof Technique for Parallel Programs 1. Acta Inf. 6 p.319–340, 1976.

    Article  MathSciNet  Google Scholar 

  12. Pnueli, A., W.P. de Roever: Fairness in the programming language ADA. Technical report, Dept. of Computer Science, Weizmann Instute, Israel, 1982.

    Google Scholar 

  13. Roncken, M., R.Gerth, W.P. de Roever: A Proof System for Brinch Hansen's Distributed Processes. Proc. GI81 München, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Utrecht, P.O. Box 80.002, 3508, TA Utrecht, The Netherlands

    Rob Gerth

Authors
  1. Rob Gerth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mogens Nielsen Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gerth, R. (1982). A sound and complete HOARE axiomatization of the ADA-rendezvous. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012774

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation