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

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 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

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

S. Bardin, A. Finkel, J. Leroux, and L. 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
URL : https://hal.archives-ouvertes.fr/hal-00345968

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

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

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

O. Coudert, C. Berthet, and J. C. Madre, Verification of synchronous sequential machines based on symbolic execution, LNCS, vol.407, 1989.
DOI : 10.1007/3-540-52148-8_30

F. Bourdoncle, Efficient chaotic iteration strategies with widenings, LNCS, vol.735, pp.128-141, 1993.
DOI : 10.1007/BFb0039704
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.3357

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.

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

J. Leroux and G. Sutre, Acceleration in Convex Data-Flow Analysis, LNCS, vol.4855, pp.520-531, 2007.
DOI : 10.1007/978-3-540-77050-3_43
URL : https://hal.archives-ouvertes.fr/hal-00346295

Y. Bres, G. Berry, A. B. Sentovich, and E. M. , State abstraction techniques for the verification of reactive circuits, In: Designing Correct Circuits, p.2, 2002.

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

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

B. Jeannet, N. Halbwachs, and P. Raymond, Dynamic Partitioning in Analyses of Numerical Properties, Static Analysis Symposium, SAS'99, 1999.
DOI : 10.1007/3-540-48294-6_3

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

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

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

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