Kuck, D.J., Kuhn, R.H., Leasure, B., Padua, D.A., and Wolfe, M., "Dependence graphs and compiler optimizations," pp. 207-218 in Conference Record of the Eighth ACM Symposium on Principles of Programming Languages, (Williamsburg, VA, January 26-28, 1981), ACM, New York (1981). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Eliminating Duplication in Source Code via Procedure Extraction - Komondoor, Horwitz (Correct)
....mentioned in Section 1.1, which provides quantitative data on how well our algorithm works in practice and how much of an advance it is over previous techniques. 2. ASSUMPTIONS AND TERMINOLOGY We assume that the reader is familiar with the standard definitions of control and data dependence [9, 14, 4]. We assume that programs are represented using a set of controlflow graphs (CFGs) one for each procedure. Predicate nodes in CFGs have two or more outgoing edges (looppredicates and if predicates have exactly two, whereas switch predicates have one for each case label and for the default ....
D. J. Kuck, R. H. Kuhn, D. A. Padua, B. Leasure, and M. Wolfe. Dependence graphs and compiler optimizations. In Proc. ACM Symp. on Principles of Programming Languages, pages 207--218, Jan. 1981.
Effective Compile-Time Analysis for Data Prefetching in Java - Cahoon (2002) (Correct)
....so that array accesses reuse smaller blocks of data that fit into the cache. Compilers typically employ advanced static analysis techniques to determine when and how to perform a transformation. The static techniques perform data dependence analysis to determine the access patterns in programs [63]. The static analysis needs to determine when the transformation is legal. If the compiler is unable to determine the legality then it cannot perform the optimization. An advantage of data prefetching is that compilers can be more aggressive in determining opportunities because legality is not a ....
David J. Kuck, R.H. Kuhn, David Padua, B. Leasure, and M. Wolfe. Dependence graphs and compiler optimizations. In Proceedings of the Eigth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 207--218, Williamsburg, VA, January 1981.
The LRPD Test: Speculative Run-Time Parallelization of.. - Rauchwerger, Padua (1999) (57 citations) Self-citation (Padua) (Correct)
No context found.
# D.J. Kuck, R.H. Kuhn, D.A. Padua, B. Leasure, and M. Wolfe, "Dependence Graphs and Compiler Optimizations," Proc. Eighth ACM Symp. Principles of Programming Languages, pp. 207--218, Jan. 1981.
The Semantics of Program Slicing - Thomas Reps And (Correct)
No context found.
Kuck, D.J., Kuhn, R.H., Leasure, B., Padua, D.A., and Wolfe, M., "Dependence graphs and compiler optimizations," pp. 207-218 in Conference Record of the Eighth ACM Symposium on Principles of Programming Languages, (Williamsburg, VA, January 26-28, 1981), ACM, New York (1981).
A Program Integration Algorithm that Accommodates - Semantics-Preserving.. (Correct)
No context found.
Kuck, D.J., Kuhn, R.H., Leasure, B., Padua, D.A., and Wolfe, M., "Dependence graphs and compiler optimizations, " pp. 207-218 in Conference Record of the Eighth ACM Symposium on Principles of Programming Languages, (Williamsburg, VA, January 26-28, 1981), (1981).
Unknown - (Correct)
No context found.
Kuck, D. J., Kahn, R. H., Padua, D. A., Leasure, B., and Wolfe, M. Dependence graphs and compiler optimizations. In Proceedings of the Eighth Annual ACM Symposium on Principles of Programming Languages (Jan. 1981), pp. 207--218.
Improving Register Allocation for Subscripted Variables - Callahan, Carr, Kennedy (1990) (120 citations) (Correct)
No context found.
D. Kuck, R. Kuhn, D. Padua, B. Leasure, and M. Wolfe. Dependence graphs and compiler optimizations. In Conference Record of the Eight ACM Symposium on the Principles of Programming Languages, 1981.
Program Specialization Based on Dynamic Slicing - Ochoa, Silva, Vidal (2004) (Correct)
No context found.
D.J. Kuck, R.H. Kuhn, D.A. Padua, B. Leasure, and M. Wolfe. Dependence Graphs and Compiler Optimization. In Proc. of the 8th Symp. on the Principles of Programming Languages (POPL'81), SIGPLAN Notices, pages 207--218, 1981.
Lecture Notes in Computer Science No. 487, Arndt Bode Ed.. - On Automatic Loop (1991) (Correct)
No context found.
D.J. Kuck, R.H. Kuhn, D.A. Padua, B. Leasure and M. Wolfe, "Dependence Graphs and Compiler Optimiza-tions", Proc. of the 8th ACM Symposium on Principles of Programming Languages Williamsburg, January 1981.
Next-Generation Memory Systems - Wang (2004) (Correct)
No context found.
D. Kuck, R. Kuhn, D. Padua, B. Leasure, and M. J. Wolfe. Dependence graphs and compiler optimizations. In Conference Record of the Eighth Annual ACM Symposium on the Principles of Programming Languages, pages 207--218, Williamsburg, VA, January 1981.
Slicing Concurrent Java Programs: Issues and Solutions - Nanda (2001) (Correct)
No context found.
D. Kuck, R. Kuhn, D. Padua, D. Leasure, and M. Wolfe. Dependence graphs and compiler optimizations. In Proceedings of the ACM Symposium on Principles of Programming Languages, 1981.
Dynamically Reconfigurable Architecture for a Class of Real-Time.. - Ohkami (1992) (Correct)
No context found.
D. J. Kuck, R. H. Kuhn, D. A. Padua, B. Leasure, and M. Wolfe, "Dependence Graphs and Compiler Optimizations," Conference Record of the 8th Annual ACM Symposium on Principles of Programming Languages, January 1981, pp.207--218.
New Programs From Old - Ramalingam And Thomas (Correct)
No context found.
Kuck, D.J., Kuhn, R.H., Leasure, B., Padua, D.A., and Wolfe, M., "Dependence graphs and compiler optimizations, " pp. 207-218 in Conference Record of the Eighth ACM Symposium on Principles of Programming Languages, (Williamsburg, VA, January 26-28, 1981), ACM, New York, NY (1981).
Eliminating Duplication in Source Code via Procedure Extraction - Komondoor, Horwitz (2002) (Correct)
No context found.
D. J. Kuck, R. H. Kuhn, D. A. Padua, B. Leasure, and M. Wolfe. Dependence graphs and compiler optimizations. In Proc. ACM Symp. on Principles of Programming Languages, pages 207--218, Jan. 1981.
Rule-Based Building-Block Architecture for Policy-based.. - Kanada, O'Keefe (2003) (Correct)
No context found.
Kuck, D. J., Kuhn, R. H., Padua, D. H., Leasure, B., and Wolfe, M., "Dependence Graphs and Compiler Optimizations", 8th ACM Symposium on Principles of Programming Languages (POPL 81), pp. 207--218, 1981.
Spatial Computation - Budiu (2003) (Correct)
No context found.
David J. Kuck, R. H. Kuhn, David A. Padua, B. Leasure, and Michael Wolfe. Dependence graphs and compiler optimizations. In ACM Symposium on Principles of Programming Languages (POPL), pages 207--218, Williamsburg, VA, January 1981.
Program Integration for Languages with Procedure Calls - David Binkley Susan (1995) (22 citations) (Correct)
No context found.
Kuck, D.J., Kuhn, R.H., Leasure, B., Padua, D.A., and Wolfe, M., "Dependence graphs and compiler optimizations," pp. 207-218 in Conference Record of the Eighth ACM Symposium on Principles of Programming Languages, (Williamsburg, VA, January 26-28, 1981), ACM, New York, NY (1981).
Constant Plurality: A New Concept for Automated Parallelisation - MacLaren (2001) (Correct)
No context found.
D. J. Kuck et al., \Dependence Graphs and Compiler Optimizations", in Proceedings of the 8th ACM Symposium on Principles of Programming Languages (POPL '81) (Williamsburg, Virginia, Jan. 1981.
The Use of Program Dependence Graphs in Software Engineering - Susan Horwitz And (1992) (6 citations) (Correct)
No context found.
Kuck, D.J., Kuhn, R.H., Leasure, B., Padua, D.A., and Wolfe, M., "Dependence graphs and compiler optimizations," pp. 207-218 in Conference Record of the Eighth ACM Symposium on Principles of Programming Languages, (Williamsburg, VA, January 26-28, 1981), (1981).
Unknown - (Correct)
No context found.
D. Kuck, R. Kuhn, D. Padua, B. Leasure, and M. Wolfe. Dependence Graphs and Compiler Optimizations. In Proc. of the 8th ACM Symposium on Principles of Programming Languages, pages 207--218, 1981.
Efficient Context-Sensitive Intrusion Detection - Giffin, Jha, Miller (2004) (3 citations) (Correct)
No context found.
D. Kuck, R. Kuhn, D. Padua, B. Leasure, and M. Wolfe. Dependence graphs and compiler optimizations. In ACM Symposium on Principles of Programming Languages (POPL), pages 207--218, Williamsburg, Virginia, January 1981.
Optimal Software Pipelining of Loops with Control Flows - Han-Saem Yun And (2002) (1 citation) (Correct)
No context found.
D. Kuck, R. Kuhn, D. Padua, B. Leasure, and M. Wolfe. Dependence Graphs and Compiler Optimizations. In Proc. of the 8th ACM Symposium on Principles of Programming Languages, pages 207--218, 1981.
Effective, Automatic Procedure Extraction - Komondoor, Horwitz (2003) (2 citations) (Correct)
No context found.
D. Kuck, R. Kuhn, D. Padua, B. Leasure, and M. Wolfe. Dependence graphs and compiler optimizations. In Proc. ACM Symp. on Principles of Prog. Langs., pages 207--218, Jan. 1981.
Effective, Automatic Procedure Extraction - Komondoor, Horwitz (2003) (2 citations) (Correct)
No context found.
D. J. Kuck, R. H. Kuhn, D. A. Padua, B. Leasure, and M. Wolfe. Dependence graphs and compiler optimizations. In Proc. ACM Symp. on Principles of Programming Languages (POPL), pages 207--218, Jan. 1981.
Time Optimal Software Pipelining of Loops with - Control Flo Ws (Correct)
No context found.
D. Kuck, R. Kuhn, D. Padua, B. Leasure, and M. Wolfe. Dependence Graphs and Compiler Optimizations. In Proc. of the 8th ACM Symposium on Principles of Programming Languages, pages 207--218, 1981.
First 50 documents Next 50
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