Polynomial invariants by linear algebra

Steven de Oliveira, Saddek Bensalem, Virgile Prevosto

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present in this paper a new technique for generating polynomial invariants, divided in two independent parts: a procedure that reduces polynomial assignments composed loops analysis to linear loops under certain hypotheses and a procedure for generating inductive invariants for linear loops. Both of these techniques have a polynomial complexity for a bounded number of variables and we guarantee the completeness of the technique for a bounded degree which we successfully implemented for C programs verification.

Original languageEnglish
Title of host publicationAutomated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016, Proceedings
EditorsCyrille Artho, Doron Peled, Axel Legay
PublisherSpringer Verlag
Pages479-494
Number of pages16
ISBN (Print)9783319465197
DOIs
Publication statusPublished - 1 Jan 2016
Externally publishedYes
Event14th International Symposium on Automated Technology for Verification and Analysis, ATVA 2016 - Chiba, Japan
Duration: 17 Oct 201620 Oct 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9938 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Symposium on Automated Technology for Verification and Analysis, ATVA 2016
Country/TerritoryJapan
CityChiba
Period17/10/1620/10/16

Fingerprint

Dive into the research topics of 'Polynomial invariants by linear algebra'. Together they form a unique fingerprint.

Cite this