Sciweavers

525 search results - page 49 / 105
» Model Checking Systems of Replicated Processes with Spin
Sort
View
PLDI
2006
ACM
14 years 2 months ago
Termination proofs for systems code
Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and conte...
Byron Cook, Andreas Podelski, Andrey Rybalchenko
CCGRID
2004
IEEE
14 years 13 days ago
Data durability in peer to peer storage systems
In this paper we present a quantitative study of data survival in peer to peer storage systems. We first recall two main redundancy mechanisms: replication and erasure codes, whic...
G. Utard, Antoine Vernois
EDBT
2000
ACM
14 years 9 days ago
Performance and Availability Assessment for the Configuration of Distributed Workflow Management Systems
Workflow management systems (WFMSs) that are geared for the orchestration of enterprise-wide or even "virtual-enterprise"-style business processes across multiple organi...
Michael Gillmann, Jeanine Weißenfels, Gerhar...
NCA
2007
IEEE
14 years 3 months ago
Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems
Open distributed systems are typically composed by an unknown number of processes running in heterogeneous hosts. Their communication often requires tolerance to temporary disconn...
Alysson Neves Bessani, Miguel Correia, Joni da Sil...
SAC
2010
ACM
14 years 3 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...