3228 search results - page 6 / 646 » Computationally Sound Proofs |
LICS
2005
IEEE
14 years 1 months ago
2005
IEEE
The universal Horn theory of relational Kleene algebra with tests (RKAT) is of practical interest, particularly for program semantics. We develop an (infinitary) proof system, ba...
LICS
2010
IEEE
13 years 5 months ago
2010
IEEE
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...
EUROCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...
TCC
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...