195 search results - page 7 / 39 » Matrix-based Constructive Theorem Proving |
TIT
2010
13 years 1 months ago
2010
In [12] the authors proved an asymptotic sampling theorem for sparse signals, showing that n random measurements permit to reconstruct an N-vector having k nonzeros provided n >...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for pro...
TLCA
2009
Springer
14 years 1 months ago
2009
Springer
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...
CSFW
2012
IEEE
11 years 9 months ago
2012
IEEE
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
CSFW
2010
IEEE
13 years 10 months ago
2010
IEEE
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...