Large Lemma Miners: Can LLMs Do Induction Proofs for Hardware?
Romy Peled, Daniel Kroening, Michael Tautschnig, Yakir Vizel
Abstract
Large Language Models (LLMs) have shown potential for solving mathematical tasks. We show that LLMs can be utilized to generate proofs by induction for hardware verification and thereby replace some of the manual work %alleviating some of the manual effort done by Formal Verification engineers and deliver value to industry. We present a neurosymbolic approach that includes two prompting frameworks to generate candidate invariants, which are checked using a formal symbolic tool. Our results indicate that with sufficient reprompting, LLMs are able to generate inductive arguments for mid-size open-source RTL designs. For 90% of our problem set, at least one of the prompt setups succeeded in producing a provably correct inductive argument.
BibTeX
@inproceedings{ijcai2026_largelemmaminers,
title = {Large Lemma Miners: Can LLMs Do Induction Proofs for Hardware?},
author = {Romy Peled and Daniel Kroening and Michael Tautschnig and Yakir Vizel},
booktitle = {IJCAI 2026},
year = {2026}
}