7103 search results - page 982 / 1421 » Program Generation and Components |
177
Voted
POPL
1993
ACM
15 years 9 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
108
Voted
ICLP
1989
Springer
15 years 9 months ago
1989
Springer
The generation of efficient code for Prolog programs requires sophisticated code transformation and optimization systems. Much of the recent work in this area has focussed on hig...
143
click to vote
ICALP
1990
Springer
15 years 9 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
150
click to vote
AOSD
2007
ACM
15 years 9 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
148
click to vote
AOSD
2007
ACM
15 years 9 months ago
2007
ACM
Configurability is a major issue in the domain of embedded system software. Existing systems specifically lack good techniques to implement configurability of architectural OS con...