Learning minimal abstractions

ACM SIGPLAN Notices

Volumn 46, Issue 1, 2011, Pages 31-42

  Liang, Percy ^a   Tripp, Omer ^b   Naik, Mayur ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c INTEL CORPORATION   (United States)

Author keywords

Concurrency; Heap abstractions; Machine learning; Randomization; Static analysis

Indexed keywords

ALLOCATION SITES; CONCURRENCY; HEAP ABSTRACTIONS; K-VALUES; MACHINE-LEARNING; POINTS-TO ANALYSIS; RANDOMIZATION; TWO MACHINES;

ABSTRACTING; LEARNING SYSTEMS; STATIC ANALYSIS;

LEARNING ALGORITHMS;

EID: 79251562562     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1925844.1926391     Document Type: Conference Paper

References (27)

1. D. Angluin. Queries and concept learning. Machine Learning, 2(4):319-342, 1988.
2. T. Ball and S. Rajamani. The SLAM project: debugging system software via static analysis. In Proceedings of ACM Symp. on Principles of Programming Languages (POPL), pages 1-3, 2002.
3. T. Ball, R. Majumdar, T. Millstein, and S. Rajamani. Automatic predicate abstraction of C programs. In Proceedings of ACM Conf. on Programming Language Design and Implementation (PLDI), pages 203-213, 2001.
4. D. Donoho. Compressed sensing. IEEE Trans. on Information Theory, 52(4):1289-1306, 2006.
5. S. Graf and H. Saidi. Construction of abstract state graphs with PVS. pages 72-83, 1997.
6. S. Gulwani. Program Analysis using Random Interpretation. PhD thesis, UC Berkeley, 2005.
7. S. Guyer and C. Lin. Client-driven pointer analysis. In Proceedings of Intl. Static Analysis Symposium, pages 214- 236, 2003.
8. D. Hamlet. Random testing. In Encyclopedia of Software Engineering, pages 970-978, 1994.
9. N. Heintze and O. Tardieu. Demand-driven pointer analysis. In Proceedings of ACM Conf. on Programming Language Design and Implementation (PLDI), pages 24-34, 2001. (Pubitemid 32865889)
10. O. Lhoták and L. Hendren. Context-sensitive points-to analysis: is it worth it? In Proceedings of Intl. Conf. on Compiler Construction, pages 47-64, 2006.
11. O. Lhoták and L. Hendren. Evaluating the benefits of contextsensitive points-to analysis using a BDD-based implementation. ACM Transactions on Software Engineering and Methodology, 18(1):1-53, 2008.
12. A. Milanova, A. Rountev, and B. Ryder. Parameterized object sensitivity for points-to and side-effect analyses for Java. In Proceedings of ACM Intl. Symp. on Software Testing and Analysis, 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 Proceedings of ACM Conf. on Programming Language Design and Implementation (PLDI), pages 308- 319.
15. J. Plevyak and A. Chien. Precise concrete type inference for object-oriented languages. In Proceedings of ACM Conf. on Object-Oriented Programming, Systems, Languages, and Applications, pages 324-340.
16. T. W. Reps. Demand interprocedural program analysis using logic databases. In Workshop on Programming with Logic Databases, pages 163-196, 1993.
17. T. W. Reps. Solving demand versions of interprocedural analysis problems. In Proceedings of Intl. Conf. on Compiler Construction, pages 389-403, 1994.
18. H. Robbins and S. Monro. A stochastic approximation method. Annals of Mathematical Statistics, 22(3):400-407, 1951.
19. M. Sagiv, T.W. Reps, and R.Wilhelm. Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems, 24(3):217-298, 2002.
20. O. Shivers. Control-flow analysis in Scheme. In Proceedings of ACM Conf. on Programming Language Design and Implementation (PLDI), pages 164-174, 1988.
21. M. Sridharan and R. Bodík. Refinement-based contextsensitive points-to analysis for Java. In Proceedings of ACM Conf. on Programming Language Design and Implementation, pages 387-400, 2006.
22. M. Sridharan, D. Gopan, L. Shan, and R. Bodík. Demanddriven points-to analysis for Java. In Proceedings of ACM Conf. on Object-Oriented Programming, Systems, Languages, and Applications, pages 59-76, 2005.
23. L. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.
24. M. J. Wainwright. Sharp thresholds for noisy and high-dimensional recovery of sparsity using l1-constrained quadratic programming (lasso). IEEE Transactions on Information Theory, 55:2183-2202, 2009.
25. J. Whaley. Context-Sensitive Pointer Analysis using Binary Decision Diagrams. PhD thesis, Stanford University, 2007.
26. J. Whaley and M. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In Proceedings of ACM Conf. on Programming Language Design and Implementation (PLDI), pages 131-144, 2004.
27. X. Zheng and R. Rugina. Demand-driven alias analysis for C. In Proceedings of ACM Symp. on Principles of Programming Languages (POPL), pages 197-208, 1998.