Conference paper Open Access

Synthesizing Invariants by Solving Solvable Loops

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

Citation Style Language JSON Export

  "publisher": "Zenodo", 
  "DOI": "10.5281/zenodo.893067", 
  "title": "Synthesizing Invariants by Solving Solvable Loops", 
  "issued": {
    "date-parts": [
  "abstract": "<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>", 
  "author": [
      "family": "de Oliveira, Steven"
      "family": "Bensalem, Saddek"
      "family": "Prevosto, Virgile"
  "id": "893067", 
  "event-place": "Pune, India", 
  "type": "paper-conference", 
  "event": "Automated Technology for Verification and Analysis (ATVA)"
All versions This version
Views 111111
Downloads 5050
Data volume 24.3 MB24.3 MB
Unique views 9393
Unique downloads 4747


Cite as