2137 search results - page 170 / 428 » Proving Abstract Non-interference |
158
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
130
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...
132
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract--We investigate the structure of the polytope underlying the linear programming (LP) decoder introduced by Feldman, Karger, and Wainwright. We first show that for expander...
113
click to vote
JANCL
2008
15 years 3 months ago
2008
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
137
click to vote
JUCS
2006
15 years 3 months ago
2006
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...