Horn-ICE Learning for Synthesizing Invariants and Contracts

D'Souza, Deepak; Ezudheen, P.; Garg, Pranav; Madhusudan, P.; Neider, Daniel

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Paper

Horn-ICE Learning for Synthesizing Invariants and Contracts

MPS-Authors

/persons/resource/persons215577

Neider, Daniel
Group R. Majumdar, Max Planck Institute for Software Systems, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

arXiv:1712.09418.pdf
(Preprint), 291KB

Supplementary Material (public)

There is no public supplementary material available

Citation

D'Souza, D., Ezudheen, P., Garg, P., Madhusudan, P., & Neider, D. (2017). Horn-ICE Learning for Synthesizing Invariants and Contracts. Retrieved from http://arxiv.org/abs/1712.09418.

Cite as: https://hdl.handle.net/21.11116/0000-0000-765A-7

Abstract

We design learning algorithms for synthesizing invariants using Horn implication counterexamples (Horn-ICE), extending the ICE-learning model. In particular, we describe a decision-tree learning algorithm that learns from Horn-ICE samples, works in polynomial time, and uses statistical heuristics to learn small trees that satisfy the samples. Since most verification proofs can be modeled using Horn clauses, Horn-ICE learning is a more robust technique to learn inductive annotations that prove programs correct. Our experiments show that an implementation of our algorithm is able to learn adequate inductive invariants and contracts efficiently for a variety of sequential and concurrent programs.