Sciweavers

566 search results - page 47 / 114
» Array Abstractions from Proofs
Sort
View
ACTA
2010
87views more  ACTA 2010»
13 years 7 months ago
On the observational theory of the CPS-calculus
We study the observational theory of Thielecke's CPS-calculus, a distillation of the target language of Continuation-Passing Style transforms. We define a labelled transition...
Massimo Merro
ESOP
2007
Springer
14 years 1 months ago
A Complete Guide to the Future
Abstract We present the semantics and proof system for an objectoriented language with active objects, asynchronous method calls, and futures. The language, based on Creol, disting...
Frank S. de Boer, Dave Clarke, Einar Broch Johnsen
CRYPTO
2005
Springer
72views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Unconditional Characterizations of Non-interactive Zero-Knowledge
Abstract. Non-interactive zero-knowledge (NIZK) proofs have been investigated in two models: the Public Parameter model and the Secret Parameter model. In the former, a public stri...
Rafael Pass, Abhi Shelat
ICNP
2002
IEEE
14 years 19 days ago
A Lightweight, Robust P2P System to Handle Flash Crowds
Abstract— Internet flash crowds (a.k.a. hot spots) are a phenomenon that result from a sudden, unpredicted increase in an on-line object’s popularity. Currently, there is no e...
Angelos Stavrou, Dan Rubenstein, Sambit Sahu
RTA
2010
Springer
13 years 11 months ago
Certified Subterm Criterion and Certified Usable Rules
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
Christian Sternagel, René Thiemann