3228 search results - page 270 / 646 » Computationally Sound Proofs |
151
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
124
Voted
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
d abstract) Nathan Segerlind∗ Sam Buss† Russell Impagliazzo‡ We prove a new switching lemma that works for restrictions that set only a small fraction of the variables and i...
139
click to vote
TPHOL
2002
IEEE
15 years 9 months ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
159
click to vote
CSR
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
157
Voted
CONCUR
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and concurrent composition, related by an inequational form of the exchange la...