A framework for numeric analysis of array operations

ACM SIGPLAN Notices

Volumn 40, Issue 1, 2005, Pages 338-350

  Gopan, Denis ^a   Reps, Thomas ^a   Sagiv, Mooly ^b  

^a UNIVERSITY OF WISCONSIN   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Abstract numeric domains; Array analysis; Canonical abstraction; Program analysis; Summarization

Indexed keywords

ABSTRACT NUMERIC DOMAINS; ARRAY ANALYSIS; CANONICAL ABSTRACTION; PROGRAM ANALYSIS; SUMMARIZATION;

ABSTRACTING; DATA STORAGE EQUIPMENT; INDEXING (OF INFORMATION); MATHEMATICAL MODELS; NUMERICAL ANALYSIS; SOFTWARE PROTOTYPING;

ARRAYS;

EID: 17044425453     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/1047659.1040333     Document Type: Conference Paper

References (21)

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. B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, D. Monniaux, and X. Rival. Design and implementation of a special-purpose static program analyzer for safety-critical real-time embedded software. In The Essence of Computation: Complexity, Analysis, Transformation., pages 85-108. Springer-Verlag, 2002.
3. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In Symp. on Princ. of Prog. Lang., pages 238-252, New York, NY, 1977. ACM Press.
4. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Symp. on Princ. of Prog. Lang., pages 269-282, New York, NY, 1979. ACM Press.
5. P. Cousot and N. Halbwachs. Automatic discovery of linear constraints among variables of a program. In Symp. on Princ. of Prog. Lang., 1978.
6. C. Flanagan and S. Qadeer. Predicate abstraction for software verification. In Symp. on Princ. of Prog. Lang., pages 191-202, 2002.
7. D. Gopan, F. DiMaio, N. Dor, T. Reps, and M. Sagiv. Numeric domains with summarized dimensions. In Tools and Algorithms for the Construction and Analysis of Systems, pages 512-529, 2004.
8. 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.
9. S. K. Lahiri and R. E. Bryant. Indexed predicate discovery for unbounded system verification. In Int. Conf. on Computer Aided Verification, pages 135-147, 2004.
10. L. Lamport. A new approach to proving the correctness of multiprocess programs. Trans. on Prog. Lang, and Syst., 1(1):84-97, July 1979.
11. T. Lev-Ami and M. Sagiv. TVLA: A system for implementing static analyses. In Static Analysis Symp., pages 280-301, 2000.
12. R. Manevich, M. Sagiv, G. Ramalingam, and J. Field. Partially disjunctive heap abstraction. In Static Analysis Symp., pages 265-279, 2004.
13. F. Masdupuy. Array Indices Relational Semantic Analysis using Rational Cosets and Trapezoids. PhD thesis, Ecole Polytechnique, 1993.
14. A. Mine. The octagon abstract domain. In Proc. Eighth Working Conf. on Rev. Eng., pages 310-322, 2001.
15. A. Mine. A few graph-based relational numerical abstract domains. In Static Analysis Symp., pages 117-132, 2002.
16. G. Peterson. Myths about the mutual exclusion problem. Information Processing Letters, 12(3):115-116, June 1981.
17. T. Reps, M. Sagiv, and A. Loginov. Finite differencing of logical formulas for static analysis. In European Symp. on Programming, pages 380-398, 2003.
18. T. Reps, M. Sagiv, and G. Yorsh. Symbolic implementation of the best transformer. In Verification, Model Checking, and Abstract Interpretation, pages 252-266, 2004.
19. 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.
20. P. Černý. Vérification par interprétation abstraite de prédicats paramétriques. D.E.A. Report, Univ. Paris VII & École normale supérieure, September 2003.
21. G. Yorsh, T. Reps, and M. Sagiv. Symbolically computing most-precise abstract operations for shape analysis. In Tools and Algorithms for the Construction and Analysis of Systems, pages 530-545, 2004.