Dhananjay M. Dhamdhere, Barry K. Rosen, and F. Kenneth Zadeck. How to analyze large programs e#ciently and informatively. In Proceedings of the ACM SIGPLAN 1992 Conference on Programming Language Design and Implementation, pages 212--223, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Partial Redundancy Elimination on Predicated Code - Knoop, Collard, Ju (1999) (1 citation) (Correct)
....pioneered by the algorithm of Morel and Renvoise [25] has thoroughly been studied in the literature. The (intraprocedural) state of the art algorithms fall into two major groups. First, algorithms aiming at eliminating redundancies among lexically identical terms, also known as syntactic PRE (cf. [2, 5, 6, 7, 8, 12, 15, 19, 20, 13, 29, 28]) Second, algorithms aiming at eliminating redundancies also among lexically di#erent, yet semantically equivalent computations, also known as semantic PRE (cf. 1, 3, 23, 27, 31, 30] The enhanced transformational power of the algorithms of the second group comes at the price of significantly ....
D. M. Dhamdhere, B. K. Rosen, and F. K. Zadeck. How to analyze large programs e#ciently and informatively. In Proc. ACM SIGPLAN Conf. Prog. Lang. Design and Impl. (PLDI'92), volume 27,7 of ACM SIGPLAN Not., pages 212 -- 223, 1992.
Composing Dataflow Analyses and Transformations - Lerner, Grove, Chambers (2001) (3 citations) (Correct)
....and nodes can be arbitrarily replaced. Clients of our framework would simply sequence analyses and transformations if non local graph replacements are needed, as in all other frameworks, including Assmann s. There is also a large body of literature on advanced and e#cient program representations [16, 12, 8, 14, 21, 30, 1, 18, 20, 25]. The definition of our framework is independent of the specific program representation used, and thus our work should be applicable to a wide range of graph based intermediate representations. In fact, our current Whirlwind implementation works over both control flow graphs and dataflow graphs. ....
Dhananjay M. Dhamdhere, Barry K. Rosen, and F. Kenneth Zadeck. How to analyze large programs e#ciently and informatively. SIGPLAN Notices, 27(7):212--223, July 1992. Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation.
Sparse Bidirectional Data Flow Analysis as a Basis for Type.. - Singer (2004) (Correct)
No context found.
Dhananjay M. Dhamdhere, Barry K. Rosen, and F. Kenneth Zadeck. How to analyze large programs e#ciently and informatively. In Proceedings of the ACM SIGPLAN 1992 Conference on Programming Language Design and Implementation, pages 212--223, 1992.
The Static Single Information Form - Ananian (1999) (1 citation) (Correct)
No context found.
D. M. Dhamdhere, B. K. Rosen, and F. K. Zadeck. How to analyze large programs eciently and informatively. In Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation (PLDI), pages 212-223, San Francisco, California, June 1992.
Active Libraries and Universal Languages - Veldhuizen (2004) (1 citation) (Correct)
No context found.
Dhananjay M. Dhamdhere, Barry K. Rosen, and F. Kenneth Zadeck. How to analyze large programs e#ciently and informatively. In Proceedings of the 5th ACM SIGPLAN conference on Programming language design and implementation, pages 212--223. ACM Press, 1992. ISBN 0-89791-475-9.
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