Advertisement

Logic of Programs 1983: Logics of Programs pp 513-527 | Cite as

A proof system for partial correctness of dynamic networks of processes

Extended abstract
  • Job Zwiers
  • Arie de Bruin
  • Willem Paul de Roever
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 164)

Abstract

We introduced a formal proof system for dynamic networks of processes, which has been shown to be sound. Future work will consider the completeness of the system.

Keywords

Proof System Parallel Composition Correctness Formula Internal Channel Consequence 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. [AFR]
    Apt, K.R., Francez, N. and de Roever, W.P. "A proof System for Communicating Sequential Processes" TOPLAS 2,3. July 1980.Google Scholar
  2. [CH]
    Chen, Z.C. and Hoare, C.A.R. "Partial Correctness of Communicating Sequential Processes." 2nd International Conference on Distributed Computer Systems, IEEE 1981, 1–12.Google Scholar
  3. [MC]
    Misra, J. and Chandy, K.M. "Proofs of Networks of Processes", IEEE Transactions on Software Engineering, July 1981.Google Scholar
  4. [SD]
    Soundararajan, N. and Dahl, O.J. "Partial Correctness Semantics of Communicating Sequential Processes"Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Job Zwiers
    • 1
  • Arie de Bruin
    • 2
  • Willem Paul de Roever
    • 3
    • 4
  1. 1.Department of Computer ScienceUniversity of Nijmegen, ToernooiveldNijmegenthe Netherlands
  2. 2.Faculty of EconomicsErasmus UniversityRotterdamthe Netherlands
  3. 3.Department of Computer ScienceUniversity of Nijmegenthe Netherlands
  4. 4.Department of Computer ScienceUniversity of UtrechtUtrechtthe Netherlands

Personalised recommendations