561 search results - page 39 / 113 » Alias Analysis of Executable Code |
ISSTA
2010
ACM
13 years 10 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
KBSE
2009
IEEE
14 years 3 months ago
2009
IEEE
Methods in object-oriented concurrent libraries hide internal synchronization details. However, information hiding may result in clients causing thread safety violations by invoki...
ACSC
2004
IEEE
14 years 13 days ago
2004
IEEE
We have been investigating ways in which the performance of model elimination based systems can be improved and in this paper we present some of our results. Firstly, we have inve...
DAC
2009
ACM
14 years 9 months ago
2009
ACM
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access will result in a definite cache hit or miss. This unpredictabilit...
IWPC
1999
IEEE
14 years 29 days ago
1999
IEEE
One of the fundamental problems with the static analysis of binary (executable) code is that7 of recognizing, in a machine-independent way, the target addresses of n-conditional b...