2019
DOI: 10.1016/j.tcs.2018.10.025
|View full text |Cite
|
Sign up to set email alerts
|

Proving properties of the Chord protocol using the ASM formalism

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(9 citation statements)
references
References 11 publications
0
9
0
Order By: Relevance
“…Having these notions, the paper [23] proves that the presented formalization of Chord consistently maintains the topological structure of rings and manipulates with distributes keys. In Section 4 we will explain that our model of BAC19 satisfies the mentioned constraints and that results from [23] hold also for BAC19.…”
Section: Abstract State Machinesmentioning
confidence: 79%
See 3 more Smart Citations
“…Having these notions, the paper [23] proves that the presented formalization of Chord consistently maintains the topological structure of rings and manipulates with distributes keys. In Section 4 we will explain that our model of BAC19 satisfies the mentioned constraints and that results from [23] hold also for BAC19.…”
Section: Abstract State Machinesmentioning
confidence: 79%
“…We also provide a brief review of Abstract State Machines, since they are used for proving properties of Chord. For more details, please see [7,16,21,23,25,31,32].…”
Section: Overlay Networkmentioning
confidence: 99%
See 2 more Smart Citations
“…Other distributed system protocols have been formally studied using "highlevel" specification languages. For instance, Pastry was analyzed using TLA + [13]; similar work used Event-B [16] or ASM [12] to partly verify other protocols. However, these studies are limited to the verification of safety properties.…”
Section: Related Workmentioning
confidence: 99%