Proof rules for communication abstractions

  • Gadi Taubenfeld
  • Nissim Francez
Session 7 Algorithms And Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 181)


A modular proof system is presented for proving partial correctness and freedom from deadlock of concurrent programs using scripts (including recursive scripts). Its applications to augmentations of CSP and a subset of ADA are discussed. The proof rules are a generalization of both the procedure rules and the concurrency rules. Correctness proofs for examples are presented.

C.R. Categories

D.3.3 F.3.1 F.3.3 

Key Words

proof rule verification concurrent programming deadlock script invariants 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AFR80]
    Apt, K.R., Francez, N., and de Roever, W.P. A proof system for communicating sequential processes. ACM Trans. Prog. Lang. Syst. 2,3 (July 1980), 359–385.Google Scholar
  2. [AP81]
    Apt, K.R., Ten years of Hoare logic: A survey-part 1. ACM Trans. Prog. Lang. Syst. 3,4 (October 1981), 431–483.Google Scholar
  3. [AP83]
    Apt, K.R., Formal justification of proof system for communicating sequential processes. ACM Trans. Prog. Lang. Syst. 30,1 (January 1983), 197–216.Google Scholar
  4. [EF82]
    Elrad, T., Francez, N. Decomposition of distributed programs into communication-close layers. Science of Computer Programming 2 (1982) 155–173, North-Holland.Google Scholar
  5. [FH83]
    Francez, N., and Hailpern, B. Script: A communication abstraction mechanism. ACM-SIGACT 2 nd annual PODC conf., Montreal, (August 1983).Google Scholar
  6. [GL80]
    Gries, D., and Levin, G. Assignment and procedure call proof rules. ACM Trans. Prog. Lang. Syst. 2,4 (October 1980), 564–579.Google Scholar
  7. [GR]
    Gerth, R., and de Roever, W.P. A proof system for concurrent ada programs. to appear in SCP. Tech. Rep. RUU-CS-83-2, U. of Utrecht, October 1983.Google Scholar
  8. [HO71]
    Hoare, C.A.R. Procedures and parameters: An axiomatic approach. In Symp. Semantics of Algorithmic Languages, E. Engeler, Ed., Notes in Mathematics 188, Springer-Verlag, New York, 1971, 102–116.Google Scholar
  9. [HO78]
    Hoare, C.A.R. Communicating sequential processes. Commun. ACM 21,8 (August 1978), 666–677.Google Scholar
  10. [OG76]
    Owicki, S.S., and Gries, D. An axiomatic proof technique for parallel programs. I. Acta Inf. 6, 1976, 319–340.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Gadi Taubenfeld
    • 1
  • Nissim Francez
    • 1
  1. 1.Computer Science dept.Technion — Israel Institute of TechnologyHaifaIsrael

Personalised recommendations