Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
haifa12 [2012/10/30 13:51] eran.yahav |
haifa12 [2012/10/30 13:53] eran.yahav |
||
|---|---|---|---|
| Line 272: | Line 272: | ||
| applicable, thus simplifying both the presentation and the correctness | applicable, thus simplifying both the presentation and the correctness | ||
| argument. | argument. | ||
| + | |||
| + | |||
| + | |||
| + | |||
| + | |||
| + | **Logico-Numerical Max-Strategy Iteration** | ||
| + | //Pavle Subotic// | ||
| + | |||
| + | Strategy iteration methods are used for solving fixed point equations. | ||
| + | It has been shown that they improve precision in static analysis based | ||
| + | on abstract interpretation | ||
| + | and template polyhedra. However, they are limited to numerical | ||
| + | programs. In this talk a method for applying max-strategy iteration to | ||
| + | logico-numerical programs is presented. This method computes the least | ||
| + | fixed point w.r.t. the abstract domain; in particular, it does not | ||
| + | resort to widening. | ||
| + | |||
| + | (Joint work with Peter Schrammel, INRIA Grenoble) | ||
| + | |||