Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs

DOI10.1007/978-3-319-08918-8_30zbMath1416.68180OpenAlexW14452780MaRDI QIDQ5170835

Christian Sternagel, René Thiemann

Publication date: 24 July 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08918-8_30

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (6)

Strong eventual consistency of the collaborative editing framework WOOT ⋮ A framework for developing stand-alone certifiers ⋮ An automated approach to the Collatz conjecture ⋮ Multi-dimensional interpretations for termination of term rewriting ⋮ An automated approach to the Collatz conjecture ⋮ Tuple interpretations for termination of term rewriting

Uses Software

• Isabelle
• Isabelle/HOL
• HOL
• Locales

This page was built for publication: Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs