Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
haifa12 [2012/10/30 13:51] eran.yahav |
haifa12 [2012/10/31 07:19] eran.yahav |
||
---|---|---|---|
Line 47: | Line 47: | ||
| 14:25-14:50 | Assisted Verification of Invariance for Parametrized Systems | Alejandro Sánchez | | | 14:25-14:50 | Assisted Verification of Invariance for Parametrized Systems | Alejandro Sánchez | | ||
| 14:50-15:15 | Interpolation for resolution and superposition | Maria Paola Bonacina | | | 14:50-15:15 | Interpolation for resolution and superposition | Maria Paola Bonacina | | ||
- | | 15:15-15:40 | Reductions for Synthesis Procedures | Philippe Suter | | + | | 15:15-15:30 | short break || |
- | | 15:40-16:05 | Logico-Numerical Max-Strategy Iteration | Pavle Subotic | | + | | 15:30-15:55 | Reductions for Synthesis Procedures | Philippe Suter | |
- | | 16:05-16:20 | short break || | + | | 15:55-16:20 | Logico-Numerical Max-Strategy Iteration | Pavle Subotic | |
- | | 16:20-17:30 | Management Committee Meeting || | + | | 16:20-16:45 | Information flow analysis and temporal logics| Markus Rabe || |
+ | | 16:45-17:00 | short break || | ||
+ | | 17:00-18:00 | Management Committee Meeting || | ||
===== Invited Talks (under construction) ===== | ===== Invited Talks (under construction) ===== | ||
Line 272: | Line 274: | ||
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) | ||
+ | |||
+ | ---- | ||
+ | **Information flow analysis and temporal logics** | ||
+ | //Markus Rabe// | ||
+ | |||
+ | Most analysis methods for information flow properties, such as noninterference, do not consider temporal restrictions. In practice, however, such properties rarely occur statically, but have to consider constraints such as when and under which conditions a variable has to be kept secret. I will present recent results on how to integrate information flow properties into temporal logics by introducing a new modal operator. | ||
+ | Finally, I will sketch upcoming work on integrating information flow properties in game logics such as ATL*. |