Inferring Function Calls In An Ambiguous Language Computer Program
作者： John R. Allen
DOI:
关键词:
摘要: An ambiguous usage of a name in statement computer program is resolved at least partially by adding to an entry thereof definition that includes the ambiguously used followed constructing definition-use graph, checking whether or not edge from added reaches containing name. If all edges into are definition, then deemed be function call. memory access. some but other not, flagged as dual usage.
lens.org 参考文章(13)
Anne M. Holler, Automated detection and correction of uninitialized variables ,(1994)
Allen, Optimizing Compilers for Modern Architectures ,(2004)
George Almási, David Padua, MaJIC Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation - PLDI '02. ,vol. 37, pp. 294- 303 ,(2002) , 10.1145/512529.512564
Karen Lee Pieper, Parallelizing compilers: implementation and effectiveness Stanford University. ,(1993)
R. Allen, Compiling high-level languages to DSPs: automating the implementation path IEEE Signal Processing Magazine. ,vol. 22, pp. 47- 56 ,(2005) , 10.1109/MSP.2005.1425897
Steven S. Muchnick, Neil D. Jones, Program Flow Analysis: Theory and Application Prentice Hall Professional Technical Reference. ,(1981)
Mark N. Wegman, F. Kenneth Zadeck, Constant propagation with conditional branches ACM Transactions on Programming Languages and Systems. ,vol. 13, pp. 181- 210 ,(1991) , 10.1145/103135.103136
Luiz De Rose, David Padua, A MATLAB to Fortran 90 translator and its effectiveness international conference on supercomputing. pp. 309- 316 ,(1996) , 10.1145/237578.237627
Steven S. Muchnick, Advanced Compiler Design and Implementation ,(1997)