Deductive Verification in Decidable Fragments with Ivy

Kenneth L. McMillan, Oded Padon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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’s design, the various capabilities of the tool, as well as case studies and applications.

Original languageEnglish
Title of host publicationStatic Analysis - 25th International Symposium, SAS 2018, Proceedings
EditorsAndreas Podelski
PublisherSpringer Verlag
Pages43-55
Number of pages13
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

Conference

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

Keywords

  • Cache coherence
  • Decidable logics
  • Deductive verification
  • Distributed systems
  • Effectively propositional logic
  • Liveness verification
  • Model checking
  • Paxos
  • Safety verification
  • Specification-based testing

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Cite this