Conference paper Open Access

Certifying Complexity Analysis

Aubert, Clément; Rubiano, Thomas; Rusch, Neea; Seiller, Thomas

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.
Files (206.0 kB)
Name Size
certifying-complexity-analysis.pdf
md5:8dc9c1c5848985452e580dc7acc96d4c 		206.0 kB Download
12
6
views
downloads
All versions This version
Views 1212
Downloads 66
Data volume 1.2 MB1.2 MB
Unique views 1212
Unique downloads 66
More info on how stats are collected.
Indexed in
Publication date:
January 21, 2023
DOI:
10.5281/zenodo.7938773

Zenodo DOI Badge

DOI 

10.5281/zenodo.7938773

Markdown 

[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.7938773.svg)](https://doi.org/10.5281/zenodo.7938773)

reStructedText 

.. image:: https://zenodo.org/badge/DOI/10.5281/zenodo.7938773.svg
   :target: https://doi.org/10.5281/zenodo.7938773

HTML 

<a href="https://doi.org/10.5281/zenodo.7938773"><img src="https://zenodo.org/badge/DOI/10.5281/zenodo.7938773.svg" alt="DOI"></a>

Image URL 

https://zenodo.org/badge/DOI/10.5281/zenodo.7938773.svg

Target URL 

https://doi.org/10.5281/zenodo.7938773

License (for files):
Creative Commons Attribution No Derivatives 4.0 International

Versions

Version 1 10.5281/zenodo.7938773 Jan 21, 2023
Cite all versions? You can cite all versions by using the DOI 10.5281/zenodo.7938772. This DOI represents all versions, and will always resolve to the latest one. Read more.

Share

Cite as

Export