2137 search results - page 260 / 428 » Proving Abstract Non-interference |
147
click to vote
PPDP
2007
Springer
15 years 10 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
150
click to vote
ASIACRYPT
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
154
click to vote
EUROCRYPT
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
143
click to vote
FPCA
1989
15 years 8 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
119
Voted
COCO
2009
Springer
15 years 7 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...