Compile time

Known as: Compile-time error, Compile-time, Compiler time 
In computer science, compile time refers to either the operations performed by a compiler (the "compile-time operations"), programming language… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1959-2017
05010019592017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
In this research, we propose a highly predictable, low overhead, and, yet, dynamic, memory-allocation strategy for embedded… (More)
  • figure 1
  • figure 3
  • table I
  • table II
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Most object oriented applications that involve persistent data interact with a relational database. The most common interaction… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
To meet the demands of modern architectures, optimizing compilers must incorporate an ever larger number of increasingly complex… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In this paper we present results we obtained using a compiler to predict performance of scienti c codes. The compiler, Polaris [3… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
1999
1999
Given a program P in a structured programming language, we propose the first polynomial-time algorithm for compiletime memory… (More)
Is this relevant?
1994
1994
This paper presents a new approach for improving performance of instruction cache based systems. The idea is to prevent cache… (More)
  • table 2
Is this relevant?
Highly Cited
1993
Highly Cited
1993
This paper presents a compile-time scheduling heuristic called dynamic level scheduling, which accounts for interprocessor… (More)
  • figure 1
  • figure 5
  • figure 4
  • figure 7
  • figure 6
Is this relevant?
1993
1993
Single-assignment and functional languages have value semantics that do not permit side-effects. This lack of side-effects makes… (More)
  • figure 2
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1977
Highly Cited
1977
This paper discusses techniques which enable automatic storage reclamation overhead to be partially shifted to compile time. The… (More)
  • figure 1
Is this relevant?