论文信息 - Formal Verification of McMillan's Compositional Assume-Guarantee Rule

Formal Verification of McMillan's Compositional Assume-Guarantee Rule

To illustrate some of the power and convenience of its specifi cat on language and theorem prover, we use the PVS formal verification system to veri fy the soundness of a proof rule for assume-guarantee reasoning due to Ken McMillan.

John Rushby

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

[2] Günter Grünsteidl,et al. TTP - A Protocol for Fault-Tolerant Real-Time Systems , 1994, Computer.

[3] Cliff B. Jones,et al. Tentative steps toward a development method for interfering programs , 1983, TOPL.

[4] L. McMillanmcmillan. Circular Compositional Reasoning about Liveness , 1999 .

[5] Kedar S. Namjoshi,et al. On the completeness of compositional reasoning , 2000 .

[6] Kenneth L. McMillan,et al. Circular Compositional Reasoning about Liveness , 1999, CHARME.

[7] Kedar S. Namjoshi,et al. On the Competeness of Compositional Reasoning , 2000, CAV.