@inproceedings{179dbcf354eb4325a6d29fcadfb655a7,
title = "Deductive Verification in Decidable Fragments with Ivy",
abstract = "This paper surveys the work to date on Ivy, a language and a tool for the formal specification and verification of distributed systems. Ivy supports deductive verification using automated provers, model checking, automated testing, manual theorem proving and generation of executable code. In order to achieve greater verification productivity, a key design goal for Ivy is to allow the engineer to apply automated provers in the realm in which their performance is relatively predictable, stable and transparent. In particular Ivy focuses on the use of decidable fragments of first-order logic. We consider the rationale or Ivy{\textquoteright}s design, the various capabilities of the tool, as well as case studies and applications.",
keywords = "Cache coherence, Decidable logics, Deductive verification, Distributed systems, Effectively propositional logic, Liveness verification, Model checking, Paxos, Safety verification, Specification-based testing",
author = "McMillan, {Kenneth L.} and Oded Padon",
note = "Publisher Copyright: {\textcopyright} 2018, Springer Nature Switzerland AG.; 25th International Static Analysis Symposium, SAS 2018 ; Conference date: 29-08-2018 Through 31-08-2018",
year = "2018",
doi = "https://doi.org/10.1007/978-3-319-99725-4_4",
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 = "43--55",
editor = "Andreas Podelski",
booktitle = "Static Analysis - 25th International Symposium, SAS 2018, Proceedings",
address = "ألمانيا",
}