2018/06/12 by Yutaka Nagashima, Nagashima, Yutaka, Julian Parsert +1 · 2 citations
Computer Science · #Logic, programming, and type systems #Formal Methods in Verification #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1806.04774
We present PGT, a Proof Goal Transformer for Isabelle/HOL. Given a proof goal and its background context, PGT attempts to generate conjectures from the original goal by transforming the original proof goal. These conjectures should be weak enough to be provable by automation but sufficiently strong to prove the original goal. By incorporating PGT into the pre-existing PSL framework, we exploit Isabelle's strong automation to identify and prove such conjectures.