Template-Based Conjecturing for Automated Induction in Isabelle/HOL
Logic in Computer Science
2023-01-23 v2
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 40 percentage point improvement of success rates for problems at intermediate difficulty level.
Cite
@article{arxiv.2212.11151,
title = {Template-Based Conjecturing for Automated Induction in Isabelle/HOL},
author = {Yutaka Nagashima and Zijin Xu and Ningli Wang and Daniel Sebastian Goc and James Bang},
journal= {arXiv preprint arXiv:2212.11151},
year = {2023}
}
Comments
To appear at Fundamentals of Software engineering 2023 (http://fsen.ir/2023/)