Sciweavers

2517 search results - page 73 / 504
» Specifying Weak Sets
Sort
View
ACTA
2006
108views more  ACTA 2006»
14 years 12 months ago
Refinement verification of the lazy caching algorithm
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
Wim H. Hesselink
PROVSEC
2010
Springer
14 years 9 months ago
Distinguishing Distributions Using Chernoff Information
Abstract. In this paper, we study the soundness amplification by repetition of cryptographic protocols. As a tool, we use the Chernoff Information. We specify the number of attempt...
Thomas Baignères, Pouyan Sepehrdad, Serge V...
VISUALIZATION
1998
IEEE
15 years 4 months ago
Interpolation of triangle hierarchies
We consider interpolation between keyframe hierarchies. We impose a set of weak constraints that allows smooth interpolation between two keyframe hierarchies in an animation or, m...
Axel Friedrich, Konrad Polthier, Markus Schmies
ICFP
2005
ACM
15 years 12 months ago
Translating specifications from nominal logic to CIC with the theory of contexts
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
Marino Miculan, Ivan Scagnetto, Furio Honsell
ECOOP
2004
Springer
15 years 5 months ago
Ownership Domains: Separating Aliasing Policy from Mechanism
Ownership types promise to provide a practical mechanism for enforcing stronger encapsulation by controlling aliasing in objectoriented languages. However, previous ownership type ...
Jonathan Aldrich, Craig Chambers