Certifying Complexity Analysis - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2023

Certifying Complexity Analysis

Clément Aubert
Thomas Rubiano
Neea Rusch
Thomas Seiller

Abstract

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.
Fichier principal
Vignette du fichier
main.pdf (101.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Licence : CC BY - Attribution

Dates and versions

hal-04083105 , version 1 (26-04-2023)

Licence

Attribution

Identifiers

  • HAL Id : hal-04083105 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More