Sciweavers

1076 search results - page 82 / 216
» Operations on proofs and labels
Sort
View
CAV
2006
Springer
141views Hardware» more  CAV 2006»
14 years 21 days ago
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
We describe a formal verification of a recent concurrent list-based set algorithm due to Heller et al. The algorithm is optimistic: the add and remove operations traverse the list ...
Robert Colvin, Lindsay Groves, Victor Luchangco, M...
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 9 months ago
How to prevent type-flaw attacks on security protocols under algebraic properties
In this paper, we prove that type-tagging prevents type-flaw attacks on security protocols that use the Exclusive-OR operator as our main contribution. Our proof method is general ...
Sreekanth Malladi, Pascal Lafourcade
ENTCS
2008
97views more  ENTCS 2008»
13 years 9 months ago
Global State Considered Helpful
Reynolds' view of a storage cell as an expression-acceptor pair has been widely used by researchers. We present a different way of organizing semantics of state, and in parti...
Paul Blain Levy
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 3 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
PPDP
2010
Springer
13 years 7 months ago
Equational axiomatization of call-by-name delimited control
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
Yukiyoshi Kameyama, Asami Tanaka