Sciweavers

119 search results - page 13 / 24
» Assertion Application in Theorem Proving and Proof Planning
Sort
View
APAL
2004
105views more  APAL 2004»
13 years 8 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek
CSFW
2010
IEEE
14 years 15 days ago
A Machine-Checked Formalization of Sigma-Protocols
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
Gilles Barthe, Daniel Hedin, Santiago Zanella B&ea...
RTA
2005
Springer
14 years 2 months ago
The Algebra of Equality Proofs
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
Aaron Stump, Li-Yang Tan
ECCC
2006
134views more  ECCC 2006»
13 years 8 months ago
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
Avi Wigderson, David Xiao
EUC
2005
Springer
14 years 2 months ago
Dependable Polygon-Processing Algorithms for Safety-Critical Embedded Systems
Algorithms that process geometric objects become more and more important for many safety-critical embedded systems, e.g. for motion planning or collision detection, where correctne...
Jens Brandt, Klaus Schneider