Advertisement

A sound and complete HOARE axiomatization of the ADA-rendezvous

Extended abstract
  • Rob Gerth
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)

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.

Keywords

Auxiliary Variable Formation Rule Proof System Proof Outline Proof Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Apt81a]
    Apt, K.: Formal Justification of a Proof System for Communicating Sequential Processes. to appearGoogle Scholar
  2. [Apt81b]
    Apt, K.: Ten Years of Hoare's Logic: A Survey — Part 1. TOPLAS 3–4 p.431–484, 1981.CrossRefGoogle Scholar
  3. [AFR80]
    Apt, K., N. Francez, W.P. de Roever: A Proof System for Communicating Sequential Processes. TOPLAS 2–3 p.359–385, 1980.CrossRefGoogle Scholar
  4. [ARM81]
    The Programming Language ADA. Reference manual. LNCS 106, Springer Verlag, New York, 1981.Google Scholar
  5. [BM81]
    Barringer, H., I.Mearns: Axioms and Proof Rules for ADA Tasks. Technical report, Dept. of Computer Science, University of Manchester, 1981.Google Scholar
  6. [Fra82]
    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. [Ger81]
    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. [Ger82a]
    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. [Ger82b]
    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. [GL80]
    Gries, D., G.Levin: Assignment and Procedure Call Proof Rules. TOPLAS 2–4 p.564–580, 1980.CrossRefGoogle Scholar
  11. [OwG76]
    Owicki, S., D.Gries: An Axiomatic Proof Technique for Parallel Programs 1. Acta Inf. 6 p.319–340, 1976.MathSciNetCrossRefGoogle Scholar
  12. [PR82]
    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. [Ron81]
    Roncken, M., R.Gerth, W.P. de Roever: A Proof System for Brinch Hansen's Distributed Processes. Proc. GI81 München, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Rob Gerth
    • 1
  1. 1.Department of Computer ScienceUniversity of UtrechtTA UtrechtThe Netherlands

Personalised recommendations