Abstract
We propose a framework to automate and mechanize simulation-based proofs of cutoffs for parameterized verification of distributed protocols. We propose a strategy to derive the simulation relation given the cutoff instance and encode the correctness of the simulation relation as a formula in first-order logic. We have successfully applied our approach on a number of distributed protocols.
BibTeX - Entry
@InProceedings{bhat_et_al:LIPIcs.DISC.2021.48,
author = {Bhat, Shreesha G. and Nagar, Kartik},
title = {{Brief Announcement: Automating and Mechanising Cutoff Proofs for Parameterized Verification of Distributed Protocols}},
booktitle = {35th International Symposium on Distributed Computing (DISC 2021)},
pages = {48:1--48:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-210-5},
ISSN = {1868-8969},
year = {2021},
volume = {209},
editor = {Gilbert, Seth},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14850},
URN = {urn:nbn:de:0030-drops-148505},
doi = {10.4230/LIPIcs.DISC.2021.48},
annote = {Keywords: Formal Methods, Automated Verification, Distributed Protocols}
}
|
Keywords: |
|
Formal Methods, Automated Verification, Distributed Protocols |
|
Collection: |
|
35th International Symposium on Distributed Computing (DISC 2021) |
|
Issue Date: |
|
2021 |
|
Date of publication: |
|
04.10.2021 |
Creative Commons Attribution 4.0 International license (CC BY 4.0)