Lecture Notes in Computer Science - Compiler Construction
Latest Publications

TOTAL DOCUMENTS

24

(FIVE YEARS 0)

H-INDEX

7

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540643043, 9783540697244

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A new approach to control flow analysis

Lecture Notes in Computer Science - Compiler Construction ◽

10.1007/bfb0026425 ◽

1998 ◽

pp. 95-108 ◽

Author(s):

Pasquale Malacaria ◽

Chris Hankin

Keyword(s):

Flow Analysis ◽

Control Flow ◽

New Approach ◽

Control Flow Analysis

Download Full-text

A new fast algorithm for optimal register allocation in modulo scheduled loops

Lecture Notes in Computer Science - Compiler Construction ◽

10.1007/bfb0026433 ◽

1998 ◽

pp. 204-218 ◽

Author(s):

Sylvain Lelait ◽

Guang R. Gao ◽

Christine Eisenbeis

Keyword(s):

Fast Algorithm ◽

Register Allocation

Download Full-text

Local stack allocation

Lecture Notes in Computer Science - Compiler Construction ◽

10.1007/bfb0026432 ◽

1998 ◽

pp. 189-203 ◽

Author(s):

Martin Maierhofer ◽

M. Anton Ertl

Download Full-text

Extended SSA mumbering: Introducing SSA properties to languages with multi-level pointers

Lecture Notes in Computer Science - Compiler Construction ◽

10.1007/bfb0026427 ◽

1998 ◽

pp. 128-143 ◽

Author(s):

Christopher Lapkowski ◽

Laurie J. Hendren

Keyword(s):

Download Full-text

Lrc — a generator for incremental language-oriented tools

Lecture Notes in Computer Science - Compiler Construction ◽

10.1007/bfb0026440 ◽

1998 ◽

pp. 298-301 ◽

Author(s):

Matthijs Kuiper ◽

João Saraiva

Download Full-text

VLIW compilation techniques for superscalar architectures

Lecture Notes in Computer Science - Compiler Construction ◽

10.1007/bfb0026435 ◽

1998 ◽

pp. 234-248 ◽

Author(s):

Esther Stümpel ◽

Michael Thies ◽

Uwe Kastens

Keyword(s):

Superscalar Architectures ◽

Compilation Techniques

Download Full-text

Myths and facts about the efficient implementation of finite automata and lexical analysis

Lecture Notes in Computer Science - Compiler Construction ◽

10.1007/bfb0026419 ◽

1998 ◽

pp. 1-15 ◽

Author(s):

Klaus Brouwer ◽

Wolfgang Gellerich ◽

Erhard Ploedereder

Keyword(s):

Finite Automata ◽

Efficient Implementation ◽

Lexical Analysis

Download Full-text

Detecting parallelism in C programs with recursive data structures

Lecture Notes in Computer Science - Compiler Construction ◽

10.1007/bfb0026429 ◽

1998 ◽

pp. 159-173 ◽

Author(s):

Rakesh Ghiya ◽

Laurie J. Hendren ◽

Yingchun Zhu

Keyword(s):

Data Structures ◽

Recursive Data Structures ◽

Download Full-text

Portable debugging and profiling

Lecture Notes in Computer Science - Compiler Construction ◽

10.1007/bfb0026438 ◽

1998 ◽

pp. 279-293 ◽

Author(s):

Mikael Pettersson

Download Full-text

Strength reduction via SSAPRE

Lecture Notes in Computer Science - Compiler Construction ◽

10.1007/bfb0026428 ◽

1998 ◽

pp. 144-158 ◽

Author(s):

Robert Kennedy ◽

Fred Chow ◽

Peter Dahl ◽

Shin-Ming Liu ◽

Raymond Lo ◽

...

Keyword(s):

Strength Reduction

Download Full-text