Certifying Complexity Analysis

Clément Aubert (1) , Thomas Rubiano , Neea Rusch , Thomas Seiller

1 Augusta University

This work drafts a strategy that leverages the field of Implicit Computational Complexity to certify resource usage in imperative programs. This original approach sidesteps some of the most common–and difficult–obstacles “traditional” complexity theory face when implemented in Coq.

Mots clés: Theory of computation; Program verification; Program verification in Coq; Complexity theory and logic

Domaines: Complexité [cs.CC]

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller. Certifying Complexity Analysis. 2023. ⟨hal-04083105⟩