Sciweavers

3228 search results - page 191 / 646
» Basics of Compiler Design
Sort
View
LCPC
2005
Springer
15 years 9 months ago
Scalable Array SSA and Array Data Flow Analysis
Static Single Assignment (SSA) has been widely accepted as the intermediate program representation of choice in most modern compilers. It allows for a much more efficient data flo...
Silvius Rus, Guobin He, Lawrence Rauchwerger
RTA
2005
Springer
15 years 9 months ago
A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code
Proof-carrying code provides a mechanism for insuring that a host, or code consumer, can safely run code delivered by a code producer. The host specifies a safety policy as a set ...
Amy P. Felty
112
Voted
ICSM
2003
IEEE
15 years 8 months ago
DART: A Framework for Regression Testing "Nightly/daily Builds" of GUI Applications
“Nightly/daily building and smoke testing” have become widespread since they often reveal bugs early in the software development process. During these builds, software is comp...
Atif M. Memon, Ishan Banerjee, Nada Hashmi, Adithy...
133
Voted
EUROPAR
2003
Springer
15 years 8 months ago
Partial Redundancy Elimination with Predication Techniques
Partial redundancy elimination (PRE) techniques play an important role in optimizing compilers. Many optimizations, such as elimination of redundant expressions, communication opti...
Bernhard Scholz, Eduard Mehofer, R. Nigel Horspool
CC
2001
Springer
121views System Software» more  CC 2001»
15 years 8 months ago
Constant-Time Root Scanning for Deterministic Garbage Collection
Root scanning is the task of identifying references to heap objects that are stored outside of the heap itself, in global and local variables and on the execution stack. Root scann...
Fridtjof Siebert