ICE-Based Refinement Type Discovery for Higher-Order Functional Programs

Adrien Champion, Tomoya Chiba, Naoki Kobayashi, Ryosuke Sato

Research output: Contribution to journalArticlepeer-review

Abstract

We propose a method for automatically finding refinement types of higher-order function programs. Our method is an extension of the Ice framework of Garg et al. for finding invariants. In addition to the usual positive and negative samples in machine learning, their Ice framework uses implication constraints, which consist of pairs (x, y) such that if x satisfies an invariant, so does y. From these constraints, Ice infers inductive invariants effectively. We observe that the implication constraints in the original Ice framework are not suitable for finding invariants of recursive functions with multiple function calls. We thus generalize the implication constraints to those of the form ({ x1, ⋯ , xk} , y) , which means that if all of x1, ⋯ , xk satisfy an invariant, so does y. We extend their algorithms for inferring likely invariants from samples, verifying the inferred invariants, and generating new samples. We have implemented our method and confirmed its effectiveness through experiments.

Original languageEnglish
Pages (from-to)1393-1418
Number of pages26
JournalJournal of Automated Reasoning
Volume64
Issue number7
DOIs
Publication statusPublished - Oct 1 2020

All Science Journal Classification (ASJC) codes

  • Software
  • Computational Theory and Mathematics
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'ICE-Based Refinement Type Discovery for Higher-Order Functional Programs'. Together they form a unique fingerprint.

Cite this