Deepak Goyal. An improved intra-procedural may-alias analysis algorithm. Technical Report 777, Courant Institute of Mathematical Sciences, New York 407 University, February 1999. Also at http://////cs1.cs.nyu.edu///phd students///deepak/// publications///improvement.ps. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
SETL for Internet Data Processing - Bacon (2000) (Correct)
....the latter serving to decrement the reference counts of objects known to have no subsequent uses. They also prove the correctness of their alias propagation analysis and code transformations using formal semantics and 13 Introduction 1.2 A Brief History of SETL abstract interpretation. Goyal [91] has obtained a dramatic improvement in the algorithmic complexity of computing intra procedural may alias relations, again using dominated convergence and finite differencing. In his dissertation [92] he develops set theoretic languages which can express both abstract specifications and ....
Deepak Goyal. An improved intra-procedural may-alias analysis algorithm. Technical Report 777, Courant Institute of Mathematical Sciences, New York 407 University, February 1999. Also at http://////cs1.cs.nyu.edu///phd students///deepak/// publications///improvement.ps.
Interprocedural Pointer Alias Analysis - Hind, Burke, Carini, Choi (1999) (8 citations) (Correct)
....visited, i.e. its transfer function is evaluated. The average number of visits ranged from 2.1 (052.alvinn) to 12.1 (09.vor) with a benchmark average of 5.9. These values do not correlate to program size for our benchmarks, but do correlate to the analysis rate of each program (SEG nodes sec) Goyal [1999] describes an incremental adaption of the transfer function (Section 3.2.2) which reduces the worst case time complexity at the cost of increased storage. 5.2 Flow Insensitive Interprocedural Algorithm The flow insensitive alias algorithm contains three distinct phases: the initial ....
Goyal, D. 1999. An improved intra-procedural may-alias analysis algorithm. Tech. Rep. TR1999777, New York University. Feb.
A Language Theoretic Approach to Algorithm and Software Development - Goyal (1999) Self-citation (Goyal) (Correct)
....Once again, we we formulate the problem as an SQ2 speci cation. However, this time, the use of the program transformational techniques, along with nite di erencing and dominated convergence, enabled us to derive a worst case O(N 3 ) time algorithm for computing the same may alias information [4]. It is our strong belief that the use of formal techniques did not hamper the process of algorithm development, but in fact gave valuable insight into the problem, and led to the development of a much improved algorithm. 3.2 Willard s Database Query Optimization The next application that we ....
D. Goyal. An improved intra-procedural may-alias analysis algorithm. Technical Report 777, New York University, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC