Sciweavers

923 search results - page 7 / 185
» Proving the value of formal methods
Sort
View
84
Voted
JSYML
2000
103views more  JSYML 2000»
14 years 9 months ago
A Model Complete Theory of Valued D-Fields
The notion of a D-ring, generalizing that of a differential or a difference ring, is introduced. Quantifier elimination and a version of the AxKochen-Ershov principle is proven for...
Thomas Scanlon
86
Voted
FORMATS
2004
Springer
15 years 1 months ago
A Unified Fault-Tolerance Protocol
Davies and Wakerly show that Byzantine fault tolerance can be achieved by a cascade of broadcasts and middle value select functions. We present an extension of the Davies and Waker...
Paul S. Miner, Alfons Geser, Lee Pike, Jeffrey Mad...
IPPS
2008
IEEE
15 years 3 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
CAV
2003
Springer
107views Hardware» more  CAV 2003»
15 years 2 months ago
Theorem Proving Using Lazy Proof Explication
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...
Cormac Flanagan, Rajeev Joshi, Xinming Ou, James B...
CAV
2004
Springer
128views Hardware» more  CAV 2004»
15 years 2 months ago
Proving More Properties with Bounded Model Checking
Bounded Model Checking, although complete in theory, has been thus far limited in practice to falsification of properties that were not invariants. In this paper we propose a term...
Mohammad Awedh, Fabio Somenzi