Sciweavers

339 search results - page 18 / 68
» Can we refactor conditional compilation into aspects
Sort
View
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 7 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
IPPS
1998
IEEE
13 years 12 months ago
Compiler-Optimization of Implicit Reductions for Distributed Memory Multiprocessors
This paper presents reduction recognition and parallel code generationstrategies for distributed-memorymultiprocessors. We describe techniques to recognize a broad range of implic...
Bo Lu, John M. Mellor-Crummey
CC
2009
Springer
157views System Software» more  CC 2009»
14 years 9 days ago
Parsing C/C++ Code without Pre-processing
Abstract. It is difficult to develop style-preserving source-to-source transformation engines for C and C++. The main reason is not the complexity of those languages, but the use o...
Yoann Padioleau
ICSE
2010
IEEE-ACM
14 years 14 days ago
From behaviour preservation to behaviour modification: constraint-based mutant generation
The efficacy of mutation analysis depends heavily on its capability to mutate programs in such a way that they remain executable and exhibit deviating behaviour. Whereas the forme...
Friedrich Steimann, Andreas Thies
XIMEP
2004
ACM
88views Database» more  XIMEP 2004»
14 years 1 months ago
XQuery Processing in Natix with an Emphasis on Join Ordering
We give an overview on how XQuery processing works in our native XML database system Natix. After a brief description of the query compiler we focus on the aspect of join ordering...
Norman May, Sven Helmer, Carl-Christian Kanne, Gui...