January 21, 2023 Conference paper Open Access

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

DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="DOI">10.5281/zenodo.7938773</identifier>
  <creators>
    <creator>
      <creatorName>Aubert, Clément</creatorName>
      <givenName>Clément</givenName>
      <familyName>Aubert</familyName>
      <nameIdentifier nameIdentifierScheme="ORCID" schemeURI="http://orcid.org/">0000-0001-6346-3043</nameIdentifier>
    </creator>
    <creator>
      <creatorName>Rubiano, Thomas</creatorName>
      <givenName>Thomas</givenName>
      <familyName>Rubiano</familyName>
    </creator>
    <creator>
      <creatorName>Rusch, Neea</creatorName>
      <givenName>Neea</givenName>
      <familyName>Rusch</familyName>
    </creator>
    <creator>
      <creatorName>Seiller, Thomas</creatorName>
      <givenName>Thomas</givenName>
      <familyName>Seiller</familyName>
    </creator>
  </creators>
  <titles>
    <title>Certifying Complexity Analysis</title>
  </titles>
  <publisher>Zenodo</publisher>
  <publicationYear>2023</publicationYear>
  <dates>
    <date dateType="Issued">2023-01-21</date>
  </dates>
  <resourceType resourceTypeGeneral="ConferencePaper"/>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/7938773</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.7938772</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="https://creativecommons.org/licenses/by-nd/4.0/legalcode">Creative Commons Attribution No Derivatives 4.0 International</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="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.</description>
  </descriptions>
</resource>