Microsoft® Product List 2012
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Understanding Distributed Consensus
What’s Live? Understanding Distributed Consensus∗ Saksham Chand Yanhong A. Liu Computer Science Department, Stony Brook University, Stony Brook, NY 11794, USA {schand,liu}@cs.stonybrook.edu Abstract Distributed consensus algorithms such as Paxos have been studied extensively. They all use the same definition of safety. Liveness is especially important in practice despite well-known theoretical impossibility results. However, many different liveness proper- ties and assumptions have been stated, and there are no systematic comparisons for better understanding of these properties. This paper systematically studies and compares different liveness properties stated for over 30 prominent consensus algorithms and variants. We introduce a precise high- level language and formally specify these properties in the language. We then create a hierarchy of liveness properties combining two hierarchies of the assumptions used and a hierarchy of the assertions made, and compare the strengths and weaknesses of algorithms that ensure these properties. Our formal specifications and systematic comparisons led to the discovery of a range of problems in various stated liveness proper- ties, from too weak assumptions for which no liveness assertions can hold, to too strong assumptions making it trivial to achieve the assertions. We also developed TLA+ spec- ifications of these liveness properties, and we use model checking of execution steps to illustrate liveness patterns for Paxos. 1 Introduction arXiv:2001.04787v2 [cs.DC] 21 Jun 2021 Distributed systems are pervasive, where processes work with each other via message passing. For example, this article is available to the current reader owing to some distributed system. At the same time, distributed systems are highly complex, due to their unpredictable asyn- chronous nature in the presence of failures—processes can fail and later recover, and messages can be lost, delayed, reordered, and duplicated. -
Formal Specification and Verification Stephan Merz
Formal specification and verification Stephan Merz To cite this version: Stephan Merz. Formal specification and verification. Dahlia Malkhi. Concurrency: the Works of Leslie Lamport, 29, Association for Computing Machinery, pp.103-129, 2019, ACM Books, 10.1145/3335772.3335780. hal-02387780 HAL Id: hal-02387780 https://hal.inria.fr/hal-02387780 Submitted on 2 Dec 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Formal specification and verification Stephan Merz University of Lorraine, CNRS, Inria, LORIA, Nancy, France 1. Introduction Beyond his seminal contributions to the theory and the design of concurrent and distributed algorithms, Leslie Lamport has throughout his career worked on methods and formalisms for rigorously establishing the correctness of algorithms. Commenting on his first article about a method for proving the correctness of multi-process programs [32] on the website providing access to his collected writings [47], Lamport recalls that this interest originated in his submitting a flawed mutual-exclusion algorithm in the early 1970s. As a trained mathematician, Lamport is perfectly familiar with mathematical set theory, the standard formal foundation of classical mathematics. His career in industrial research environments and the fact that his main interest has been in algorithms, not formalisms, has certainly contributed to his designing reasoning methods that combine pragmatism and mathematical elegance. -
University of Groningen 16Th SC@RUG 2019 Proceedings
University of Groningen 16th SC@RUG 2019 proceedings 2018-2019 Smedinga, Reinder; Biehl, Michael IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please check the document version below. Publication date: 2019 Link to publication in University of Groningen/UMCG research database Citation for published version (APA): Smedinga, R., & Biehl, M. (Eds.) (2019). 16th SC@RUG 2019 proceedings 2018-2019. Bibliotheek der R.U. Copyright Other than for strictly personal use, it is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license (like Creative Commons). Take-down policy If 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. Downloaded from the University of Groningen/UMCG research database (Pure): http://www.rug.nl/research/portal. For technical reasons the number of authors shown on this cover page is limited to 10 maximum. Download date: 13-11-2019 faculty of science computing science faculty of science computing science and engineering and engineering 1 6 th SC @ RUG 201 SC@RUG 2019 proceedings 8 -201 9 16th SC@RUG 2018-2019 Rein Smedinga, Michael Biehl (editors) rug.nl/research/bernoulli R20170190_omslag_SC_RUG2018_.indd 3 01-05-18 13:11 SC@RUG 2019 proceedings Rein Smedinga Michael Biehl editors 2019 Groningen ISBN (e-pub): 978-94-034-1664-9 ISBN (book): 978-94-034-1665-6 Publisher: Bibliotheek der R.U. -
University of Groningen 16Th SC@RUG 2019 Proceedings 2018-2019 Smedinga, Reinder
University of Groningen 16th SC@RUG 2019 proceedings 2018-2019 Smedinga, Reinder; Biehl, Michael IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please check the document version below. Publication date: 2019 Link to publication in University of Groningen/UMCG research database Citation for published version (APA): Smedinga, R., & Biehl, M. (Eds.) (2019). 16th SC@RUG 2019 proceedings 2018-2019. Bibliotheek der R.U. Copyright Other than for strictly personal use, it is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license (like Creative Commons). The publication may also be distributed here under the terms of Article 25fa of the Dutch Copyright Act, indicated by the “Taverne” license. More information can be found on the University of Groningen website: https://www.rug.nl/library/open-access/self-archiving-pure/taverne- amendment. Take-down policy If 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. Downloaded from the University of Groningen/UMCG research database (Pure): http://www.rug.nl/research/portal. For technical reasons the number of authors shown on this cover page is limited to 10 maximum. Download date: 10-10-2021 faculty of science computing science faculty of science computing science and engineering and engineering 1 6 th SC @ RUG 201 SC@RUG 2019 proceedings 8 -201 9 16th SC@RUG 2018-2019 Rein Smedinga, Michael Biehl (editors) rug.nl/research/bernoulli R20170190_omslag_SC_RUG2018_.indd 3 01-05-18 13:11 SC@RUG 2019 proceedings Rein Smedinga Michael Biehl editors 2019 Groningen ISBN (e-pub): 978-94-034-1664-9 ISBN (book): 978-94-034-1665-6 Publisher: Bibliotheek der R.U.