Sciweavers

7049 search results - page 1313 / 1410
» Data Abstraction for CSP-OZ
Sort
View
ESORICS
2009
Springer
15 years 10 months ago
Reliable Evidence: Auditability by Typing
Abstract. Many protocols rely on audit trails to allow an impartial judge to verify a posteriori some property of a protocol run. However, in current practice the choice of what da...
Nataliya Guts, Cédric Fournet, Francesco Za...
CADE
2009
Springer
15 years 10 months ago
A Generalization of Semenov's Theorem to Automata over Real Numbers
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
Bernard Boigelot, Jérôme Leroux, Juli...
CAV
2009
Springer
136views Hardware» more  CAV 2009»
15 years 10 months ago
Intra-module Inference
Abstract. Contract-based property checkers hold the potential for precise, scalable, and incremental reasoning. However, it is difficult to apply such checkers to large program mod...
Shuvendu K. Lahiri, Shaz Qadeer, Juan P. Galeotti,...
CAV
2009
Springer
215views Hardware» more  CAV 2009»
15 years 10 months ago
Homer: A Higher-Order Observational Equivalence Model checkER
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
David Hopkins, C.-H. Luke Ong
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
15 years 10 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
« Prev « First page 1313 / 1410 Last » Next »