2976 search results - page 265 / 596 » On the bounded integer programming |
186
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
With the increasing gap between processor speed and memory latency, the performance of data-dominated programs are becoming more reliant on fast data access, which can be improved...
171
click to vote
SAS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
200
click to vote
CC
2005
Springer
16 years 25 days ago
2005
Springer
In this paper, we present a formal description of data slicing, which is a type-directed program transformation technique that separates a program’s heap into several independent...
200
click to vote
SRDS
2003
IEEE
16 years 17 days ago
2003
IEEE
A large class of security attacks exploit software implementation vulnerabilities such as unchecked buffers. This paper proposes Transparent Runtime Randomization (TRR), a general...
195
click to vote
ICFP
1997
ACM
15 years 11 months ago
1997
ACM
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...