169 search results - page 31 / 34 » Which Languages Have 4-Round Zero-Knowledge Proofs |
EMSOFT
2007
Springer
14 years 1 months ago
2007
Springer
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...
ECOOP
2008
Springer
13 years 9 months ago
2008
Springer
Verification of object-oriented programs relies on object invariants which express consistency criteria of objects. The semantics of object invariants is subtle, mainly because of...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
EACL
1993
ACL Anthology
13 years 8 months ago
1993
ACL Anthology
This paper solves some puzzles in the formalisation of logic for discontinuity in categorial grammar. A ‘tuple’ operation introduced in [Solias, 1992] is defined as a mode of...
IJCAI
1993
13 years 8 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...