?. Soient-? and ?. ?-un-État-concret-et-r, (?) un choix de représentants. On pose ? = ? ? r. On a alors ? ? ?(?) ? ? donc ? ? ?

«. Acronyme-de, . Data-word, and . Logic, Acronyme de « Composite Structures Logic » 6 Acronyme de « Unbounded Array with Bounded Element » A[1] = 3; A[2] = 7; x = A[ 1 ] ; A[1] = A[ 2 ] ; A[2] = x ; (a) array

. Le-troisième-construit-un-tableau, Cette version du programme va forcer l'analyseur à considérer une relation privilégiée entre chaque cellule et sa cellule suivante. On aura bien entendu la propriété A[0] = c. L'analyseur ne produisant pas de relations entre les cellules et leurs indices, il ne pourra découvrir A[] = c + . En revanche, il découvre la propriété ? 1

M. [. Aho, J. D. Garey, and . Ullman, The Transitive Reduction of a Directed Graph, SIAM Journal on Computing, vol.1, issue.2, pp.131-137, 1972.
DOI : 10.1137/0201008

A. Allamigeon, Non-disjunctive Numerical Domain for Array Predicate Abstraction, Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems, ESOP'08/ETAPS'08, pp.163-177, 2008.
DOI : 10.1007/978-3-540-78739-6_14

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.592.1207

B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne et al., The essence of computation . chapter Design and implementation of a special-purpose static program analyzer for safety-critical real-time embedded software, pp.85-108, 2002.

A. Bouajjani, C. Dr?-agoi, C. Enea, A. Rezine, and M. Sighireanu, Invariant Synthesis for Programs Manipulating Lists with Unbounded Data, Proceedings of the 22nd international conference on Computer Aided Verification, CAV'10, pp.72-88, 2010.
DOI : 10.1007/978-3-642-14295-6_8

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

A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, A Logic-Based Framework for Reasoning about Composite Data Structures, pp.178-195, 2009.
DOI : 10.1016/j.jlap.2006.12.001

]. R. Bel52 and . Bellman, On the Theory of Dynamic Programming, Proceedings of the National Academy of Sciences, pp.716-719, 1952.

A. [. Bardin, J. Finkel, L. Leroux, and . Petrucci, FAST: Fast Acceleration of Symbolic Transition Systems, Lecture Notes in Computer Science, vol.2725, 2003.
DOI : 10.1007/978-3-540-45069-6_12

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

M. Bozga, P. Habermehl, R. Iosif, F. Konecný, and T. Vojnar, Automatic Verification of Integer Array Programs, Computer Aided Verification, 21st International Conference, pp.157-172, 2009.
DOI : 10.1007/978-3-642-02658-4_15

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

A. Bouajjani, P. Habermehl, Y. Jurski, M. Sighireanu, [. Beyer et al., Rewriting systems with data (cité page 190) Path invariants, Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation, PLDI '07, pp.1-22, 2007.
DOI : 10.1007/978-3-540-74240-1_1

A. R. Bradley, Z. Manna, and H. B. Sipma, What???s Decidable About Arrays?, Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation, VMCAI'06, pp.427-442, 2006.
DOI : 10.1007/11609773_28

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.4969

[. Bourdoncle, Efficient chaotic iteration strategies with widenings, International Conference on 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

R. [. Cousot and . Cousot, Static determination of dynamic properties of programs, 2nd Int. Symp. on Programming. Dunod, pp.16-150, 1976.

R. [. Cousot and . Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.2-9, 1977.
DOI : 10.1145/512950.512973

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

P. Cousot and R. Cousot, Abstract Interpretation Frameworks, Journal of Logic and Computation, vol.2, issue.4, pp.511-547, 1992.
DOI : 10.1093/logcom/2.4.511

R. Clarisó and J. Cortadella, The octahedron abstract domain, Science of Computer Programming, vol.64, issue.1, pp.115-139
DOI : 10.1016/j.scico.2006.03.009

[. Cousot, R. Cousot, and F. Logozzo, A parametric segmentation functor for fully automatic and scalable array content analysis, ACM SIGPLAN Notices, vol.46, issue.1, pp.105-118, 2011.
DOI : 10.1145/1925844.1926399

URL : https://hal.archives-ouvertes.fr/inria-00543874

E. [. Clarke, A. P. Emerson, and . Sistla, Automatic verification of finitestate concurrent systems using temporal logic specifications, ACM TOPLAS, vol.8, issue.2, p.1986
DOI : 10.1145/5397.5399

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.9102

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

O. E. Clarke, S. Grumberg, Y. Jha, H. Lu, and . Veith, Counterexample-guided abstraction refinement for symbolic model checking, Preliminary version in CAV'2000, pp.752-794, 2003.
DOI : 10.1145/876638.876643

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.8938

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, pp.16-165, 1978.
DOI : 10.1145/512760.512770

P. Cousot, Verification by Abstract Interpretation, International Symposium on Verification, pp.243-268, 2003.
DOI : 10.1007/978-3-540-39910-0_11

URL : https://hal.archives-ouvertes.fr/inria-00528611

[. Cheng and X. Rival, An Abstract Domain to Infer Types over Zones in Spreadsheets, SAS, pp.94-110
DOI : 10.1007/978-3-642-33125-1_9

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

P. David, Interprétation abstraite en logique intuitionniste : extraction d'analyseurs Java certifiés, 2005.

S. Das, D. L. Dill, and S. Park, Experience with Predicate Abstraction, Lecture Notes in Computer Science, vol.1633, pp.160-171, 1999.
DOI : 10.1007/3-540-48683-6_16

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.3860

W. Edsger and . Dijkstra, A discipline of programming, pp.201-208, 1976.

L. David and . Dill, Timing assumptions and verification of finite-state concurrent systems , in lecture notes in computer science 407, Automatic Verification Methods for Finite State Systems, pp.6-16, 1989.

S. [. Flanagan and . Qadeer, Predicate abstraction for software verification, POPL 2002, pp.191-202, 2002.
DOI : 10.1145/565816.503291

D. Gopan, F. Dimaio, N. Dor, T. W. Reps, and S. Sagiv, Numeric Domains with Summarized Dimensions, Lecture Notes in Computer Science, vol.2988, issue.83, pp.512-529, 2004.
DOI : 10.1007/978-3-540-24730-2_38

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.8931

[. Gulwani, B. Mccloskey, and A. Tiwari, Lifting abstract interpreters to quantified logical domains, POPL, pp.235-246, 2008.
DOI : 10.1145/1328438.1328468

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.9559

L. Gonnord, Acceleration abstraite pour l'amelioration de la precision en analyse des relations lineaires, p.195, 2007.
URL : https://hal.archives-ouvertes.fr/tel-00196899

D. Gopan and T. W. Reps, Guided Static Analysis, SAS, pp.349-365, 2007.
DOI : 10.1007/978-3-540-74061-2_22

[. Gopan, T. W. Reps, and S. Sagiv, A framework for numeric analysis of array operations, POPL, pp.338-350, 2005.

H. [. Graf and . Saidi, Construction of abstract state graphs with PVS, Conference on Computer Aided Verification CAV'97, 1997.
DOI : 10.1007/3-540-63166-6_10

N. Halbwachs and J. Henry, When the Decreasing Sequence Fails, 19th International Static Analysis Symposium, SAS'12, pp.198-213, 2012.
DOI : 10.1007/978-3-642-33125-1_15

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

[. Habermehl, R. Iosif, and T. Vojnar, What Else Is Decidable about Integer Arrays?, Static analysis (SAS), pp.474-489, 2008.
DOI : 10.1007/978-3-540-78499-9_33

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

N. Halbwachs and M. Péron, Discovering properties about arrays in simple programs, ACM Conference on Programming Language Design and Implementation , PLDI 2008, pp.339-348, 2008.
DOI : 10.1145/1379022.1375623

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

[. Jeannet, D. Gopan, and T. W. Reps, A Relational Abstraction for Functions, SAS, pp.186-202, 2005.
DOI : 10.1007/11547662_14

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.143.3818

K. [. Jhala and . Mcmillan, Array Abstractions from Proofs, CAV 2007, pp.193-206, 2007.
DOI : 10.1007/978-3-540-73368-3_23

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.8283

[. Jeannet and A. Miné, Apron: A Library of Numerical Abstract Domains for Static Analysis, Lecture Notes in Computer Science, vol.5643, pp.661-667, 2009.
DOI : 10.1007/978-3-642-02658-4_52

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

]. M. Kar76 and . Karr, Affine relationships among variables of a program, Acta Informatica, vol.6, issue.17, pp.133-151, 1976.

[. Kleene, Introduction to metamathematics, Bibl. Matematica. North- Holland, pp.1952-1963

L. Kovács and A. Voronkov, Finding Loop Invariants for Programs over Arrays Using a Theorem Prover, Lecture Notes in Computer Science, vol.5503, pp.470-485, 2009.
DOI : 10.1007/978-3-642-00593-0_33

T. Lev-ami, T. Reps, M. Sagiv, and R. Wilhelm, Putting static analysis to work for verification : A case study, Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis, ISSTA '00, pp.26-38, 2000.

R. [. Lahiri and . Bryant, Indexed Predicate Discovery for Unbounded System Verification, LNCS, vol.3114, pp.135-147, 2004.
DOI : 10.1007/978-3-540-27813-9_11

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.3383

F. Logozzo and M. Fähndrich, Pentagons, Proceedings of the 2008 ACM symposium on Applied computing , SAC '08, pp.796-807
DOI : 10.1145/1363686.1363736

A. Miné, The octagon abstract domain, AST, pp.310-319, 2001.

A. Miné, The octagon abstract domain. Higher-Order and Symbolic Computation, pp.31-100, 2006.

D. Monniaux, Analyse statique : de la théorie à la pratique. Habilitation to direct research, 2009.

D. Monniaux, A minimalistic look at widening operators. Higher-Order and Symbolic Computation, pp.145-154, 2009.
DOI : 10.1007/s10990-009-9046-8

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

M. Péron, Contributions à l'analyse statique de programmes manipulant des tableaux, p.195

M. Péron and N. Halbwachs, An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints, VMCAI'07 : Eighth International Conference on Verification, Model Checking, and Abstract Interpretation, pp.268-282, 2007.
DOI : 10.1007/978-3-540-69738-1_20

J. [. Queille, H. G. Sifakis, and . Rice, Specification and verification of concurrent systems in Cesar Classes of recursively enumerable sets and their decision problems) [SG09] Saurabh Srivastava and Sumit Gulwani. Program verification using templates over predicate abstraction Concrete memory models for shape analysis, Pre29] Mojesz Pressburger. Über die vollständigkeit eines gewissen systems der arithmetik ganzer zahlen Comptes-Rendus du I Congrès de Mathématiciens des Pays Slaves International Symposium on Programming Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation, PLDI '09 ACM. (cité page 193) [SJR10] Pascal Sotin, Bertrand Jeannet, and Xavier Rival, pp.92-101358, 1929.

A. Simon, A. King, and J. M. Howe, Two variables per linear inequality as an abstract domain (cité page 16) [SPW09] Mohamed Nassim Seghir, Andreas Podelski, and Thomas Wies Abstraction refinement for quantified array assertions (cité page 192) [SRW99] Mooly Sagiv, Thomas Reps, and Reinhard Wilhelm. Parametric shape analysis via 3-valued logic, Proceedings of the 12th international conference on Logic based program synthesis and transformation, LOPSTR'02 Proceedings of the 16th International Symposium on Static Analysis, SAS '09 Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL '99, pp.71-89, 1999.

H. Saïdi and N. Shankar, Abstract and Model Check while You Prove
DOI : 10.1007/3-540-48683-6_38

A. Syropoulos, Mathematics of Multisets, Proceedings of the Workshop on Multiset Processing : Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View, WMP '00, pp.347-358, 2001.
DOI : 10.1007/3-540-45523-X_17

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.285-309, 1955.
DOI : 10.2140/pjm.1955.5.285

[. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418

M. Zhou, F. He, . Bow-yaw, M. Wang, and . Gu, On Array Theory of Bounded Elements, Lecture Notes in Computer Science, vol.6174, pp.570-584
DOI : 10.1007/978-3-642-14295-6_50

URL : https://hal.archives-ouvertes.fr/inria-00517943