english only
EPFL > I&C > Tresor > Seminars
RESOURCES
Home
People
Seminars
Courses
Research Topics
Events
Useful Links

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Last revision Both sides next revision
seminars:calendar [2007/04/16 17:18]
fsalvi
seminars:calendar [2007/04/16 17:29]
fsalvi
Line 1: Line 1:
 ====== Tresor Talks ===== ====== Tresor Talks =====
  
-  * 08/07/2006 Soccer-Tournament +<gcal pages=(:seminars) mode=ahmet_month>​
-  * 08/07/2006 08:00 rdv in [[:seminars:​calendar:​rdvtest2|test2]] +
-  * 08/17/2006 08:00 rdv2 in test2 +
-  * 08/02/2006 - 08/​25/​2006 +
-  * 01.08. Happy b-day Franky !+
  
-\\ 
-\\ 
  
-  * 2007-04-17 13:00 [[http://​www-verimag.imag.fr/​~iosif/​|Radu Iosif, Verimag]]: "​Proving Termination of Tree Manipulating Programs"​. 
- 
-Abstract: 
-We consider the termination problem of programs manipulating tree-like dynamic data structures. Our approach is based on an abstract-check-refine loop. We use abstract regular tree model-checking to infer invariants of the program. Then, we translate the program to a counter automaton which simulates it. If the counter automaton can be shown to terminate using existing techniques, the program terminates. If not, we analyze the possible counterexample given by a counter automata termination checker and either conclude that the program does not terminate, or else refine the abstraction ​ and repeat. We show that the spuriousness problem for lasso-shaped counterexamples 
-is decidable in some non-trivial cases. We applied the method successfully on several interesting case studies. 
- 
-Joint work with Peter Habermehl, Tomas Vojnar and Adam Rogalewicz 
- 
-\\ 
-\\ 
- 
- 
-  * 2007-04-18 16:10 [[http://​www-mgi.informatik.rwth-aachen.de/​~kaiser/​|Lukasz Kaiser. RWTH Aachen]]: "​Hierarchical Games"​. ​ 
- 
-Abstract: 
-We extend combinatorial imperfect information games to a multi-player setting, where information is exchanged with respect to hierarchical constraints. We show that this class of games can be used for model checking first-order logic on structures, where elements are built inductively. We focus on structures with relations given by automata where these games have finite arenas. Assuming that players alternate their moves, it is possible to decide the winning coalition in such a game. We discuss how this game-based representation can be exploited algorithmically. 
- 
-\\ 
-\\ 
- 
-  * 2007-04-23 to 2007-04-25: [[http://​www-verimag.imag.fr/​~async/​AVM/​|Alpine Verification Meeting]]. 
- 
-\\ 
-\\ 
- 
- 
-  * May 1: 
- 
-\\ 
-\\ 
- 
- 
-  * May 8: 
- 
-\\ 
-\\ 
- 
- 
-  * May 15: 
- 
-\\ 
-\\ 
- 
- 
-  * May 22: 
- 
-\\ 
-\\ 
- 
- 
-  * May 29: