Finding optimum abstractions in parametric dataflow analysis

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

Volumn , Issue , 2013, Pages 365-376

  Zhang, Xin ^a   Naik, Mayur ^a   Yang, Hongseok ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Abstraction refinement; CEGAR; Dataflow analysis; Impossibility; Optimum abstraction; Under approximation

Indexed keywords

ABSTRACTION REFINEMENT; CEGAR; IMPOSSIBILITY; OPTIMUM ABSTRACTION; UNDER-APPROXIMATION;

COMPUTER SOFTWARE; DATA FLOW ANALYSIS; JAVA PROGRAMMING LANGUAGE;

ABSTRACTING;

EID: 84883085918     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2462156.2462185     Document Type: Conference Paper

References (23)

1. T. Ball and S. Rajamani. Bebop: a path-sensitive interprocedural dataflow engine. In Proceedings of the ACM Workshop on Program Analysis For Software Tools and Engineering (PASTE'01), 2001.
2. T. Ball and S. Rajamani. The SLAM project: Debugging system software via static analysis. In Proceedings of the 29th ACM Symposium on Principles of Programming Languages (POPL'02), 2002.
3. N. Beckman, A. Nori, S. Rajamani, R. Simmons, S. Tetali, and A. Thakur. Proofs from tests. IEEE Trans. Software Eng., 36(4):495-508, 2010.
4. P. Cousot and R. Cousot. Refining model checking by abstract interpretation. Autom. Softw. Eng., 6(1):69-95, 1999.
5. I. Dillig, T. Dillig, and A. Aiken. Sound, complete and scalable path-sensitive analysis. In Proceedings of the 29th ACM Conference on Programming Language Design and Implementation (PLDI'08), 2008.
6. I. Dillig, T. Dillig, and A. Aiken. Fluid updates: beyond strong vs. weak updates. In Proceedings of the 19th European Symposium on Programming (ESOP'10), 2010.
7. S. Fink, E. Yahav, N. Dor, G. Ramalingam, and E. Geay. Effective typestate verification in the presence of aliasing. ACM Trans. Softw. Eng. Methodol., 17(2), 2008.
8. B. Gulavani, T. Henzinger, Y. Kannan, A. Nori, and S. Rajamani. Synergy: a new algorithm for property checking. In Proceedings of the 14th ACM SIGSOFT International Symposium on Foundations of Software Engineering (FSE'06), 2006.
9. B. Gulavani, S. Chakraborty, A. Nori, and S. Rajamani. Automatically refining abstract interpretations. In Proceedings of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'08), 2008.
10. S. Gulwani and A. Tiwari. Assertion checking unified. In Proceedings of the 8th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'07), 2007.
11. S. Gulwani, B. McCloskey, and A. Tiwari. Lifting abstract interpreters to quantified logical domains. In Proceedings of the 35th ACM Symposium on Principles of Programming Language (POPL'08), 2008.
12. S. Guyer and C. Lin. Client-driven pointer analysis. In Proceedings of the 10th International Symposium on Static Analysis (SAS'03), 2003.
13. T. Henzinger, R. Jhala, R. Majumdar, and K. McMillan. Abstractions from proofs. In Proceedings of the 31st ACM Symposium on Principles of Programming Languages (POPL'04), 2004.
14. P. Liang and M. Naik. Scaling abstraction refinement via pruning. In Proceedings of the 32nd ACM Conference on Programming Language Design and Implementation (PLDI'11), 2011.
15. P. Liang, O. Tripp, and M. Naik. Learning minimal abstractions. In Proceedings of the 38th ACM Symposium on Principles of Programming Languages (POPL'11), 2011.
16. M. Naik. Chord: A static and dynamic program analysis platform for Java. http://code.google.com/p/jchord/.
17. M. Naik, H. Yang, G. Castelnuovo, and M. Sagiv. Abstractions from tests. In Proceedings of the 39th ACM Symposium on Principles of Programming Languages (POPL'12), 2012.
18. J. Plevyak and A. Chien. Precise concrete type inference for object-oriented languages. In Proceedings of the 9th ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA'94), 1994.
19. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL'95), 1995.
20. T. Reps, S. Schwoon, S. Jha, and D. Melski. Weighted pushdown systems and their application to interprocedural dataflow analysis. Sci. Comput. Program., 58(1-2):206-263, 2005.
21. M. Sridharan and R. Bodík. Refinement-based context-sensitive points-to analysis for Java. In Proceedings of the 27th ACM Conference on Programming Language Design and Implementation (PLDI'06), 2006.
22. M. Sridharan, D. Gopan, L. Shan, and R. Bodík. Demand-driven points-to analysis for Java. In Proceedings of the 20th ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA'05), 2005.
23. X. Zhang, M. Naik, and H. Yang. Finding optimum abstractions in parametric dataflow analysis. Technical report, Georgia Institute of Technology, 2013. Available at http://pag.gatech.edu/pubs/pldi13.pdf.