169 search results - page 10 / 34 » Which Languages Have 4-Round Zero-Knowledge Proofs |
140
click to vote
EKAW
1994
Springer
15 years 8 months ago
1994
Springer
Formal knowledge modelling languages have a number of advantages over informal languages, such as their precise meaning and the possibility to derive propertiesthrough formal proof...
175
click to vote
ITP
2010
15 years 6 months ago
2010
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
132
click to vote
ICLP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
196
click to vote
CAV
1998
Springer
15 years 8 months ago
1998
Springer
As a pedagogical exercise in ACL2, we formalize and prove the correctness of a write invalidate cache scheme. In our formalization, an arbitrary number of processors, each with its...
120
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...