R. Alur, C. Courcoubetis, D. L. Dillbou93-]-f, . [. Bourdoncle, R. Cousot et al., Model-checking in dense real-time Information and Computation Abstract debugging of higher-order imperative languages Static determination of dynamic properties of programs Verification of parametric timed circuits using octahedra Automatic discovery of linear restraints among variables of a program, PLDI'93 2nd Int. Symp. on Programming Designing correct circuitsCH78] P. Cousot and N. Halbwachs POPL'78, pp.2-34, 1976.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Steindeu94, ]. L. Dillgk79 et al., Introduction to Algorithms Interprocedural may-alias analysis for pointers: beyond k-limiting Timing assumptions and verification of finite-state concurrent systems A reduct-and-closure algorithm for graphs Static analysis of linear congruence equalities among variables of a program, PLDI'94 Automatic Verification Methods for Finite State Systems MFCS CAAP'91, pp.230-241, 1979.

W. Harvey, P. J. Stuckeyhs03, ]. W. Harvey, and P. J. Stuckey, A unit two variable per inequality integer constraint solver for constraint logic programming Improving linear constraint propagation by changing constraint representation Variable elimination for generalized linear constraints The NBAC verification/slicing tool, Twentieth Australasian Computer Science Conference, ACSC'97 ICLP'93, pp.102-111173, 1993.

B. Jeannet, N. Halbwachs, and P. Raymond, Dynamic partitioning in analyses of numerical properties Affine relationships among variables of a program McAloon. A canonical form for generalized linear constraints, SAS'99, pp.133-1511, 1976.

K. G. Larsen, J. Pearson, C. Weise, W. Yimas93-]-f, and . Masdupuy, Clock difference diagrams Semantic analysis of interval congruences The octagon abstract domain A few graph-based relational numerical abstract domains, International Conference on Formal Methods in Programming and Their ApplicationsMin01] A. Miné ASTMin02] A. Miné SAS'02, pp.271-298, 1993.

J. B. Møller, J. Lichtenberg, H. R. Andersen, H. [. Hulgaard, X. Mauborgne et al., Difference decision diagrams Trace partitioning in abstract interpretation based static analyzers A fast algorithm for the bound consistency of alldiff constraints American Association for Artificial Intelligence Constraint-based array dependence analysis, CSL'99 ESOP'05 AAAI'98/IAAI'98: Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligenceRH80] D. J. Rosenkrantz and H. B. Hunt III. Processing conjunctive predicates and queries. In VLDB, pp.111-125, 1980.

K. Simon, D. Crippa, and F. Collenberg, On the distribution of the transitive closure in a random acyclic digraph, ESA'93, pp.345-356
DOI : 10.1007/3-540-57273-2_69

]. K. Springer-verlagsim88 and . Simon, An improved algorithm for transitive closure on acyclic digraphs, TCS, vol.58, issue.1-3, pp.325-346, 1988.

S. Sankaranarayanan, F. Ivan?i´ivan?i´c, I. Shlyakhter, A. Guptasw02-]-r, D. Seater et al., Static analysis in disjunctive numerical domains Efficient Manipulation of Disequalities During Dependence Analysis, SAS'06 LCPC'02: Proceedings of the 15th international workshop on Languages and Compilers for Parallel Computing, pp.295-308, 2002.