1274 search results - page 142 / 255 » New Proofs for |
81
Voted
CP
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
141
Voted
CSFW
2008
IEEE
15 years 2 months ago
2008
IEEE
We present a general technique for modeling remote electronic voting protocols in the applied pi-calculus and for automatically verifying their security. In the first part of this...
FM
2008
Springer
15 years 2 months ago
2008
Springer
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
106
click to vote
FM
2008
Springer
15 years 2 months ago
2008
Springer
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
101
Voted
ICISC
2007
15 years 2 months ago
2007
Query-response based protocols between a client and a server such as SSL, TLS, SSH are asymmetric in the sense that the querying client and the responding server play different ro...