Part of the Lecture Notes in Computer Science book series (LNCS, volume 164)
A proof system for partial correctness of dynamic networks of processes
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.
KeywordsProof 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.
Unable to display preview. Download preview PDF.
- [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
- [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
- [MC]Misra, J. and Chandy, K.M. "Proofs of Networks of Processes", IEEE Transactions on Software Engineering, July 1981.Google Scholar
- [SD]Soundararajan, N. and Dahl, O.J. "Partial Correctness Semantics of Communicating Sequential Processes"Google Scholar
© Springer-Verlag Berlin Heidelberg 1984