|
Conferences in DBLP
- Amr Sabry, Matthias Felleisen
Is Continuation-Passing Useful for Data Flow Analysis? [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:1-12 [Conf]
- Andrew W. Appel, David B. MacQueen
Separate Compilation for Standard ML. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:13-23 [Conf]
- John Launchbury, Simon L. Peyton Jones
Lazy Functional State Threads. [Citation Graph (1, 0)][DBLP] PLDI, 1994, pp:24-35 [Conf]
- Kemal Ebcioglu, Randy D. Groves, Ki-Chang Kim, Gabriel M. Silberman, Isaac Ziv
VLIW Compilation Techniques in a Superscalar Environment. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:36-48 [Conf]
- Amitabh Srivastava, David W. Wall
Link-Time Optimization of Address Calculation on a 64-bit Architecture. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:49-60 [Conf]
- Torbjörn Granlund, Peter L. Montgomery
Division by Invariant Integers using Multiplication. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:61-72 [Conf]
- Ko-Yang Wang
Precise Compile-Time Performance Prediction for Superscalar-Based Computers. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:73-84 [Conf]
- Tim A. Wagner, Vance Maverick, Susan L. Graham, Michael A. Harrison
Accurate Static Estimators for Program Optimization. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:85-96 [Conf]
- Andreas Krall
Improving Semi-static Branch Prediction by Code Replication. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:97-106 [Conf]
- Reinhard von Hanxleden, Ken Kennedy
GIVE-N-TAKE - A Balanced Code Placement Framework. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:107-120 [Conf]
- William Pugh
Counting Solutions to Presburger Formulas: How and Why. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:121-134 [Conf]
- Allan L. Fisher, Anwar M. Ghuloum
Parallelizing Complex Scans and Reductions. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:135-146 [Conf]
- Jens Knoop, Oliver Rüthing, Bernhard Steffen
Partial Dead Code Elimination. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:147-158 [Conf]
- Preston Briggs, Keith D. Cooper
Effective Partial Redundancy Elimination. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:159-170 [Conf]
- Richard Johnson, David Pearson, Keshav Pingali
The Program Structure Tree: Computing Control Regions in Linear Time. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:171-185 [Conf]
- Jack W. Davidson, Sanjay Jinturkar
Memory Access Coalescing: A technique for Eliminating Redundant memory Accesses. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:186-195 [Conf]
- Amitabh Srivastava, Alan Eustace
ATOM - A System for Building Customized Program Analysis Tools. [Citation Graph (3, 0)][DBLP] PLDI, 1994, pp:196-205 [Conf]
- Mark B. Reinhold
Cache Performance of Garbage-Collected Programs. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:206-217 [Conf]
- Joseph Hummel, Laurie J. Hendren, Alexandru Nicolau
A General Data Dependence Test for Dynamic, Pointer-Based Data Structures. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:218-229 [Conf]
- Alain Deutsch
Interprocedural May-Alias Analysis for Pointers: Beyond k-limiting. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:230-241 [Conf]
- Maryam Emami, Rakesh Ghiya, Laurie J. Hendren
Context-Sensitive Interprocedural Points-to Analysis in the Presence of Function Pointers. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:242-256 [Conf]
- Steven M. Kurlander, Charles N. Fischer
Zero-cost Range Splitting. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:257-265 [Conf]
- Cindy Norris, Lori L. Pollock
register Allocation over the Program Dependence Graph. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:266-277 [Conf]
- Roland Wismüller
Debugging of Globally Optimized Programs Using Data Flow Analysis. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:278-289 [Conf]
- Todd M. Austin, Scott E. Breach, Gurindar S. Sohi
Efficient Detection of All Pointer and Array Access Errors. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:290-301 [Conf]
- Hiralal Agrawal
On Slicing Programs with Jump Statements. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:302-312 [Conf]
- Robert H. B. Netzer, Mark H. Weaver
Optimal Tracing and Incremental Reexecution for Debugging Long-Running Programs. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:313-325 [Conf]
- Urs Hölzle, David Ungar
Optimizing Dynamically-Dispatched Calls with Run-Time Type Feedback. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:326-336 [Conf]
- Pascal Van Hentenryck, Agostino Cortesi, Baudouin Le Charlier
Type Analysis of Prolog Using Type Graphs. [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:337-348 [Conf]
- Pascal Van Hentenryck, Viswanath Ramachandran
Backtracking without Trailing in CLP(RLin). [Citation Graph (0, 0)][DBLP] PLDI, 1994, pp:349-360 [Conf]
|