Conference paper Open Access

Certifying Complexity Analysis

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


Citation Style Language JSON Export

{
  "publisher": "Zenodo", 
  "DOI": "10.5281/zenodo.7938773", 
  "author": [
    {
      "family": "Aubert, Cl\u00e9ment"
    }, 
    {
      "family": "Rubiano, Thomas"
    }, 
    {
      "family": "Rusch, Neea"
    }, 
    {
      "family": "Seiller, Thomas"
    }
  ], 
  "issued": {
    "date-parts": [
      [
        2023, 
        1, 
        21
      ]
    ]
  }, 
  "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\u2013and difficult\u2013obstacles \"traditional\" complexity theory face when implemented in Coq.", 
  "title": "Certifying Complexity Analysis", 
  "type": "paper-conference", 
  "id": "7938773"
}
19
7
views
downloads
All versions This version
Views 1919
Downloads 77
Data volume 1.4 MB1.4 MB
Unique views 1919
Unique downloads 77

Share

Cite as