René Thiemann and Jonas Schöpf and Christian Sternagel and Akihisa Yamada, Thiemann, René, Schöpf, Jonas, Sternagel, Christian, Yamada, Akihisa, René Thiemann and Jonas Schöpf and Christian Sternagel and Akihisa Yamada, Thiemann, René, Schöpf, Jonas, Sternagel, Christian, and Yamada, Akihisa
The weighted path order (WPO) unifies and extends several termination proving techniques that are known in term rewriting. Consequently, the first tool implementing WPO could prove termination of rewrite systems for which all previous tools failed. However, we should not blindly trust such results, since there might be problems with the implementation or the paper proof of WPO. In this work, we increase the reliability of these automatically generated proofs. To this end, we first formally prove the properties of WPO in Isabelle/HOL, and then develop a verified algorithm to certify termination proofs that are generated by tools using WPO. We also include support for max-polynomial interpretations, an important ingredient in WPO. Here we establish a connection to an existing verified SMT solver. Moreover, we extend the termination tools NaTT and TTT2, so that they can now generate certifiable WPO proofs.