General
This site provides supporting material for the paper Certifying the Weighted Path Order by René Thiemann, Jonas Schöpf, Christian Sternagel and Akihisa Yamada.Formalization
Our Isabelle formalization is part of IsaFoR/CeTA version 2.39 which compiles with Isabelle 2020 and a corresponding Archive of Formal Proofs. Below we provide links between Isabelle snippets of the paper and the actual formalization in IsaFoR.Section 2
-
The
locale redpair S NSin the paper is actuallylocale redtriple S NS NSwhere several definitions of previous locales have been expanded. -
The
locale redpair_order S NSin the paper is actuallylocale redtriple_order S NS NS, again with some definitions expanded. - Similarly,
locale ce_af_redpair_orderin the paper correponds tolocale ce_af_redtriple_order.
Section 3
-
locale wpo_params -
theorem "redpair_order WPO_S WPO_NS"is actually namedtheorem wpo_redtriple_order. -
lemma wpo_af_compatible -
lemma wpo_ce_af_redtriple_order -
The
generic_reduction_pairin the paper is actually the more generic and more complexlocale generic_redtriple_impl.
Section 4
-
datatype sig -
primrec I -
definition le_via_IA -
definition less_via_IA -
lemma le_via_IA -
lemma less_via_IA
Section 5
Experimental Results
TPDB Results from StarExec
We have tested two termination tools which have an implementation of WPO on the benchmarks of the TPDB:- The Nagoya Termination Tool (NaTT; version 1.6c) in its competition setting and a certifiable version with most of the nontermination techniques disabled.
- The Tyrolean Termination Tool 2 (TTT2; version 1.20) with a special (certifiable) competition configuration with and without WPO.
The results can be found here: StarExec experiments