K. S. Namjoshi and R. J. Trefler. On the completeness of compositional reasoning. In E. A. Emerson and A. P. Sistla, editors, Proc. Computer-Aided Verification (CAV'00), Chicago, IL, July 2000. LNCS 1855, Springer-Verlag. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Formal Verification of McMillan's Compositional Assume-Guarantee.. - Rushby (2001) (Correct)
....but what exactly does it mean, and is it sound These question can be resolved only by giving a semantics to the symbols and formulas used in the rule. McMillan s presentation of the rule only sketches the argument for its soundness; a more formal treatment is given by Namjoshi and Trefler [NT00], but it is not easy reading and does not convey the basic intuition. Accordingly, we present in the next Chapter a formalization and verification of McMillan s rule using PVS. The development is surprisingly short and simple and should be clear to anyone with knowledge of PVS. The ....
....associated JUDGEMENT, which automatically discharges numerous side conditions during the proof) Although we have proved McMillan s assume guarantee method to be sound, it is known to be incomplete (i.e. there are correct systems that cannot be verified using the rule 1. 1) Namjoshi and Trefler [NT00] present an extended rule that is both sound and complete, and it would be interesting to extend our PVS verification to this rule. Another extension would expand the formal treatment from the two process to the n process case (this is a technical challenge in formal verification, rather than an ....
Kedar S. Namjoshi and Richard J. Trefler. On the completeness of compositional reasoning. In E. A. Emerson and A. P. Sistla, editors, Computer-Aided Verification, CAV '2000, volume 1855 of Lecture Notes in Computer Science, pages 139--153, Chicago, IL, July 2000. Springer-Verlag.
An Overview of Formal Verification for the Time-Triggered.. - Rushby (2002) (6 citations) (Correct)
....rule (4) into the verification framework employed and for this we probably need to embed the semantics of the rule into the specification language concerned. McMillan s presentation of the rule only sketches the argument for its soundness; a more formal treatment is given by Namjoshi and Trefler [40], but it is not easy reading and does not convey the basic intuition. Rushby [56] presents an embedding of LTL in the PVS specification language and formally verifies the soundness of the rule. The specification and proof are surprisingly short and provide a good demonstration of the power and ....
Kedar S. Namjoshi and Richard J. Trefler. On the completeness of compositional reasoning. In Emerson and Sistla [15], pages 139--153. 13
Compositional Reasoning for Asynchronous - Systems Draft Nina Self-citation (Namjoshi Trefler) (Correct)
No context found.
K.S. Namjoshi and R.J. Trefler. On the completeness of compositional reasoning. In CAV, volume 1855 of LNCS. Springer-Verlag, 2000.
Assume-Guarantee Based Compositional Reasoning for.. - Amla, Emerson.. Self-citation (Namjoshi Er) (Correct)
....na ve compositional rules based on this style of reasoning, for instance, P 1 = P 2 j= T holds if P 1 = Q 2 j= T 1 and P 2 = Q 1 j= T 2 , are sound only for safety properties. In this paper, we rst present a new rule for assume guarantee reasoning, which generalizes several earlier rules (cf. [15, 1, 3, 12, 13]) by removing the sources of incompleteness in some of these rules, by using processes, instead of temporal logic formulas, as speci cations, and by allowing more general forms of process de nition and composition. The new rule extends the na ve rule above with a check for soundness. As it deals ....
....reasoning for concurrently active processes has been the subject of much work over the past three decades. Our rst contribution in this paper is the development of a sound and complete rule for reasoning about arbitrary processes, including those with fairness constraints. Earlier work (cf. [15, 1, 3, 12, 13]) either applies only to restricted kinds of processes or temporal logic formulas, or proposes incomplete rules. Our rule extends a simple reasoning rule that is known to be sound for safety properties with an additional soundness check for liveness properties. Thus, in a sense, the rule isolates ....
K.S. Namjoshi and R.J. Tre er. On the completeness of compositional reasoning. In CAV, volume 1855 of LNCS. Springer-Verlag, 2000.
A Strategy for Efficiently Verifying Requirements.. - Jeffords, Heitmeyer (2003) (Correct)
No context found.
K. S. Namjoshi and R. J. Trefler. On the completeness of compositional reasoning. In E. A. Emerson and A. P. Sistla, editors, Proc. Computer-Aided Verification (CAV'00), Chicago, IL, July 2000. LNCS 1855, Springer-Verlag.
Modular Certification - Rushby (2002) (Correct)
No context found.
Kedar S. Namjoshi and Richard J. Trefler. On the completeness of compositional reasoning. In E. A. Emerson and A. P. Sistla, editors, Computer-Aided Verification, CAV '2000, volume 1855 of Lecture Notes in Computer Science, pages 139--153, Chicago, IL, July 2000. Springer-Verlag.
Modular Certification - Rushby (2002) (Correct)
No context found.
Kedar S. Namjoshi and Richard J. Trefler. On the completeness of compositional reasoning. In E. A. Emerson and A. P. Sistla, editors, Computer-Aided Verification, CAV '2000, volume 1855 of Lecture Notes in Computer Science, pages 139--153, Chicago, IL, July 2000. Springer-Verlag.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC