Sciweavers

10715 search results - page 9 / 2143
» From Tests to Proofs
Sort
View
SP
2006
IEEE
147views Security Privacy» more  SP 2006»
14 years 1 months ago
A Computationally Sound Mechanized Prover for Security Protocols
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
Bruno Blanchet
SAT
2010
Springer
125views Hardware» more  SAT 2010»
13 years 11 months ago
Two Techniques for Minimizing Resolution Proofs
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
Scott Cotton
SERP
2007
13 years 9 months ago
From Functional Requirements through Test Evaluation Design to Automatic Test Data Patterns Retrieval - a Concept for Testing of
- Functional testing of software dedicated for hybrid embedded systems should start at the early development phase and requires analysis of discrete and continuous signals, where t...
Justyna Zander-Nowicka, Abel Marrero Pérez,...
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 8 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
FM
2003
Springer
109views Formal Methods» more  FM 2003»
14 years 1 months ago
Certifying and Synthesizing Membership Equational Proofs
As the systems we have to specify and verify become larger and more complex, there is a mounting need to combine different tools and decision procedures to accomplish large proof ...
Grigore Rosu, Steven Eker, Patrick Lincoln, Jos&ea...