C. R. Alur, N. Courcoubetis, T. Halbwachs, P. Henzinger, X. Ho et al., The algorithmic analysis of hybrid systems, Theoretical Computer Science, vol.138, issue.1, pp.3-34, 1995.
DOI : 10.1016/0304-3975(94)00202-T

. Bbc-+-00-]-n, A. Bjorner, M. Browne, B. Colon, Z. Finkbeiner et al., Verifying temporal properties of reactive systems: A STeP tutorial, Formal Methods in System Design, vol.16, pp.227-270, 2000.

N. Bjorner, I. A. Browne, and Z. Manna, Automatic generation of invariants and intermediate assertions, Theoretical Computer Science, vol.173, issue.1, pp.49-87, 1997.
DOI : 10.1016/S0304-3975(96)00191-0

]. B. Bcc-+-03, P. Blanchet, R. Cousot, J. Cousot, L. Feret et al., A static analyzer for large safety-critical software, 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

R. Bagnara, P. M. Hill, E. Ricci, E. Zaffanellabou92-]-f, . [. Bourdoncle et al., Precise Widening Operators for Convex Polyhedra, Static Analysis: Proceedings of the 10th International Symposium. [Boi99] B. Boigelot. Symbolic methods for exploring infinite state spaces CAV'94, Stanford (Ca.), 1994 4th ACM Symposium on Principles of Programming Languages, POPL'77CH78] P. Cousot and N. Halbwachs 5th ACM Symposium on Principles of Programming Languages, POPL'78, pp.337-354, 1977.
DOI : 10.1007/3-540-44898-5_19

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

Z. Chaochen, C. A. Hoare, and A. P. Ravn, A calculus of durations Multiple counters automata, safety analysis and Presburger arithmetic, CAV'98, 1991.

N. Dor, M. Rodeh, M. Sagivfl02, ]. Finkel, and J. Leroux, Cleanness checking of string manipulations in C programs via integer analysis How to compose Presburger-accelerations: Applications to broadcast protocols, SAS'01 Proceedings of the 22nd Conf. Found. of Software Technology and Theor. Comp. Sci. (FSTTCS'2002 25th Int. Symp. Math. Found. Comp, pp.145-156, 2001.

]. D. Scigr06, T. Gopan, and . Reps, Lookahead widening Détermination automatique de relations linéaires vérifiées par les variables d'un programme Decidable and undecidable problems in matrix theory, Thèse detroisì eme cycleHal97] Vesa Halava, 1979.

T. A. Henzinger, P. Ho, and H. Wong-toi, HYTECH: a??model checker for hybrid systems, International Journal on Software Tools for Technology Transfer, vol.1, issue.1-2, pp.110-122, 1997.
DOI : 10.1007/s100090050008

N. Halbwachs, Y. E. Proy, P. Roumanoff, F. Irigoin, P. Jouvelot et al., Verification of real-time systems using linear relation analysis Formal Methods in System Design Semantical interprocedural parallelization: An overview of the PIPS project [Iri05] F. Irigoin Detecting affine loop invariants using modular static analysis Sriram Sankaranarayanan, Henny Sipma, and Zohar Manna. Constraintbased linear relations analysis A class of polynomially solvable range constraints for interval analysis without widenings and narrowings Depth-first search and linear graph algorithms Termination of linear programs, ACM Int. Conf. on Supercomputing , ICS'91 International Symposium on Static Analysis TACAS'04 Computer-Aided Verification, CAVWB98] P. Wolper and B. Boigelot. Verifying systems with infinite but regular state spaces. In CAV'98, pp.157-185, 1972.