Ne Win T, Ernst MD (2002) Verifying distributed algorithms via dynamic analysis and theorem proving. Technical Report 841, Massachusetts Institute of Technology, Laboratory for Computer Science, Cambridge, MA, 25 May 2002 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Automatic Generation and Checking of Program Specifications - Nimmer (2001) (2 citations) (Correct)
....verifiable with the help of a static checker, guaranteeing the absence of certain errors and adding confidence to future maintenance tasks. In addition to the results contained in this work, generated specifications have been shown to be useful for program refactoring [KEGN01] theorem proving [NWE02] test suite generation [Har02] and anomaly and bug detection [ECGN01, Dod02] In many of these tasks, the accuracy of the generated specification (the degree to which it matches the code) affects the effort involved in performing the task. One of the contributions of this work is that our ....
....first order logic. Daikon proposes goals, lemmas, and intermediate assertions for the theorem prover. Representation invariants can assist in proofs of properties that hold in all reachable states or representations, but not in all possible states or representations. In preliminary experiments [NWE02] users found Daikon of substantial help in proving Peterson s 2 process mutual exclusion algorithm (leading to a new proof that would not have otherwise been obtained) a cache coherence protocol, and Lamport s Paxos algorithm. Generated specifications also suggest program refactorings ....
Toh Ne Win and Michael Ernst. Verifying distributed algorithms via dynamic analysis and theorem proving. Technical Report 841, MIT Lab for Computer Science, May 25, 2002.
An overview of JML tools and applications - Burdy, Cheon, Cok, Ernst.. (2004) (16 citations) Self-citation (Ernst) (Correct)
No context found.
Ne Win T, Ernst MD (2002) Verifying distributed algorithms via dynamic analysis and theorem proving. Technical Report 841, Massachusetts Institute of Technology, Laboratory for Computer Science, Cambridge, MA, 25 May 2002
Automatic Generation of Program Specifications - Nimmer, Ernst (2002) (4 citations) Self-citation (Ernst) (Correct)
No context found.
Toh Ne Win and Michael Ernst. Verifying distributed algorithms via dynamic analysis and theorem proving. Technical Report 841, MIT Lab for Computer Science, May 25, 2002.
Efficient Incremental Algorithms for Dynamic Detection of.. - Perkins, Ernst (2004) (2 citations) Self-citation (Ernst) (Correct)
No context found.
T. Ne Win and M. D. Ernst. Verifying distributed algorithms via dynamic analysis and theorem proving. Technical Report 841, MIT Lab for Computer Science, May 25, 2002.
An Overview of JML Tools and Applications - Burdy, Cheon, Cok, Ernst.. (2003) (16 citations) Self-citation (Ernst) (Correct)
No context found.
Toh Ne Win and Michael D. Ernst. Verifying distributed algorithms via dynamic analysis and theorem proving. Technical Report 841, Massachusetts Institute of Technology, Laboratory for Computer Science, Cambridge, MA, May 25, 2002.
Automatic Generation of Program Specifications - Nimmer, Ernst (2002) (4 citations) Self-citation (Ernst) (Correct)
No context found.
Toh Ne Win and Michael Ernst. Verifying distributed algorithms via dynamic analysis and theorem proving. Technical Report 841, MIT Lab for Computer Science, May 25, 2002.
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