140 search results - page 11 / 28 » Orderings and Constraints: Theory and Practice of Proving Te... |
EUROCRYPT
2009
Springer
16 years 6 days ago
2009
Springer
We initiate the cryptographic study of order-preserving symmetric encryption (OPE), a primitive suggested in the database community by Agrawal et al. (SIGMOD '04) for allowin...
119
click to vote
CAV
2004
Springer
15 years 3 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
119
click to vote
ACL
1997
15 years 1 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
103
click to vote
ICNP
2006
IEEE
15 years 5 months ago
2006
IEEE
— This paper reports on an experiment in network protocol design: we use novel rigorous techniques in the design process of a new protocol, in a close collaboration between syste...
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...