Sciweavers

8 search results - page 1 / 2
» How Safe is Probabilistic Checkpointing
Sort
View
ENTCS
2007
113views more  ENTCS 2007»
13 years 5 months ago
Modular Checkpointing for Atomicity
Transient faults that arise in large-scale software systems can often be repaired by re-executing the code in which they occur. Ascribing a meaningful semantics for safe re-execut...
Lukasz Ziarek, Philip Schatz, Suresh Jagannathan
IWMM
2009
Springer
107views Hardware» more  IWMM 2009»
14 years 5 days ago
Self-recovery in server programs
It is important that long running server programs retain availability amidst software failures. However, server programs do fail and one of the important causes of failures in ser...
Vijay Nagarajan, Dennis Jeffrey, Rajiv Gupta
TARK
2007
Springer
13 years 11 months ago
From conditional probability to the logic of doxastic actions
We investigate the discrete (finite) case of the Popper-Renyi theory of conditional probability, introducing discrete conditional probabilistic models for (multi-agent) knowledge...
Alexandru Baltag, Sonja Smets
ICWS
2007
IEEE
13 years 7 months ago
Probabilistic QoS and soft contracts for transaction based Web services
— Web services orchestrations and choreographies require establishing Quality of Service (QoS) contracts with the user. This is achieved by performing QoS composition, based on c...
Sidney Rosario, Albert Benveniste, Stefan Haar, Cl...