Inferring function calls in an ambiguous language computer...

Data processing: software development – installation – and managem – Software program development tool – Translation of code

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07376941

ABSTRACT:
An ambiguous usage of a name in a statement of a computer program is resolved at least partially by adding to an entry statement thereof a definition that includes the ambiguously used name followed by constructing a definition-use graph, followed by checking whether or not an edge from the added definition reaches the statement containing the ambiguously used name. If all edges into the ambiguous statement are from the added definition, then the name is deemed to be a function call. If all edges into the ambiguous statement are not from the added definition, then the name is deemed to be a memory access. If some edges into the ambiguous statement are from the added definition but other edges are not, then the statement is flagged as a dual usage.

REFERENCES:
patent: 5615369 (1997-03-01), Holler
patent: 6671874 (2003-12-01), Passova
patent: 2005/0027838 (2005-02-01), Magid
Luiz De Rose & David Padua, “Techniques for the Translation of MATLAB Programs into Fortran 90”, ACM Transactions on Programming Languages and Systems, vol. 21, No. 2, Mar. 1999 pp. 286-323.
George Almasi & David Padua, “MaJIC: Compiling MATLAB for Speed and Responsiveness”, Department of Computer Science University of Illinois at Urbana-Champaign, PLDI'02, Jun. 17-19, 2002, Berlin, Germany, pp. 294-303.
Steven S. Muchnick, “Advanced Compiler Design and Implementation”, Academic Press, 1997, pp. 217-266.
Steven S. Muchnick & Neil D. Jones “Program Flow Analysis: Theory and Applications”, Prentice Hall Publisher ,1981, pp. 1-54.
Karen Pieper “Parallelizing compilers: Implementation and effectiveness” PhD. thesis, Stanford Computer Systems Laboratory, Jun. 1993, pp. 70-121.
Randy Allen & Ken Kennedy, “Optimizing Compilers for Modern Architectures”, Morgan Kaufmann publishers, 2002, Chapter 4 pp. 135-317.
De Rose, L. et al., “A MATLAB to Fortran 90 Translator and its Effectiveness”, Mar. 1996, pp. 9.
“MATLAB: The Language of Technical Computing - Using MATLAB Version 6”, The Mathworks, Inc., 2002, pp. 3-1 to 3-14; 21-20 to 21-22.
De Rose, L. “Compiler Techniques for MATLAB Programs”, 1996, Urbana, Illinois, p. 120.
Allen, R. “Compiling High-Level Languages to DSP's”, May 1005, IEEE Signal Processing Magazine, pp. 47-56.
Wegman, M. N. et al. “Constant propagation with conditional branches”, ACM Transactions on Programming Languages and Systems, Apr. 1991, vol. 13, No. 2, pp. 181-210.
Aho, A. V. et al. Chapter 2 in a book “Compilers: Principles, Techniques, and Tools”, 2006, 2ndEdition, pp. 25-82.
“MATLAB: The Language of Technical Computing - Using MATLAB Version 6”, The Mathworks, Inc., 2002, pp. 16-1 to 16-14; 21-64 to 21-69.
Entire Prosecution History of U.S. Appl. No. 11/698,252 filed on Jan. 24, 2007 by James G.Peterson et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Inferring function calls in an ambiguous language computer... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Inferring function calls in an ambiguous language computer..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inferring function calls in an ambiguous language computer... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2809655

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.