Skip to the content.

Template-Based Conjecturing for Automated Induction in Isabelle/HOL

Abstract

Proof by induction plays a central role in formal verification. However, its automation remains as a formidable challenge in Computer Science. To solve inductive problems, human engineers often have to provide auxiliary lemmas manually. We automate this laborious process with template-based conjecturing, a novel approach to generate auxiliary lemmas and use them to prove final goals. Our evaluation shows that our working prototype, TBC, achieved 50% point improvement of success rates for problems at intermediate difficulty level.

Project Dependency Graph

is part of

is used in

is realised in

should be used in

is used in

is used in

is used in

is used in

is used in

evolves to

is used in

evolves to

is used in

is used in

should be used in

is used in

is used in

is used in

integrates

VerifyC

Refinement

VeriFile

TowardsEvo

GeneticSyn

PSL

GoalOriented

TemplateBased

LiFtEr

SeLFiE

SmartInduct

SmarterInduct

PaMpeR

SimpleData

Abduction

Mindmap

Mindmap for TemplateBased at FSEN2023