3228 search results - page 47 / 646 » Computationally Sound Proofs |
159
click to vote
IGPL
2007
15 years 6 months ago
2007
This work studies the structure of proofs containing non-analytic cuts in the cut-based system, a sequent inference system in which the cut rule is not eliminable and the only bra...
138
Voted
AAECC
2002
Springer
15 years 6 months ago
2002
Springer
A fruitful interaction between a new randomized WZ procedure and other computer algebra programs is illustrated by the computer proof of a series evaluation that originates from a ...
190
click to vote
EUROCRYPT
2008
Springer
15 years 8 months ago
2008
Springer
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
174
click to vote
CAV
1993
Springer
15 years 10 months ago
1993
Springer
Abstract. This paper presents a scalable approach to reasoning formally about distributed algorithms. It uses results about I O automata to extract a set of proof obligations for s...
173
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...