January 21, 2023 Conference paper Open Access

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

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Aubert, Clément</dc:creator>
  <dc:creator>Rubiano, Thomas</dc:creator>
  <dc:creator>Rusch, Neea</dc:creator>
  <dc:creator>Seiller, Thomas</dc:creator>
  <dc:date>2023-01-21</dc:date>
  <dc: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–and difficult–obstacles "traditional" complexity theory face when implemented in Coq.</dc:description>
  <dc:identifier>https://zenodo.org/record/7938773</dc:identifier>
  <dc:identifier>10.5281/zenodo.7938773</dc:identifier>
  <dc:identifier>oai:zenodo.org:7938773</dc:identifier>
  <dc:relation>doi:10.5281/zenodo.7938772</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nd/4.0/legalcode</dc:rights>
  <dc:title>Certifying Complexity Analysis</dc:title>
  <dc:type>info:eu-repo/semantics/conferencePaper</dc:type>
  <dc:type>publication-conferencepaper</dc:type>
</oai_dc:dc>