Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Ilina Stoilkovska"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 1 (2023)
Threshold guards are a basic primitive of many fault-tolerant algorithms that solve classical problems in distributed computing, such as reliable broadcast, two-phase commit, and consensus. Moreover, threshold guards can be found in recent blockchain
Externí odkaz:
https://doaj.org/article/108d81d8efd84c74b43f1fa7438e852f
Publikováno v:
Formal Techniques for Distributed Objects, Components, and Systems
Lecture Notes in Computer Science
40th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)
40th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2020, Valletta, Malta. pp.189-207, ⟨10.1007/978-3-030-50086-3_11⟩
Lecture Notes in Computer Science-Formal Techniques for Distributed Objects, Components, and Systems
Formal Techniques for Distributed Objects, Components, and Systems-FORTE 2020
Formal Techniques for Distributed Objects, Components, and Systems ISBN: 9783030500856
FORTE
Lecture Notes in Computer Science
40th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)
40th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2020, Valletta, Malta. pp.189-207, ⟨10.1007/978-3-030-50086-3_11⟩
Lecture Notes in Computer Science-Formal Techniques for Distributed Objects, Components, and Systems
Formal Techniques for Distributed Objects, Components, and Systems-FORTE 2020
Formal Techniques for Distributed Objects, Components, and Systems ISBN: 9783030500856
FORTE
Threshold guards are a basic primitive of many fault-tolerant algorithms that solve classical problems of distributed computing, such as reliable broadcast, two-phase commit, and consensus. Moreover, threshold guards can be found in recent blockchain
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::38de7bae2c1fc24e3117277040576c3d
http://europepmc.org/articles/PMC7281874
http://europepmc.org/articles/PMC7281874
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030670665
VMCAI
VMCAI
In previous work, we introduced synchronous threshold automata for the verification of synchronous fault-tolerant distributed algorithms, and presented a verification method based on bounded model checking. Modeling a distributed algorithm by a thres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3138e5fa0c8341142904480a3cf69a81
https://doi.org/10.1007/978-3-030-67067-2_10
https://doi.org/10.1007/978-3-030-67067-2_10
Publikováno v:
Automated Technology for Verification and Analysis ISBN: 9783030591519
ATVA
ATVA
Threshold automata were introduced to give a formal semantics to distributed algorithms in a way that supports automated verification. While transitions in threshold automata are guarded by conditions over the number of globally sent messages, condit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1af35cc59e872a1c943c248d7f3404f6
https://doi.org/10.1007/978-3-030-59152-6_11
https://doi.org/10.1007/978-3-030-59152-6_11
Autor:
Josef Widder, Igor Konnov, Sean Braithwaite, Ethan Buchman, Zarko Milosevic, Ilina Stoilkovska, Anca Zamfir
Publikováno v:
Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles ISBN: 9783030613617
ISoLA (1)
ISoLA (1)
Blockchain synchronization is one of the core protocols of Tendermint blockchains. We describe our recent efforts on formal specification of the protocol and its implementation, and present model checking results for small parameters. We demonstrate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a7112815498a9c4c732260892b83305
https://doi.org/10.1007/978-3-030-61362-4_27
https://doi.org/10.1007/978-3-030-61362-4_27
Publikováno v:
TACAS 2019-International Conference on Tools and Algorithms for the Construction and Analysis of Systems
TACAS 2019-International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Apr 2019, Prague, Czech Republic. ⟨10.1007/978-3-030-17465-1_20⟩
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030174644
TACAS (2)
TACAS 2019-International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Apr 2019, Prague, Czech Republic. ⟨10.1007/978-3-030-17465-1_20⟩
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030174644
TACAS (2)
International audience; Many fault-tolerant distributed algorithms are designed for synchronous or round-based semantics. In this paper, we introduce the synchronous variant of threshold automata, and study their applicability and limitations for the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6bc30863646de637328da7a4616cf364
https://hal.inria.fr/hal-01925653
https://hal.inria.fr/hal-01925653
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319737201
VMCAI
VMCAI
Parameterized verification of fault-tolerant distributed algorithms has recently gained more and more attention. Most of the existing work considers asynchronous distributed systems (interleaving semantics). However, there exists a considerable distr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b88ef4b681360eeca24c37f06f8d8447
https://doi.org/10.1007/978-3-319-73721-8_1
https://doi.org/10.1007/978-3-319-73721-8_1