Certified rule labeling
View/ Open
Volume
36
Pagination
269 - 284
ISBN-13
9783939897859
DOI
10.4230/LIPIcs.RTA.2015.269
ISSN
1868-8969
Metadata
Show full item recordAbstract
© Julian Nagele and Harald Zankl. The rule labeling heuristic aims to establish confluence of (left-)linear term rewrite systems via decreasing diagrams. We present a formalization of a confluence criterion based on the interplay of relative termination and the rule labeling in the theorem prover Isabelle. Moreover, we report on the integration of this result into the certifier CeTA, facilitating the checking of confluence certificates based on decreasing diagrams for the first time. The power of the method is illustrated by an experimental evaluation on a (standard) collection of confluence problems.