169 search results - page 33 / 34 » Which Languages Have 4-Round Zero-Knowledge Proofs |
155
click to vote
TLCA
2009
Springer
15 years 11 months ago
2009
Springer
Taha and Nielsen have developed a multi-stage calculus λα with a sound type system using the notion of environment classifiers. They are special identifiers, with which code fr...
120
click to vote
ESOP
2001
Springer
15 years 9 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
143
click to vote
ESOP
2001
Springer
15 years 9 months ago
2001
Springer
We check statically whether it is safe for untrusted foreign machine code to be loaded into a trusted host system. (Here “safety” means that the program abides by a memory-acc...
139
click to vote
TPHOL
2007
IEEE
15 years 10 months ago
2007
IEEE
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
155
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...