A Proof System for Communicating Sequential Processes

@article{Apt1980APS,
  title={A Proof System for Communicating Sequential Processes},
  author={K. Apt and N. Francez and W. Roever},
  journal={ACM Trans. Program. Lang. Syst.},
  year={1980},
  volume={2},
  pages={359-385}
}
  • K. Apt, N. Francez, W. Roever
  • Published 1980
  • Computer Science
  • ACM Trans. Program. Lang. Syst.
  • An axiomatic proof system is presented for proving partial correctness and absence of deadlock (and failure) of communicating sequential processes. The key (meta) rule introduces cooperation between proofs, a new concept needed to deal with proofs about synchronization by message passing. CSP's new convention for distributed termination of loops is dealt with. Applications of the method involve correctness proofs for two algorithms, one for distributed partitioning of sets, the other for… CONTINUE READING
    362 Citations
    A proof technique for communicating sequential processes
    • 53
    • Highly Influenced
    Proof Rules for Communication Abstractions (Abstract)
    • PDF
    A Proof System for Distributed Processes
    • 5
    A proof system for distributed processes
    Design and Proof of Communicating Sequential Processes
    • 5
    Partial Correctness of Distributed Programs
    An axiomatic semantics for nested concurrency
    • S. Meldal
    • Computer Science
    • BIT Comput. Sci. Sect.
    • 1986
    • 8

    References

    SHOWING 1-2 OF 2 REFERENCES
    A Correctness Proof for Communicating Processes: A Small Exercise
    • 18
    • Highly Influential
    A complete set of assertions on distributed systems
    • Inst. of Computer Science, Polish Academy of Science,
    • 1979