A combination framework for tracking partition sizes

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2009, Pages 239-251

  Gulwani, Sumit ^a   Lev Ami, Tal ^b   Sagiv, Mooly ^b  

^a MICROSOFT RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Combining analyses; Memory safety; Numerical analysis; Set analysis; Shape analysis; Space bounds; Termination

Indexed keywords

COMBINING ANALYSES; MEMORY SAFETY; SET ANALYSIS; SHAPE ANALYSIS; SPACE BOUNDS; TERMINATION;

ABSTRACTING; PROGRAM INTERPRETERS; TRANSFER FUNCTIONS;

SET THEORY;

EID: 67649862244     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1480881.1480912     Document Type: Conference Paper

References (35)

1. Annotated outline of collections framework. Sun Microsystems. Available at http://java.sun.com/j2se/1.5.0/docs/guide/collections/reference.html.
2. R. Bagnara, P. M. Hill, and E. Zaffanella. The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Science of Computer Programming, 2008. To appear.
3. A. Bouajjani, M. Bozga, P. Habermehl, R. Iosif, P. Moro, and T. Vojnar. Programs with lists are counter automata. In CAV, pages 517-531, 2006. (Pubitemid 44560904)
4. A. R. Bradley, Z. Manna, and H. B. Sipma. The polyranking principle. In ICALP, pages 1349-1361, 2005. (Pubitemid 41436191)
5. C. Calcagno, D. Distefano, P. W. O'Hearn, and H. Yang. Beyond reachability: Shape abstraction in the presence of pointer arithmetic. In SAS, pages 182-203, 2006. (Pubitemid 44561974)
6. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL, pages 238-252, 1977.
7. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In POPL, pages 269-282, 1979. (Pubitemid 9471475)
8. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In POPL, pages 84-96, 1978.
9. A. Deutsch. On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications. In POPL, pages 157-168, 1990. (Pubitemid 20681749)
10. A. Deutsch. Operational Models of Programming Languages and Representations of Relations on Regular Languages with Application to the Static Determination of Dynamic Aliasing Properties of Data. PhD thesis, LIX, The Comp. Sci. Lab of École Polytechnique, 1992.
11. A. Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In PLDI, pages 230-241, 1994.
12. D. Distefano, P. W. O'Hearn, and H. Yang. A local shape analysis based on separation logic. In TACAS, pages 287-302, 2006. (Pubitemid 44019377)
13. N. Dor, M. Rodeh, and M. Sagiv. CSSV: towards a realistic tool for statically detecting all buffer overflows in C. In PLDI, pages 155-167, 2003.
14. D. Gopan, F. DiMaio, N. Dor, T. W. Reps, and M. Sagiv. Numeric domains with summarized dimensions. In TACAS, pages 512-529, 2004. (Pubitemid 38458536)
15. D. Gopan, T. Reps, and M. Sagiv. A framework for numeric analysis of array operations. In POPL, pages 338-350, 2005. (Pubitemid 40493989)
16. S. Gulwani, T. Lev-Ami, and M. Sagiv. A combination framework for tracking partition sizes. Technical Report MSR-TR-2008-2158, Microsoft Research, Oct. 2008.
17. S. Gulwani and A. Tiwari. Combining abstract interpreters. In PLDI, pages 376-386, 2006. (Pubitemid 44074948)
18. M. Hofmann and S. Jost. Static prediction of heap space usage for first-order functional programs. In POPL, pages 185-197, 2003.
19. J. Hughes and L. Pareto. Recursion and dynamic data-structures in bounded space: Towards embedded ML programming. In ICFP, pages 70-81, 1999. (Pubitemid 129685545)
20. M. Karr. Affine relationships among variables of a program. Acta Inf., 6:133-151, 1976.
21. V. Kuncak and M. C. Rinard. Towards efficient satisfiability checking for boolean algebra with presburger arithmetic. In CADE, pages 215-230, 2007. (Pubitemid 47545112)
22. T. Lev-Ami and M. Sagiv. TVLA: A system for implementing static analyses. In SAS, pages 280-301, 2000.
23. S. Magill, J. Berdine, E. M. Clarke, and B. Cook. Arithmetic strengthening for shape analysis. In SAS, pages 419-436, 2007.
24. R. Manevich, M. Sagiv, G. Ramalingam, and J. Field. Partially disjunctive heap abstraction. In SAS, pages 265-279, 2004. (Pubitemid 39203892)
25. R. Manevich, E. Yahav, G. Ramalingam, and M. Sagiv. Predicate abstraction and canonical abstraction for singly-linked lists. In VMCAI, pages 181-198, 2005. (Pubitemid 41231361)
26. A. Miné. The octagon abstract domain. In WCRE, pages 310-319, 2001. (Pubitemid 33013361)
27. G. Nelson and D. Oppen. Fast decision procedures based on congruence closure. JACM, 27(2):356-364, Apr. 1980. (Pubitemid 11428851)
28. H. H. Nguyen, C. David, S. Qin, and W.-N. Chin. Automated verification of shape and size properties via separation logic. In VMCAI, pages 251-266, 2007. (Pubitemid 350143498)
29. A. Podelski and A. Rybalchenko. Transition invariants. In LICS, pages 32-41, 2004.
30. A. Podelski and T. Wies. Boolean heaps. In SAS, pages 268-283, 2005.
31. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In LICS, pages 55-74, 2002. (Pubitemid 34911797)
32. R. Rugina. Quantitative shape analysis. In SAS, pages 228-245, 2004. (Pubitemid 39203890)
33. M. Sagiv, T. W. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM TOPLAS, 24(3):217-298, 2002.
34. A. Turing. Checking a large routine. In The early British computer conferences, pages 70-72. MIT Press, Cambridge, MA, USA, 1989.
35. T. Yavuz-Kahveci and T. Bultan. Automated verification of concurrent linked lists with counters. In SAS, pages 69-84, 2002.