Interactive Verification of Distributed Protocols Using Decidable Logic

Sharon Shoham*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationStatic Analysis - 25th International Symposium, SAS 2018, Proceedings
EditorsAndreas Podelski
PublisherSpringer Verlag
Pages77-85
Number of pages9
ISBN (Print)9783319997247
DOIs
StatePublished - 2018
Event25th International Static Analysis Symposium, SAS 2018 - Freiburg, Germany
Duration: 29 Aug 201831 Aug 2018

Publication series

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

Conference

Conference25th International Static Analysis Symposium, SAS 2018
Country/TerritoryGermany
CityFreiburg
Period29/08/1831/08/18

Funding

FundersFunder number
Horizon 2020 Framework Programme759102-SVIS
Blavatnik Family Foundation
European Research Council
United States-Israel Binational Science Foundation2016260, 2012259
Tel Aviv University

    Fingerprint

    Dive into the research topics of 'Interactive Verification of Distributed Protocols Using Decidable Logic'. Together they form a unique fingerprint.

    Cite this