3228 search results - page 54 / 646 » Computationally Sound Proofs |
121
click to vote
JLP
2006
15 years 3 months ago
2006
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
IH
2001
Springer
15 years 7 months ago
2001
Springer
The goal of zero-knowledge watermark detection is to allow a prover to soundly convince a verifier of the presence of a watermark in certain stego-data without revealing any infor...
135
click to vote
LICS
1999
IEEE
15 years 7 months ago
1999
IEEE
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
131
Voted
JAR
2010
14 years 10 months ago
2010
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
102
click to vote
POPL
2012
ACM
13 years 10 months ago
2012
ACM
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...