September 15, 2017 Conference paper Open Access

de Oliveira, Steven; Bensalem, Saddek; Prevosto, Virgile

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.893067</identifier>
  <creators>
    <creator>
      <creatorName>de Oliveira, Steven</creatorName>
      <givenName>Steven</givenName>
      <familyName>de Oliveira</familyName>
      <affiliation>CEA, LIST</affiliation>
    </creator>
    <creator>
      <creatorName>Bensalem, Saddek</creatorName>
      <givenName>Saddek</givenName>
      <familyName>Bensalem</familyName>
      <affiliation>Université Grenoble Alpes</affiliation>
    </creator>
    <creator>
      <creatorName>Prevosto, Virgile</creatorName>
      <givenName>Virgile</givenName>
      <familyName>Prevosto</familyName>
      <affiliation>CEA, LIST</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Synthesizing Invariants by Solving Solvable Loops</title>
  </titles>
  <publisher>Zenodo</publisher>
  <publicationYear>2017</publicationYear>
  <subjects>
    <subject>invariant generation</subject>
    <subject>linearization</subject>
    <subject>polynomial mapping</subject>
  </subjects>
  <dates>
    <date dateType="Issued">2017-09-15</date>
  </dates>
  <resourceType resourceTypeGeneral="ConferencePaper"/>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/893067</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.893066</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="https://creativecommons.org/licenses/by-sa/4.0/legalcode">Creative Commons Attribution Share Alike 4.0 International</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">&lt;p&gt;Formal program verification faces two problems. The first&lt;br&gt;
problem is related to the necessity of having automated solvers that are&lt;br&gt;
powerful enough to decide whether a formula holds for a set of proof obli-&lt;br&gt;
gations as large as possible, whereas the second manifests in the need of&lt;br&gt;
finding sufficiently strong invariants to obtain correct proof obligations.&lt;br&gt;
This paper focuses on the second problem and describes a new method&lt;br&gt;
for the automatic generation of loop invariants that handles polynomial&lt;br&gt;
and non deterministic assignments. This technique is based on the eigen-&lt;br&gt;
vector generation for a given linear transformation and on the polynomial&lt;br&gt;
optimization problem, which we implemented on top of the open-source&lt;br&gt;
tool Pilat.&lt;br&gt;
 &lt;/p&gt;</description>
  </descriptions>
  <fundingReferences>
    <fundingReference>
      <funderName>European Commission</funderName>
      <funderIdentifier funderIdentifierType="Crossref Funder ID">10.13039/501100000780</funderIdentifier>
      <awardNumber awardURI="info:eu-repo/grantAgreement/EC/H2020/731453/">731453</awardNumber>
      <awardTitle>VERIFICATION ENGINEERING OF SAFETY AND SECURITY CRITICAL DYNAMIC INDUSTRIAL APPLICATIONS</awardTitle>
    </fundingReference>
  </fundingReferences>
</resource>