Certified result checking for polyhedral analysis of bytecode programs

Authors:
Frédéric Besson;Thomas Jensen;David Pichardie;Tiphaine Turpin
Affiliations:
INRIA Rennes, Rennes, France;INRIA Rennes, Rennes, France;INRIA Rennes, Rennes, France;INRIA Rennes, Rennes, France
Venue:
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Year:
2010

Citing 17
Cited 1

Software reliability via run-time result-checking

Journal of the ACM (JACM)
Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A compiled implementation of strong reduction

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Verified bytecode verifiers

Theoretical Computer Science - Foundations of software science and computation structures
Towards array bound check elimination in Java TM virtual machine language

CASCON '99 Proceedings of the 1999 conference of the Centre for Advanced Studies on Collaborative research
Imperative Programming with Dependent Types

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Precise interprocedural analysis through linear algebra

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formal certification of a compiler back-end or: programming a compiler with a proof assistant

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The octagon abstract domain

Higher-Order and Symbolic Computation
Towards a mechanized metatheory of standard ML

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extracting a data flow analyser in constructive logic

Theoretical Computer Science - Applied semantics: Selected topics
Bytecode Analysis for Proof Carrying Code

Electronic Notes in Theoretical Computer Science (ENTCS)
Small witnesses for abstract interpretation-based proofs

ESOP'07 Proceedings of the 16th European conference on Programming
Fast reflexive arithmetic tactics the linear case and beyond

TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
The ASTREÉ analyzer

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Asserting bytecode safety

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems

Inference of polynomial invariants for imperative programs: a farewell to gröbner bases

SAS'12 Proceedings of the 19th international conference on Static Analysis

Quantified Score

Hi-index	0.00

Visualization

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.