Sciweavers

249 search results - page 41 / 50
» Generative programming techniques for Java library migration
Sort
View
CP
2009
Springer
14 years 3 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
PEPM
1999
ACM
14 years 27 days ago
C++ Templates as Partial Evaluation
This paper explores the relationship between C++ templates and partial evaluation. Templates were designed to support generic programming but unintentionally provided the ability ...
Todd L. Veldhuizen
ICCAD
2002
IEEE
152views Hardware» more  ICCAD 2002»
14 years 5 months ago
Efficient instruction encoding for automatic instruction set design of configurable ASIPs
Application-specific instructions can significantly improve the performance, energy, and code size of configurable processors. A common approach used in the design of such instruc...
Jong-eun Lee, Kiyoung Choi, Nikil Dutt
AOSD
2007
ACM
14 years 20 days ago
SCoPE: an AspectJ compiler for supporting user-defined analysis-based pointcuts
This paper proposes an approach called SCoPE, which supports user-defined analysis-based pointcuts in aspect-oriented programming (AOP) languages. The advantage of our approach is...
Tomoyuki Aotani, Hidehiko Masuhara
ECOOP
2008
Springer
13 years 10 months ago
Computing Stack Maps with Interfaces
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
Frédéric Besson, Thomas P. Jensen, T...