Sciweavers

352 search results - page 8 / 71
» Evaluating the imprecision of static analysis
Sort
View
SAS
2007
Springer
124views Formal Methods» more  SAS 2007»
15 years 5 months ago
Arithmetic Strengthening for Shape Analysis
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...
Stephen Magill, Josh Berdine, Edmund M. Clarke, By...
ACSAC
2006
IEEE
15 years 5 months ago
Static Detection of Vulnerabilities in x86 Executables
In the last few years, several approaches have been proposed to perform vulnerability analysis of applications written in high-level languages. However, little has been done to au...
Marco Cova, Viktoria Felmetsger, Greg Banks, Giova...
CC
2011
Springer
267views System Software» more  CC 2011»
14 years 3 months ago
Using Disjoint Reachability for Parallelization
Abstract. We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. Each heap annotated with a set o...
James Christopher Jenista, Yong Hun Eom, Brian Dem...
WCET
2007
15 years 25 days ago
Analysis of path exclusion at the machine code level
We present a method to find static path exclusions in a control flow graph in order to refine the WCET analysis. Using this information, some infeasible paths can be discarded ...
Ingmar Stein, Florian Martin
AUTOMATICA
2006
64views more  AUTOMATICA 2006»
14 years 11 months ago
On stability of second-order quasi-polynomials with a single delay
In this note the stability of a second-order quasi-polynomial with a single delay is studied. Although there is a vast literature on this problem, most available solutions are lim...
Efim Malakhovski, Leonid Mirkin