Sciweavers

339 search results - page 20 / 68
» Can we refactor conditional compilation into aspects
Sort
View
AAAI
2006
13 years 9 months ago
Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes)
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
Héctor Palacios, Hector Geffner
CGO
2004
IEEE
13 years 11 months ago
A Compiler Scheme for Reusing Intermediate Computation Results
Recent research has shown that programs often exhibit value locality. Such locality occurs when a code segment, although executed repeatedly in the program, takes only a small num...
Yonghua Ding, Zhiyuan Li
ASM
2004
ASM
14 years 1 months ago
An ASM Semantics for SSA Intermediate Representations
Abstract. Static single assignment (SSA) form is the intermediate representation of choice in modern optimizing compilers for which no formal semantics has been stated yet. To prov...
Sabine Glesner
WCRE
2002
IEEE
14 years 18 days ago
Java Quality Assurance by Detecting Code Smells
Software inspection is a known technique for improving software quality. It involves carefully examining the code, the design, and the documentation of software and checking these...
Eva Van Emden, Leon Moonen
ICS
2007
Tsinghua U.
14 years 1 months ago
Sensitivity analysis for automatic parallelization on multi-cores
Sensitivity Analysis (SA) is a novel compiler technique that complements, and integrates with, static automatic parallelization analysis for the cases when relevant program behavi...
Silvius Rus, Maikel Pennings, Lawrence Rauchwerger