17 search results - page 3 / 4 » Faulty Logic: Reasoning about Fault Tolerant Programs |
KR
1998
Springer
13 years 9 months ago
1998
Springer
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
DSVIS
2005
Springer
13 years 10 months ago
2005
Springer
The calculus outlined in this paper provides a formal architectural framework for describing and reasoning about the properties of multi-user and mobile distributed interactive sys...
ISSTA
2010
ACM
13 years 8 months ago
2010
ACM
In program debugging, finding a failing run is only the first step; what about correcting the fault? Can we automate the second task as well as the first? The AutoFix-E tool au...
ISCA
2002
IEEE
13 years 9 months ago
2002
IEEE
We propose a scheme for transient-fault recovery called Simultaneously and Redundantly Threaded processors with Recovery (SRTR) that enhances a previously proposed scheme for tran...
ICFP
2009
ACM
14 years 5 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...