A Proof System for Communicating Sequential Processes-Reference-Cited by-同舟云学术

A Proof System for Communicating Sequential Processes

Published:1980-07 Issue:3 Volume:2 Page:359-385
ISSN:0164-0925
Container-title:ACM Transactions on Programming Languages and Systems
language:en
Short-container-title:ACM Trans. Program. Lang. Syst.

Author:

Apt Krzysztof R.¹,Francez Nissim²,de Roever Willem P.²

Affiliation:

1. Faculty of Economics, University of Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands

2. Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel and Department of Computer Science, University of Utrecht, P.O. Box 80.002, 3508 TA Utrecht, The Netherlands

Abstract

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 distributed computation of the greatest common divisor of n numbers.

Publisher

Association for Computing Machinery (ACM)

Subject

Software

Link

https://dl.acm.org/doi/pdf/10.1145/357103.357110

Reference16 articles.

1. APT K.R. Recursive assertions and parallel programs. Submitted for publication. APT K.R. Recursive assertions and parallel programs. Submitted for publication.

2. APT K.R. DE ROEVER W.P. AND FRANCEZ N. Weakest precondition semantics for communicaring processes. To appear. APT K.R. DE ROEVER W.P. AND FRANCEZ N. Weakest precondition semantics for communicaring processes. To appear.

3. Proving assertions about parallel programs;ASHCRO~;J. Comput. Syst. Sci.,1975

4. Distributed Termination

Cited by 228 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Towards Exogenous Coordination of Concurrent Cloud Applications;International Journal of Software Engineering and Knowledge Engineering;2023-10-05

2. A proof system of the CaIT calculus;Frontiers of Computer Science;2023-09-11

3. Reasoning About Choreographic Programs;Lecture Notes in Computer Science;2023

4. Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs;Automated Deduction – CADE 29;2023

5. Approximate verification of concurrent systems using token structures and invariants;International Journal on Software Tools for Technology Transfer;2022-04-07