R. E. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, vol.35, issue.8, pp.677-691, 1986.
DOI : 10.1109/TC.1986.1676819

P. Cousot, Méthodes itératives de construction et d'approximation de points fixes d'opérateurs monotones sur un treillis, analyse sémantique de programmes, Thèse d' ´ EtatèsEtatès sciences mathématiques, 1978.

P. Cousot, Verification by abstract interpretation on Verification ? Theory & Practice ? Honoring Zohar Manna's 64th Birthday, Proc. Int. Symp, pp.243-268, 2003.

P. Cousot and R. Cousot, Static determination of dynamic properties of programs, Proc. 2 nd Int. Symp. on Programming, pp.106-130, 1976.

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.238-252, 1977.
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/inria-00528590

P. Cousot and R. Cousot, Systematic design of program analysis frameworks, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '79, pp.269-282, 1979.
DOI : 10.1145/567752.567778

P. Cousot and R. Cousot, Abstract Interpretation Frameworks, Journal of Logic and Computation, vol.2, issue.4, pp.511-547, 1992.
DOI : 10.1093/logcom/2.4.511

P. Cousot and R. Cousot, Comparing the Galois connection and widening/narrowing approaches to abstract interpretation, Proc. 4 th Int. Symp. Programming Language Implementation and Logic Programming, PLILP '92, pp.26-28, 1992.
DOI : 10.1007/3-540-55844-6_142

P. Cousot and R. Cousot, Formal language, grammar and set-constraint-based program analysis by abstract interpretation, Proceedings of the seventh international conference on Functional programming languages and computer architecture , FPCA '95, pp.170-181, 1995.
DOI : 10.1145/224164.224199

P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné et al., The Astrée static analyzer

P. Cousot, R. Cousot, and F. Logozzo, A parametric segmentation abstract domain function for the fully automatic and scalable inference of array properties, 2009.

P. Cousot and N. Halbwachs, Automatic discovery of linear restraints among variables of a program, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '78, pp.84-97, 1978.
DOI : 10.1145/512760.512770

S. Graf and H. Sa¨?disa¨?di, Verifying invariants using theorem proving, Proc. 8 th Int. Conf. on Computer Aided Verification, CAV '97, pp.196-207, 1996.
DOI : 10.1007/3-540-61474-5_69
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.6452

P. Granger, Static analysis of arithmetical congruences, International Journal of Computer Mathematics, vol.30, issue.3-4, pp.165-190, 1989.
DOI : 10.1145/29873.29875

L. Mauborgne, Analyse statique et domaines abstraits symboliques. Mémoire d'habilitationàhabilitation`habilitationà diriger les recherches en informatique, 2007.

L. Mauborgne, Abstract interpretation using TDGs, Proc. 1 st Int. Symp. on Static Analysis, SAS '94, pp.20-22, 1994.
DOI : 10.1007/3-540-58485-4_52
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.2130

L. Mauborgne, Abstract interpretation using typed decision graphs, Science of Computer Programming, vol.31, issue.1, pp.91-112, 1998.
DOI : 10.1016/S0167-6423(96)00042-1

L. Mauborgne, Binary Decision Graphs, Proc. 6 th Int. Symp. on Static Analysis, SAS '99, pp.22-24, 1999.
DOI : 10.1007/3-540-48294-6_7

A. Miné, The octagon abstract domain. Higher-Order and Symbolic Computation, pp.31-100, 2006.

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.285-310, 1955.
DOI : 10.2140/pjm.1955.5.285

A. Venet, Abstract cofibered domains: Application to the alias analysis of untyped programs, Static Analysis Symp. (SAS'96), LNCS 1145, 1996.
DOI : 10.1007/3-540-61739-6_53