Abstract
We introduce the notion of a partially-flow-sensitive analysis based on the number of read and write operations that are guaranteed to be analyzed in a sequential manner. We study the complexity of partially-flow-sensitive alias analysis and show that precise alias analysis with a very limited flow-sensitivity is as hard as precise flow-sensitive alias analysis, both when dynamic memory allocation is allowed, as well as in the absence of dynamic memory allocation.
- Andersen, L. O. 1994. Program analysis and specialization for the C programming language. Ph.D. dissertation, DIKU, Univ. of Copenhagen. (DIKU report 94/19).Google Scholar
- Chakaravarthy, V. 2003. New results on the computability and complexity of points--to analysis. In POPL '03: Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, NY, USA, 115--125. Google Scholar
Digital Library
- Horwitz, S. 1997. Precise flow-insensitive may-alias analysis is NP-hard. ACM Trans. Prog. Lang. Syst. 19, 1(Jan.), 1--6. Google Scholar
Digital Library
- Kernighan, B. W. and Ritchie, D. M. 1988. The C programming language. Prentice Hall, Upper Saddle River, NJ. Google Scholar
Digital Library
- Landi, W. 1992a. Interprocedural aliasing in the presence of pointers. Ph.D. dissertation, Rutgers University. Google Scholar
Digital Library
- Landi, W. 1992b. Undecidability of static analysis. Let. on Prog. Lang. and Syst. 1, 4, 323--337. Google Scholar
Digital Library
- Milne, R. and Strachey, C. 1977. A Theory of Programming Language Semantics. Halsted Press, New York, NY. Google Scholar
Digital Library
- Muth, R. and Debray, S. K. 2000. On the complexity of flow-sensitive dataflow analyses. In Proceedings of the Symposium on Principles of Programming Languages. 67--80. Google Scholar
Digital Library
- Ramalingam, G. 1994. The undecidability of aliasing. Trans. Prog. Lang. Syst. 16, 5, 1467--1471. Google Scholar
Digital Library
- Reynolds, J. 2002. Separation logic: A logic for shared mutable data structures. In Logic in Computer Science. 55--74. Google Scholar
Digital Library
- Strachey, C. 1966. Towards a formal semantics. In Formal Language Description Languages for Computer Programming, T. B. Steel, Ed. North Holland, Amsterdam, The Netherlands, 198--220.Google Scholar
Index Terms
On the complexity of partially-flow-sensitive alias analysis
Recommendations
Semi-sparse flow-sensitive pointer analysis
POPL '09Pointer analysis is a prerequisite for many program analyses, and the effectiveness of these analyses depends on the precision of the pointer information they receive. Two major axes of pointer analysis precision are flow-sensitivity and context-...
Precise flow-insensitive may-alias analysis is NP-hard
Determining aliases is one of the foundamental static analysis problems, in part because the precision with which this problem is solved can affect the precision of other analyses such as live variables, available expressions, and constant propagation. ...
Demand-driven context-sensitive alias analysis for Java
ISSTA '11: Proceedings of the 2011 International Symposium on Software Testing and AnalysisSoftware tools for program understanding, transformation, verification, and testing often require an efficient yet highly-precise alias analysis. Typically this is done by computing points-to information, from which alias queries can be answered. This ...






Comments