325 search results - page 11 / 65 » Proofs of Restricted Shuffles |
LOPSTR
2004
Springer
14 years 3 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
CADE
2005
Springer
14 years 10 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
WISTP
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. In this paper we report on the performance of the RSA variants of Brands protocols for zero-knowledge proof and restrictive blinded issuing [1]. The performance is relati...
FOCS
1999
IEEE
14 years 2 months ago
1999
IEEE
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
CADE
2008
Springer
14 years 10 months ago
2008
Springer
We describe a framework with which first order theorem provers can be used for checking formal proofs. The main aim of the framework is to take as much advantage as possible from t...