Arun Lakhotia
- 1.Aho, A. V., Sethi, R., and Ullman, J. D. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986. Google Scholar
Digital Library
- 2.Allen, F. E. Interprocedural data flow analysis. In Proceedings IFIP Congress, 1974 (1974), North- Holland, pp. 398-402.Google Scholar
- 3.Banning, J. P. An efficient way to find the side effects of procedure calls and the aliases of variables. In Proceedings of 6th Annual Symposium on Principles of Programming Languages (1979), ACM, pp. 29-41. Google ScholarDigital Library
- 4.Burke, M. An interval-based approach to exhaustive and incremental interprocedural analysis. Tech. Rep. RC 12702, IBM Research Center, Yorktown Heights, NY, Sept. 1987.Google Scholar
- 5.Callahan, D., Carle, A., Hall, M. W., and Kennedy, K. Consm~cting the procedure call multigraph. IEEE Trans. Soflw. Eng. 16, 4 (Apr. 1990), 483-487. Google ScholarDigital Library
- 6.Callahan, D., Cooper, K. D., Kennedy, K., and Torczon, L. Interprocedural constant propagation. In Proceedings of the SIGPLAN' 86 Symposium on Compiler Construction (June 1986), pp. 152-161. Google ScholarDigital Library
- 7.Chikofsky, E. J., and Cross II, J. H. Reverse enghneering and design recovery: A taxonomy. IEEE Software (Jan. 1990), 13-17. Google ScholarDigital Library
- 8.Choi, S. C., and Scacchi, W. Extracting and restructuring the design of large systems. IEEE Software (Jan. 1990), 66-71. Google ScholarDigital Library
- 9.Cooper, K. D., and Kennedy, K. Efficient computation of flow insensitive interprocedural summary information. In Proceedings of the ACM SIGPLAN'84 Symposium on Compiler Construction (Jtme 1984), pp. 247-258. Google ScholarDigital Library
- 10.Hecht, M. S. Flow Analysis of Computer Programs. North-Holland, New York, 1977. Google ScholarDigital Library
- 11.Horwitz, S., Reps, T., and B inkley, D. Interprocedural slicing using dependence graphs. ACM Trans. Program. Lang. Syst. 12, 1 (1990), 26-60. Google ScholarDigital Library
- 12.Kam, J. B., and Ullman, J. D. Monotone data flow analysis frameworks. Acta Informatica 7 (1977), 305-317.Google ScholarDigital Library
- 13.Kildall, G. A unified approach to global program optimization. In Proceedings of the first ACM Symposium on Principle of Programming Languages (Oct. 1973), pp. 194-206. Google ScholarDigital Library
- 14.Kuck, D. J., Muraoka, Y., and Chen, S. On the number of operations simultaneously executable in FORTRAN-like programs and their resulting speed-up. IEEE Transactions on Computers C- 12, 12 (Dec. 1972).Google Scholar
- 15.Myers, E. A precise interprocedural data flow algorithm. In Proceedings of the 8th Annual Symposium on Principles of Programming Languages (Jan. 1981), pp. 219-230. Google ScholarDigital Library
- 16.Ottenstein, K. J., and Ottenstein, L. M. The program dependence graph in a software development environment. ACM SIGPLAN Notices 19, 5 (May 1984). Google ScholarDigital Library
- 17.Ryder, B. G. Constructing the call graph of a program. IEEE Trans. Softw. Eng. SE-5, 3 (May 1979), 216-226.Google ScholarDigital Library
- 18.Shivers, O. Control-flow Analysis of Higher- Order Languages. Phi) thesis, School of Computer Science, Carnegie Mellon University, 1991. Google ScholarDigital Library
- 19.Spillman, T. C. Exposing side-effets in a PL/I optimizing compiler. In Proceedings IFIPS (Computer Software) Conference (1971), pp. 56-60.Google Scholar
- 20.Wegman, M., and Zadeck, F. Constant propagation with conditional branches. ACM Trans. Program. Lang. Syst. 13, 2 (Apr. 1990), 181-210. Google ScholarDigital Library
- 21.Weihl, W. E. Interprocedural data flow analysis in the presence of pointers, procedure variables, and label variables. In Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages (Jan. 1980), pp. 83- 94. Google ScholarDigital Library
Index Terms
- Constructing call multigraphs using dependence graphs
Recommendations
Interval Non-edge-Colorable Bipartite Graphs and Multigraphs
An edge-coloring of a graph G with colors 1,...,t is called an interval t-coloring if all colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. In 1991, Erdï s constructed a bipartite graph ...
Constructing connected bicritical graphs with edge-connectivity 2
A graph G is said to be bicritical if the removal of any pair of vertices decreases the domination number of G . For a bicritical graph G with the domination number t , we say that G is t -bicritical. Let λ ( G ) denote the edge-connectivity of G . In 2]...
Constructing Graphs with No Immersion of Large Complete Graphs
In 1989, Lescure and Meyniel proved, for d=5,6, that every d-chromatic graph contains an immersion of Kd, and in 2003 Abu-Khzam and Langston conjectured that this holds for all d. In 2010, DeVos, Kawarabayashi, Mohar, and Okamura proved this conjecture ...
Comments