Automatic modular abstractions for template numerical constraints

Logical Methods in Computer Science

Volumn 6, Issue 3, 2010, Pages 1-50

  Monniaux, David ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; DIGITAL ARITHMETIC; EMBEDDED SYSTEMS; FUNCTIONAL PROGRAMMING; STATIC ANALYSIS;

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; FLOATING POINTS; LINEAR ASSIGNMENT; LINEAR CONSTRAINTS; MODULARS; NUMERICAL CONSTRAINTS; POINT VARIABLES; PROGRAM BLOCK; RATIONAL POINTS;

RECURSIVE FUNCTIONS;

EID: 77957578743     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/lmcs-6(3:4)2010     Document Type: Article

References (108)

1. Assalé Adjé, Stéphane Gaubert, and Éric Goubault. Computing the smallest fixed point of nonexpansive mappings arising in game theory and static analysis of programs. preprint, arXiv:0806.1160v2, 2008. URL http://arxiv.org/abs/0806.1160.
2. Hirokazu Anai and Volker Weispfenning. Deciding linear-trigonometric problems.In International symposium on symbolic and algebraic computation (ISSAC). ACM, 2000. ISBN 1-58113-218-2. doi: 10.1145/345542.345567.
3. Karl Johan Åströom and Bjöorn Wittenmark. Computer-controlled systems. Prentice-Hall, 1997. ISBN 0-13-314899-8.
4. Roberto Bagnara, Patricia M. Hill, and Enea Zaffanella. The Parma Polyhedra Li-brary, version 0.9. URL http://www.cs.unipr.it/ppl.
5. Roberto Bagnara, Patricia M. Hill, Elena Mazzi, and Enea Zaffanella. Wideningoperators for weakly-relational numeric abstractions. In Hankin and Siveroni [60],pages 3-18. ISBN 3-540-28584-9. doi: 10.1007/11547662 3.
6. Roberto Bagnara, Patricia M. Hill, Elisa Ricci, and Enea Zaffanella. Precise wideningoperators for convex polyhedra. Science of Computer Programming, 58(1-2):28-56, 2005. doi: 10.1016/j.scico.2005.02.003.
7. Roberto Bagnara, Enric Rodríguez-Carbonell, and Enea Zaffanella. Generation ofbasic semi-algebraic invariants using convex polyhedra. In Hankin and Siveroni [60],pages 19-34. ISBN 3-540-28584-9. doi: 10.1007/11547662 4.
8. Thomas Ball, Rupak Majumdar, Todd Millstein, and Sriram K. Rajamani. Automaticpredicate abstraction of C programs. In PLDI, pages 203-213. ACM, 2001. ISBN 1-58113-414-2. doi: 10.1145/378795.378846.
9. Clark Barrett, Silvio Ranise, Aaron Stump, and Cesare Tinelli. The satisfiabilitymodulo theories library (SMT-LIB). www.smtlib.org, 2008.
10. Saugata Basu, Richard Pollack, and Marie-Françoise Roy. Algorithms in real algebraicgeometry. Algorithms and computation in mathematics. Springer, 2nd edition, 2006.ISBN 3-540-33098-4.
11. Bernd Becker, Christian Dax, Jochen Eisinger, and Felix Klaedtke. LIRA: handlingconstraints of linear arithmetics over the integers and the reals. In Werner Damm andHolger Hermanns, editors, Computer-aided verification (CAV), volume 4590 of LNCS,pages 307-310. Springer, 2007. ISBN 978-3-540-73367-6. doi: 10.1007/978-3-540-73368-3 36.
12. Dirk Beyer, Thomas A. Henzinger, Ranjit Jhala, and Rupak Majumdar. The softwaremodel checker blast. Int. J. of Software Tools for Technology Transfer (STTT), 9(5-6):505-525, 2007. doi: 10.1007/s10009-007-0044-z. Special section FASE '04/05.
13. Armin Biere, Alessandro Cimatti, Edmund M. Clarke, Ofer Strichman, and YunshanZhu. Bounded model checking. Advances in Computers, 58:118-149, August 2003.doi: 10.1016/S0065-2458(03)58003-2.
14. Bruno Blanchet, Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne,Antoine Miné, David Monniaux, and Xavier Rival. Design and implementation of aspecial-purpose static program analyzer for safety-critical real-time embedded software.In Torben Æ. Mogensen, David A. Schmidt, and I. Hal Sudborough, editors,The Essence of Computation: Complexity, Analysis, Transformation, number 2566 inLNCS, pages 85-108. Springer, 2002. ISBN 3-540-00326-6. doi: 10.1007/3-540-36377-7 5.
15. Bruno Blanchet, Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne,Antoine Miné, David Monniaux, and Xavier Rival. A static analyzer for large safetycriticalsoftware. In Programming Language Design and Implementation (PLDI),pages 196-207. ACM, 2003. ISBN 1-58113-662-5. doi: 10.1145/781131.781153.
16. Bernard Boigelot, Sébastien Jodogne, and Pierre Wolper. An effective decision procedurefor linear arithmetic over the integers and reals. ACM Transactions on Compu-tational Logic (TOCL), 6(3):614-633, 2005. ISSN 1529-3785. doi: 10.1145/1071596.1071601.
17. Ahmed Bouajjani, Javier Esparza, and Oded Maler. Reachability analysis of pushdownautomata: Application to model-checking. In Antoni W. Mazurkiewicz andJózef Winkowski, editors, Concurrency Theory (CONCUR), volume 1243 of LectureNotes in Computer Science, pages 135-150. Springer, 1997. ISBN 3-540-63141-0. doi:10.1007/3-540-63141-0 10.
18. François Bourdoncle. Sémantique des langages impératifs d'ordre supérieur et in-terprétation abstraite. PhD thesis, École polytechnique, Palaiseau, 1992.
19. Aaron R. Bradley and Zohar Manna. The Calculus of Computation: Decision Proce-dures with Applications to Verification. Springer, October 2007. ISBN 3-540-74112-7.
20. Dominique Brière and Pascal Traverse. Airbus A320/A330/A340 electrical ightcontrols {pipe} a family of fault-tolerant systems. In FTCS-23 (Symposium on Fault-Tolerant Computing), pages 616-623. IEEE, June 1993. ISBN 0-8186-3680-7. doi:10.1109/FTCS.1993.627364.
21. Christopher W. Brown and James H. Davenport. The complexity of quantifier eliminationand cylindrical algebraic decomposition. In ISSAC (Symposium on Symbolicand algebraic computation), pages 54-60. ACM, 2007. ISBN 978-1-59593-743-8. doi:10.1145/1277548.1277557.
22. Stephen L. Campbell, Jean-Philippe Chancelier, and Ramine Nikoukhah. Modelingand Simulation in Scilab/Scicos. Springer, 2006. ISBN 0-387-27802-8.
23. Paul Caspi, Daniel Pilaud, Nicolas Halbwachs, and John A. Plaice. LUSTRE: adeclarative language for real-time programming. In POPL (Symposium on Princi-ples of programming languages), pages 178-188. ACM, 1987. ISBN 0-89791-215-2. doi:10.1145/41625.41641.
24. Bob F. Caviness and Jeremy R Johnson, editors. Quantifier elimination and cylindri-cal algebraic decomposition. Springer, 1998. ISBN 3-211-82794-3.
25. Robert Clarisó and Jordi Cortadella. The octahedron abstract domain. In RobertoGiacobazzi, editor, Static Analysis (SAS), number 3148 in LNCS. Springer, 2004.ISBN 3-540-22791-1. doi: 10.1007/b99688.
26. Edmund Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith.Counterexample-guided abstraction refinement for symbolic model checking. Jour-nal of the ACM, 50(5):752-794, 2003. ISSN 0004-5411. doi: 10.1145/876638.876643.
27. Edmund M. Clarke, Jr, Orna Grumberg, and Doron A. Peled. Model Checking. MITPress, 1999. ISBN 0-262-03270-8.
28. George Collins. Quantifier elimination for real closed fields by cylindric algebraicdecomposition. In Automata theory and formal languages (2nd GI conference), LNCS,pages 134-183. Springer, 1975. ISBN 0-387-07407-4. reprinted as [24].
29. Michael A. Colón, Sriram Sankaranarayanan, and Henny Sipma. Linear invariantgeneration using non-linear constraint solving. In Computer Aided Verification(CAV), number 2725 in LNCS, pages 420-433. Springer, 2003. ISBN 3-540-40524-0. doi:10.1007/b11831.
30. D. C. Cooper. Theorem proving in arithmetic without multiplication. In BernardMeltzer and Donald Michie, editors, Machine Intelligence 7, pages 91-100. EdinburghUniversity Press, 1972. ISBN 0-85224-234-4.
31. Alexandru Costan, Stephane Gaubert, Éric Goubault, Matthieu Martel, and SylviePutot. A policy iteration algorithm for computing fixed points in static analysis ofprograms. In Etessami and Rajamani [46], pages 462-475. ISBN 3-540-27231-3. doi:10.1007/11513988 46.
32. Patrick Cousot. Proving program invariance and termination by parametric abstraction,Lagrangian relaxation and semidefinite programming. In Radhia Cousot, editor,Verification, Model Checking and Abstract Interpretation (VMCAI), number 3385 inLNCS, pages 1-24. Springer, 2005. ISBN 3-540-24297-X. doi: 10.1007/b105073.
33. Patrick Cousot. Méthodes itératives de construction et d'approximation de points fixesd'opérateurs monotones sur un treillis, analyse sémantique des programmes. Statedoctorate thesis, Université scientifique et médicale de Grenoble and Institut NationalPolytechnique de Grenoble, 1978. URL http://tel.archives-ouvertes.fr/tel-00288657/en/.
34. Patrick Cousot and Radhia Cousot. Static determination of dynamic properties ofprograms. In Proceedings of the Second International Symposium on Programming(1976), pages 106-130, Paris, 1977. Dunod. ISBN 2-04-005185-6. Also known as Actesdu deuxième colloque international sur la programmation.
35. Patrick Cousot and Radhia Cousot. Abstract interpretation frameworks. J. of Logicand Computation, pages 511-547, August 1992. ISSN 0955-792X. doi: 10.1093/log-com/2.4.511.
36. Patrick Cousot and Nicolas Halbwachs. Automatic discovery of linear restraints amongvariables of a program. In Principles of Programming Languages (POPL), pages 84-96. ACM, 1978. doi: 10.1145/512760.512770.
37. Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné,David Monniaux, and Xavier Rival. The ASTRÉE analyzer. In Shmuel \Mooly"Sagiv, editor, Programming Languages and Systems (ESOP), number 3444 in LNCS,pages 21-30. Springer, 2005. ISBN 3-540-25435-8. doi: 10.1007/b107380.
38. Patrick Cousot, Radhia Cousot, Jerome Feret, Antoine Miné, Laurent Mauborgne,David Monniaux, and Xavier Rival. Varieties of static analyzers: A comparison withASTRÉE. In Theoretical Aspects of Software Engineering (TASE). IEEE, 2007. ISBN0-7695-2856-2.
39. Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné,David Monniaux, and Xavier Rival. Combination of abstractions in the astrée staticanalyzer. In Mitsu Okada and Ichiro Satoh, editors, Advances in Computer Science{pipe} ASIAN 2006, volume 4435 of LNCS, pages 272-300. Springer, 2008. ISBN 978-3-540-77504-1. doi: 10.1007/978-3-540-77505-8 23. URL http://www.di.ens.fr/~cousot/COUSOTpapers/ASIAN06.shtml.
40. James H. Davenport and Joos Heintz. Real quantifier elimination is doubly exponential.Journal of Symbolic Computation, 5(1-2):29-35, April 1988. doi: 10.1016/S0747-7171(88)80004-X.
41. Leonardo de Moura and Nikolaj Bjørner. Z3: An efficient SMT solver. In C. R.Ramakrishnan and Jakob Rehof, editors, TACAS, volume 4963 of LNCS, pages 337-340. Springer, 2008. ISBN 3-540-78799-2. doi: 10.1007/978-3-540-78800-3 24.
42. Rocco de Nicola, editor. Programming Languages and Systems (ESOP), volume 4421of LNCS, 2007. Springer. ISBN 978-3-540-71316-6.
43. David Delmas and Jean Souyris. Astrée: From research to industry. In Nielson and Filé [86], pages 437-451. ISBN 978-3-540-74060-5. doi: 10.1007/978-3-540-74061-2 27.
44. Andreas Dolzmann, Andreas Seidl, and Thomas Sturm. Redlog User Manual, 3.1edition, 2006. for Redlog version 3.06 and Reduce version 3.8.
45. Bruno Dutertre and Leonardo de Moura. A fast linear-arithmetic solver for DPLL(T).In Thomas Ball and Robert B. Jones, editors, Computer-aided verification (CAV),volume 4144 of LNCS, pages 81-94. Springer, 2006. ISBN 3-540-37406-X. doi:10.1007/11817963 11.
46. Kousha Etessami and Sriram K. Rajamani, editors. Computer Aided Verification(CAV), number 4590 in LNCS, 2005. Springer. ISBN 3-540-27231-3. doi: 10.1007/b138445.
47. Jeanne Ferrante and Charles Rackoff. A decision procedure for the first order theoryof real addition with order. SIAM J. on Computing, 4(1):69-76, March 1975. ISSN0097-5397. doi: 10.1137/0204006.
48. Michael J. Fischer and Michael O. Rabin. Super-exponential complexity of Presburgerarithmetic. In Richard Karp, editor, Complexity of Computation, number 7 in SIAM-AMS proceedings, pages 27-42. American Mathematical Society, 1974. ISBN 0-8218-1327-7.
49. Stéphane Gaubert, Éric Goubault, Ankur Taly, and Sarah Zennou. Static analysisby policy iteration on relational domains. In de Nicola [42], pages 237-252. ISBN978-3-540-71316-6.
50. Thomas Gawlitza and Helmut Seidl. Precise relational invariants through strategyiteration. In Jacques Duparc and Thomas A. Henzinger, editors, Computer sciencelogic (CSL), volume 4646 of LNCS, pages 23-40. Springer, 2007. ISBN 978-3-540-74914-1.doi: 10.1007/978-3-540-74915-8 6.
51. Thomas Gawlitza and Helmut Seidl. Precise fixpoint computation through strategyiteration. In de Nicola [42], pages 300-315. ISBN 978-3-540-71316-6. doi: 10.1007/978-3-540-71316-6 21.
52. Laure Gonnord. Accelération abstraite pour l'amélioration de la précision en analysedes relations linéaires. PhD thesis, Université Joseph Fourier, October 2007. URLhttp://tel.archives-ouvertes.fr/tel-00196899/en/.
53. Laure Gonnord and Nicolas Halbwachs. Combining widening and acceleration inlinear relation analysis. In Kwangkeun Yi, editor, Static analysis (SAS), volume 4134 of LNCS, pages 144-160. Springer, 2006. ISBN 3-540-37756-5. doi: 10.1007/11823230 10.
54. Denis Gopan and Thomas W. Reps. Lookahead widening. In Thomas Ball andRobert B. Jones, editors, Computer Aided Verification (CAV), volume 4144 of LNCS,pages 452-466. Springer, 2006. ISBN 3-540-37406-X. doi: 10.1007/11817963 41.
55. Philippe Granger. Static analysis of linear congruence equalities among variables of aprogram. In TAPSOFT, volume 493 of LNCS. Springer, 1991. doi: 10.1007/3-540-53982-4 10.
56. Sumit Gulwani, Saurabh Srivastava, and Ramarathnam Venkatesan. Program analysisas constraint solving. In Programming Language Design and Implementation (PLDI).ACM, 2008. ISBN 978-1-59593-860-2. doi: 10.1145/1375581.1375616.
57. Nicolas Halbwachs. Delay analysis in synchronous programs. In Costas Courcoubetis,editor, Computer Aided Verification (CAV), volume 697 of LNCS, pages 333-346.Springer, 1993. ISBN 3-540-56922-7. doi: 10.1007/3-540-56922-7 28.
58. Nicolas Halbwachs. Détermination automatique de relations linéaires vérifiées parles variables d'un programme. PhD thesis, Université scientifique et médicale deGrenoble and Institut National Polytechnique de Grenoble, 1979. URL http://tel.archives-ouvertes.fr/tel-00288805/en/.
59. Nicolas Halbwachs, Yann-Erick Proy, and Pascal Raymond. Verification of linear hybridsystems by means of convex approximations. In Static analysis (SAS), September1994. ISBN 3-540-58485-4. doi: 10.1007/3-540-58485-4 43.
60. Chris Hankin and Igor Siveroni, editors. Static analysis (SAS), volume 3672 of LNCS, 2005. Springer. ISBN 3-540-28584-9.
61. IEEE standard for Binary oating-point arithmetic for microprocessor systems. IEEE, 1985. ANSI/IEEE Std 754-1985.
62. Bertrand Jeannet. Dynamic partitioning in linear relation analysis. application to theverification of reactive systems. Formal Methods in System Design, 23(1):5-37, July2003. ISSN 0925-9856. doi: 10.1023/A:1024480913162.
63. William Kahan. Advantages of gradual over abrupt underow to zero. Slides of akeynote talk given at ARITH17, 2005.
64. Deepak Kapur. Automatically generating loop invariants using quantifier elimination.In Applications of Computer Algebra (ACA), 2004.
65. Michael Karr. Affine relationships among variables of a program. Acta Informatica, 6(2), June 1976.
66. Daniel Kroening and Ofer Strichman. Decision procedures. Springer, 2008. ISBN978-3-540-74104-6.
67. Akash Lal, Gogul Balakrishnan, and Thomas Reps. Extended weighted pushdownsystems. In Etessami and Rajamani [46], pages 343-357. ISBN 3-540-27231-3. doi:10.1007/11817963 32.
68. Jérôme Leroux and Grégoire Sutre. Accelerated data-ow analysis. In Static Analysis, 14th International Symposium, SAS 2007, Kongens Lyngby, Denmark, August 22-24, 2007, Proceedings, volume 4634 of Lecture Notes in Computer Science, pages 184-199.Springer, 2007. doi: 10.1007/s10009-008-0064-3.
69. Rüudiger Loos and Volker Weispfenning. Applying linear quantifier elimination. TheComputer Journal, 36(5):450-462, 1993. Special issue on computational quantifierelimination.
70. Zohar Manna and John McCarthy. Properties of programs and partial function logic.In Bernard Meltzer and Donald Michie, editors, Machine Intelligence, 5, pages 27-38.Edinburgh University Press, 1969. ISBN 0-85224-176-3.
71. Zohar Manna and Amir Pnueli. Formalization of properties of functional programs.Journal of the ACM, 17(3):555-569, 1970. doi: 10.1145/321592.321606.
72. Florian Martin, Martin Alt, Reinhard Wilhelm, and Christian Ferdinand. Analysis ofloops. In Kai Koskimies, editor, Compiler Construction (CC), volume 1383 of LNCS,pages 80-94. Springer, 1998. ISBN 3-540-64304-4. doi: 10.1007/BFb0026424.
73. Yuri V. Matiyasevich. Hilbert's Tenth Problem. MIT Press, 1993. ISBN 0262132958.
74. Antoine Miné. The octagon abstract domain. In Axel Simon, Andy King, and JacobM. Howe, editors, WCRE (Analysis, Slicing, and Transformation), pages 310-319.IEEE, 2001. doi: 10.1109/WCRE.2001.957836.
75. Antoine Miné. Relational abstract domains for the detection of oating-point run-timeerrors. In David Schmidt, editor, Programming Languages and Systems (ESOP), number 2986 in LNCS, pages 3-17. Springer, 2004. ISBN 3-540-21313-9. doi: 10.1007/b96702.
76. Antoine Miné. Domaines numériques abstraits faiblement relationnels. PhD thesis,École polytechnique, 2004. URL http://tel.archives-ouvertes.fr/tel-00136630/fr/.
77. Antoine Miné. The octagon abstract domain. Higher-Order and Symbolic Computa-tion, 19(1):31-100, 2006. doi: 10.1007/s10990-006-8609-1.
78. Antoine Miné. Symbolic methods to enhance the precision of numerical abstractdomains. In Verification, Model Checking, and Abstract Interpretation (VMCAI'06),volume 3855 of LNCS, pages 348-363. Springer, January 2006. ISBN 3-540-31139-4. doi:10.1007/11609773.
79. David Monniaux. Compositional analysis of oating-point linear numerical filters. InEtessami and Rajamani [46], pages 199-212. ISBN 3-540-27231-3. doi: 10.1007/b138445.
80. David Monniaux. Quantifier elimination by lazy model enumeration. In Computeraided verification (CAV), LNCS. Springer, 2010. To appear.
81. David Monniaux. A quantifier elimination algorithm for linear real arithmetic. InIliano Cervesato, Helmut Veith, and Andrei Voronkov, editors, Logic for ProgrammingArtificial Intelligence and Reasoning (LPAR), volume 5330 of LNAI, pages 243-257.Springer, 2008. ISBN 978-3-540-89438-4. doi: 10.1007/978-3-540-89439-1 18.
82. David Monniaux. Automatic modular abstractions for linear constraints. In BenjaminC. Pierce, editor, Symposium on Principles of programming languages (POPL).ACM, 2009. ISBN 978-1-60558-379-2. doi: 10.1145/1480881.1480899.
83. David Monniaux. Optimal abstraction on real-valued programs. In Nielson and Filé, pages 104-120. ISBN 978-3-540-74060-5. doi: 10.1007/978-3-540-74061-2 7.
84. David Monniaux. The pitfalls of verifying oating-point computations. Transactionson programming languages and systems (TOPLAS), 30(3):12, May 2008. ISSN 0164-0925. doi: 10.1145/1353445.1353446. URL http://hal.archives-ouvertes.fr/hal-00128124/en/.
85. George C. Necula, Scott McPeak, Shree P. Rahul, and Westley Weimer. CIL: Intermediatelanguage and tools for analysis and transformation of C programs. In R. NigelHorspool, editor, Compiler Construction (CC), volume 2304 of LNCS, pages 209-265.Springer, 2002. ISBN 3-540-43369-4. doi: 10.1007/3-540-45937-5 16.
86. Hanne Riis Nielson and Gilberto Filé, editors. Static analysis (SAS), volume 4634 ofLNCS, 2007. Springer. ISBN 978-3-540-74060-5.
87. Tobias Nipkow. Linear quantifier elimination. In Alessandro Armando, Peter Baumgartner,and Gilles Dowek, editors, Automated reasoning (IJCAR), volume 5195 ofLNCS, pages 18-33. Springer, 2008. ISBN 978-3-540-71069-1. doi: 10.1007/978-3-540-71070-7 3.
88. Dominique Perrin. Finite automata. In Jan van Leeuwen, editor, Handbook of Theo-retical Computer Science, vol. B, chapter 1. MIT Press, 1990. ISBN 0444880747.
89. Mojżesz Presburger. Über die Vollstandigkeit eines Gewissen Systems der ArithmetikGanzer Zahlen, in Welchem die Addition als Einzige Operation Hervortritt. InComptes-rendus du premier congrès des mathématiciens des pays slaves, pages 92-101,Warsaw, 1929.
90. William Pugh. The Omega test: a fast and practical integer programming algorithmfor dependence analysis. In Supercomputing '91, pages 4-13. ACM, 1991. ISBN 0-89791-459-7. doi: 10.1145/125826.125848.
91. Thomas W. Reps, Shmuel Sagiv, and Reinhard Wilhelm. Static program analysis via3-valued logic. In Rajeev Alur and Doron Peled, editors, Computer Aided Verification(CAV), volume 3114 of LNCS, pages 15-30. Springer, 2004. ISBN 3-540-22342-8. doi:10.1007/b98490.
92. Henry Gordon Rice. Classes of recursively enumerable sets and their decision problems.Transactions of the American Mathematical Society, 74(2):358-366, March 1953.
93. Xavier Rival and Laurent Mauborgne. The trace partitioning abstract domain. Trans-actions on Programming Languages and Systems (TOPLAS), 29(5):26, 2007. ISSN0164-0925. doi: 10.1145/1275497.1275501.
94. E. Rodríguez-Carbonell and D. Kapur. Automatic generation of polynomial invariantsof bounded degree using abstract interpretation. Science of Computer Programming, 64(1):54-75, 2007. ISSN 0167-6423. doi: 10.1016/j.scico.2006.03.003.
95. Enric Rodríguez-Carbonell and Deepak Kapur. An abstract interpretation approachfor automatic generation of polynomial invariants. In SAS (Static Analysis), number3148 in LNCS. Springer, 2004.
96. Hartley Rogers, Jr. Theory of Recursive Functions and Effective Computability. MITPress, 1987. ISBN 0-262-68052-1.
97. Radu Rugina and Martin Rinard. Symbolic bounds analysis for pointers, array indices,and accessed memory regions. ACM Trans. on Programming Languages and Systems(TOPLAS), 27(2):185-235, 2005. doi: 10.1145/349299.349325.
98. Sriram Sankaranarayanan, Henny Sipma, and Zohar Manna. Constraint-based linearrelationsanalysis. In Static Analysis (SAS), number 3148 in LNCS, pages 53-68.Springer, 2004. doi: 10.1007/b99688.
99. Sriram Sankaranarayanan, Henny Sipma, and Zohar Manna. Scalable analysis oflinear systems using mathematical programming. In Verification, Model Checking,and Abstract Interpretation (VMCAI), volume 3385 of LNCS, pages 21-47. Springer, 2005. doi: 10.1007/b105073.
100. Christoph Scholl, Stefan Disch, Florian Pigorsch, and Stefan Kupferschmid. Computingoptimized representations for non-convex polyhedra by detection and removalof redundant linear constraints. In Stefan Kowalewski and Anna Philippou, editors,Tools and Algorithms for Construction and Analysis of Systems (TACAS), volume5505 of LNCS, pages 383-397. Springer, 2009. ISBN 978-3-642-00767-5. doi: 10.1007/978-3-642-00768-2 32.
101. Abraham Seidenberg. A new decision method for elementary algebra. Annals of Math-ematics, 60(2):365-374, September 1954. URL http://www.jstor.org/stable/1969640.
102. Helmut Seidl, Andrea Flexeder, and Michael Petter. Interprocedurally analysing linearinequality relations. In de Nicola [42], pages 284-299. ISBN 978-3-540-71316-6. doi:10.1007/978-3-540-71316-6 20.
103. Micha Sharir and Amir Pnueli. Two approaches to inter-procedural data-ow analysis.In Neil Jones and Steven Muchnik, editors, Program Flow Analysis: Theory andApplication. Prentice-Hall, 1981.
104. Jean Souyris and David Delmas. Experimental assessment of Astrée on safety-criticalavionics software. In Francesca Saglietti and Norbert Oster, editors, SAFECOMP,volume 4680 of LNCS, pages 479-490. Springer, 2007. ISBN 978-3-540-75100-7. doi:10.1007/978-3-540-75101-4 45.
105. Alfred Tarski. A Decision Method for Elementary Algebra and Geometry. Universityof California Press, 1951. reprinted as [106].
106. Alfred Tarski. A decision method for elementary algebra and geometry. TechnicalReport 109, The RAND Corporation, 1957. Second edition (original 1948, revised1951), reprint of [105].
107. Volker Weispfenning. The complexity of linear problems in fields. Journal of Sym-bolic Computation, 5(1-2):3-27, February 1988. ISSN 0747-7171. doi: 10.1016/S0747-7171(88)80003-8.
108. Stephen Wolfram. The Mathematica Book. Wolfram Research, 2005. Manual comingwith version 5.2 of Mathematica.