Sciweavers

125 search results - page 17 / 25
» Bounds Checking with Taint-Based Analysis
Sort
View
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
15 years 4 months ago
Integer Polyhedra for Program Analysis
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
Philip J. Charles, Jacob M. Howe, Andy King
ICCAD
2001
IEEE
84views Hardware» more  ICCAD 2001»
15 years 6 months ago
Stars in VCC: Complementing Simulation with Worst-Case Analysis
tems. STARS manipulates abstract representations of system components to obtain upper bounds on the number of various events in the system, as well as a bound on the response time....
Felice Balarin
CORR
2009
Springer
242views Education» more  CORR 2009»
14 years 7 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...
IANDC
2007
107views more  IANDC 2007»
14 years 9 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
POPL
2012
ACM
13 years 5 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...