2137 search results - page 136 / 428 » Proving Abstract Non-interference |
238
click to vote
ASIAN
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. This paper provides a Hoare-style logic for quantum computation. While the usual Hoare logic helps us to verify classical deterministic programs, our logic supports quant...
126
click to vote
CADE
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We introduce a semantics for classical logic with partial functions. We believe that the semantics is natural. When a formula contains a subterm in which a function is ap...
112
click to vote
CRYPTO
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. A cryptographic primitive is leakage-resilient, if it remains secure even if an adversary can learn a bounded amount of arbitrary information about the computation with e...
117
click to vote
CSL
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
130
click to vote
APLAS
2010
ACM
15 years 3 months ago
2010
ACM
Abstract. The type system of Objective Caml has many unique features, which make ensuring the correctness of its implementation difficult. One of these features is structurally pol...