Interactive Verification of Distributed Protocols Using Decidable Logic

Sharon Shoham

doi:10.1007/978-3-319-99725-4_7

Interactive Verification of Distributed Protocols Using Decidable Logic

Sharon Shoham

School of Computer Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Distributed systems are becoming more and more pervasive in our lives, making their correctness crucial. Unfortunately, distributed systems are notoriously hard to get right and verify. Due to the infinite state space (e.g., unbounded number of nodes and messages) and the complexity of the protocols used, verification of such systems is both undecidable and hard in practice.

Original language	English
Title of host publication	Static Analysis - 25th International Symposium, SAS 2018, Proceedings
Editors	Andreas Podelski
Publisher	Springer Verlag
Pages	77-85
Number of pages	9
ISBN (Print)	9783319997247
DOIs	https://doi.org/10.1007/978-3-319-99725-4_7
State	Published - 2018
Event	25th International Static Analysis Symposium, SAS 2018 - Freiburg, Germany Duration: 29 Aug 2018 → 31 Aug 2018

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11002 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	25th International Static Analysis Symposium, SAS 2018
Country/Territory	Germany
City	Freiburg
Period	29/08/18 → 31/08/18

Access to Document

10.1007/978-3-319-99725-4_7

Cite this

Shoham, S. (2018). Interactive Verification of Distributed Protocols Using Decidable Logic. In A. Podelski (Ed.), Static Analysis - 25th International Symposium, SAS 2018, Proceedings (pp. 77-85). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11002 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-99725-4_7

@inproceedings{e63e958dc7cc4704835aedbfee04b727,

title = "Interactive Verification of Distributed Protocols Using Decidable Logic",

abstract = "Distributed systems are becoming more and more pervasive in our lives, making their correctness crucial. Unfortunately, distributed systems are notoriously hard to get right and verify. Due to the infinite state space (e.g., unbounded number of nodes and messages) and the complexity of the protocols used, verification of such systems is both undecidable and hard in practice.",

author = "Sharon Shoham",

note = "Publisher Copyright: {\textcopyright} 2018, Springer Nature Switzerland AG.; null ; Conference date: 29-08-2018 Through 31-08-2018",

year = "2018",

doi = "10.1007/978-3-319-99725-4_7",

language = "אנגלית",

isbn = "9783319997247",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "77--85",

editor = "Andreas Podelski",

booktitle = "Static Analysis - 25th International Symposium, SAS 2018, Proceedings",

}

Shoham, S 2018, Interactive Verification of Distributed Protocols Using Decidable Logic. in A Podelski (ed.), Static Analysis - 25th International Symposium, SAS 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11002 LNCS, Springer Verlag, pp. 77-85, 25th International Static Analysis Symposium, SAS 2018, Freiburg, Germany, 29/08/18. https://doi.org/10.1007/978-3-319-99725-4_7

Interactive Verification of Distributed Protocols Using Decidable Logic. / Shoham, Sharon.

Static Analysis - 25th International Symposium, SAS 2018, Proceedings. ed. / Andreas Podelski. Springer Verlag, 2018. p. 77-85 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11002 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Interactive Verification of Distributed Protocols Using Decidable Logic

AU - Shoham, Sharon

PY - 2018

Y1 - 2018

N2 - Distributed systems are becoming more and more pervasive in our lives, making their correctness crucial. Unfortunately, distributed systems are notoriously hard to get right and verify. Due to the infinite state space (e.g., unbounded number of nodes and messages) and the complexity of the protocols used, verification of such systems is both undecidable and hard in practice.

AB - Distributed systems are becoming more and more pervasive in our lives, making their correctness crucial. Unfortunately, distributed systems are notoriously hard to get right and verify. Due to the infinite state space (e.g., unbounded number of nodes and messages) and the complexity of the protocols used, verification of such systems is both undecidable and hard in practice.

UR - http://www.scopus.com/inward/record.url?scp=85053606274&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-99725-4_7

DO - 10.1007/978-3-319-99725-4_7

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85053606274

SN - 9783319997247

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 77

EP - 85

BT - Static Analysis - 25th International Symposium, SAS 2018, Proceedings

A2 - Podelski, Andreas

PB - Springer Verlag

Y2 - 29 August 2018 through 31 August 2018

ER -

Shoham S. Interactive Verification of Distributed Protocols Using Decidable Logic. In Podelski A, editor, Static Analysis - 25th International Symposium, SAS 2018, Proceedings. Springer Verlag. 2018. p. 77-85. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-99725-4_7

Interactive Verification of Distributed Protocols Using Decidable Logic

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this