共 132 条
- [1] Horwitz S., Precise flow-insensitive may-alias analysis is NP-hard, ACM Transactions on Programming Languages and Systems, 19, 1, pp. 1-6, (1997)
- [2] Landi W, Ryder BG., A safe approximate algorithm for interprocedural aliasing, Proc. of the ACM SIGPLAN 1992 Conf. on Programming Language Design and Implementation, pp. 235-248, (1992)
- [3] Ramalingam G., The undecidability of aliasing, ACM Transactions on Programming Languages and Systems, 16, 5, pp. 1467-1471, (1994)
- [4] Landi W., Undecidability of static analysis, ACM Letters on Programming Languages and Systems, 1, 4, pp. 323-337, (1992)
- [5] Hind M., Pointer analysis: Haven't we solved this problem yet?, Proc. of the 2001 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pp. 54-61, (2001)
- [6] Ryder BG., Dimensions of precision in reference analysis of object-oriented programming languages, Proc. of the 12th Int'l Conf. on Compiler Construction, pp. 126-137, (2003)
- [7] Steensgaard B., Points-to analysis in almost linear time, Proc. of the 23rd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, pp. 32-41, (1996)
- [8] Andersen LO., Program analysis and specialization for the C programming language, (1994)
- [9] Lhotá
- [10] k O, Hendren L., Scaling Java points-to analysis using spark, Proc. Of the 12th Int'l Conf. on Compiler Construction, pp. 153-169, (2003)