Numeric domains with summarized dimensions

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

Volumn 2988, Issue , 2004, Pages 512-529

  Gopan, Denis ^a   DiMaio, Frank ^a   Dor, Nurit ^b   Reps, Thomas ^a   Sagiv, Mooly ^b  

^a University of Wisconsin Madison   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

ABSTRACT NUMERIC DOMAINS; SHAPE ANALYSIS;

ABSTRACTING;

EID: 35048886087     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24730-2_38     Document Type: Article

References (17)

1. R. Bagnara, E. Ricci, E. Zaffanella, and P. M. Hill. Possibly not closed convex polyhedra and the parma polyhedra library. In Static Analysis Symp., volume 2477, pages 213-229, 2002.
2. P. Cousot and N. Halbwachs, Automatic discovery of linear constraints among variables of a program. In Symp. on Princ. of Prog. Lang., 1978.
3. G. B. Dantzig and B. C. Eaves. Fourier-motzkin elimination and its dual. Journal of Combinatorial Theory (A), 14:288-297, 1973.
4. D.L. Dill. Timing assumptions and verification of finite-state concurrent systems. In Automatic Verification Methods for Finite State Systems, pages 197-212, 1989.
5. P. Granger. Analyses Semantiques de Congruence. PhD thesis, Ecole Polytechnique, 1991.
6. N. Halbwachs, Y.-E. Proy, and P. Roumanoff. Verification of real-time systems using linear relation analysis. Formal Methods in System Design, 11(2):157-185, 1997.
7. W.H. Harrison. Compiler analysis of the value ranges for variables. Trans. on Softw. Eng., 3(3):243-250, 1977.
8. T. Lev-Ami, T. Reps, M. Sagiv, and R. Wilhelm. Putting static analysis to work for verification: A case study. In Int. Symp. on Software Testing and Analysis, pages 26-38, 2000.
9. T. Lev-Ami and M. Sagiv. TVLA: A system for implementing static analyses. In Static Analysis Symp., pages 280-301, 2000.
10. F. Masdupuy. Array Indices Relational Semantic Analysis using Rational Cosets and Trapezoids. PhD thesis, Ecole Polytechnique, 1993.
11. A. Mine. The octagon abstract domain. In P roc. Eighth Working Conf. on Rev. Eng., pages 310-322, 2001.
12. A. Mine. A few graph-based relational numerical abstract domains. In Static Analysis Symp., pages 117-132, 2002.
13. Y. Saad. Sparsekit: A basic tool kit for sparse matrix computations, version 2. Tech. rep., Comp. Sci. Dept. Univ. of Minnesota, June 1994.
14. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. Trans. on Prog. Lang. and Syst., 24(3):217-298, 2002.
15. C. Verbrugge, P. Co, and L.J. Hendren. Generalized constant propagation: A study in C. In Int. Conf. on Comp. Construct., volume 1060 of Lec. Notes in Comp. Sci., pages 74-90, 1996.
16. D. Wagner, J. Foster, E. Brewer, and A. Aiken. A first step towards automated detection of buffer overrun vulnerabilities. In Symp. on Network and Distributed Systems Security (NDSS), February 2000.
17. T. Yavuz-Kahveci and T. Bultan. Automated verification of concurrent linked lists with counters. In Static Analysis Symp., pages 69-84, 2002.