T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, 2001.

P. Cousot and R. Cousot, Static Determination of Dynamic Properties of Programs, Second Int. Symp. on Programming, pp.106-130, 1976.

P. Cousot and R. Cousot, Comparison of the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation, JTASPEFL '91, pp.107-110, 1991.

P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné et al., The ASTRÉEASTR´ASTRÉE Analyser, European Symposium on Programming (ESOP), pp.21-30, 2005.

T. Gawlitza and H. Seidl, Precise Fixpoint Computation Through Strategy Iteration, European Symposium on Programming (ESOP), pp.300-315, 2007.
DOI : 10.1007/978-3-540-71316-6_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.153

D. E. Knuth, A generalization of Dijkstra's algorithm, Information Processing Letters, vol.6, issue.1, pp.1-5, 1977.
DOI : 10.1016/0020-0190(77)90002-3

J. Leroux and G. Sutre, Accelerated Data-Flow Analysis, Static Analysis, 14th Int. Symp. (SAS), pp.184-199, 2007.
DOI : 10.1007/978-3-540-74061-2_12
URL : https://hal.archives-ouvertes.fr/hal-00346005

A. Miné, Relational Abstract Domains for the Detection of Floating-Point Run-Time Errors, European Symposium on Programming (ESOP), pp.3-17, 2004.
DOI : 10.1007/978-3-540-24725-8_2

A. Miné, Symbolic Methods to Enhance the Precision of Numerical Abstract Domains, Verification, Model Checking, and Abstract Interpretation, 7th Int. Conf. (VMCAI), pp.348-363, 2006.
DOI : 10.1007/11609773_23

H. Seidl, Least and Greatest Solutions of Equations over N, Nordic Journal of Computing (NJC), vol.3, issue.1, pp.41-62, 1996.

Z. Su and D. Wagner, A class of polynomially solvable range constraints for interval analysis without widenings, Theoretical Computer Science, vol.345, issue.1, pp.122-138, 2005.
DOI : 10.1016/j.tcs.2005.07.035