HoIce: An ICE-Based Non-linear Horn Clause Solver

20Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The ICE framework is a machine-learning-based technique originally introduced for inductive invariant inference over transition systems, and building on the supervised learning paradigm. Recently, we adapted the approach to non-linear Horn clause solving in the context of higher-order program verification. We showed that we could solve more of our benchmarks (extracted from higher-order program verification problems) than other state-of-the-art Horn clause solvers. This paper discusses some of the many improvements we recently implemented in HoIce, our implementation of this generalized ICE framework.

Cite

CITATION STYLE

APA

Champion, A., Kobayashi, N., & Sato, R. (2018). HoIce: An ICE-Based Non-linear Horn Clause Solver. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11275 LNCS, pp. 146–156). Springer Verlag. https://doi.org/10.1007/978-3-030-02768-1_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free