Verification of a distributed summation algorithm

Vaandrager, Frits

doi:10.1007/3-540-60218-6_14

Cited by 6 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Less formal work includes [25,26,28,29]. More formal work can be found in [6,2,20,15,8,9,18,17,30,13,10]. Examining and studying all these works we concluded that specifications and correctness proofs are most of the time not easy to reuse in order to demonstrate the various applications of diffusing computations mentioned above.…”

Section: Diffusing Computationsmentioning

confidence: 99%

See 1 more Smart Citation

Facilitating the Verification of Diffusing Computations and Their Applications

Vos

Swierstra²

2018

CLEIej

View full text Add to dashboard Cite

We study a class of distributed algorithms, generally known by the name of diffusing computations, that play an important role in all kinds distributed and/or database applications to perform tasks like termination detection, leader election, or propagation of information with feedback. We construct a highly parameterized abstract algorithm and shown that many existing algorithms and their applications can be obtained from this abstract algorithm by instantiating the parameters appropriately and/or refining some of its actions. Subsequently, we show that this use of parameterization and re-usability of notation and proof leads to a reduction of the effort and cost of developing and verifying distributed diffusing computations. More specific, we show that proving the correctness of any application now boils down to verifying an application-specific safety property and reusing the termination and safety proofs of the underlying abstract algorithm.

show abstract

Section: Diffusing Computationsmentioning

confidence: 99%

“…It is straightforward [8,17,18,29,30] to instantiate our algorithm such that the sum of all data values is computed and eventually resides at the starter (i.e. is stored in the variable V.starter).…”

Section: Computation Of Summationmentioning

confidence: 99%

Facilitating the Verification of Diffusing Computations and Their Applications

Vos

Swierstra²

2018

CLEIej

View full text Add to dashboard Cite

show abstract

“…Alternatively, they are called auxiliary variables or history variables, see (e.g.) [11,12]. Ghost variables are not allowed in guards and in the righthand side of assignments to ordinary variables.…”

Section: The Modelling and The Repertoirementioning

confidence: 99%

Progress under bounded fairness

Hesselink¹

1999

Distributed Computing

View full text Add to dashboard Cite

Progress is investigated for a shared-memory distributed system with a weak form of fault tolerance that allows processes to stop and restart functioning without notification. The concept of bounded fairness is introduced to formalize bounded delay under the assumption that each family of related processes continuously contains at least one active member. This is a generalization of wait-freedom, and also of a finitary form of weak fairness. Several useful proof rules are stated and proved. In a system with bounded fairness, a wait-free process can be constructed by forming a new process in which processes from the various families are scheduled in a round robin way. The theory is applied to prove progress within bounded delay for a linearizing concurrent data-object in shared memory. The safety properties of this algorithm have been treated elsewhere.

show abstract

“…His research works play a pivotal role in the formal analysis of communication protocols and algorithms for distributed systems. Notably, in [10] he proved correct a distributed algorithm, somewhat related to depth-first search, in which all nodes in a distributed network report their weights to a designated root node via a spanning tree, so that this root can determine the sum of all these weights.…”

Section: Introductionmentioning

confidence: 99%

A Note on the Message Complexity of Cidon’s Distributed Depth-First Search Algorithm

Musaev

Fokkink

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? Take down policyIf you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

show abstract

Verification of a distributed summation algorithm

Cited by 6 publications

References 18 publications

Facilitating the Verification of Diffusing Computations and Their Applications

Facilitating the Verification of Diffusing Computations and Their Applications

Progress under bounded fairness

A Note on the Message Complexity of Cidon’s Distributed Depth-First Search Algorithm

Contact Info

Product

Resources

About