641 search results - page 35 / 129 » Formal Reliability Analysis Using Theorem Proving |
111
click to vote
ATVA
2007
Springer
15 years 6 months ago
2007
Springer
One of the prerequisites for information society is secure and reliable communication among computing systems. Accordingly, network security appliances become key components of inf...
135
click to vote
ICECCS
2009
IEEE
15 years 9 months ago
2009
IEEE
Distributed information systems are critical to the functioning of many businesses; designing them to be dependable is a challenging but important task. We report our experience i...
119
click to vote
TAPSOFT
1997
Springer
15 years 6 months ago
1997
Springer
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
161
Voted
POPL
2011
ACM
14 years 5 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
104
Voted
DAC
2003
ACM
16 years 3 months ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...