A. G. Akritas, Linear and quadratic complexity bounds on the values of the positive roots of polynomials, J. Univers. Comput. Sci, vol.15, pp.523-537, 2009.

F. Boulier, M. Lefranc, F. Lemaire, P. E. Morant, and A. Ürgüplü, On Proving the Absence of Oscillations in Models of Genetic Circuits, Proceedings of Algebraic Biology, pp.66-80, 2007.
DOI : 10.1007/978-3-540-73433-8_6

URL : https://hal.archives-ouvertes.fr/hal-00139667

K. D. Burhenne, Implementierung eines Algorithmus zur Quantorenelimination fur lineare reelle Probleme. Diplomarbeit, 1990.

J. F. Collard, Reasoning about Program Transformations, 2003.
DOI : 10.1007/b97654

A. Dolzmann, O. Gloor, and T. Sturm, Approaches to parallel quantifier elimination, Proceedings of the 1998 international symposium on Symbolic and algebraic computation , ISSAC '98, pp.88-95, 1998.
DOI : 10.1145/281508.281564

A. Dolzmann and T. Sturm, REDLOG, ACM SIGSAM Bulletin, vol.31, issue.2, pp.2-9, 1997.
DOI : 10.1145/261320.261324

A. Dolzmann and T. Sturm, Simplification of Quantifier-free Formulae over Ordered Fields, Journal of Symbolic Computation, vol.24, issue.2, pp.209-231, 1997.
DOI : 10.1006/jsco.1997.0123

A. Dolzmann and T. Sturm, Redlog user manual, 1999.

A. Dolzmann, T. Sturm, and V. Weispfenning, A new approach for automatic theorem proving in real geometry, Journal of Automated Reasoning, vol.21, issue.3, pp.357-380, 1998.
DOI : 10.1023/A:1006031329384

A. Dolzmann, T. Sturm, and V. Weispfenning, Real Quantifier Elimination in Practice, Algorithmic Algebra and Number Theory, pp.221-247, 1999.
DOI : 10.1007/978-3-642-59932-3_11

E. Kahoui, M. Weber, and A. , Deciding Hopf Bifurcations by Quantifier Elimination in a Software-component Architecture, Journal of Symbolic Computation, vol.30, issue.2, pp.161-179, 2000.
DOI : 10.1006/jsco.1999.0353

H. Errami, M. Eiswirth, D. Grigoriev, W. M. Seiler, T. Sturm et al., Efficient Methods to Compute Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates, Proceedings of the CASC 2013, pp.88-99, 2013.
DOI : 10.1007/978-3-319-02297-0_7

URL : https://hal.archives-ouvertes.fr/hal-00931946

H. Errami, M. Eiswirth, D. Grigoriev, W. M. Seiler, T. Sturm et al., Detection of Hopf bifurcations in chemical reaction networks using convex coordinates, Journal of Computational Physics, vol.291, pp.279-302, 2015.
DOI : 10.1016/j.jcp.2015.02.050

URL : https://hal.archives-ouvertes.fr/hal-01239486

H. Errami, T. Sturm, and A. Weber, Algorithmic aspects of Muldowney's extension of the Bendixson?Dulac criterion for polynomial vector fields, Polynomial Computer Algebra. The Euler International Mathematical Institute, pp.25-28, 2011.

K. Gatermann, M. Eiswirth, and A. Sensse, Toric ideals and graph theory to analyze Hopf bifurcations in mass action systems, Journal of Symbolic Computation, vol.40, issue.6, pp.1361-1382, 2005.
DOI : 10.1016/j.jsc.2005.07.002

K. Korovin, N. Tsiskaridze, and A. Voronkov, Conflict Resolution, In: Lect. Notes Comput. Sci, vol.1, issue.5, pp.509-523, 2009.
DOI : 10.1007/11591191_3

A. Lasaruk and T. Sturm, Weak quantifier elimination for the full linear theory of the integers, Applicable Algebra in Engineering, Communication and Computing, vol.8, issue.2, pp.545-574, 2007.
DOI : 10.1007/s00200-007-0053-x

R. Loos and V. Weispfenning, Applying Linear Quantifier Elimination, The Computer Journal, vol.36, issue.5, pp.450-462, 1993.
DOI : 10.1093/comjnl/36.5.450

G. Nelson and D. C. Oppen, Simplification by Cooperating Decision Procedures, ACM Transactions on Programming Languages and Systems, vol.1, issue.2, pp.245-257, 1979.
DOI : 10.1145/357073.357079

R. Nieuwenhuis, A. Oliveras, and C. Tinelli, Solving SAT and SAT Modulo Theories, Journal of the ACM, vol.53, issue.6, pp.937-977, 2006.
DOI : 10.1145/1217856.1217859

A. M. Seidl, T. Sturm, V. G. Ganzha, E. W. Mayr, and E. V. Vorozhtsov, Boolean quantification in a first-order context, Computer Algebra in Scientific Computing. Proceedings of the CASC 2003. Institut für Informatik, pp.329-345, 2003.

T. Sturm, Real quantifier elimination in geometry. Doctoral dissertation, 1999.

T. Sturm, Reasoning over Networks by Symbolic Methods, Applicable Algebra in Engineering, Communication and Computing, vol.10, issue.1, pp.79-96, 1999.
DOI : 10.1007/s002000050123

T. Sturm, V. G. Ganzha, E. W. Mayr, and E. V. Vorozhtsov, An Algebraic Approach to Offsetting and Blending of Solids, Computer Algebra in Scientific Computing. Proceedings of the CASC, pp.367-382, 2000.
DOI : 10.1007/978-3-642-57201-2_28

T. Sturm, Linear Problems in Valued Fields, Journal of Symbolic Computation, vol.30, issue.2, pp.207-219, 2000.
DOI : 10.1006/jsco.1999.0303

T. Sturm and A. Tiwari, Verification and synthesis using real quantifier elimination, Proceedings of the 36th international symposium on Symbolic and algebraic computation, ISSAC '11, pp.329-336, 2011.
DOI : 10.1145/1993886.1993935

T. Sturm and A. Weber, Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology, Proceedings of Algebraic Biology, pp.200-215, 2008.
DOI : 10.1007/978-3-540-85101-1_15

T. Sturm, A. Weber, E. O. Abdel-rahman, and M. Kahoui, Investigating Algebraic and Logical Algorithms to Solve Hopf Bifurcation Problems in Algebraic Biology, Mathematics in Computer Science, vol.2, issue.3, pp.493-515, 2009.
DOI : 10.1007/s11786-008-0067-1

T. Sturm and V. Weispfenning, Computational geometry problems in REDLOG Automated Deduction in Geometry, In: LNAI, vol.1360, pp.58-86, 1997.

T. Sturm and V. Weispfenning, Rounding and blending of solids by a real elimination method, Proceedings of the IMACS 97, pp.727-732, 1997.

T. Sturm and V. Weispfenning, Quantifier elimination in term algebras. The case of finite languages, Computer Algebra in Scientific Computing. Proceedings of the CASC 2002. Institut für Informatik, pp.285-300, 2002.

T. Sturm and C. Zengler, Parametric quantified SAT solving, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, pp.77-84, 2010.
DOI : 10.1145/1837934.1837954

A. Weber, T. Sturm, and E. O. Abdel-rahman, Algorithmic Global Criteria for Excluding Oscillations, Bulletin of Mathematical Biology, vol.24, issue.2, pp.899-916, 2011.
DOI : 10.1007/s11538-010-9618-0

V. Weispfenning, The complexity of linear problems in fields, Journal of Symbolic Computation, vol.5, issue.1-2, pp.3-27, 1988.
DOI : 10.1016/S0747-7171(88)80003-8

V. Weispfenning, Parametric linear and quadratic optimization by elimination, 1994.

V. Weispfenning, Quantifier elimination for real algebra---the cubic case, Proceedings of the international symposium on Symbolic and algebraic computation , ISSAC '94, pp.258-263, 1994.
DOI : 10.1145/190347.190425

V. Weispfenning, Quantifier Elimination for Real Algebra -- the Quadratic Case and Beyond, Applicable Algebra in Engineering, Communication and Computing, vol.8, issue.2, pp.85-101, 1997.
DOI : 10.1007/s002000050055

V. Weispfenning, Simulation and Optimization by Quantifier Elimination, Journal of Symbolic Computation, vol.24, issue.2, pp.189-208, 1997.
DOI : 10.1006/jsco.1997.0122

V. Weispfenning, Semilinear Motion Planning in REDLOG, Applicable Algebra in Engineering, Communication and Computing, vol.12, issue.6, pp.455-475, 2001.
DOI : 10.1007/s002000100086