Sciweavers

146 search results - page 19 / 30
» Fault-Tolerant Distributed Theorem Proving
Sort
View
IPPS
1999
IEEE
13 years 11 months ago
A Formal Framework for Specifying and Verifying Time Warp Optimizations
Parallel and distributed systems are representative of large and complex systems that require the application of formal methods. These systems are often unreliable because implemen...
Victoria Chernyakhovsky, Peter Frey, Radharamanan ...
RTSS
1998
IEEE
13 years 11 months ago
Statistical Delay Guarantee of Virtual Clock
In this paper, we derive a statistical delay guarantee of the generalized Virtual Clock scheduling algorithm. We define the concept of an equivalent fluid and packet source and pr...
Pawan Goyal, Harrick M. Vin
ATAL
2006
Springer
13 years 11 months ago
Strategic voting when aggregating partially ordered preferences
Preferences of a single agent are often partially ordered. For example, it may be hard to compare a novel with a biography. In such a situation, the agent may want the novel and t...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
ENTCS
2006
122views more  ENTCS 2006»
13 years 7 months ago
Verification of Clock Synchronization Algorithms: Experiments on a Combination of Deductive Tools
We report on an experiment in combining Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study...
Damián Barsotti, Leonor Prensa Nieto, Alwen...
PLDI
2012
ACM
11 years 9 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa