Download PDFOpen PDF in browser

On Inductive Verification and Synthesis

8 pagesPublished: May 25, 2019


We study possibilities of using symbol elimination in program verification and synthesis. We consider programs for which a property is given, which is supposed to hold for all states reachable from the initial states. If it can not be proven that such a formula is an inductive invariant, the task is to find conditions to strengthen the property in order to make it an inductive invariant. We propose a method for property-directed invariant generation and analyze its properties.

Keyphrases: invariant synthesis, local theory extensions, quantifier elimination, SMT

In: Christoph Benzmüller, Xavier Parent and Alexander Steen (editors). Selected Student Contributions and Workshop Papers of LuxLogAI 2018, vol 10, pages 1--8

BibTeX entry
  author    = {Dennis Peuter and Viorica Sofronie-Stokkermans},
  title     = {On Inductive Verification and Synthesis},
  booktitle = {Selected Student Contributions and Workshop Papers of LuxLogAI 2018},
  editor    = {Christoph Benzm\textbackslash{}"uller and Xavier Parent and Alexander Steen},
  series    = {Kalpa Publications in Computing},
  volume    = {10},
  pages     = {1--8},
  year      = {2019},
  publisher = {EasyChair},
  bibsource = {EasyChair,},
  issn      = {2515-1762},
  url       = {},
  doi       = {10.29007/9199}}
Download PDFOpen PDF in browser