Synchronizing Constrained Horn Clauses

18 pages•Published: May 4, 2017

Dmitry Mordvinov and Grigory Fedyukovich

Abstract

Simultaneous occurrences of multiple recurrence relations in a system of non-linear constrained Horn clauses are crucial for proving its satis ability. A solution of such system is often inexpressible in the constraint language. We propose to synchronize recurrent computations, thus increasing the chances for a solution to be found. We introduce a notion of CHC product allowing to formulate a lightweight iterative algorithm of merging recurrent computations into groups and prove its soundness. The evaluation over a set of systems handling lists and linear integer arithmetic confirms that the transformed systems are drastically more simple to solve than the original ones.

Keyphrases: constrained horn clauses, inductive invariant, linearization, relational verification, unbounded model checking

In: Thomas Eiter and David Sands (editors). LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 46, pages 338-355.

Links:	https://easychair.org/publications/paper/LlxW
	https://doi.org/10.29007/gr5c

BibTeX entry

@inproceedings{LPAR-21:Synchronizing_Constrained_Horn_Clauses,
  author    = {Dmitry Mordvinov and Grigory Fedyukovich},
  title     = {Synchronizing Constrained Horn Clauses},
  booktitle = {LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Thomas Eiter and David Sands},
  series    = {EPiC Series in Computing},
  volume    = {46},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/LlxW},
  doi       = {10.29007/gr5c},
  pages     = {338-355},
  year      = {2017}}

Download PDF Open PDF in browser