Proving the safety of highly-available distributed objects - Archive ouverte HAL Access content directly
Conference Papers Year :

Proving the safety of highly-available distributed objects

Sreeja S Nair
  • Function : Author
  • PersonId : 1022830
Gustavo Petri
Marc Shapiro


To provide high availability in distributed systems, object replicas allow concurrent updates. Although replicas eventually converge, they may diverge temporarily, for instance when the network fails. This makes it difficult for the developer to reason about the object's properties , and in particular, to prove invariants over its state. For the sub-class of state-based distributed systems, we propose a proof methodology for establishing that a given object maintains a given invariant, taking into account any concurrency control. Our approach allows reasoning about individual operations separately. We demonstrate that our rules are sound, and we illustrate their use with some representative examples. We automate the rule using Boogie, an SMT-based tool.
Fichier principal
Vignette du fichier
esop2020.pdf (578.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02424317 , version 1 (27-12-2019)
hal-02424317 , version 2 (20-02-2020)
hal-02424317 , version 3 (27-02-2020)


  • HAL Id : hal-02424317 , version 3


Sreeja S Nair, Gustavo Petri, Marc Shapiro. Proving the safety of highly-available distributed objects. ESOP 2020 - 29th European Symposium on Programming, Apr 2020, Dublin, Ireland. ⟨hal-02424317v3⟩
221 View
343 Download


Gmail Facebook Twitter LinkedIn More