1821 search results - page 193 / 365 » Security-Aware Program Transformations |
LOPSTR
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
ICS
1999
Tsinghua U.
14 years 1 months ago
1999
Tsinghua U.
On modern computers, the performance of programs is often limited by memory latency rather than by processor cycle time. To reduce the impact of memory latency, the restructuring ...
ASPLOS
1994
ACM
14 years 1 months ago
1994
ACM
Several researchers have proposed algorithms for basic block reordering. We call these branch alignment algorithms. The primary emphasis of these algorithms has been on improving ...
AOSD
2007
ACM
14 years 1 months ago
2007
ACM
Design patterns aim at improving reusability and variability of object-oriented software. Despite a notable success, aspect-oriented programming (AOP) has been discussed recently ...
ICLP
2001
Springer
14 years 1 months ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...