Scaling abstraction refinement via pruning

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2011, Pages 590-601

  Liang, Percy ^a   Naik, Mayur ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b INTEL CORPORATION   (United States)

Author keywords

abstraction refinement; concurrency; heap abstraction; pruning; slicing; static analysis

Indexed keywords

ABSTRACTING; ITERATIVE METHODS; REFINING;

ABSTRACTION-REFINEMENT; CONCURRENCY; CONTEXT SENSITIVITY; HEAP ABSTRACTION; ITERATIVE REFINEMENT; POINTER ANALYSIS; PROGRAM ANALYSIS; PRUNING; SCALINGS; SLICING;

STATIC ANALYSIS;

EID: 79959871167     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993498.1993567     Document Type: Conference Paper

References (23)

1. T. Ball, R. Majumdar, T. Millstein, and S. Rajamani. Automatic predicate abstraction of C programs. In PLDI, pages 203-213, 2001.
2. M. Bravenboer and Y. Smaragdakis. Strictly declarative specification of sophisticated points-to analyses. In OOPSLA, pages 243-262, 2009.
3. S. Graf and H. Saidi. Construction of abstract state graphs with PVS. Computer Aided Verification, 1254:72-83, 1997. (Pubitemid 127088966)
4. S. Guyer and C. Lin. Client-driven pointer analysis. In SAS, pages 214-236, 2003.
5. N. Heintze and O. Tardieu. Demand-driven pointer analysis. In PLDI, pages 24-34, 2001.
6. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In POPL, 2002.
7. O. Lhoták and L. Hendren. Context-sensitive points-to analysis: is it worth it? In CC, pages 47-64, 2006.
8. O. Lhoták and L. Hendren. Evaluating the benefits of context-sensitive points-to analysis using a BDD-based implementation. ACM Transactions on Software Engineering and Methodology, 18(1):1-53, 2008.
9. P. Liang, O. Tripp, M. Naik, and M. Sagiv. A dynamic evaluation of static heap abstractions. In OOPSLA, pages 411-427, 2010.
10. P. Liang, O. Tripp, and M. Naik. Learning minimal abstractions. In POPL, 2011.
11. K. McMillan. Lazy abstraction with interpolants. In CAV, pages 123-136, 2006.
12. A. Milanova, A. Rountev, and B. Ryder. Parameterized object sensitivity for points-to and side-effect analyses for Java. In ISSTA, pages 1-11, 2002.
13. A. Milanova, A. Rountev, and B. Ryder. Parameterized object sensitivity for points-to analysis for Java. ACM Transactions on Software Engineering and Methodology, 14(1):1-41, 2005. (Pubitemid 40245820)
14. M. Naik, A. Aiken, and J. Whaley. Effective static race detection for Java. In PLDI, pages 308-319, 2006.
15. J. Plevyak and A. Chien. Precise concrete type inference for object-oriented languages. In OOPSLA, pages 324-340.
16. O. Shivers. Control-flow analysis in Scheme. In PLDI, pages 164-174, 1988.
17. Y. Smaragdakis, M. Bravenboer, and O. Lhotak. Pick your contexts well: Understanding object-sensitivity. In POPL, 2011.
18. S. A. Spoon and O. Shivers. Demand-driven type inference with subgoal pruning: Trading precision for scalability. In ECOOP, 2004.
19. M. Sridharan and R. Bodík. Refinement-based context-sensitive points-to analysis for Java. In PLDI, pages 387-400, 2006.
20. V. Vipindeep and P. Jalote. Efficient static analysis with path pruning using coverage data. In International Workshop on Dynamic Analysis (WODA), 2005.
21. J. Whaley. Context-Sensitive Pointer Analysis using Binary Decision Diagrams. PhD thesis, Stanford University, 2007.
22. J. Whaley and M. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In PLDI, pages 131-144, 2004.
23. X. Zheng and R. Rugina. Demand-driven alias analysis for C. In POPL, pages 197-208, 1998.