An abstract domain extending difference-bound matrices with disequality constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4349 LNCS, Issue , 2007, Pages 268-282

  Péron, Mathias ^a   Halbwachs, Nicolas ^a  

^a VERIMAG   (France)

Author keywords

Abstract domains; Alias analysis; Difference bound matrices; Disequalities; Static analysis

Indexed keywords

ABSTRACTING; ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; DIGITAL ARITHMETIC; NUMERICAL METHODS;

ABSTRACT DOMAINS; ALIAS ANALYSIS; DIFFERENCE-BOUND MATRICES; DISEQUALITIES;

STATIC ANALYSIS;

EID: 36348964680     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69738-1_20     Document Type: Conference Paper

References (30)

1. R. Alur, C. Courcoubetis, and D.L. Dill. Model-checking in dense real-time. Information and Computation, 104(1):2-34, 1993.
2. F. Bourdoncle. Abstract debugging of higher-order imperative languages. In PLDI'93, pages 46-55, New York, 1993.
3. P. Cousot and R. Cousot. Static determination of dynamic properties of programs. In 2nd Int. Symp. on Programming, pages 106-130. Dunod, Paris, 1976.
4. R. C. Clarisó and J. Cortadella. Verification of parametric timed circuits using octahedra. In Designing correct circuits, DCC'04, Barcelona, 2004.
5. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In POPL'78, pages 84-96, January 1978.
6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, Cambridge, Massachusetts, 1990.
7. A. Deutsch. Interprocedural may-alias analysis for pointers: beyond k-limiting. In PLDI'94, pages 230-241, 1994.
8. D. L. Dill. Timing assumptions and verification of finite-state concurrent systems. In Automatic Verification Methods for Finite State Systems, pages 197-212. LNCS 407, Springer-Verlag, 1989.
9. A. Goralciková and V. Koubek. A reduct-and-closure algorithm for graphs. In MFCS, pages 301-307, 1979.
10. P. Granger. Static analysis of linear congruence equalities among variables of a program. In CAAP'91, pages 169-192, 1991.
11. W. Harvey and P. J. Stuckey. A unit two variable per inequality integer constraint solver for constraint logic programming. In Twentieth Australasian Computer Science Conference, ACSC'97, pages 102-111, February 1997.
12. W. Harvey and P. J. Stuckey. Improving linear constraint propagation by changing constraint representation. Constraints, 8(2): 173-207, 2003.
13. J.-L. Imbert. Variable elimination for generalized linear constraints. In ICLP'93, pages 499-516, 1993.
14. B. Jeannet. The NBAC verification/slicing tool. http://www.inrialpes.fr/ pop-art/people/bjeannet/nbac/.
15. B. Jeannet, N. Halbwachs, and P. Raymond. Dynamic partitioning in analyses of numerical properties. In SAS'99, Venezia, September 1999.
16. M. Karr. Affine relationships among variables of a program. Acta Informatica, 6:133-151, 1976.
17. J.-L. Lassez and K. McAloon. A canonical form for generalized linear constraints. J. Symb. Comput., 13(1):1-24, 1992.
18. K. G. Larsen, J. Pearson, C. Weise, and W. Yi. Clock difference diagrams. Nordic J. of Computing, 6(3):271-298, 1999.
19. F. Masdupuy. Semantic analysis of interval congruences. In International Conference on Formal Methods in Programming and Their Applications, pages 142-155, 1993.
20. A. Miné. The octagon abstract domain. In AST 2001 in WCRE 2001, IEEE, pages 310-319. IEEE CS Press, October 2001.
21. A. Miné. A few graph-based relational numerical abstract domains. In SAS'02, pages 117-132, London, UK, 2002. Springer-Verlag.
22. J. B. Møller, J. Lichtenberg, H. R. Andersen, and H. Hulgaard. Difference decision diagrams. In CSL'99, pages 111-125. Springer-Verlag, 1999.
23. L. Mauborgne and X. Rival. Trace partitioning in abstract interpretation based static analyzers. In ESOP'05, Edinburgh, April 2005.
24. J.-F. Puget. A fast algorithm for the bound consistency of alldiff constraints. In AAAI'98/IAAI'98: Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence, pages 359-366, Menlo Park, CA, USA, 1998. American Association for Artificial Intelligence.
25. W. Pugh and D. Wonnacott. Constraint-based array dependence analysis. TOPLAS, 20(3):635-678, 1998.
26. D. J. Rosenkrantz and H. B. Hunt III. Processing conjunctive predicates and queries. In VLDB, pages 64-72, 1980.
27. K. Simon, D. Crippa, and F. Collenberg. On the distribution of the transitive closure in a random acyclic digraph. In ESA '93, pages 345-356. Springer-Verlag, 1993.
28. K. Simon. An improved algorithm for transitive closure on acyclic digraphs. TCS, 58(13):325-346, 1988.
29. S. Sankaranarayanan, F. Ivančić, I. Shlyakhter, and A. Gupta. Static analysis in disjunctive numerical domains. In SAS'06, Seoul, Korea, August 2006.
30. R. Seater and D. Wonnacott. Efficient Manipulation of Disequalities During Dependence Analysis. In LCPC'02: Proceedings of the 15th international workshop on Languages and Compilers for Parallel Computing, volume 2481, pages 295-308, December 2002.