Misra & Chandy: Proofs of process networks

Proof Methods For Message-Based Parallelism
Part of the Lecture Notes in Computer Science book series (LNCS, volume 191)


Inference Rule Component Process Message Transmission Internal Specification Proof 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.

Unable to display preview. Download preview PDF.

3.4.1 References

  1. [MC81]
    Misra, J. and Chandy, K.M. Proofs of networks of processes, IEEE TOSE Vol. SE-7, No. 4, July 1981.Google Scholar
  2. [CM79]
    Chandy, K.M. and Misra, J. An axiomatic proof technique for networks of communicating processes Technical Report TR-98, Dept. of Computer Science, University of Texas at Austin, 1979.Google Scholar
  3. [MCS82]
    Misra, J., Chandy, K.M. and Smith, T. Proving Safety and Liveness of Communicating Processes with Examples, Proc. of the ACM Symposium on Principles of Distributed Computing, Ottawa, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Personalised recommendations