


default search action
SIGPLAN Symposium on Compiler Construction 1986: Palo Alto, California, USA
- Richard L. Wexelblat: 
 Proceedings of the 1986 SIGPLAN Symposium on Compiler Construction, Palo Alto, California, USA, June 25-27, 1986. ACM 1986, ISBN 0-89791-197-0
- David Bernstein, Haran Boral, Ron Y. Pinter: 
 Optimal chaining in expression trees. 1-10
- Phillip B. Gibbons, Steven S. Muchnick: 
 Efficient instruction scheduling for a pipelined architecture. 11-16
- Vivek Sarkar, John L. Hennessy: 
 Compile-time partitioning and scheduling of parallel programs. 17-26
- Thomas R. Gross, Monica S. Lam: 
 Compilation for a high-performance systolic array. 27-38
- Roger Hoover, Tim Teitelbaum: 
 Efficient incremental evaluation of aggregate values in attribute grammars. 39-50
- Gail E. Kaiser: 
 Generation of run-time environments. 51-57
- Keith D. Cooper, Ken Kennedy, Linda Torczon: 
 Interprocedural optimization: eliminating unnecessary recompilation. 58-67
- Véronique Royer: 
 Transformations of denotational semantics in semantics directed compiler generation. 68-73
- Kari-Jouko Räihä, Jorma Tarhio  : :
 A globalizing transformation for attribute grammars. 74-84
- Rodney Farrow: 
 Automatic generation of fixed-point-finding evaluators for circular, but well-defined, attribute grammars. 85-98
- Mark Scott Johnson  , Terrence C. Miller: , Terrence C. Miller:
 Effectiveness of a machine-level, global optimizer. 99-108
- Harold Johnson: 
 Data flow analysis for 'intractable' system software. 109-117
- Robert R. Kessler, John C. Peterson, Harold Carr, Gerald P. Duggan, J. Knell, Jed J. Krohnfeldt: 
 EPIC - a retargetable, highly optimizing Lisp compiler. 118-130
- Fred Ives: 
 Unifying view of recent LALR(1) lookahead set algorithms. 131-135
- Manuel E. Bermudez, Karl M. Schimpf: 
 A practical arbitrary look-ahead LR parsing technique. 136-144
- Thomas J. Pennello: 
 Very fast LR parsing. 145-151
- David Callahan, Keith D. Cooper, Ken Kennedy, Linda Torczon: 
 Interprocedural constant propagation. 152-161
- Michael G. Burke, Ron Cytron: 
 Interprocedural dependence analysis and parallelization. 162-175
- Rémi Triolet, François Irigoin, Paul Feautrier: 
 Direct parallelization of call statements. 176-185
- Hans-Juergen Boehm, Alan J. Demers: 
 Implementing RUSSELL. 186-195
- Gary Lindstrom: 
 Static evaluation of functional programs. 196-206
- Peter G. Harrison  , Hessam Khoshnevisan: , Hessam Khoshnevisan:
 Efficient compilation of linear recursive functions into object level loops. 207-218
- David A. Kranz, Richard Kelsey, Jonathan Rees  , Paul Hudak, James Philbin: , Paul Hudak, James Philbin:
 ORBIT: an optimizing compiler for scheme. 219-233
- Jack W. Davidson: 
 A retargetable instruction reorganizer. 234-241
- Christopher W. Fraser, Alan L. Wendt: 
 Integrating code generation and optimization. 242-248
- Peter B. Kessler: 
 Discovering machine-specific code improvements. 249-254
- James R. Larus, Paul N. Hilfinger: 
 Register allocation in the SPUR Lisp compiler. 255-263
- David W. Wall: 
 Global register allocation at link time. 264-275

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


 Google
Google Google Scholar
Google Scholar Semantic Scholar
Semantic Scholar Internet Archive Scholar
Internet Archive Scholar CiteSeerX
CiteSeerX ORCID
ORCID














