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