345 search results - page 32 / 69 » Computer-Assisted Simulation Proofs |
113
click to vote
ICDCS
2003
IEEE
15 years 7 months ago
2003
IEEE
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes an...
130
click to vote
ICTCS
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
109
click to vote
FMCAD
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We present a simple method for verifying the safety properties of cache coherence protocols with arbitrarily many nodes. Our presentation begins with two examples. The fi...
113
click to vote
FAC
2008
15 years 2 months ago
2008
The Mondex case study about the specification and refinement of an electronic purse as defined in the Oxford Technical Monograph PRG-126 has recently been proposed as a challenge f...
115
Voted
PKC
2012
Springer
13 years 4 months ago
2012
Springer
We define a new notion of relatively-sound non-interactive zeroknowledge (NIZK) proofs, where a private verifier with access to a trapdoor continues to be sound even when the Ad...