TY - GEN
T1 - Interactive Verification of Distributed Protocols Using Decidable Logic
AU - Shoham, Sharon
N1 - Publisher Copyright:
© 2018, Springer Nature Switzerland AG.
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
T2 - 25th International Static Analysis Symposium, SAS 2018
Y2 - 29 August 2018 through 31 August 2018
ER -