Voltar
Artigo Acesso aberto Revisado por pares
BIBTEX RIS

Verifying programs that use causally-ordered message-passing

1995; Elsevier BV; Volume: 24; Issue: 2 Linguagem: Inglês

10.1016/0167-6423(95)00002-a

ISSN

1872-7964

Autores

Scott D. Stoller, Fred B. Schneider,

Tópico(s)

Formal Methods in Verification

Resumo

We give an operational model of causally-ordered message-passing primitives. Based on this model, we formulate a Hoare-style proof system for causally-ordered delivery. To illustrate the use of this proof system and to demonstrate the feasibility of applying invariant-based verification techniques to algorithms that depend on causally-ordered delivery, we verify an asynchronous variant of the distributed termination detection algorithm of Dijkstra, Feijen, and van Gasteren.

Referência(s)