Sciweavers

5084 search results - page 73 / 1017
» Proving Possibility Properties
Sort
View
TPDS
1998
71views more  TPDS 1998»
13 years 9 months ago
Theoretical Analysis for Communication-Induced Checkpointing Protocols with Rollback-Dependency Trackability
—Rollback-Dependency Trackability (RDT) is a property that states that all rollback dependencies between local checkpoints are on-line trackable by using a transitive dependency ...
Jichiang Tsai, Sy-Yen Kuo, Yi-Min Wang
SIGMOD
2003
ACM
147views Database» more  SIGMOD 2003»
14 years 10 months ago
Formal semantics and analysis of object queries
Modern database systems provide not only powerful data models but also complex query languages supporting powerful features such as the ability to create new database objects and ...
Gavin M. Bierman
EUROCRYPT
2005
Springer
14 years 3 months ago
Reducing Complexity Assumptions for Statistically-Hiding Commitment
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...
Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-...
CAV
2001
Springer
154views Hardware» more  CAV 2001»
14 years 1 months ago
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
MPC
1995
Springer
125views Mathematics» more  MPC 1995»
14 years 1 months ago
Synthesizing Proofs from Programs in the Calculus of Inductive Constructions
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
Catherine Parent