1274 search results - page 121 / 255 » N-fold integer programming |
123
click to vote
SAS
2007
Springer
15 years 11 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...
143
click to vote
CC
2005
Springer
15 years 10 months 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...
139
Voted
SRDS
2003
IEEE
15 years 10 months 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...
144
Voted
ICFP
1997
ACM
15 years 9 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 ...
114
click to vote
CGO
2004
IEEE
15 years 8 months ago
2004
IEEE
Dynamic binary translators use a two-phase approach to identify and optimize frequently executed code dynamically. In the first step (profiling phase), blocks of code are interpre...