论文信息 - The Incompleteness of Misra and Chandy's Proof Systems - 字舞流文

The Incompleteness of Misra and Chandy's Proof Systems

In this paper we show that Misra and Chandy''s proof systems for networks of communicating processes ([1, 2]) are incomplete.

[1] K. Mani Chandy,et al. Proofs of Networks of Processes , 1981, IEEE Transactions on Software Engineering.

[2] Stephen D. Brookes,et al. A Semantics and Proof System for Communicating Processes , 1983, Logic of Programs.

[3] Van Nguyen,et al. A model and temporal proof system for networks of processes , 1985, POPL '85.

[4] K. Mani Chandy,et al. Proving safety and liveness of communicating processes with examples , 1982, PODC '82.