Result certification for relational program analysis

Frédéric Besson 1 Thomas Jensen 1 David Pichardie 1 Tiphaine Turpin 1
1 Lande - Logiciel : ANalyse et DEveloppement
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : We define a generic relational program analysis for an imperative, stack-oriented byte code language with procedures, arrays and global variables and instantiate it with an abstract domain of polyhedra. The analysis has automatic inference of loop invariants and method pre-/post-conditions, and efficient checking of analysis results by a simple checker. Invariants, which can be large, can be specialized for proving a safety policy using an automatic pruning technique which reduces their size. The result of the analysis can be checked efficiently by annotating the program with parts of the invariant together with certificates of polyhedral inclusions, which allow to avoid certain complex polyhedral computation such as the convex hull of two polyhedra. Small, easily checkable inclusion certificates are obtained using Farkas lemma for proving the absence of solutions to systems of linear inequalities. The resulting checker is sufficiently simple to be entirely certified within the Coq proof assistant.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00166930
Contributor : Rapport de Recherche Inria <>
Submitted on : Thursday, October 25, 2007 - 10:12:18 AM
Last modification on : Friday, November 16, 2018 - 1:28:19 AM
Long-term archiving on : Friday, November 25, 2016 - 6:07:31 PM

Files

RR-6333.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00166930, version 4

Citation

Frédéric Besson, Thomas Jensen, David Pichardie, Tiphaine Turpin. Result certification for relational program analysis. [Research Report] RR-6333, INRIA. 2007, pp.32. ⟨inria-00166930v4⟩

Share

Metrics

Record views

759

Files downloads

151