Pub Date : 2022-03-25DOI: 10.48550/arXiv.2203.14711
H. Carr, Christopher Jenkins, Mark Moir, Victor Cacciari Miraldo, Lisandra Silva
LibraBFT is a Byzantine Fault Tolerant (BFT) consensus protocol based on HotStuff. We present an abstract model of the protocol underlying HotStuff / LibraBFT, and formal, machine-checked proofs of their core correctness (safety) property and an extended condition that enables non-participating parties to verify committed results. (Liveness properties would be proved for specific implementations, not for the abstract model presented in this paper.) A key contribution is precisely defining assumptions about the behavior of honest peers, in an abstract way, independent of any particular implementation. Therefore, our work is an important step towards proving correctness of an entire class of concrete implementations, without repeating the hard work of proving correctness of the underlying protocol. The abstract proofs are for a single configuration (epoch); extending these proofs across configuration changes is future work. Our models and proofs are expressed in Agda, and are available in open source.
{"title":"Towards Formal Verification of HotStuff-based Byzantine Fault Tolerant Consensus in Agda: Extended Version","authors":"H. Carr, Christopher Jenkins, Mark Moir, Victor Cacciari Miraldo, Lisandra Silva","doi":"10.48550/arXiv.2203.14711","DOIUrl":"https://doi.org/10.48550/arXiv.2203.14711","url":null,"abstract":"LibraBFT is a Byzantine Fault Tolerant (BFT) consensus protocol based on HotStuff. We present an abstract model of the protocol underlying HotStuff / LibraBFT, and formal, machine-checked proofs of their core correctness (safety) property and an extended condition that enables non-participating parties to verify committed results. (Liveness properties would be proved for specific implementations, not for the abstract model presented in this paper.) A key contribution is precisely defining assumptions about the behavior of honest peers, in an abstract way, independent of any particular implementation. Therefore, our work is an important step towards proving correctness of an entire class of concrete implementations, without repeating the hard work of proving correctness of the underlying protocol. The abstract proofs are for a single configuration (epoch); extending these proofs across configuration changes is future work. Our models and proofs are expressed in Agda, and are available in open source.","PeriodicalId":436677,"journal":{"name":"NASA Formal Methods","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121070597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-02-06DOI: 10.1007/978-3-031-06773-0_38
Daniel Basgöze, Matthias Volk, J. Katoen, Shahid Khan, M. Stoelinga
{"title":"BDDs Strike Back: Efficient Analysis of Static and Dynamic Fault Trees","authors":"Daniel Basgöze, Matthias Volk, J. Katoen, Shahid Khan, M. Stoelinga","doi":"10.1007/978-3-031-06773-0_38","DOIUrl":"https://doi.org/10.1007/978-3-031-06773-0_38","url":null,"abstract":"","PeriodicalId":436677,"journal":{"name":"NASA Formal Methods","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131760734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-01-18DOI: 10.1007/978-3-031-06773-0_29
S. Nayak, D. Neider, Rajarshi Roy, Martin Zimmermann
{"title":"Robust Computation Tree Logic","authors":"S. Nayak, D. Neider, Rajarshi Roy, Martin Zimmermann","doi":"10.1007/978-3-031-06773-0_29","DOIUrl":"https://doi.org/10.1007/978-3-031-06773-0_29","url":null,"abstract":"","PeriodicalId":436677,"journal":{"name":"NASA Formal Methods","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116255950","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-01-17DOI: 10.1007/978-3-031-06773-0_15
Stanley Bak, Hoang-Dung Tran
{"title":"Neural Network Compression of ACAS Xu Early Prototype Is Unsafe: Closed-Loop Verification Through Quantized State Backreachability","authors":"Stanley Bak, Hoang-Dung Tran","doi":"10.1007/978-3-031-06773-0_15","DOIUrl":"https://doi.org/10.1007/978-3-031-06773-0_15","url":null,"abstract":"","PeriodicalId":436677,"journal":{"name":"NASA Formal Methods","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126488751","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-18DOI: 10.1007/978-3-031-06773-0_17
Diganta Mukhopadhyay, Kumar Madhukar, M. Srivas
{"title":"Permutation Invariance of Deep Neural Networks with ReLUs","authors":"Diganta Mukhopadhyay, Kumar Madhukar, M. Srivas","doi":"10.1007/978-3-031-06773-0_17","DOIUrl":"https://doi.org/10.1007/978-3-031-06773-0_17","url":null,"abstract":"","PeriodicalId":436677,"journal":{"name":"NASA Formal Methods","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127888492","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-08-17DOI: 10.1007/978-3-030-76384-8_13
Tsutomu Kobayashi, Rick Salay, I. Hasuo, K. Czarnecki, F. Ishikawa, Shin-ya Katsumata
{"title":"Robustifying Controller Specifications of Cyber-Physical Systems Against Perceptual Uncertainty","authors":"Tsutomu Kobayashi, Rick Salay, I. Hasuo, K. Czarnecki, F. Ishikawa, Shin-ya Katsumata","doi":"10.1007/978-3-030-76384-8_13","DOIUrl":"https://doi.org/10.1007/978-3-030-76384-8_13","url":null,"abstract":"","PeriodicalId":436677,"journal":{"name":"NASA Formal Methods","volume":"281 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122505901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：