Skip to main content
SpringerLink
Log in

A proof system for distributed processes

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

A partial correctness proof system for Brinch Hansen's Distributed Processes (DP) is presented. Two important aspects of the system are: Proofs of individual processes of a DP program are completely isolated from each other; in particular, no assumptions are allowed in the proof of one process about the behavior of the other processes. Secondly a process is characterized by its externally visible behavior, i.e. the sequence of interactions between this process and the other processes of the program. An example demonstrates the use of the system.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Apt, K.R., Francez, N., de Roever, W.P.: A Proof System for Communicating Sequential Processes. ACM TOPLAS 2, 359–385 (1980)

    Google Scholar 

  2. Brinch Hansen, P.: Distributed Processes: A Concurrent Programming Concept. Commun. ACM 21, 934–941 (1978)

    Google Scholar 

  3. Dijkstra, E.W.: Guarded Commands, Nondeterminancy and the Formal Derivation of Programs. Commun. ACM 18, 453–457 (1975)

    Google Scholar 

  4. Gerth, R., de Roever, W.P., Roncken, M.: Procedures and Concurrency: A Study in Proof. Proceedings of the 5th International Symposium on Programming. Lect. Notes Comput. Sci. Vol 137. pp. 132–163. Berlin, Heidelberg, New York: Springer 1982

    Google Scholar 

  5. Hoare, C.A.R.: An Axiomatic Basis for Computer Programming. Commun. ACM 12, 576–580, 583 (1969)

    Google Scholar 

  6. Lamport, L., Schneider, F. B.: The ‘Hoare Logic’ of CSP, and All That. ACM TOPLAS 6, 281–296 (1984)

    Google Scholar 

  7. Levin, G.M., Gries, D.: A Proof Technique for Communicating Sequential Processes. ACTA Inf. 15, 281–302 (1981)

    Google Scholar 

  8. Misra, J., Chandy, K.M.: Proofs of Networks of Processes. IEEE Trans. Software Eng. 7, 417–426 (1981)

    Google Scholar 

  9. Misra, J., Chandy, K.M., Smith, T.: Proving Safety and Liveness of Communicating Processes With Examples. PODC 1, 201–208 (1982)

    Google Scholar 

  10. Owicki, S.S., Gries, D.: An Axiomatic Proof Technique for Parallel Programs. ACTA Inf. 6, 319–340 (1976)

    Google Scholar 

  11. Sobel, A.E.K.: Modular Verification of Concurrent Systems, Ph.D. Dissertation, The Ohio State University, August 1986

  12. Soundararajan, N.: Liveness of CSP Programs. Technical Report, Department of Computer and Information Science, The Ohio State University, 1987

  13. Soundararajan, N., Dahl, O.J.: Partial Correctness Semantics for CSP. Technical Report, University of Oslo, February 1982

  14. Zwiers, J., de Roever, W.P., van Emde Boas, P.: Compositionality and Concurrent Networks: Soundness and Completeness of a Proof System. ICALP. Lect. Notes Comput. Sci., Vol. 194, pp. 509–519. Berlin, Heidelberg, New York: Springer 1985

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Thomas J. Watson Research Center, 10598, Yorktown Heights, New York, USA

    A. E. K. Sobel

  2. The Ohio State University, 43210, Columbus, Ohio, USA

    N. Soundararajan

Authors
  1. A. E. K. Sobel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. Soundararajan
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sobel, A.E.K., Soundararajan, N. A proof system for distributed processes. Acta Informatica 25, 305–332 (1988). https://doi.org/10.1007/BF00283331

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation