V. Acary and B. Brogliato, Numerical Methods for Nonsmooth Dynamical Systems: Applications in Mechanics and Electronics, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00423530

E. Asarin, O. Bournez, T. Dang, and O. Maler, Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems, Hybrid Systems: Computation and Control, pp.21-31, 2000.
DOI : 10.1007/3-540-46430-1_6
URL : https://hal.archives-ouvertes.fr/inria-00099316

R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P. 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

[. Alur, C. Courcoubetis, T. A. Henzinger, and P. Ho, Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems, In Hybrid Systems, Lecture Notes in Computer Science, pp.209-229, 1992.
DOI : 10.1007/3-540-57318-6_30

C. Ancourt, F. Coelho, and F. Irigoin, A Modular Static Analysis Approach to Affine Loop Invariants Detection, Numerical and Symbolic Abstract Domains, pp.3-16, 2010.
DOI : 10.1016/j.entcs.2010.09.002
URL : https://hal.archives-ouvertes.fr/hal-00586338

R. Alur and D. L. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8

R. Alur, T. Dang, J. M. Esposito, Y. Hur, F. Ivancic et al., Hierarchical modeling and analysis of embedded systems, Proceedings of the IEEE, vol.91, issue.1, pp.11-28, 2003.
DOI : 10.1109/JPROC.2002.805817
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.612

E. Asarin, T. Dang, and A. Girard, Hybridization methods for the analysis of nonlinear systems, Acta Informatica, vol.12, issue.2, pp.451-476, 2007.
DOI : 10.1007/s00236-006-0035-7
URL : https://hal.archives-ouvertes.fr/hal-00157475

[. Alur, T. Dang, and F. Ivancic, Reachability analysis of hybrid systems using counter-example guided predicate abstraction, 2002.

A. Adjé, S. Gaubert, and . Goubault, Coupling Policy Iteration with Semi-definite Relaxation to Compute Accurate Numerical Invariants in Static Analysis, European Symposium on Programming, pp.23-42, 2010.
DOI : 10.1007/978-3-642-11957-6_3

S. Agg10b-]-xavier-allamigeon, E. Gaubert, and . Goubault, The tropical double description method, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.47-58, 2010.

R. Alur, A. Kanade, S. Ramesh, and K. C. Shashidhar, Symbolic analysis for improving simulation coverage of Simulink/Stateflow models, Proceedings of the 7th ACM international conference on Embedded software, EMSOFT '08, pp.89-98, 2008.
DOI : 10.1145/1450058.1450071

E. Asarin, O. Maler, and A. Pnueli, Reachability analysis of dynamical systems having piecewise-constant derivatives, Theoretical Computer Science, vol.138, issue.1, pp.35-65, 1995.
DOI : 10.1016/0304-3975(94)00228-B
URL : http://doi.org/10.1016/0304-3975(94)00228-b

[. Agrawal, G. Simon, and G. Karsai, Semantic Translation of Simulink/Stateflow Models to Hybrid Automata Using Graph Transformations, Electronic Notes in Theoretical Computer Science, vol.109, pp.43-56, 2004.
DOI : 10.1016/j.entcs.2004.02.055

A. Beletska, D. Barthou, W. Bielecki, and A. Cohen, Computing the Transitive Closure of a Union of Affine Integer Tuple Relations, Combinatorial Optimization and Applications, pp.98-109, 2009.
DOI : 10.1007/978-3-642-02026-1_9
URL : https://hal.archives-ouvertes.fr/hal-00575959

[. Bres, G. Berry, A. Bouali, and E. M. Sentovich, State abstraction techniques for the verification of reactive circuits, Designing Correct Circuits, pp.197-203, 2002.

A. Benveniste, T. Bourke, B. Caillaud, and M. Pouzet, Divide and recycle: types and compilation for a hybrid synchronous language, Languages , Compilers, and Tools for Embedded Systems, pp.61-70, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00654112

A. Benveniste, T. Bourke, B. Caillaud, and M. Pouzet, A hybrid synchronous language with hierarchical automata, Proceedings of the ninth ACM international conference on Embedded software, EMSOFT '11, pp.137-148, 2011.
DOI : 10.1145/2038642.2038664
URL : https://hal.archives-ouvertes.fr/hal-00654113

A. Benveniste, T. Bourke, B. Caillaud, and M. Pouzet, Non-standard semantics of hybrid systems modelers, Journal of Computer and System Sciences, vol.78, issue.3, pp.877-910, 2012.
DOI : 10.1016/j.jcss.2011.08.009
URL : https://hal.archives-ouvertes.fr/hal-00766726

[. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis, Property preserving simulations, Computer-Aided Verification, pp.260-273, 1992.
DOI : 10.1007/3-540-56496-9_21

[. Berry and L. Cosserat, The ESTEREL synchronous programming language and its mathematical semantics, Seminar on Concurrency, pp.389-448, 1985.
DOI : 10.1007/3-540-15670-4_19
URL : https://hal.archives-ouvertes.fr/inria-00076230

B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne et al., Design and Implementation of a Special-Purpose Static Program Analyzer for Safety-Critical Real-Time Embedded Software, The Essence of Computation, pp.85-108, 2002.
DOI : 10.1007/3-540-36377-7_5
URL : https://hal.archives-ouvertes.fr/inria-00528442

B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne et al., A static analyzer for large safety-critical software, Programming Language Design and Implementation, pp.196-207, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00128135

A. Benveniste, P. Caspi, S. A. Edwards, N. Halbwachs, P. L. Guernic et al., The synchronous languages twelve years later, Proceedings of the IEEE, pp.64-83, 2003.
DOI : 10.1109/jproc.2002.805826
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.6645

A. Benveniste, B. Caillaud, and M. Pouzet, The fundamentals of hybrid systems modelers, 49th IEEE Conference on Decision and Control (CDC), pp.4180-4185, 2010.
DOI : 10.1109/CDC.2010.5717614
URL : https://hal.archives-ouvertes.fr/inria-00554271

A. Bouajjani, J. Fernandez, and N. Halbwachs, Minimal model generation, Computer-Aided Verification, pp.197-203, 1991.
DOI : 10.1007/BFb0023733

A. Bfl04-]-sébastien-bardin, J. Finkel, and . Leroux, FASTer Acceleration of Counter Automata in Practice, Tools and Algorithms for the Construction and Analysis of Systems, pp.576-590, 2004.
DOI : 10.1007/978-3-540-24730-2_42

A. Bflp03-]-sébastien-bardin, J. Finkel, L. Leroux, and . Petrucci, FAST: Fast Acceleration of Symbolic Transition Systems, Computer-Aided Verification, pp.118-121, 2003.
DOI : 10.1007/978-3-540-45069-6_12

A. Bflp08-]-sébastien-bardin, J. Finkel, L. Leroux, and . Petrucci, FAST: acceleration from theory to practice, International Journal on Software Tools for Technology Transfer, vol.15, issue.2, pp.401-424, 2008.
DOI : 10.1007/s10009-008-0064-3

A. Bfls05-]-sébastien-bardin, J. Finkel, P. Leroux, and . Schnoebelen, Flat Acceleration in Symbolic Model Checking, Automated Technology for Verification and Analysis, pp.474-488, 2005.
DOI : 10.1007/11562948_35

[. Boigelot and P. Godefroid, Symbolic verification of communication protocols with infinite state spaces using QDDs. Formal Methods in System Design, pp.237-255, 1997.

M. Bozga, C. G??rleag??rlea, and R. Iosif, Iterating Octagons, Lecture Notes in Computer Science, vol.19, issue.1, pp.337-351, 2009.
DOI : 10.1007/s10990-006-8609-1
URL : https://hal.archives-ouvertes.fr/hal-00374863

A. Benveniste, P. L. Guernic, and C. Jacquemot, Synchronous programming with events and relations: the SIGNAL language and its semantics, Science of Computer Programming, vol.16, issue.2, pp.103-149, 1991.
DOI : 10.1016/0167-6423(91)90001-E
URL : http://doi.org/10.1016/0167-6423(91)90001-e

[. Bultan, R. Gerber, and C. League, Composite model-checking: verification with type-specific symbolic representations, ACM Transactions on Software Engineering and Methodology, vol.9, issue.1, pp.3-50, 2000.
DOI : 10.1145/332740.332746
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.2196

[. Bultan, R. Gerber, and W. Pugh, Symbolic model checking of infinite state systems using presburger arithmetic, Computer-Aided Verification, pp.400-411, 1997.
DOI : 10.1007/3-540-63166-6_39

[. Bagnara, P. M. Hill, and E. Zaffanella, Widening Operators for Powerset Domains, Verification, Model Checking, and Abstract Interpretation Patricia M. Hill, and Enea Zaffanella. Not necessarily closed convex polyhedra and the double description method. Formal Aspects of Computing, pp.135-148222, 2004.
DOI : 10.1007/978-3-540-24622-0_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.219

[. Bozga, R. Iosif, and F. Konecn´ykonecn´y, Fast Acceleration of Ultimately Periodic Relations, Computer-Aided Verification, pp.227-242, 2010.
DOI : 10.1007/978-3-642-14295-6_23
URL : https://hal.archives-ouvertes.fr/hal-01418908

]. J. Bil87 and . Billon, Perfect normal forms for discrete programs, 1987.

X. Briand and B. Jeannet, Combining control and data abstraction in the verification of hybrid systems, Computer-Aided Design of Integrated Circuits and Systems, vol.10, pp.1481-1494, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00786337

S. Bliudze and D. Krob, Modelling of complex systems: Systems as dataflow machines, Fundamenta Informaticae, vol.91, issue.2, pp.251-274, 2009.

S. Bliudze, Un cadre formel pour l'´ etude des systèmes industriels complexes: un exemple basé sur l'infrastructure de l'UMTS, 2006.

J. Bengtsson, K. G. Larsen, F. Larsson, P. Pettersson, and W. Yi, UPPAAL ??? a tool suite for automatic verification of real-time systems, Hybrid Systems, pp.232-243, 1995.
DOI : 10.1007/BFb0020949

[. Boigelot, Symbolic Methods for Exploring Infinite State Spaces, 1998.

[. Bourdoncle, Efficient chaotic iteration strategies with widenings, Formal Methods in Programming and their Applications, pp.128-141, 1993.
DOI : 10.1007/BFb0039704
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.3357

O. Bouissou, Analyse statique par interprétation abstraite de systèmes hybrides, 2008.

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

R. E. Bryant, On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication, IEEE Transactions on Computers, vol.40, issue.2, pp.205-213, 1991.
DOI : 10.1109/12.73590

R. E. Bryant, Symbolic Boolean manipulation with ordered binary-decision diagrams, ACM Computing Surveys, vol.24, issue.3, pp.293-318, 1992.
DOI : 10.1145/136035.136043
URL : http://akebono.stanford.edu/users/nanni/courses/EE318/bryant92.pdf

O. Botchkarev and S. Tripakis, Verification of Hybrid Systems with Linear Differential Inclusions Using Ellipsoidal Approximations, Hybrid Systems: Computation and Control, pp.73-88, 2000.
DOI : 10.1007/3-540-46430-1_10

[. Boigelot and P. Wolper, Symbolic verification with periodic sets, Computer-Aided Verification, pp.55-67, 1994.
DOI : 10.1007/3-540-58179-0_43
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.6568

B. Bollig and I. Wegener, Improving the variable ordering of OBDDs is NP-complete, IEEE Transactions on Computers, vol.45, issue.9, pp.993-1002, 1996.
DOI : 10.1109/12.537122

[. Coudert, C. Berthet, and J. C. Madre, Verification of synchronous sequential machines based on symbolic execution, Automatic Verification Methods for Finite State Systems, pp.365-373, 1989.
DOI : 10.1007/3-540-52148-8_30

E. Clarke, A. Biere, R. Raimi, and Y. Zhu, Bounded model checking using satisfiability solving, Formal Methods in System Design, vol.19, issue.1, pp.7-34, 2001.
DOI : 10.1023/A:1011276507260

P. Cousot and R. Cousot, Static determination of dynamic properties of programs, Proceedings of the Second International Symposium 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 and application to logic programs, The Journal of Logic Programming, vol.13, issue.2-3, pp.103-179, 1992.
DOI : 10.1016/0743-1066(92)90030-7

P. Cousot and R. Cousot, Comparing the Galois connection and widening/narrowing approaches to abstract interpretation, Programming Language Implementation and Logic Programming, pp.269-295, 1992.
DOI : 10.1007/3-540-55844-6_142
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.537

P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné et al., The ASTRE?? Analyzer, European Symposium on Programming, pp.21-30, 2005.
DOI : 10.1007/978-3-540-31987-0_3

P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné et al., Why does ASTRÉEASTR´ASTRÉE scale up? Formal Methods in System Design, pp.229-264, 2009.

[. Cousot, R. Cousot, and L. Mauborgne, The Reduced Product of Abstract Domains and the Combination of Decision Procedures, Foundations of Software Science and Computation Structures, pp.456-472, 2011.
DOI : 10.1007/978-3-642-19805-2_31

A. Costan, S. Gaubert, E. Goubault, M. Martel, and S. Putot, A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs, Computer-Aided Verification, pp.462-475, 2005.
DOI : 10.1007/11513988_46

J. Colaço, A. Girault, G. Hamon, and M. Pouzet, Towards a higher-order synchronous data-flow language, Proceedings of the fourth ACM international conference on Embedded software , EMSOFT '04, pp.230-239, 2004.
DOI : 10.1145/1017753.1017792

E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, Counterexample-Guided Abstraction Refinement, Computer-Aided Verification, pp.154-169, 2000.
DOI : 10.1007/10722167_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.407

E. M. Clarke, O. Grumberg, and D. E. Long, Model checking and abstraction, ACM Transactions on Programming Languages and Systems, vol.16, issue.5, pp.1512-1542, 1994.
DOI : 10.1145/186025.186051

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

]. N. Che65 and . Chernikova, Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities, USSR Computational Mathematics and Mathematical Physics, vol.5, issue.2, pp.228-233, 1965.

[. Caspi, G. Hamon, and M. Pouzet, Synchronous Functional Programming with Lucid Synchrone, Real-Time Systems: Description and Verification Techniques: Theory and Tools. Hermes, 2008.
DOI : 10.1002/9780470611012.ch7

H. Comon and Y. Jurski, Multiple counters automata, safety analysis and presburger arithmetic, Computer-Aided Verification, pp.268-279, 1998.
DOI : 10.1007/BFb0028751

[. Chutinan and B. H. Krogh, Computing polyhedral approximations to flow pipes for dynamic systems, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171), pp.2089-2094, 1998.
DOI : 10.1109/CDC.1998.758642

A. Chutinan and B. H. Krogh, Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe Approximations, Hybrid Systems: Computation and Control, pp.76-90, 1999.
DOI : 10.1007/3-540-48983-5_10

[. Chutinan and B. H. Krogh, Verification of infinite-state dynamic systems using approximate quotient transition systems, IEEE Transactions on Automatic Control, vol.46, issue.9, pp.1401-1410, 2001.
DOI : 10.1109/9.948467

[. Chutinan and B. H. Krogh, Computational techniques for hybrid system verification, IEEE Transactions on Automatic Control, vol.48, issue.1, pp.64-75, 2003.
DOI : 10.1109/TAC.2002.806655

E. M. Clarke, K. L. Mcmillan, X. Zhao, M. Fujita, and J. Yang, Spectral transforms for large boolean functions with applications to technology mapping, Proceedings of the 30th international on Design automation conference , DAC '93, pp.54-60, 1993.
DOI : 10.1145/157485.164569
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.1009

A. Stephen and . Cook, The complexity of theorem-proving procedures, Symposium on Theory of Computing, pp.151-158, 1971.

P. Cousot, Asynchronous iteration methods for solving a fixed point system of monotone equations in a complete lattice, 1977.

P. Cousot, Semantic foundations of program analysis, Program Flow Analysis: Theory and Applications, pp.303-342, 1981.

P. Caspi and M. Pouzet, Synchronous Kahn networks, International Conference on Functional Programming, pp.226-238, 1996.
DOI : 10.1145/232627.232651
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.9168

[. Caspi, D. Pilaud, N. Halbwachs, and J. A. Plaice, LUSTRE: a declarative language for real-time programming, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '87, pp.178-188, 1987.
DOI : 10.1145/41625.41641

[. Colaço, B. Pagano, and M. Pouzet, A conservative extension of synchronous data-flow with state machines, Proceedings of the 5th ACM international conference on Embedded software , EMSOFT '05, pp.173-182, 2005.
DOI : 10.1145/1086228.1086261

[. Bousquet, Test fonctionnel statistique de systèmes spécifiés en Lustre, 1999.

T. Dang and T. M. Gawlitza, Discretizing affine hybrid automata with uncertainty. In Automated Technology for Verification and Analysis, Lecture Notes in Computer Science, pp.473-481, 2011.
DOI : 10.1007/978-3-642-24372-1_36
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.6994

T. Dang and T. M. Gawlitza, Template-based unbouded time verification of affine hybrid automata, Asian Symposium on Programming Languages and Systems, pp.34-49, 2011.
DOI : 10.1007/978-3-642-25318-8_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.2533

[. Dang, C. L. Guernic, and O. Maler, Computing Reachable States for Nonlinear Biological Models, Computational Methods in Systems Biology, pp.126-141, 2009.
DOI : 10.1007/978-1-4613-8431-1
URL : http://doi.org/10.1016/j.tcs.2011.01.014

D. Delmas, E. Goubault, S. Putot, J. Souyris, K. Tekkal et al., Towards an Industrial Use of FLUCTUAT on Safety-Critical Avionics Software, Formal Methods for Industrial Critical Systems, pp.53-69, 2009.
DOI : 10.1007/978-3-642-04570-7_6

D. Vijay, L. Silva, D. Haller, and . Kroening, Satisfiability solvers are static analyzers, Static Analysis Symposium, 2012.

A. F. Donaldson, L. Haller, D. Kroening, and P. Rümmer, Software Verification Using k-Induction, Static Analysis Symposium, pp.351-368, 2011.
DOI : 10.1007/3-540-40922-X_8
URL : http://spiral.imperial.ac.uk/bitstream/10044/1/14359/2/paper.pdf

T. Dang and O. Maler, Reachability analysis via face lifting, Hybrid Systems: Computation and Control, pp.96-109, 1998.
DOI : 10.1007/3-540-64358-3_34
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4435

H. [. Davey and . Priestley, Introduction to Lattices and Order, 1990.
DOI : 10.1017/CBO9780511809088

B. George, M. N. Dantzig, and . Thapa, Linear programming 1: Introduction, 1997.

[. André, Timed Parametrization of Embedded System Components, 2010.

[. Eggers, M. Fränzle, and C. Herde, SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems, Automated Technology for Verification and Analysis, pp.171-185, 2008.
DOI : 10.1007/978-3-540-78929-1_30

[. Eggers, N. Ramdani, N. Nedialkov, and M. Fränzle, Improving SAT Modulo ODE for Hybrid Systems Analysis by Combining Different Enclosure Methods, Software Engineering and Formal Methods, pp.172-187, 2011.
DOI : 10.1007/BFb0031569
URL : https://hal.archives-ouvertes.fr/hal-00630303

P. Fritzson and V. Engelson, Modelica ??? A unified object-oriented language for system modeling and simulation, European Conference on Object-Oriented Programming, pp.67-90
DOI : 10.1007/BFb0054087

G. Frehse, C. Le-guernic, A. Donzé, R. Ray, O. Lebeltel et al., SpaceEx: Scalable Verification of Hybrid Systems, Computer-Aided Verification, pp.379-395, 2011.
DOI : 10.1007/978-3-642-00768-2_32
URL : https://hal.archives-ouvertes.fr/hal-00769608

M. Fränzle and C. Herde, HySAT: An efficient proof engine for bounded model checking of hybrid systems, Formal Methods in System Design, vol.68, issue.2, pp.179-198, 2007.
DOI : 10.1007/s10703-006-0031-0

M. Fränzle, C. Herde, T. Teige, S. Ratschan, and T. Schubert, Efficient solving of large non-linear arithmetic constraint systems with complex boolean structure, Journal on Satisfiability Boolean Modeling and Computation, vol.1, pp.3-4209, 2007.

F. Aleksei and . Filippov, Differential equations with discontinuous right-hand sides, Mathematicheskii Sbornik, vol.51, issue.1, 1960.

[. Flanagan, R. Joshi, X. Ou, and J. B. Saxe, Theorem Proving Using Lazy Proof Explication, Computer-Aided Verification, pp.355-367, 2003.
DOI : 10.1007/978-3-540-45069-6_34
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.9486

L. Fribourg and U. Kühne, Parametric Verification and Test Coverage for Hybrid Automata Using the Inverse Method, Reachability Problems, pp.191-204, 2011.
DOI : 10.1007/978-3-642-24288-5_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.9532

A. Finkel and J. Leroux, How to Compose Presburger-Accelerations: Applications to Broadcast Protocols, Foundations of Software Technology and Theoretical Computer Science, pp.145-156, 2002.
DOI : 10.1007/3-540-36206-1_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.9119

L. Fribourg and H. Olsén, Proving safety properties of infinite state systems by compilation into Presburger arithmetic, Concurrency Theory, pp.213-227, 1997.
DOI : 10.1007/3-540-63141-0_15

K. Fukuda and A. Prodon, Double description method revisited, In Combinatorics and Computer Science Lecture Notes in Computer Science, vol.1120, pp.91-111, 1995.
DOI : 10.1007/3-540-61576-8_77
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.8343

C. Flanagan and S. Qadeer, Predicate abstraction for software verification, Principles of Programming Languages, pp.191-202, 2002.

G. Frehse and . Phaver, PHAVer: Algorithmic Verification of Hybrid Systems Past HyTech, Hybrid Systems: Computation and Control, pp.258-273, 2005.
DOI : 10.1007/978-3-540-31954-2_17

[. Gaucher, ´ Etude du débogage de systèmes réactifs et application au langage synchrone Lustre, 2003.

M. Thomas and . Gawlitza, Strategieverbesserungsalgorithmen für exakte Programmanalysen, 2009.

[. , L. Guernic, and A. Girard, Reachability analysis of hybrid systems using support functions, Computer-Aided Verification, pp.540-554, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00769527

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

L. Gonnord and N. Halbwachs, Combining Widening and Acceleration in Linear Relation Analysis, Static Analysis Symposium, pp.144-160, 2006.
DOI : 10.1007/11823230_10
URL : https://hal.archives-ouvertes.fr/hal-00189614

K. Ghorbal, F. Ivancic, G. Balakrishnan, N. Maeda, and A. Gupta, Donut Domains: Efficient Non-convex Domains for Abstract Interpretation, Verification, Model Checking, and Abstract Interpretation, pp.235-250, 2012.
DOI : 10.1007/978-3-540-69738-1_20

A. Girard, Reachability of Uncertain Linear Systems Using Zonotopes, Hybrid Systems: Computation and Control, pp.291-305, 2005.
DOI : 10.1007/978-3-540-31954-2_19
URL : https://hal.archives-ouvertes.fr/hal-00307003

E. [. Gaucher, B. Jahier, F. Jeannet, . Maraninchi, R. Gupta et al., Automatic state reaching for debugging reactive programs Hybrid cc, hybrid automata and program verification, Automated and Algorithmic Debugging Hybrid Systems, pp.52-63, 1995.

R. Mark, I. Greenstreet, and . Mitchell, Reachability analysis using polygonal projections, Hybrid Systems: Computation and Control, pp.103-116, 1999.

. Bibliography, . Thomas, D. Gawlitza, and . Monniaux, Improving strategies via SMT solving, European Symposium on Programming, pp.236-255, 2011.

[. Goubault, M. Martel, and S. Putot, Asserting the Precision of Floating-Point Computations: A Simple Abstract Interpreter, European Symposium on Programming, pp.209-212, 2002.
DOI : 10.1007/3-540-45927-8_15

L. Gonnord, The ASPIC tool: Accelerated symbolic polyhedral invariant computation

L. Gonnord, Accélération abstraite pour l'amélioration de la précision en Analyse des Relations Linéaires, Thèse de doctorat, 2007.

E. Goubault and S. Putot, Static Analysis of Numerical Algorithms, Static Analysis Symposium, pp.18-34, 2006.
DOI : 10.1007/11823230_3

R. Giacobazzi and F. Ranzato, Optimal domains for disjunctive abstract interpretation, Static Analysis Symposium, pp.177-210, 1998.
DOI : 10.1016/S0167-6423(97)00034-8
URL : http://doi.org/10.1016/s0167-6423(97)00034-8

P. Granger, Static analysis of linear congruence equalities among variables of a program, TAPSOFT, pp.169-192, 1991.
DOI : 10.1007/3-540-53982-4_10

S. Graf and H. Sa¨?disa¨?di, Construction of abstract state graphs with PVS, Computer-Aided Verification, pp.72-83, 1997.
DOI : 10.1007/3-540-63166-6_10

M. Thomas, H. Gawlitza, and . Seidl, Precise fixpoint computation through strategy iteration, European Symposium on Programming, pp.300-315, 2007.

M. Thomas, H. Gawlitza, and . Seidl, Precise relational invariants through strategy iteration, In Computer Science Logic Lecture Notes in Computer Science, vol.4646, pp.23-40, 2007.

M. Thomas, H. Gawlitza, and . Seidl, Precise interval analysis vs. parity games, Formal Methods, pp.342-357, 2008.

M. Thomas, H. Gawlitza, and . Seidl, Computing relaxed abstract semantics w.r.t. quadratic zones precisely, Static Analysis Symposium, pp.271-286, 2010.

M. Thomas, H. Gawlitza, and . Seidl, Solving systems of rational equations through strategy iteration, Transactions on Programming Languages and Systems, vol.33, issue.3, p.11, 2011.

M. Thomas, H. Gawlitza, A. Seidl, S. Adjé, . Gaubert et al., Abstract interpretation meets convex optimization, Journal of Symbolic Computation, vol.47, issue.12, pp.1512-1532, 2012.

[. Gulwani and A. Tiwari, Constraint-Based Approach for Analysis of Hybrid Systems, Computer-Aided Verification, pp.190-203, 2008.
DOI : 10.1007/978-3-540-70545-1_18

G. Hagen, Verifying safety properties of Lustre programs: an SMT-based approach, 2008.

[. Halbwachs, Détermination automatique de relations linéaires vérifiées par les variables d'un programme, Thèse du 3` eme cycle, 1979.

N. Hal93a and . Halbwachs, Delay analysis in synchronous programs, Computer-Aided Verification, pp.333-346

[. Halbwachs, Synchronous programming of reactive systems, Kluwer, 1993.

[. Halbwachs, Synchronous programming of reactive systems, Computer-Aided Verification, pp.1-16, 1998.
DOI : 10.1007/BFb0028726

A. C. Hindmarsh, P. N. Brown, K. E. Grant, S. L. Lee, R. Serban et al., SUNDIALS, ACM Transactions on Mathematical Software, vol.31, issue.3, pp.31363-396, 2005.
DOI : 10.1145/1089014.1089020

A. Thomas and . Henzinger, Hybrid automata with finite bisimulations, International Colloquium on Automata, Languages and Programming, pp.324-335, 1995.

A. Thomas and . Henzinger, The theory of hybrid automata, Logic in Computer Science, p.278, 1996.

A. Thomas, P. Henzinger, and . Ho, Model checking strategies for linear hybrid systems, 1994.

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.2086

T. A. Henzinger, P. Ho, and H. Wong-toi, Algorithmic analysis of nonlinear hybrid systems, IEEE Transactions on Automatic Control, vol.43, issue.4, pp.225-238, 1998.
DOI : 10.1109/9.664156
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.472.2783

M. Jacob, A. Howe, and . King, Logahedra: A new weakly relational domain In Automated Technology for Verification and Analysis, Lecture Notes in Computer Science, vol.5799, pp.306-320, 2009.

T. A. Henzinger and P. W. Kopke, What's Decidable about Hybrid Automata?, Journal of Computer and System Sciences, vol.57, issue.1, pp.94-124, 1998.
DOI : 10.1006/jcss.1998.1581

[. Halbwachs, F. Lagnier, and P. Raymond, Synchronous Observers and the Verification of Reactive Systems, Algebraic Methodology And Software Technology, Workshops in Computing, pp.83-96, 1993.
DOI : 10.1007/978-1-4471-3227-1_8

A. Thomas, X. Henzinger, J. Nicollin, S. Sifakis, and . Yovine, Symbolic model checking for real-time systems, Logic in Computer Science, pp.394-406, 1992.

P. Ho, Automatic Analysis of Hybrid Systems, 1995.

[. Halbwachs, Y. Proy, and P. Roumanoff, Verification of realtime systems using linear relation analysis, Formal Methods in System Design, vol.11, issue.2, pp.157-185, 1997.
DOI : 10.1023/A:1008678014487

[. Bibliography, P. Halbwachs, Y. Raymond, and . Proy, Verification of linear hybrid systems by means of convex approximations, Static Analysis Symposium, pp.223-237, 1994.

M. Handjieva and S. Tzolovski, Refining Static Analyses by Trace-Based Partitioning Using Control Flow, Static Analysis Symposium, pp.200-214, 1998.
DOI : 10.1007/3-540-49727-7_12

G. Hagen and C. Tinelli, Scaling Up the Formal Verification of Lustre Programs with SMT-Based Techniques, 2008 Formal Methods in Computer-Aided Design, pp.1-9, 2008.
DOI : 10.1109/FMCAD.2008.ECP.19

Y. Iwasaki, A. Farquhar, V. A. Saraswat, D. G. Bobrow, and V. Gupta, Modeling time in hybrid systems: How fast is " instantaneous, International Joint Conference on Artificial Intelligence, pp.1773-1781, 1995.

[. Jeannet, BDDAPRON: A logico-numerical abstract domain library

[. Jeannet, Partitionnement Dynamique dans l'Analyse de Relations Linéaires et ApplicationàApplicationà la Vérification de Programmes Synchrones, Thèse de doctorat, 2000.

B. Jeannet, Dynamic partitioning in linear relation analysis. application to the verification of reactive systems, Formal Methods in System Design, vol.23, issue.1, pp.5-37, 2003.
DOI : 10.1023/A:1024480913162

N. D. Jones, C. K. Gomard, and P. Sestoft, Partial Evaluation and Automatic Program Generation, 1993.

[. Jeannet, N. Halbwachs, and P. Raymond, Dynamic Partitioning in Analyses of Numerical Properties, Static Analysis Symposium, pp.39-50, 1999.
DOI : 10.1007/3-540-48294-6_3

C. Jard, T. Jeannet, T. Jéron, V. Rusu, and E. Zinovieva, TGV: theory, principles and algorithms, Tools and Algorithms for the Construction and Analysis of Systems, pp.297-315, 2005.
DOI : 10.1007/s10009-004-0153-x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.4262

[. Jeannet and A. Miné, Apron: A Library of Numerical Abstract Domains for Static Analysis, Computer-Aided Verification, pp.661-667, 2009.
DOI : 10.1007/978-3-642-02658-4_52
URL : https://hal.archives-ouvertes.fr/hal-00786354

[. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, vol.244, issue.S, pp.373-396, 1984.
DOI : 10.1007/BF02579150
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.1990

C. Stephen and . Kleene, Introduction to Metamathematics, 1952.

W. Kelly, W. Pugh, E. Rosser, and T. Shpeisman, Transitive Closure of Infinite Graphs and Its Applications, International Journal of Parallel Programming, vol.36, issue.12, pp.579-598, 1996.
DOI : 10.1007/BF03356760
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.2237

B. John, J. D. Kam, and . Ullman, Monotone data flow analysis frameworks, Acta Informatica, vol.7, pp.305-317, 1977.

A. Kurzhanskiy and P. Varaiya, Ellipsoidal Techniques for Reachability Analysis, Hybrid Systems: Computation and Control, pp.202-214, 2000.
DOI : 10.1007/3-540-46430-1_19

L. Lamport, Proving the Correctness of Multiprocess Programs, IEEE Transactions on Software Engineering, vol.3, issue.2, pp.125-143, 1977.
DOI : 10.1109/TSE.1977.229904

[. Lakhdar-chaouch, B. Jeannet, and A. Girault, Widening with Thresholds for Programs with Complex Control Graphs, Automated Technology for Verification and Analysis, pp.492-502, 2011.
DOI : 10.1007/978-3-642-24372-1_38
URL : https://hal.archives-ouvertes.fr/inria-00606961

J. Leroux, Algorithmique de la vérification des systèmessystèmesà compteurs ? Approximation et accélération ? Implémentation dans l'outil FAST, Thèse de doctorat, 2003.

T. Lindstrøm, AN INVITATION TO NONSTANDARD ANALYSIS, Nonstandard Analysis and its Applications, pp.1-105, 1988.
DOI : 10.1017/CBO9781139172110.002

[. Löhner, Einschließung der Lösung gewöhnlicher Anfangs-und Randwertaufgaben und Anwendungen, 1988.

J. Leroux and G. Sutre, Flat Counter Automata Almost Everywhere!, Lecture Notes in Computer Science, vol.3707, pp.489-503, 2005.
DOI : 10.1007/11562948_36
URL : https://hal.archives-ouvertes.fr/hal-00346310

J. Leroux and G. Sutre, Acceleration in Convex Data-Flow Analysis, Foundations of Software Technology and Theoretical Computer Science, pp.520-531, 2007.
DOI : 10.1007/978-3-540-77050-3_43
URL : https://hal.archives-ouvertes.fr/hal-00346295

P. Lancaster and M. Tismenetsky, The Theory of Matrices, 1984.

A. Edward, H. Lee, and . Zheng, Operational semantics of hybrid systems, Hybrid Systems: Computation and Control, pp.25-53, 2005.

C. Mauras, Calcul symbolique et automates interprétés, 1996.

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
URL : http://doi.org/10.1016/s0167-6423(96)00042-1

D. Monniaux and L. Gonnord, Using Bounded Model Checking to Focus Fixpoint Iterations, Static Analysis Symposium, pp.369-385, 2011.
DOI : 10.1007/11823230_2
URL : https://hal.archives-ouvertes.fr/hal-00600087

L. Marvin and . Minsky, Computation: Finite and Infinite Machines, 1967.

A. Miné, A New Numerical Abstract Domain Based on Difference-Bound Matrices, Programs as Data Objects, pp.155-172, 2001.
DOI : 10.1007/3-540-44978-7_10

A. Miné, The octagon abstract domain, Working Conference on Reverse Engineering, pp.310-319, 2001.

K. Manamcheri, S. Mitra, S. Bak, and M. Caccamo, A step towards verification and synthesis from simulink/stateflow models, Proceedings of the 14th international conference on Hybrid systems: computation and control, HSCC '11, pp.317-318, 2011.
DOI : 10.1145/1967701.1967749

D. Monniaux, Automatic modular abstractions for linear constraints, Principles of Programming Languages, pp.140-151, 2009.
DOI : 10.1145/1480881.1480899
URL : https://hal.archives-ouvertes.fr/hal-00336144

R. E. Moore, Interval Analysis, 1966.

. S. Bibliography-[-mrtt53-]-t, H. Motzkin, G. L. Raiffa, and R. M. Thompson, The double description method, Contributions to the theory of games, 1953.

C. Meinel and T. Theobald, Algorithms and Data Structures in VLSI Design: OBDD Foundations and Applications, 1998.
DOI : 10.1007/978-3-642-58940-9

I. Mitchell and C. Tomlin, Level Set Methods for Computation in Hybrid Systems, Hybrid Systems: Computation and Control, pp.310-323, 2000.
DOI : 10.1007/3-540-46430-1_27

[. Milner, M. Tofte, and R. Harper, The Definition of Standard ML, 1990.

[. Manolios and D. Vroon, Integrating static analysis and generalpurpose theorem proving for termination analysis, International Conference on Software Engineering, pp.873-876, 2006.

S. Nedialko, K. R. Nedialkov, G. F. Jackson, and . Corliss, Validated solutions of initial value problems for ordinary differential equations, Applied Mathematics and Computation, vol.105, issue.1, pp.21-68, 1999.
DOI : 10.1016/S0096-3003(98)10083-8

[. Najafi and R. Nikoukhah, Implementation of Hybrid Automata in Scicos, 2007 IEEE International Conference on Control Applications, pp.819-824, 2007.
DOI : 10.1109/CCA.2007.4389334

[. Nielson, Hanne Riis Nielson, and Chris Hankin. Principles of Program Analysis, 2005.

[. Otter, H. Elmqvist, and S. E. Mattsso, Hybrid modeling in Modelica based on the synchronous data flow principle, Proceedings of the 1999 IEEE International Symposium on Computer Aided Control System Design (Cat. No.99TH8404), pp.22-27, 1999.
DOI : 10.1109/CACSD.1999.808640

S. Prajna and A. Jadbabaie, Safety Verification of Hybrid Systems Using Barrier Certificates, Hybrid Systems: Computation and Control, pp.477-492, 2004.
DOI : 10.1007/978-3-540-24743-2_32

A. Platzer, Differential Dynamic Logic for Hybrid Systems, Journal of Automated Reasoning, vol.30, issue.1, pp.143-189, 2008.
DOI : 10.1007/s10817-008-9103-8

A. Platzer, Differential-algebraic Dynamic Logic for Differential-algebraic Programs, Journal of Logic and Computation, vol.20, issue.1, pp.309-352, 2010.
DOI : 10.1093/logcom/exn070

A. Pnueli, The temporal logic of programs, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.46-57, 1977.
DOI : 10.1109/SFCS.1977.32

M. Pouzet, Lucid Synchrone: un langage synchrone d'ordre supérieur, 2002.

M. Pouzet, Lucid Synchrone Release version 3.0: Tutorial and Reference Manual, 2006.

A. Platzer and J. Quesel, KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description), International Joint Conference on Automated Reasoning, pp.171-178, 2008.
DOI : 10.1007/978-3-540-71070-7_15

. Moj? and . Presburger, ¨ Uber die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt, Sprawozdanie z I Kongresu matematyków krajów s lowia´nskichlowia´nskich, pp.92-101, 1929.

P. Raymond, Compilation efficace d'un langage déclaratif synchrone: Le générateur de code LUSTRE-V3, Thèse de doctorat, 1991.

P. Roux, R. Delmas, and P. Garoche, SMT-AI: an Abstract Interpreter as Oracle for k-induction, Electronic Notes in Theoretical Computer Science, vol.267, issue.2, pp.55-68, 2010.
DOI : 10.1016/j.entcs.2010.09.018

X. Rival and L. Mauborgne, The trace partitioning abstract domain, ACM Transactions on Programming Languages and Systems, vol.29, issue.5, p.26, 2007.
DOI : 10.1145/1275497.1275501

A. Robinson, Non-Standard Analysis, Princeton Landmarks in Mathematics, 1996.

[. Raymond, Y. Roux, and E. Jahier, Lutin: A Language for Specifying and Executing Reactive Scenarios, EURASIP Journal on Embedded Systems, vol.9, issue.1, 2008.
DOI : 10.1007/s10009-006-0023-9

C. William, H. Rounds, and . Song, The phi-calculus: A language for distributed control of reconfigurable embedded systems, Hybrid Systems: Computation and Control, pp.435-449

S. Ratschan and Z. She, Safety verification of hybrid systems by constraint propagation-based abstraction refinement, Transactions on Embedded Computing Systems, vol.6, issue.1, 2007.

R. Rudell, Dynamic variable ordering for ordered binary decision diagrams, International Conference on Computer-Aided Design, pp.42-47, 1993.

K. Suenaga and I. Hasuo, Programming with Infinitesimals: A While-Language for Hybrid System Modeling, International Colloquium on Automata, Languages and Programming, pp.392-403, 2011.
DOI : 10.1007/978-3-540-71070-7_15

. Sim and . Simulink, Simulation and model-based design

[. Sankaranarayanan, F. Ivancic, I. Shlyakhter, and A. Gupta, Static Analysis in Disjunctive Numerical Domains, Static Analysis Symposium, pp.3-17, 2006.
DOI : 10.1007/11823230_2

P. Schrammel and B. Jeannet, Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs, Numerical and Symbolic Abstract Domains, pp.101-114, 2010.
DOI : 10.1016/j.entcs.2010.09.009
URL : https://hal.archives-ouvertes.fr/hal-00749914

P. Schrammel and B. Jeannet, Logico-Numerical Abstract Acceleration and Application to the Verification of Data-Flow Programs, Static Analysis Symposium, pp.233-248
DOI : 10.1007/s10703-006-0031-0
URL : https://hal.archives-ouvertes.fr/inria-00596241

P. Schrammel and B. Jeannet, Applying abstract acceleration to (co-)reachability analysis of reactive programs, Journal of Symbolic Computation, vol.47, issue.12, pp.1512-1532, 2012.
DOI : 10.1016/j.jsc.2011.12.051
URL : https://hal.archives-ouvertes.fr/hal-00753412

P. Schrammel and B. Jeannet, From hybrid data-flow languages to hybrid automata, Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control, HSCC '12, pp.167-176, 2012.
DOI : 10.1145/2185632.2185658
URL : https://hal.archives-ouvertes.fr/hal-00659698

P. Bibliography, B. Schrammel, and . Jeannet, From hybrid data-flow languages to hybrid automata: A complete translation, 2012.

P. Sotin, B. Jeannet, F. Védrine, and . Goubault, Policy Iteration within Logico-Numerical Abstract Domains, Automated Technology for Verification and Analysis, pp.290-305, 2011.
DOI : 10.1007/978-3-642-24372-1_21
URL : https://hal.archives-ouvertes.fr/hal-00786321

O. Stursberg and B. H. Krogh, Efficient Representation and Computation of Reachable Sets for Hybrid Systems, Hybrid Systems: Computation and Control, pp.482-497, 2003.
DOI : 10.1007/3-540-36580-X_35

A. Simon and A. King, Widening Polyhedra with Landmarks, Asian Symposium on Programming Languages and Systems, pp.166-182, 2006.
DOI : 10.1007/11924661_11

P. Schrammel and P. Subotic, Logico-Numerical Max-Strategy Iteration, Verification, Model Checking, and Abstract Interpretation, pp.414-433, 2013.
DOI : 10.1007/978-3-642-35873-9_25
URL : https://hal.archives-ouvertes.fr/hal-00756833

[. Sankaranarayanan, H. Sipma, and Z. Manna, Non-linear loop invariant generation using Gröbner bases, Principles of Programming Languages, pp.318-329, 2004.

[. Sankaranarayanan, H. B. Sipma, and Z. Manna, Scalable Analysis of Linear Systems Using Mathematical Programming, Verification, Model Checking, and Abstract Interpretation, pp.25-41, 2005.
DOI : 10.1007/978-3-540-30579-8_2

[. Sheeran, S. Singh, and G. Stålmarck, Checking safety properties using induction and a sat-solver In Formal Methods in Computer-Aided Design Relational abstractions for continuous and hybrid systems, Computer-Aided Verification, pp.108-125, 1954.

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, 1955.
DOI : 10.2140/pjm.1955.5.285
URL : http://projecteuclid.org/download/pdf_1/euclid.pjm/1103044538

A. Tiwari, Approximate Reachability for Linear Systems, Hybrid Systems: Computation and Control, pp.514-525, 2003.
DOI : 10.1007/3-540-36580-X_37
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.5265

A. Tiwari, Abstractions for hybrid systems, Formal Methods in System Design, vol.92, issue.3, pp.57-83, 2008.
DOI : 10.1007/s10703-007-0044-3

C. J. Tomlin, Hybrid Control of Air Traffic Management Systems, 1998.

[. Tripakis, C. Sofronis, P. Caspi, and A. Curic, Translating discrete-time simulink to lustre, ACM Transactions on Embedded Computing Systems, vol.4, issue.4, pp.779-818, 2005.
DOI : 10.1145/1113830.1113834

I. Vadim and . Utkin, Sliding modes in Control and optimization, 1992.

D. A. Van-beek, K. L. Man, M. A. Reniers, J. E. Rooda, and R. R. Schiffelers, Syntax and consistent equation semantics of hybrid Chi, The Journal of Logic and Algebraic Programming, vol.68, issue.1-2, pp.129-210, 2006.
DOI : 10.1016/j.jlap.2005.10.005

[. Verge, A note on Chernikowa's algorithm, 1992.

P. Wolper and B. Boigelot, Verifying systems with infinite but regular state spaces, Computer-Aided Verification, pp.88-97, 1998.
DOI : 10.1007/BFb0028736
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.8097

]. H. Wil86 and . Williams, Fourier's method of linear programming and its dual, American Mathematical Monthly, vol.93, pp.681-695, 1986.

H. Wong-toi, Symbolic approximations for verifying real-time systems, 1994.

C. Wang, Z. Yang, A. Gupta, and F. Ivancic, Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra, Computer-Aided Verification, pp.352-365, 2007.
DOI : 10.1007/978-3-540-73368-3_40

T. Yavuz-kahveci, M. Tuncer, and T. Bultan, A Library for Composite Symbolic Representations, Lecture Notes in Computer Science, vol.2031, pp.52-66, 2001.
DOI : 10.1007/3-540-45319-9_5

[. Zheng, E. A. Lee, and A. D. Ames, Beyond Zeno: Get on with It!, Lecture Notes in Computer Science, vol.3927, pp.568-582, 2006.
DOI : 10.1007/11730637_42

K. Zee, P. Lam, V. Kuncak, and M. Rinard, Combining theorem proving with static analysis for data structure consistency, Workshop on Software Verification and Validation, 2004.

A. Zutshi, S. Sankaranarayanan, and A. Tiwari, Timed Relational Abstractions for Sampled Data Control Systems, Computer-Aided Verification, pp.343-361, 2012.
DOI : 10.1007/978-3-642-31424-7_27