R. Alur, C. Courcoubetis, and D. L. Dill, Model-checking in dense real-time. Information and Computation, Preliminary version appears in the Proc. of 5th LICS, pp.2-34, 1990.

A. R. Bradley, Z. Manna, and H. B. Sipma, What???s Decidable About Arrays?, VMCAI 06, pp.427-442, 2006.
DOI : 10.1007/11609773_28

P. Cousot and R. Cousot, Static determination of dynamic properties of programs, 2nd Int. Symp. on Programming, 1976.

P. Cousot, Verification by abstract interpretation on Verification ? Theory & Practice ? Honoring Zohar Manna's 64th Birthday, Proc. Int. Symp, pp.243-268, 2003.

E. W. Dijkstra, A Discipline of Programming. Prentice-Hall Series in Automatic Computation, 1976.

D. L. Dill, Timing assumptions and verification of finite-state concurrent systems, Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, 1989.
DOI : 10.1007/3-540-52148-8_17

A. Dovier, C. Piazza, and G. Rossi, A uniform approach to constraint-solving for lists, multisets, compact lists, and sets, ACM Transactions on Computational Logic, vol.9, issue.3, 2008.
DOI : 10.1145/1352582.1352583

N. Dor, M. Rodeh, and M. Sagiv, CCSV: towards a realistic tool for statically detecting all buffer overflows in C, ACM Conference on Programming Language Design and Implementation, PLDI 2003, pp.155-167, 2003.

E. Dantsin and A. Voronkov, A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees, FOSSACS'99, pp.180-196, 1999.
DOI : 10.1007/3-540-49019-1_13

J. Edmonds and R. M. Karp, Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems, Journal of the ACM, vol.19, issue.2, pp.248-264, 1972.
DOI : 10.1145/321694.321699

L. R. Ford and D. R. Fulkerson, Maximal flow through a network, Journal canadien de math??matiques, vol.8, issue.0, pp.399-404, 1956.
DOI : 10.4153/CJM-1956-045-5

C. Flanagan and S. Qadeer, Predicate abstraction for software verification, POPL 2002, pp.191-202, 2002.

S. Gulwani, B. Mccloskey, and A. Tiwari, Lifting abstract interpreters to quantified logical domains, pp.235-246, 2008.

D. Gopan, T. Reps, and M. Sagiv, A framework for numeric analysis of array operations, Proc. of POPL'2005, pp.338-350, 2005.

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.
URL : https://hal.archives-ouvertes.fr/hal-00288274

P. [. Iosif, T. Habermehl, and . Vojnar, What else is decidable about arrays?, FOSSACS 2008, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01418914

R. Jhala and K. L. Mcmillan, Array Abstractions from Proofs, LNCS, vol.4590, 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

M. Karr, Affine relationships among variables of a program, Acta Informatica, vol.6, issue.2, pp.133-151, 1976.
DOI : 10.1007/BF00268497

L. Kovács and A. Voronkov, Finding loop invariants for programs over arrays using a theorem prover, FASE 2009, pp.470-485, 2009.

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

G. Lindstrom, Scanning list structures without stacks or tag bits, Information Processing Letters, vol.2, issue.2, pp.47-51, 1973.
DOI : 10.1016/0020-0190(73)90012-4

A. Loginov, T. W. Reps, and M. Sagiv, Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm, SAS 2006, pp.261-279, 2006.
DOI : 10.1007/11823230_17

C. David, N. Luckham, and . Suzuki, Verification of array, record, and pointer operations in Pascal, ACM Trans. Program. Lang. Syst, vol.1, issue.2, pp.226-244, 1979.

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

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

S. Srivastava and S. Gulwani, Program verification using templates over predicate abstraction, ACM Conference on Programming Language Design and Implementation, PLDI 2009, pp.223-234, 2009.

D. Singh, A. M. Ibrahim, T. Yohanna, J. N. Singhsj80-]-n, D. Suzuki et al., An overview of the applications of multisets Verification decidability of Presburger array programs, Novi Sad J. Math. JACM, vol.37, issue.271, pp.73-92, 1980.

S. Sagiv, T. W. Reps, and R. Wilhelm, Parametric shape analysis via 3-valued logic, ACM Transactions on Programming Languages and Systems, vol.24, issue.3, pp.217-298, 2002.
DOI : 10.1145/514188.514190

H. Schorr and W. Waite, An efficient machine-independent procedure for garbage collection in various list structures, Communications of the ACM, vol.10, issue.8, pp.501-506, 1967.
DOI : 10.1145/363534.363554

A. Syropoulos, Mathematics of Multisets, Workshop on Multiset Processing, pp.347-358, 2000.
DOI : 10.1007/3-540-45523-X_17

V. Vafeiadis, Shape-Value Abstraction for Verifying Linearizability, 10th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI'09, pp.335-348, 2009.
DOI : 10.1007/978-3-540-93900-9_27

R. Wilhelm, S. Sagiv, and T. W. Reps, Shape Analysis, LNCS 1781, pp.1-17, 2000.
DOI : 10.1007/3-540-46423-9_1