Advertisement

A compositional reformulation of Owicki-Gries's partial correctness logic for a concurrent while language

  • Colin Stirling
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 226)

Abstract

A straightforward compositional reformulation of Owicki-Gries's Hoare logic for a parallel while language is presented. The reformulation involves a Hoare quintuple (Γ,Δ) ⊢ {A} p {B} where Γ,Δ are sets of first-order formulas. It is shown that the quintuple has an interesting semantics which suggests a generalization of the proof system.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    K. Abrahamson "Modal logic of concurrent programs" LNCS 70 pp. 21–33 (1979).Google Scholar
  2. [2]
    K. Apt "Recursive assertions and parallel programs" Acta Informatica pp. 219–32 (1981).Google Scholar
  3. [3]
    H. Barringer, R. Kuiper and A. Pnueli "Now you may compare temporal logic specifications" Proc. STOC (1984).Google Scholar
  4. [4]
    S. Brookes "An axiomatic treatment of a parallel programming language" LNCS 193 (1985).Google Scholar
  5. [5]
    N. Francez, A. Pnueli "A proof method for cyclic programs" Acta Informatica pp. 133–157 (1978).Google Scholar
  6. [6]
    R. Gerth "Transition logic" Proc. STOC (1983).Google Scholar
  7. [7]
    M. Hennessy, G. Plotkin "Full abstraction for a simple parallel programming language" LNCS 74 pp. 108–120 (1979).Google Scholar
  8. [8]
    C. Jones "Specification and design of (parallel) programs" IFIP pp. 321–32 (1983).Google Scholar
  9. [9]
    L. Lamport "The Hoare logic of concurrent programs" Acta Informatica pp. 21–37 (1980).Google Scholar
  10. [10]
    J. Misra and K. Chandy "Proofs of networks of processes" IEEE Transactions on Software Engineering pp. 417–26 (1981).Google Scholar
  11. [11]
    S. Owicki "Axiomatic Proof Techniques for Parallel Programs" Ph.D. thesis, Cornell (1975).Google Scholar
  12. [12]
    S. Owicki, D. Gries "An axiomatic proof technique for parallel programs I" Acta Informatica pp. 319–40 (1976).Google Scholar
  13. [13]
    J. Reynolds "The Craft of Programming" Prentice-Hall (1981).Google Scholar
  14. [14]
    N. Soundararajan "A proof technique for parallel programs" Theoretical Computer Science pp. 13–29 (1984).Google Scholar
  15. [15]
    J. Zwiers, W. de Roever, P. van Emde Boas "Compositionality and concurrent networks: soundness and completeness of a proof system" LNCS 194 (1985).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Colin Stirling
    • 1
  1. 1.Dept. of Computer ScienceUniversity of EdinburghUK

Personalised recommendations