R. Bharadwaj, A. Felty and F. Stomp, Formalizing INductive Proofs of Net- work Algorithms, Proceedings of the 1st Asian Computer Science Conference,  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Checking Verifications of Protocols and Distributed Systems .. - Groote, Monin, Pol (1998) (8 citations) (Correct)
.... for arbitrary values of m in [49] In [63] the correctness of the alternating bit protocol was proved with Isabelle and the bounded retransmission protocol, previously checked in [39, 36] was proved with PVS in [38] Also using Coq and a model checker, a broadcasting protocol has been verified in [10]. A THE SET OF REWRITE RULES (APPENDIX TO SECTION 4) 20 A The set of rewrite rules (appendix to Section 4) We present the set of rewrite rules in four parts. First the rules for ACP and standard concurrency are presented. Then the extensions with the sum operator, the star operator and the ....
R. Bharadwaj, A. Felty and F. Stomp. Formalizing inductive proofs of network algorithms. In Proceedings of the 1995 Asian Computing Science Conference, 1995.
A Correctness Proof of a Cache Coherence Protocol - Felty, Stomp (1996) (2 citations) Self-citation (Felty Stomp) (Correct)
....appoaches, our assumptions may refer to global properties. We believe that our approach is worth further research, since it allows more transparent formulations of properties and structuring their proofs. This may have an impact on reducing complexity of automated proofs. In previous work [2], with Ramesh Bharadwaj, we have investigated how to combine model checking and theorem proving to verify a broadcasting protocol. The work reported in the current paper serves as a foundation for a case study to push the limits of formal verification by means of tools to really large programs. In ....
R. Bharadwaj, A. Felty, and F. Stomp. Formalizing inductive proofs of network algorithms. In Proceedings of the 1995 Asian Computing Science Conference, Dec. 1995.
A Correctness Proof of a Cache Coherence Protocol - Felty, Stomp (1996) (2 citations) Self-citation (Felty Stomp) (Correct)
....proofs. With Doug Howe we are currently mechanizing the correctness proof reported on in the current paper. This is an ongoing project, and at present we have reached Lemma 5.13. Results about our mechanization, employing the theorem prover Nuprl [7] can be found in [8] In previous work [2], with Ramesh Bharadwaj, we have investigated how to combine model checking and theorem proving to verify a broadcasting protocol. The work reported in the current paper serves as a foundation for a case study to push the limits of formal verification by means of tools to really large programs, in ....
Ramesh Bharadwaj, Amy Felty, and Frank Stomp. Formalizing inductive proofs of network algorithms. In Proceedings of the 1995 Asian Computing Science Conference (Lecture Notes in Computer Science 1023), December 1995.
Data Independent Induction: CSP Model Checking of Arbitrary Sized .. - Creese (2001) (1 citation) (Correct)
No context found.
R. Bharadwaj, A. Felty and F. Stomp, Formalizing INductive Proofs of Net- work Algorithms, Proceedings of the 1st Asian Computer Science Conference,
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