Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs?
Abstract. Monotone algebras are frequently used to generate reduction orders in automated termination and complexity proofs. To be able to certify these proofs, we formalized several kinds of interpretations in the proof assistant Isabelle/HOL. We report on our integration of matrix interpretations,...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Text |
| Language: | English |
| Subjects: | |
| Online Access: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.657.1888 http://www.jaist.ac.jp/%7Ec-sterna/publications/Sternagel-Thiemann-RTA-TLCA14.pdf |
| Summary: | Abstract. Monotone algebras are frequently used to generate reduction orders in automated termination and complexity proofs. To be able to certify these proofs, we formalized several kinds of interpretations in the proof assistant Isabelle/HOL. We report on our integration of matrix interpretations, arctic interpretations, and nonlinear polynomial inter-pretations over various domains, including the reals. 1 |
|---|