Learning invariants using decision trees and implication counterexamples

@inproceedings{Garg2016LearningIU,
  title={Learning invariants using decision trees and implication counterexamples},
  author={Pranav Garg and Daniel Neider and P. Madhusudan and Dan Roth},
  booktitle={POPL},
  year={2016}
}
Inductive invariants can be robustly synthesized using a learning model where the teacher is a program verifier who instructs the learner through concrete program configurations, classified as positive, negative, and implications. We propose the first learning algorithms in this model with implication counter-examples that are based on machine learning techniques. In particular, we extend classical decision-tree learning algorithms in machine learning to handle implication samples, building new… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 69 citations. REVIEW CITATIONS

4 Figures & Tables

Topics

Statistics

0204020142015201620172018
Citations per Year

69 Citations

Semantic Scholar estimates that this publication has 69 citations based on the available data.

See our FAQ for additional information.