Sciweavers

171 search results - page 6 / 35
» CoSP: a general framework for computational soundness proofs
Sort
View
104
Voted
EUROCRYPT
2008
Springer
15 years 1 months ago
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
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...
Nishanth Chandran, Vipul Goyal, Amit Sahai
JALC
2002
97views more  JALC 2002»
14 years 11 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
APLAS
2010
ACM
14 years 9 months ago
Metric Spaces and Termination Analyses
We present a framework for defining abstract interpreters for liveness properties, in particular program termination. The framework makes use of the theory of metric spaces to defi...
Aziem Chawdhary, Hongseok Yang
ICFP
2010
ACM
15 years 20 days ago
VeriML: typed computation of logical terms inside a language with effects
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
Antonis Stampoulis, Zhong Shao
123
Voted
COMMA
2010
14 years 6 months ago
Dialectical Proofs for Constrained Argumentation
Abstract. Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of...
Caroline Devred, Sylvie Doutre, Claire Lefè...