Experimental Comparison of call string and functional Approaches to Interprocedural Analysis
No abstract available.
Related papers
- An improved bound for call strings based interprocedural analysis of bit vector frameworks TOPLAS 2007
- Efficiency, Precision, Simplicity, and Generality in Interprocedural Data Flow Analysis: Resurrecting the Classical Call Strings Method CC 2008
- More Sound Static Handling of Java Reflection APLAS 2015
- A framework for call graph construction algorithms TOPLAS 2001
- Exploiting the Sparseness of Control-Flow and Call Graphs for Efficient and On-Demand Algebraic Program Analysis OOPSLA 2023
- Interprocedural Specialization of Higher-Order Dynamic Languages Without Static Analysis ECOOP 2017
- Dynamic Optimistic Interprocedural Analysis: A Framework and an Application OOPSLA 2001
- Solving string constraints with Regex-dependent functions through transducers with priorities and variables POPL 2022