Smart Induction for Isabelle/HOL (System Description)

01/27/2020
by   Yutaka Nagashima, et al.
0

Proof assistants offer tactics to facilitate inductive proofs. However, it still requires human ingenuity to decide what arguments to pass to those induction tactics. To automate this process, we present smart_induct for Isabelle/HOL. Given an inductive problem in any problem domain, smart_induct lists promising arguments for the induct tactic without relying on a search. Our evaluation demonstrated smart_induct produces valuable recommendations across problem domains.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/19/2020

Faster Smarter Induction in Isabelle/HOL

We present semantic_induct, an automatic tool to recommend how to apply ...
research
10/19/2020

SeLFiE: Modular Semantic Reasoning for Induction in Isabelle/HOL

Proof assistants offer tactics to apply proof by induction, but these ta...
research
12/04/2018

Towards Machine Learning Mathematical Induction

Mathematical induction lies at the heart of mathematics and computer sci...
research
11/20/2022

Template-Based Conjecturing for Automated Induction in Isabelle/HOL

Proof by induction plays a central role in formal verification. However,...
research
06/19/2019

LiFtEr: Language to Encode Induction Heuristics for Isabelle/HOL

Proof assistants, such as Isabelle/HOL, offer tools to facilitate induct...
research
02/28/2020

Providing Hints, Next Steps and Feedback in a Tutoring System for Structural Induction

Structural induction is a proof technique that is widely used to prove s...
research
06/29/2019

Domain-Specific Language to Encode Induction Heuristics

Proof assistants, such as Isabelle/HOL, offer tools to facilitate induct...

Please sign up or login with your details

Forgot password? Click here to reset