An Isabelle/HOL formalization of AProVE’s termination method for LLVM IR

Haslbeck, Max W.; Thiemann, René

doi:10.1145/3437992.3439935

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, algorithmic methods were implemented using this library, and from that, they extracted the verified termination checker called CeTA [13]. More recent efforts have also been put in formalizing other tools, for instance, Thiemann and Sternagel developed a verified tool for certifying AProVE's termination proofs of LLVM IR programs [13,6].…”

Section: Introductionmentioning

confidence: 99%

Formalizing Higher-Order Termination in Coq

Vale¹,

Weide²

2021

Preprint

View full text Add to dashboard Cite

We describe a formalization of higher-order rewriting theory and formally prove that an AFS is strongly normalizing if it can be interpreted in a well-founded domain. To do so, we use Coq, which is a proof assistant based on dependent type theory. Using this formalization, one can implement several termination techniques, like the interpretation method or dependency pairs, and prove their correctness. Those implementations can then be extracted to OCaml, which results in a verified termination checker.

show abstract

Section: Introductionmentioning

confidence: 99%