日本語
 
Help Privacy Policy ポリシー/免責事項
  詳細検索ブラウズ

アイテム詳細

  A Machine-checked Proof of Correctness of Pastry

Azmy, N. (2016). A Machine-checked Proof of Correctness of Pastry. PhD Thesis, Universität des Saarlandes, Saarbrücken.

Item is

基本情報

表示: 非表示:
資料種別: 学位論文

ファイル

表示: ファイル

関連URL

表示:
非表示:
URL:
http://scidok.sulb.uni-saarland.de/volltexte/2017/6730/ (全文テキスト(全般))
説明:
-
OA-Status:
Green
説明:
-
OA-Status:
Not specified

作成者

表示:
非表示:
 作成者:
Azmy, Noran1, 2, 著者           
Weidenbach, Christoph1, 学位論文主査           
Merz, Stephan3, 監修者
所属:
1Automation of Logic, MPI for Informatics, Max Planck Society, ou_1116545              
2International Max Planck Research School, MPI for Informatics, Max Planck Society, Campus E1 4, 66123 Saarbrücken, DE, ou_1116551              
3External Organizations, ou_persistent22              

内容説明

表示:
非表示:
キーワード: -
 要旨: A distributed hash table (DHT) is a peer-to-peer network that offers the function of a classic hash table, but where different key-value pairs are stored at different nodes on the network. Like a classic hash table, the main function provided by a DHT is key lookup, which retrieves the value stored at a given key. Examples of DHT protocols include Chord, Pastry, Kademlia and Tapestry. Such DHT protocols certain correctness and performance guarantees, but formal verification typically discovers border cases that violate those guarantees. In his PhD thesis, Tianxiang Lu reported correctness problems in published versions of Pastry and developed a model called LuPastry, for which he provided a partial proof of correct delivery of lookup messages assuming no node failure, mechanized in the TLA+ Proof System. In analyzing Lu's proof, I discovered that it contained unproven assumptions, and found counterexamples to several of these assumptions. The contribution of this thesis is threefold. First, I present LuPastry+, a revised TLA+ specification of LuPastry. Aside from needed bug fixes, LuPastry+ contains new definitions that make the specification more modular and significantly improve proof automation. Second, I present a complete TLA+ proof of correct delivery for LuPastry+. Third, I prove that the final step of the node join process of LuPastry/LuPastry+ is not necessary to achieve consistency. In particular, I develop a new specification with a simpler node join process, which I denote by Simplified LuPastry+, and prove correct delivery of lookup messages for this new specification. The proof of correctness of Simplified LuPastry+ is written by reusing the proof for LuPastry+, which represents a success story in proof reuse, especially for proofs of this size. Each of the two proofs amounts to over 32,000 proof steps; to my knowledge, they are currently the largest proofs written in the TLA+ language, and---together with Lu's proof---the only examples of applying full theorem proving for the verification of DHT protocols

資料詳細

表示:
非表示:
言語: eng - English
 日付: 2016-11-2420162016
 出版の状態: 出版
 ページ: ix, 119 p.
 出版情報: Saarbrücken : Universität des Saarlandes
 目次: -
 査読: -
 識別子(DOI, ISBNなど): BibTex参照ID: Azmyphd16
URN: urn:nbn:de:bsz:291-scidok-67309
 学位: 博士号 (PhD)

関連イベント

表示:

訴訟

表示:

Project information

表示:

出版物

表示: