Sciweavers

793 search results - page 121 / 159
» Argumentation and standards of proof
Sort
View
LFCS
2007
Springer
14 years 5 months ago
Cut Elimination in Deduction Modulo by Abstract Completion
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
Guillaume Burel, Claude Kirchner
LPAR
2004
Springer
14 years 4 months ago
Abstraction-Carrying Code
ion-Carrying Code Elvira Albert1 , Germ´an Puebla2 , and Manuel Hermenegildo2,3 1 DSIP, Universidad Complutense Madrid 2 Facultad de Inform´atica, Technical University of Madrid ...
Elvira Albert, Germán Puebla, Manuel V. Her...
PLDI
2003
ACM
14 years 4 months ago
A provably sound TAL for back-end optimization
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang
CRYPTO
2001
Springer
113views Cryptology» more  CRYPTO 2001»
14 years 3 months ago
OAEP Reconsidered
The OAEP encryption scheme was introduced by Bellare and Rogaway at Eurocrypt ’94. It converts any trapdoor permutation scheme into a public-key encryption scheme. OAEP is widel...
Victor Shoup
EUROCRYPT
2007
Springer
14 years 2 months ago
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
Yehuda Lindell, Benny Pinkas