Lemma Generation for Horn Clause Satisfiability: A Preliminary Study

@article{Angelis2019LemmaGF,
  title={Lemma Generation for Horn Clause Satisfiability: A Preliminary Study},
  author={Emanuele De Angelis and Fabio Fioravanti and Alberto Pettorossi and Maurizio Proietti},
  journal={ArXiv},
  year={2019},
  volume={abs/1908.07188},
  pages={4-18}
}
  • Emanuele De Angelis, Fabio Fioravanti, +1 author Maurizio Proietti
  • Published in VPT@Programming 2019
  • Mathematics, Computer Science
  • It is known that the verification of imperative, functional, and logic programs can be reduced to the satisfiability of constrained Horn clauses (CHCs), and this satisfiability check can be performed by using CHC solvers, such as Eldarica and Z3. These solvers perform well when they act on simple constraint theories, such as Linear Integer Arithmetic and the theory of Booleans, but their efficacy is very much reduced when the clauses refer to constraints on inductively defined structures, such… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Topics from this paper.

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 20 REFERENCES

    Transformations of CLP Modules

    VIEW 11 EXCERPTS
    HIGHLY INFLUENTIAL

    Unfold/Fold Transformation of Logic Programs

    VIEW 11 EXCERPTS
    HIGHLY INFLUENTIAL

    Predicate Pairing for Program Verification

    VIEW 1 EXCERPT

    The OCaml system, Release 4.06

    • X. Leroy, D. Doligez, +3 authors J. Vouillon
    • Documentation and user’s manual, Institut National de Recherche en Informatique et en Automatique, France
    • 2017
    VIEW 1 EXCERPT