Refinement-based context-sensitive points-to analysis for Java
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Effective typestate verification in the presence of aliasing
ACM Transactions on Software Engineering and Methodology (TOSEM)
Client-driven pointer analysis
SAS'03 Proceedings of the 10th international conference on Static analysis
IEEE Transactions on Software Engineering
F4F: taint analysis of framework-based web applications
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Automated error diagnosis using abductive inference
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
Correlation tracking for points-to analysis of javascript
ECOOP'12 Proceedings of the 26th European conference on Object-Oriented Programming
| Hi-index | 0.00 |
Though impressive advances have been made in the precision and scalabilty of alias analyses over the last 20 years, their applicability to real-world object-oriented programs has actually decreased. The growth in size of standard libraries and application frameworks has far exceeded scalability improvements in alias analysis--even analyzing a "Hello world" program in Java has become non-trivial due to enormous standard libraries. Precision gains from greater flow and context sensitivity have been countered by greater usage of reflective constructs in programs, leading analyses to either unsoundly ignore reflection or compute very coarse results. Similar complications are emerging for large JavaScript applications, and the lack of static types in such programs can make computing even a basic call graph difficult [7]. Given these trends, it seems unlikely that further incremental improvements to traditional alias analysis algorithms will be sufficient to address the challenges of analyzing current and future real-world codes.