. [. Bibliographie, E. Annichini, A. Asarin, and . Bouajjani, Symbolic techniques for parametric reasoning about counter and clock systems, Computer Aided Verification, pp.419-434, 2000.

C. R. Alur, N. Courcoubetis, T. Halbwachs, P. Henzinger, X. Ho et al., The algorithmic analysis of hybrid systems, ICALP'90, pp.3-34, 1990.
DOI : 10.1016/0304-3975(94)00202-T

O. [. Asarin, A. Maler, F. Pnueliams06-]-k.-altisen, D. Maraninchi, and . Stauch, Reachability analysis of dynamical systems having piecewise-constant derivatives Aspect-oriented programming for reactive systems : Larissa, a proposal in the synchronous framework, Theoretical Computer Science Science of Computer Programming, Special Issue on Foundations of Aspect-Oriented Programming, vol.138, issue.633, pp.35-65, 1995.

S. Bardin, A. Finkel, J. Leroux, P. Schnoebelenbar05-]-s, T. Bardin et al., Flat acceleration in symbolic model checking Vers un model checking avec accélération plate de systèmes hétérogènes Efficient symbolic representations for arithmetic constraints in verification, Proceedings of the 3rd International Symposium on Automated Technology for Verification and Analysis (ATVA'05), volume 3707 of Lecture Notes in Computer Science International Journal of Foundations of Computer Science (IJFCS), special issue on Verification and Analysis of Infinite State Systems, pp.474-488, 2003.

]. A. Bbh-+-06, M. Bouajjani, P. Bozga, R. Habermehl, P. Iosif et al., Programs with lists are counter automata, Thèse de Laure Gonnord, p.147

A. Bouajjani, A. Collomb-annichini, Y. Lakhnech, and M. Sighireanu, Analysing fair parametric extended automata, pp.577-588, 2006.

]. B. Bcc-+-03, P. Blanchet, R. Cousot, J. Cousot, L. Feret et al., A static analyzer for large safety-critical software FASTer acceleration of counter automata in practice, PLDI 2003 Proceedings of the 10th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'04), volume 2988 of Lecture Notes in Computer Science, 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, and E. Zaffanella, Precise Widening Operators for Convex Polyhedra, Static Analysis : Proceedings of the 10th International Symposium Iosif, and Y. Lakhnech. Flat parametric counter automata. In ICALP, pp.337-354, 2003.
DOI : 10.1007/3-540-44898-5_19

S. [. Boigelot, F. Jodogne, and . Herbreteau, Hybrid Acceleration Using Real Vector Automata, Proc. of the 15th International Conference on Computer Aided Verification, pp.193-205, 2003.
DOI : 10.1007/978-3-540-45069-6_19
URL : https://hal.archives-ouvertes.fr/inria-00335915

A. [. Boigelot, P. Legay, and . Wolper, Iterating Transducers in the Large, Proc. 15th Int. Conf. on Computer Aided Verification, pp.223-235, 2003.
DOI : 10.1007/978-3-540-45069-6_24

]. B. Boi99 and . Boigelot, Symbolic methods for exploring infinite state spaces, p.76, 1999.

]. F. Bou92 and . Bourdoncle, Sémantique des langages impératifs d'ordre supérieur et interprétation abstraite, Thèse Ecole PolytechniqueBou93] F. Bourdoncle. Efficient chaotic iteration strategies with widenings, pp.23128-141, 1992.

P. [. Boigelot, . Wolper-]-b, P. Boigelot, and . Wolper, Symbolic verification with periodic sets Representing arithmetic constraints with finite automata : An overview, CAV'94, Stanford (Ca.), 1994 Proc. International Conference on Logic Programming (ICLP), pp.45-47, 2002.

L. Thèse-de, B. Gonnord, . Bibliographie-[-cc76-]-p, R. Cousot, . Cousot-]-p et al., Static determination of dynamic properties of programs Abstract interpretation : a unified lattice model for static analysis of programs by construction or approximation of fixpoints Abstract interpretation and application to logic programs, 4th ACM Symposium on Principles of Programming Languages, POPL'77, pp.481-4103, 1976.

]. P. Cc92b, R. Cousot, and . Cousot, Comparing the Galois connection and widening/narrowing approaches to abstract interpretation, invited paper, Proceedings of the International Workshop Programming Language Implementation and Logic Programming, PLILP '92, pp.13-17, 1992.

J. [. Clarisó and . Cortadella, Verification of parametric timed circuits using octahedra, Designing correct circuits, DCC'04, 1925.

A. Costan, S. Gaubert, E. Goubault, M. Martel, and S. Putot, A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs, Proc. of the 17th International Conference on Computer Aided VerificationCGL94] E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction, p.60, 2005.
DOI : 10.1007/11513988_46

N. [. Cousot and . 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, p.105, 1978.
DOI : 10.1145/512760.512770

Z. Chaochen, C. A. Hoare, and A. P. Ravn, A calculus of durations, Information Processing Letters, vol.40, issue.5, p.32, 1991.
DOI : 10.1016/0020-0190(91)90122-X

Z. Chaochen, C. A. Hoare, and A. P. Ravn, A calculus of durations, Information Processing Letters, vol.40, issue.5, pp.269-276, 1991.
DOI : 10.1016/0020-0190(91)90122-X

Y. [. Comon and . Jurski, Multiple counters automata, safety analysis and Presburger arithmetic Comon and Y. Jurski. Timed automata and the theory of real numbers, CAV'98 Proc. Conf. on Concurrency theory, volume 1664 of lncs, pp.42-242, 1998.
DOI : 10.1007/bfb0028751
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.6334

F. [. Cornet, L. Maraninchi, ]. C. Maillet-contozdfv05, A. Darlot, L. Finkel et al., Formalizing systemc transaction-level models of systems-on-chip : a component-based approach. Unpublished About Fast and TReX accelerations, Proceedings of the 4th International Workshop on Automated Verification of Critical Systems 45 [DG03] L. Danthony-Gonnord. Du calcul des durées aux automates symboliques, pp.118-87, 2003.

J. [. Finkel, . Lerouxfo97-]-l, H. Fribourg, and . Olsén, How to compose Presburger-accelerations : Applications to broadcast protocols Proving safety properties of infinite state systems by compilation into Presburger arithmetic, Proceedings of the 22nd Conf. Found. of Software Technology and Theor. Comp. Sci. (FSTTCS'2002), volume 2556 of Lecture Notes in Computer Science Proceedings of the 8th International Conference on Concurrency Theory (CONCUR'97 Sutre. An algorithm constructing the semilinear Post* for 2-dim Reset/Transfer VASS Proceedings of the 25th International Symposium on Mathematical Fundations of Computer Science (MFCS 2000), volume 1893 of Lecture Notes in Computer Science, pp.101-145, 1997.

]. A. Fs00b, G. Finkel, and . Sutre, An algorithm constructing the semilinear post* for 2-dim reset/transfer vass, 25th Int. Symp. Math. Found. Comp. Sci. (MFCS'2000), p.12, 2000.

S. Gaubert, E. Goubault, A. Taly, and S. Zennou, Static Analysis by Policy Iteration on Relational Domains, European Symposium On Programming, p.60, 2007.
DOI : 10.1007/978-3-540-71316-6_17

N. [. Gonnord, L. Halbwachs, N. Gonnord, P. Halbwachs, and . Raymond, Combining widening and acceleration in linear relation analysis From discrete duration calculus to symbolic automata, 13th International Static Analysis Symposium, SAS'06 3rd International Workshop on Synchronous Languages, Applications, and Programs, pp.97-110, 2004.

C. [. Graf and . Loiseaux, A tool for symbolic program verification and abstraction, Fifth Conference on Computer-Aided Verification, CAV'93, Elounda (Greece), 1993.
DOI : 10.1007/3-540-56922-7_7

]. E. Gou01 and . Goubault, Static analyses of the precision of floating-point operations Gopan and T. Reps. Lookahead widening, SAS CAV'06, pp.234-259, 2001.

]. Gra91, . Ph, and . Granger, Analyses sémantiques de congruence, 1925.

L. Thèse-de, B. Gonnord, ]. N. Bibliographie-[-hal79a, and . Halbwachs, Détermination automatique de relations linéaires vérifiées par les variables d'un programme Détermination automatique de relations linéaires vérifiées par les variables d'un programme Delay analysis in synchronous programs, Thèse detroisì eme cycle Thèse de 3e cycle Fifth Conference on Computer-Aided Verification, CAV'93, Elounda (Greece), pp.113-162, 1979.

N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud, The synchronous data flow programming language LUSTRE, Proceedings of the IEEE, vol.79, issue.9, pp.1305-1320, 0105.
DOI : 10.1109/5.97300

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

F. [. Halbwachs, C. Lagnier, . Ratelhlr93-]-n, F. Halbwachs, P. Lagnier et al., Programming and verifying real-time systems by means of the synchronous data-flow programming language Lustre Special Issue on the Specification and Analysis of Real-Time Systems Synchronous observers and the verification of reactive systems, IEEE Transactions on Software Engineering Third Int. Conf. on Algebraic Methodology and Software Technology, AMAST'93, pp.785-793, 1992.

T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, Symbolic model checking for real-time systems, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, p.59, 1992.
DOI : 10.1109/LICS.1992.185551

Y. [. Halbwachs, P. Proy, . Roumanoffhrr91-]-n, P. Halbwachs, C. Raymond et al., Verification of real-time systems using linear relation analysis Formal Methods in System Design Generating efficient code from dataflow programs Semantical interprocedural parallelization : An overview of the PIPS project, Third International Symposium on Programming Language Implementation and Logic Programming ACM Int. Conf. on Supercomputing, ICS'91 [Iri05] F. Irigoin. Detecting affine loop invariants using modular static analysis, pp.157-185, 0106.

]. Y. Jur99 and . Jurski, Expression de la relation binaire d'accessibilité pour les automatesà automates`automatesà compteurs plats et les automates temporisés, Thèse de doctorat, p.40, 1999.

B. Bibliographie-[-kar76 and ]. M. Karr, Affine relationships among variables of a program Proving the correctness of multiprocess programs, Acta Informatica IEEE Transactions on Software Engineering, vol.6, issue.2, pp.133-151, 1976.

]. J. Las-]-lashler03 and . Leroux, Algorithmique de la vérification des systèmessystèmesà compteurs ? approximation et accélération ? implémentation dans l'outil Fast The maximum order of an element of a finite symmetric group, Am. Math. Monthly, vol.53, issue.6, pp.40-113, 1987.

]. A. Min01 and . Miné, The octagon abstract domain, AST, pp.310-319, 1925.

R. Mt53-]-thompson-motzkin, P. K. Thrall, and . Pandya, The double description method. Theodore S. Motzkin : Selected Papers Specifying and deciding quantified discrete-time duration calculus formulae using dcvalid, html. 102 [Ope05] Open SystemC Initiative. IEEE 1666 : SystemC Language Reference Manual Real-Time Tools, pp.27-110, 1953.

J. [. Plaice and . Saint, The Lustre-Esterel portable format, p.106, 1987.

W. Pugh, The Omega test: a fast and practical integer programming algorithm for dependence analysis, Proceedings of the 1991 ACM/IEEE conference on Supercomputing , Supercomputing '91, 1991.
DOI : 10.1145/125826.125848

S. S. Sankaranarayanan, F. Ivancic, I. Shlyakhter, and A. Gupta, Constraintbased linear relations analysis, ACM/IEEE conference on Supercomputing International Symposium on Static Analysis, SAS'2006, pp.4-13, 1991.

A. [. Simon and . King, Widening Polyhedra with Landmarks, Fourth Asian Symposium on Programming Languages and Systems, pp.166-182, 2006.
DOI : 10.1007/11924661_11
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.656

L. Samper, F. Maraninchi, L. Mounier, and L. Mandel, GLONEMO, Proceedings of the first international conference on Integrated internet ad hoc and sensor networks , InterSense '06, pp.120-53, 2004.
DOI : 10.1145/1142680.1142684

L. Thèse-de, B. Gonnord, . Bibliographie, . Sti, ]. Z. Sting et al., A class of polynomially solvable range constraints for interval analysis without widenings and narrowings Depth-first search and linear graph algorithms, srirams/Software/sting.html. 113 [SW04 TACAS'04, pp.280-295, 1972.

[. Wolper and B. Boigelot, Verifying systems with infinite but regular state spaces, CAV'98, pp.45-88, 1998.
DOI : 10.1007/BFb0028736