1717 search results - page 119 / 344 » A Computable Spectral Theorem |
127
click to vote
CSFW
2005
IEEE
15 years 10 months ago
2005
IEEE
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
140
click to vote
CCS
2008
ACM
15 years 6 months ago
2008
ACM
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
119
click to vote
ISIPTA
2003
IEEE
15 years 9 months ago
2003
IEEE
A generalization of deFinetti’s Fundamental Theorem of Probability facilitates coherent assessment, by iterated natural extension, of imprecise probabilities or expectations, co...
150
click to vote
ICFEM
2005
Springer
15 years 10 months ago
2005
Springer
Many safety-critical systems deal with geometric objects. Reasoning about the correctness of such systems is mandatory and requires the use of basic definitions of geometry for th...
124
click to vote
WADT
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...