Lee Pike, Paul Miner, and Wilfredo Torres-Pomales  Home/Search
Context Related
| indiana.edu/~lepike/pub...counterex.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: indiana.edu/~lepike/pubs/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Interactive mechanical theorem proving can provide high assurance of correct design, but it can also be a slow iterative process. Much time is spent determining why a proof of a conjecture is not forthcoming. In some cases, the conjecture is false and in others, the attempted proof is insu#cient. In this case study, we use the SAL family of model checkers to generate a concrete counterexample to an unproven conjecture specified in the mechanical theorem prover, PVS. The focus of our case study... (Update)
Cited by: More
Formal Verification of Time-Triggered Systems - Pike (2006) (Correct)
The Formal Verification of a Reintegration Protocol - Pike, Johnson (2005) (Correct)
Active bibliography (related documents): More All
0.8: A Unified Fault-Tolerance Protocol - Miner, Geser, Pike, Maddalon (2004) (Correct)
0.5: Quantifying the Reliability of Proven - Spider Group Membership (Correct)
0.5: An Approach To Combining B and Alloy - Leonid Mikhailov And (2002) (Correct)
Similar documents based on text:
4.0: Unknown - (Correct)
Related documents from co-citation: More All
2: Bus architectures for safety-critical embedded systems - Rushby
2: Verification Diagrams Revisited: Disjunctive Invariants for Easy Verification - Rushby - 2000
2: Real time is really simple (context) - Lamport - 2005
BibTeX entry: (Update)
L. Pike, P. Miner, and W. Torres. Model checking failed conjectures in theorem proving: a case study. Technical Report NASA/TM--2004. http://citeseer.ist.psu.edu/pike04model.html More
@misc{ pike04model,
author = "L. Pike and P. Miner and W. Torres",
title = "Model checking failed conjectures in theorem proving: a case study",
text = "L. Pike, P. Miner, and W. Torres. Model checking failed conjectures in
theorem proving: a case study. Technical Report NASA/TM--2004.",
year = "2004",
url = "citeseer.ist.psu.edu/pike04model.html" }
Citations (may not include all citations):718 Distributed Algorithms (context) - Lynch - 1996
625 ACM Transactions on Programming Languages and Systems (context) - Shostak, The et al. - 1982
270 Formal Verification for FaultTolerant Architectures: Prolego.. - Owre, Rusby et al. - 1995
256 Reaching Agreement in the Presence of Faults (context) - Pease, Shostak et al. - 1980
55 Interactive Consistency With Multiple Failure Modes (context) - Thambidurai, Park - 1988
43 Validation of ultrahigh dependability for software-based sys.. (context) - Littlewood, Strigini - 1993
38 Fault Injection Techniques and Tools - Hsueh, Tsai et al. - 1997
20 Systematic Formal Verification for Fault-Tolerant Time-Trigg.. - Rushby - 1999
15 Formal Verification of an Interactive Consistency Algorithm .. - Lincoln, Rushby - 1994
14 The proof of correctness of a fault-tolerant circuit design - Bevier, Young - 1991
12 Comparing Verification Systems: Interactive Consistency in A.. - Young - 1997
12 Bus Architectures For Safety-Critical Embedded Systems - Rushby - 2001
10 The SURE Approach to Reliability Analysis (context) - Butler - 1992
8 Conceptual Design of a Reliable Optical Bus (context) - Miner, Malekpour et al. - 2002
7 IEEE Transactions on Computers (context) - Davies, Wakerly - 1978
6 SRI International (context) - Science, Formal et al. - 2003
5 A New On-Line Diagnosis Protocol for the SPIDER Family of By.. (context) - Miner, Geser - 2003
5 A Formal Correctness Proof of the SPIDER Diagnosis Protocol (context) - Geser, Miner - 2002
4 Kluwer Academic Publishers (context) - Koptez - 1997
3 Abstractions for Fault-Tolerant Distributed System Verificat.. - Pike, Maddalon et al. - 2004
3 Available at http: //shemesh (context) - Methods, SPIDER et al. - 2004
3 Finding Counterexamples to Inductive Conjectures and Discove.. - Steel, Bundy et al. - 2002
3 Available at http: //shemesh (context) - Methods, PVS et al. - 2004
2 SAL Tutorial: Analyzing the Fault-Tolerant Algorithm OM (context) - Rushby - 2004
2 Experiements in Theorem Proving and Model Checking for Proto.. (context) - Havelund, Shankar - 1996
2 Proof and Refutation in Formal Software Development - Bicarregui, Matthews - 1999
1 Springer-Verlag Heidelberg (context) - Driscoll, Hall et al. - 2003
1 Modeling and Analysis of Timed and Fault-Tolerant Systems (context) - Miner, Geser et al. - 2004
1 Available httpsal (context) - Symbolic, SAL et al. - 2004
1 Workshop on Disproving: NonTheorems (context) - Ahrendt, Baumgartner et al. - 2004
Documents on the same site (http://www.cs.indiana.edu/~lepike/pubs/): More
Logics for Classes of Boolean Monoids - Allwein, Demir, Pike (2004) (Correct)
Nasa/tm-2005-213751 - Real-Time System Verification (1982) (Correct)
Abstractions for Fault-Tolerant Distributed System.. - Pike, Maddalon, Miner.. (2004) (Correct)
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