641 search results - page 56 / 129 » Formal Reliability Analysis Using Theorem Proving |
170
click to vote
ENTCS
2006
15 years 6 months ago
2006
We report on an experiment in combining Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study...
141
click to vote
FMCAD
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We present a simple method for verifying the safety properties of cache coherence protocols with arbitrarily many nodes. Our presentation begins with two examples. The fi...
143
click to vote
CSEE
2000
Springer
15 years 10 months ago
2000
Springer
Accurate and complete requirements specifications are crucial for the design and implementation of high-quality software. Unfortunately, the articulation and verification of softw...
177
click to vote
SIAMCOMP
1998
15 years 5 months ago
1998
Abstract. String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has had a rather sparse set of techniques. This paper presents a new a...
170
click to vote
SAS
1997
Springer
15 years 10 months ago
1997
Springer
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...