September 15, 2017 Conference paper Open Access

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

JSON-LD (schema.org) Export

{
  "description": "<p>Formal program verification faces two problems. The first<br>\nproblem is related to the necessity of having automated solvers that are<br>\npowerful enough to decide whether a formula holds for a set of proof obli-<br>\ngations as large as possible, whereas the second manifests in the need of<br>\nfinding sufficiently strong invariants to obtain correct proof obligations.<br>\nThis paper focuses on the second problem and describes a new method<br>\nfor the automatic generation of loop invariants that handles polynomial<br>\nand non deterministic assignments. This technique is based on the eigen-<br>\nvector generation for a given linear transformation and on the polynomial<br>\noptimization problem, which we implemented on top of the open-source<br>\ntool Pilat.<br>\n\u00a0</p>", 
  "license": "https://creativecommons.org/licenses/by-sa/4.0/legalcode", 
  "creator": [
    {
      "affiliation": "CEA, LIST", 
      "@type": "Person", 
      "name": "de Oliveira, Steven"
    }, 
    {
      "affiliation": "Universit\u00e9 Grenoble Alpes", 
      "@type": "Person", 
      "name": "Bensalem, Saddek"
    }, 
    {
      "affiliation": "CEA, LIST", 
      "@type": "Person", 
      "name": "Prevosto, Virgile"
    }
  ], 
  "headline": "Synthesizing Invariants by Solving Solvable Loops", 
  "image": "https://zenodo.org/static/img/logos/zenodo-gradient-round.svg", 
  "datePublished": "2017-09-15", 
  "url": "https://zenodo.org/record/893067", 
  "keywords": [
    "invariant generation", 
    "linearization", 
    "polynomial mapping"
  ], 
  "@context": "https://schema.org/", 
  "identifier": "https://doi.org/10.5281/zenodo.893067", 
  "@id": "https://doi.org/10.5281/zenodo.893067", 
  "@type": "ScholarlyArticle", 
  "name": "Synthesizing Invariants by Solving Solvable Loops"
}