Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
This video presents a research talk from the CPP 2025 conference detailing an Isabelle/HOL formalization of co-rewrite pairs for analyzing non-reachability in term rewriting systems. Explore how researchers Dohan Kim, Teppei Saito, René Thiemann, and Akihisa Yamada formalized polynomial interpretations over negative integers along with weighted path order (WPO) and its co-WPO variant. Learn about how this formalization enables the verified certifier CeTA to check non-reachability proofs, including those for previously unsolved problems in existing databases. The 31-minute presentation, sponsored by ACM SIGPLAN and ACM SIGLOG, includes discussion of term rewriting techniques with supplementary materials available on the project's web page.
