January 21, 2023 Conference paper Open Access

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

JSON-LD (schema.org) Export

{
  "description": "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.", 
  "license": "https://creativecommons.org/licenses/by-nd/4.0/legalcode", 
  "creator": [
    {
      "@id": "https://orcid.org/0000-0001-6346-3043", 
      "@type": "Person", 
      "name": "Aubert, Cl\u00e9ment"
    }, 
    {
      "@type": "Person", 
      "name": "Rubiano, Thomas"
    }, 
    {
      "@type": "Person", 
      "name": "Rusch, Neea"
    }, 
    {
      "@type": "Person", 
      "name": "Seiller, Thomas"
    }
  ], 
  "headline": "Certifying Complexity Analysis", 
  "image": "https://zenodo.org/static/img/logos/zenodo-gradient-round.svg", 
  "datePublished": "2023-01-21", 
  "url": "https://zenodo.org/record/7938773", 
  "@context": "https://schema.org/", 
  "identifier": "https://doi.org/10.5281/zenodo.7938773", 
  "@id": "https://doi.org/10.5281/zenodo.7938773", 
  "@type": "ScholarlyArticle", 
  "name": "Certifying Complexity Analysis"
}