Using message passing for distributed programming: proof rules and disciplines
暂无分享,去创建一个
[1] K. Mani Chandy,et al. Proofs of Networks of Processes , 1981, IEEE Transactions on Software Engineering.
[2] Leslie Lamport,et al. The ``Hoare Logic'' of CSP, and All That , 1984, TOPL.
[3] Neelam Soundararajan,et al. Axiomatic semantics of communicating sequential processes , 1984, ACM Trans. Program. Lang. Syst..
[4] Per Brinch Hansen,et al. Distributed processes: a concurrent programming concept , 1978, CACM.
[5] J. D. Ichbiah,et al. Preliminary Ada reference manual , 1979, SIGP.
[6] K. Mani Chandy,et al. Proving safety and liveness of communicating processes with examples , 1982, PODC '82.
[7] Willem P. de Roever,et al. A Proof System for Concurrent ADA Programs , 1984, Sci. Comput. Program..
[8] Willem P. de Roever,et al. A Proof System for Communicating Sequential Processes , 1980, ACM Trans. Program. Lang. Syst..
[9] I. Mearns,et al. Axioms and proof rules for Ada tasks , 1982 .
[10] Marly Roncken,et al. Procedures and concurrency: A study in proof , 1982, Symposium on Programming.
[11] Donald I. Good,et al. Principles of proving concurrent programs in Gypsy , 1979, POPL '79.
[12] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.
[13] Patrick Cousot,et al. Semantic Analysis of Communicating Sequential Processes (Shortened Version) , 1980, ICALP.
[14] Rob Gerth. A Sound and Complete Hoare Axiomatization of the Ada-Rendevous , 1982, ICALP.
[15] Nissim Francez,et al. Extended naming conventions for communicating processes , 1982, POPL '82.
[16] C. A. R. Hoare. A Calculus of Total Correctness for Communicating Processes , 1981, Sci. Comput. Program..
[17] Nissim Francez. Extended Naming Conventions for Communicating Processes , 1983, Sci. Comput. Program..