Certified Static Analysis by Abstract Interpretation

Authors:
Frédéric Besson;David Cachera;Thomas Jensen;David Pichardie
Affiliations:
INRIA Rennes, Rennes Cedex, France 35042;ENS Cachan (Bretagne), Bruz, France 35170;CNRS, Rennes Cedex, France 35042;INRIA Rennes, Rennes Cedex, France 35042
Venue:
Foundations of Security Analysis and Design V
Year:
2009

Citing 0
Cited 4

Verified squared: does critical software deserve verified tools?

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Certifying execution time

FOPARA'11 Proceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis
A formally-verified alias analysis

CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
Proofs you can believe in: proving equivalences between Prolog semantics in Coq

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

A certified static analysis is an analysis whose semantic validity has been formally proved correct with a proof assistant. We propose a tutorial on building a certified static analysis in Coq. We study a simple bytecode language for which we propose an interval analysis that allows to verify statically that no array-out-of-bounds accesses will occur.