10715 search results - page 85 / 2143 » Proofs from Tests |
135
Voted
FOCS
1998
IEEE
15 years 7 months ago
1998
IEEE
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...
173
Voted
ICFP
2006
ACM
16 years 3 months ago
2006
ACM
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
138
Voted
CSFW
2005
IEEE
15 years 9 months ago
2005
IEEE
We present the first cryptographically sound Dolev-Yaostyle security proof of a comprehensive electronic payment system. The payment system is a slightly simplified variant of t...
132
click to vote
CTRSA
2001
Springer
15 years 7 months ago
2001
Springer
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
139
Voted
CSFW
2010
IEEE
15 years 6 months ago
2010
IEEE
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...