inria-00266171, version 2
Semantic foundations and inference of non-null annotations
Laurent Hubert
a, 1Thomas Jensen
a, 1David Pichardie
b, 1
N° RR-6482 (2008)
Abstract: This paper proposes a semantics-based automatic null pointer analysis for inferring non-null annotations of fields in object-oriented programs. The analysis is formulated for a minimalistic OO language and is expressed as a constraint-based abstract interpretation of the program which for each field of a class infers whether the field is definitely non-null or possibly null after object initialization. The analysis is proved correct with respect to an operational semantics of the minimalistic OO language. This correctness proof has been machine checked using the Coq proof assistant. We also prove the analysis complete with respect to the non-null type system proposed by Fähndrich and Leino, in the sense that for every typable program the analysis is able to prove the absence of null dereferences without any hand-written annotations. Experiments with a prototype implementation of the analysis show that the inference is feasible for large programs.
- a – CNRS
- b – INRIA
- 1: LANDE (INRIA - IRISA)
- CNRS : UMR6074 – INRIA – INSA Rennes – Université de Rennes 1
- Domain : Computer Science/Programming Languages
- Keywords : program analysis – automated program proving – machine checked proofs – operational semantics
- Internal note : RR-6482
- Available versions : v1 (2008-03-22) v2 (2008-03-25)
- inria-00266171, version 2
- http://hal.inria.fr/inria-00266171
- oai:hal.inria.fr:inria-00266171
- From: Laurent Hubert
- Submitted on: Tuesday, 25 March 2008 11:09:22
- Updated on: Tuesday, 1 April 2008 09:53:33






Associated documents
Export