3228 search results - page 19 / 646 » Computationally Sound Proofs |
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
ABSTRACT. In many automated methods for proving inductive theorems, finding a suitable generalization of a conjecture is a key for the success of proof attempts. On the other hand...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
ionally Sound Abstraction and Verification of Secure Multi-Party Computations Michael Backes Saarland University MPI-SWS Matteo Maffei Saarland University Esfandiar Mohammadi Saarl...
JFPLC
2000
13 years 8 months ago
2000
ABSTRACT. This paper focuses on the assignment of meaning to some nonterminating SLD derivations in logic programming. Several approaches have been developped by considering infini...
CRYPTO
2001
Springer
14 years 3 hour ago
2001
Springer
The public-key model for interactive proofs has proved to be quite effective in improving protocol efficiency [CGGM00]. We argue, however, that its soundness notion is more subtle...
FLOPS
2006
Springer
13 years 11 months ago
2006
Springer
Pocklington certificates are known to provide short proofs of primality. We show how to perform this in the framework of formal, mechanically checked, proofs. We present an encodin...