J. Palsberg and M. Schwartzbach, Object-Oriented Type Inference, OOPSLA'91, pp.146-161
DOI : 10.7146/dpb.v20i345.6575

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

D. Corney and J. Gough, Type test elimination using typeflow analysis, Proceedings of Programming Languages and System Architectures, pp.137-150, 1994.
DOI : 10.1007/3-540-57840-4_29

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Dean, D. Grove, and C. Chambers, Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis, p.95
DOI : 10.1007/3-540-49538-X_5

O. Agesen, J. Palsberg, and M. Schwartzbach, Type inference of SELF: Analysis of objects with dynamic and multiple inheritance, Software: Practice and Experience, vol.4, issue.9, pp.975-995, 1995.
DOI : 10.1002/spe.4380250903

D. Bacon and P. Sweeney, Fast Static Analysis of C++ Virtual Function Calls, OOPSLA'96, pp.324-341, 1996.

S. Collin, D. Colnet, and O. Zendra, Type inference for late binding: The SmallEiffel Compiler, JMLC'97, pp.67-81
DOI : 10.1007/3-540-62599-2_31

URL : https://hal.archives-ouvertes.fr/inria-00563353

O. Zendra, D. Colnet, and C. S. , Efficient Dynamic Dispatch without Virtual Function Tables. The SmallEiffel Compiler, p.97
URL : https://hal.archives-ouvertes.fr/inria-00565627

M. Fähndrich and R. Leino, Declaring and Checking Non-null Types in an Object-Oriented Language, pp.302-312, 2003.

P. Cousot and R. Cousot, Static determination of dynamic properties of programs, 2nd Int. Symp. on Programming, 1976.

R. Gupta, A fresh look at optimizing array bound checking, PLDI 1990, pp.272-282, 1990.
DOI : 10.1145/93548.93581

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

W. Chin and E. Goh, A reexamination of ???Optimization of array subscript range checks???, ACM Transactions on Programming Languages and Systems, vol.17, issue.2, pp.217-227
DOI : 10.1145/201059.201063

C. Flanagan and S. Qadeer, Predicate abstraction for software verification, pp.191-202, 2002.

S. Lahiri, R. Bryant, and B. Cook, A Symbolic Approach to Predicate Abstraction, pp.141-153, 2003.
DOI : 10.1007/978-3-540-45069-6_15

B. Blanchet, P. Cousot, J. Feret, L. Mauborgne, A. Miné et al., A static analyser for large safety-critical software. PLDI, 2003.

S. Lahiri and R. Bryant, Indexed Predicate Discovery for Unbounded System Verification, LNCS, vol.3114, pp.135-147, 2004.
DOI : 10.1007/978-3-540-27813-9_11

A. Bradley, Z. Manna, and H. Sipma, What's decidable about arrays? VMCAI 06, LNCS, vol.3855, pp.427-442, 2006.

D. Beyer, T. Henzinger, R. Majumdar, and A. Rybalchenko, Path invariants. PLDI, pp.300-309, 2007.

R. Jhala and K. Mcmillan, Array Abstractions from Proofs, LNCS, vol.4590, pp.193-206, 2007.
DOI : 10.1007/978-3-540-73368-3_23

R. Iosif, P. Habermehl, and T. Vojnar, What else is decidable about arrays?, FOSSACS 2008, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01418914

N. Halbwachs and M. Péron, Discovering Properties about Arrays in Simple Programs. PLDI, pp.339-352, 2008.
DOI : 10.1145/1375581.1375623

URL : https://hal.archives-ouvertes.fr/hal-00288274

M. Ellis and B. Stroustrup, The Annotated C++ Reference Manual, 1990.

K. Driesen and U. Hölzle, The Direct Cost of Virtual Function Calls in C++, OOPSLA'96, pp.306-323, 1996.

B. Sonntag and D. Colnet, Lisaac: the power of simplicity at work for operating system. TOOLS Pacific, pp.45-52, 2002.

O. Zendra and D. Colnet, Adding external iterators to an existing Eiffel class library. TOOLS Pacific'99, pp.188-199
URL : https://hal.archives-ouvertes.fr/inria-00098784

R. Jones and R. Lins, Garbage Collection, 1996.

D. Colnet, P. Coucaud, and O. Zendra, Compiler Support to Customize the Mark and Sweep Algorithm, pp.154-165