125 search results - page 9 / 25 » Bounds Checking with Taint-Based Analysis |
CC
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Alias analysis, traditionally performed statically, is unsuited for a dynamic binary translator (DBT) due to incomplete control-flow information and the high complexity o...
DDECS
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...
CDC
2009
IEEE
13 years 8 months ago
2009
IEEE
In this paper, we study the reachability problem for the class of (strictly) monotone Petri nets that we define based on algebraic conditions. More specifically, given a (strictly)...
KBSE
2007
IEEE
14 years 1 months ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
TACAS
1998
Springer
13 years 11 months ago
1998
Springer
In this paper, we report on an application of the validation and veri cation tool kit Uppaal in the design and analysis of a prototype gear controller, carried out in a joint proje...