]. B. Bcc-+-03, P. Blanchet, R. Cousot, J. Cousot, L. Feret et al., A static analyzer for large safety-critical software, ACM SIGPLAN SIGSOFT Conference on Programming Language Design and Implementation, PLDI 2003, pp.196-207, 2003.

S. Bardin, A. Finkel, J. Leroux, and L. Petrucci, FAST: Fast Acceleration of Symbolic Transition Systems, CAV'03, pp.118-121, 2003.
DOI : 10.1007/978-3-540-45069-6_12
URL : https://hal.archives-ouvertes.fr/hal-00084185

T. Bultan, R. Gerber, and W. Pugh, Symbolic model checking of infinite state systems using presburger arithmetic, Computer Aided Verification, CAV'97, 1997.
DOI : 10.1007/3-540-63166-6_39
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.6057

R. Bagnara, P. M. Hill, E. Ricci, and E. Zaffanella, Precise Widening Operators for Convex Polyhedra, Static Analysis: Proceedings of the 10th International Symposium, pp.337-354, 2003.
DOI : 10.1007/3-540-44898-5_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.7610

F. [. Bourdoncle, R. Cousot, and . Cousot, Efficient chaotic iterations strategies with widening Static determination of dynamic properties of programs Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, International Conference on Formal Methods in Programming and their applications 2nd Int. Symp. on Programming 4th ACM Symposium on Principles of Programming Languages, POPL'77, pp.128-141, 1976.

A. Costan, S. Gaubert, E. Goubault, M. Martel, and S. Putot, A policy iteration algorithm for computing fixed points in static analysis of programs Automatic discovery of linear restraints among variables of a program, CAV 2005 5th ACM Symposium on Principles of Programming Languages, POPL'78, pp.462-475, 1978.

H. Comon, Y. Jurskicz11, ]. Cortesi, and M. Zanioli, Multiple counters automata, safety analysis and Presburger arithmetic Widening and narrowing operators for abstract interpretation Combining widening and acceleration in linear relation analysis, CAV'98 13th International Static Analysis Symposium, SAS'06, pp.24-42, 1998.

E. Goubault, . [. Static, T. Gopan, . [. Reps, H. Gawlitza et al., Lookahead widening [GR07] Denis Gopan and Thomas W. Reps. Guided static analysis Precise fixpoint computation through strategy iteration Delay analysis in synchronous programs, SAS CAV'06 SAS 2007 ESOP 2007Hal93] N. Halbwachs Fifth Conference on Computer-Aided Verification, CAV'93, Elounda (Greece), pp.234-259, 1993.

N. Halbwachs, Y. E. Proy, P. [. Roumanoff, A. Jeannet, V. Miné-lattner et al., Verification of real-time systems using linear relation analysis Apron: a library of numerical abstract domains for static analysis LLVM: a compilation framework fopr lifelong program analysis & transformation, CAV'09 CGO'04, pp.157-185, 1997.
DOI : 10.1023/A:1008678014487

L. Lakhdar-chaouch, B. Jeannet, A. [. Girault, J. Monniaux, and . Le-guen, Widening with thresholds for programs with complex control graphs Stratified static analysis based on variable dependencies, Automated Technology for Verification and Analysis, ATVA 2011Min04] A. Miné. Weakly relational numerical abstract domains Third International Workshop on Numerical and Symbolic Abstract Domains, pp.492-502, 2004.

E. [. Putot, M. Goubault, and . Martel, Static Analysis-Based Validation of Floating-Point Computations, Numerical Software with Result Verification, pp.306-313, 2003.
DOI : 10.1007/978-3-540-24738-8_18

S. Sankaranarayanan, H. Sipma, and Z. Manna, Constraintbased linear relations analysis, International Symposium on Static Analysis, pp.53-68, 2004.

S. Sankaranarayanan, H. Sipma, and Z. Manna, Scalable Analysis of Linear Systems Using Mathematical Programming, 6th International Conference on Verification, Model-checking, and Abstract Intepretation , VMCAI'05, 2005.
DOI : 10.1007/978-3-540-30579-8_2

Z. Su, D. E. Wagnertar72-]-r, and . Tarjan, A class of polynomially solvable range constraints for interval analysis without widenings and narrowings Depth-first search and linear graph algorithms Verifying systems with infinite but regular state spaces, TACAS'04 CAV'98, pp.280-295146, 1972.

C. Wang, Z. Yang, A. Gupta, and F. Ivan?i´ivan?i´c, Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra, CAV 2007, pp.352-365, 2007.
DOI : 10.1007/978-3-540-73368-3_40