10715 search results - page 260 / 2143 » Proofs from Tests |
175
click to vote
GI
2009
Springer
15 years 11 months ago
2009
Springer
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
196
Voted
CSL
2001
Springer
15 years 11 months ago
2001
Springer
Hyper tableau reasoning is a version of clausal form tableau reasoning where all negative literals in a clause are resolved away in a single inference step. Constrained hyper table...
163
click to vote
ASIACRYPT
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Naor and Pinkas introduced metering schemes at Eurocrypt ’98 in order to decide on advertisement fees for web servers. In the schemes, any server should be able to cons...
175
Voted
CADE
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
172
click to vote
AAAI
2010
15 years 8 months ago
2010
Modern complete SAT solvers almost uniformly implement variations of the clause learning framework introduced by Grasp and Chaff. The success of these solvers has been theoretical...