Code generation (compiler)

Known as: Code generation, Code generator, Intermediate code generation 
In computing, code generation is the process by which a compiler's code generator converts some intermediate representation of source code into a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1962-2017
010020030019622017

Related topics

Related topics

49 relations
(and SAP Sybase PowerAMC)Abstract syntax treeAlgorithmAlgorithmic efficiency
(More)

Related mentions per year

Related mentions per year

1936-2019
19401960198020002020
Code generation (compiler)
Algorithm
Compiler
Recursion
Run time (program lifecycle phase)
Algorithmic efficiency

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Polyhedral parallel code generation for CUDA
This article addresses the compilation of a sequential program for parallel execution on a modern GPU. To this end, we present a… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Lightweight modular staging: a pragmatic approach to runtime code generation and compiled DSLs
Good software engineering practice demands generalization and abstraction, whereas high performance demands specialization and… (More)
  • figure 2
  • figure 4
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Code Generation via Higher-Order Rewrite Systems
We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Code generation in the polyhedral model is easier than you think
Many advances in automatic parallelization and optimization have been achieved through the polyhedral model. It has been… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
'C and tcc: A Language and Compiler for Dynamic Code Generation
Dynamic code generation allows programmers to use run-time information in order to achieve performance and expressiveness… (More)
  • table I
  • figure 4
  • table II
  • figure 25
  • figure 26
Is this relevant?
Highly Cited
1993
Highly Cited
1993
The Essence of Compiling with Continuations
In order to simplify the compilation process, many compilers for higher-order languages use the continuation-passing style (CPS… (More)
  • figure 1
  • figure 5
  • figure 6
  • figure 8
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Communication Optimization and Code Generation for Distributed Memory Machines
This paper presents several algorithms to solve code generation and optimization problems specific to machines with distributed… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Compiling Fortran D for MIMD Distributed Memory Machines
Fortran D, a version of Fortran extended with data decomposition speciications, is designed to provide a machine-independent data… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Code Generation Using Tree Matching and Dynamic Programming
Compiler-component generators, such as lexical analyzer generators and parser generators, have long been used to facilitate the… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • table II
Is this relevant?
Highly Cited
1976
Highly Cited
1976
Code Generation for Expressions with Common Subexpressions
This paper shows the problem of generating optimal code for expressions containing common subexpressions is computationally… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?