Skip to Main content Skip to Navigation
New interface
Conference papers

Certified Result Checking for Polyhedral Analysis of Bytecode Programs

Frédéric Besson 1 Thomas Jensen 1 David Pichardie 1 Tiphaine Turpin 1 
1 CELTIQUE - Software certification with semantic analysis
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
Abstract : Static analysers are becoming so complex that it is crucial to ascertain the soundness of their results in a provable way. In this paper we develop a certified checker in Coq that is able to certify the results of a polyhedral array-bound analysis for an imperative, stack-oriented bytecode language with procedures, arrays and global variables. The checker uses, in addition to the analysis result, certificates which at the same time improve efficiency and make correctness proofs much easier. In particular, our result certifier avoids complex polyhedral computations such as convex hulls and is using easily checkable inclusion certificates based on Farkas lemma. Benchmarks demonstrate that our approach is effective and produces certificates that can be efficiently checked not only by an extracted Caml checker but also directly in Coq.
Document type :
Conference papers
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : David Pichardie Connect in order to contact the contributor
Submitted on : Friday, November 19, 2010 - 2:15:58 PM
Last modification on : Thursday, January 20, 2022 - 4:20:13 PM
Long-term archiving on: : Friday, October 26, 2012 - 4:01:51 PM


Files produced by the author(s)


  • HAL Id : inria-00537816, version 1


Frédéric Besson, Thomas Jensen, David Pichardie, Tiphaine Turpin. Certified Result Checking for Polyhedral Analysis of Bytecode Programs. The 5th International Symposium on Trustworthy Global Computing (TGC), 2010, Munich, Germany. ⟨inria-00537816⟩



Record views


Files downloads