1382 search results - page 105 / 277 » Formal Analysis of Online Algorithms |
144
click to vote
DLT
2008
15 years 7 months ago
2008
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
135
click to vote
SAS
2007
Springer
16 years 6 days 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...
158
click to vote
FM
2001
Springer
15 years 10 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
159
click to vote
SAS
2004
Springer
15 years 11 months ago
2004
Springer
Array-Range Analysis computes at compile time the range of possible index values for each array-index expression in a program. This information can be used to detect potential out-...
130
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
Verification of system designs continues to be a major challenge today. Simulation remains the primary tool for making sure that implementations perform as they should. We present...