Program

Tuesday, July 12, 2005

8:50am-10:00am Session I
8:50am-9:00am Opening
9:00am-10:00am Patricia Bouyer
  partial Observation of Timed Systems (Abstract
10:00am-10:30am Coffee Break
10:30am-12:30pm Session II: Probability and Time
10:30am-11:10am Kousha Etessami
   Analysis and verification of Recursive Markov Chains, Recursive Markov Decision Processes, and Recursive Stochastic Games (Abstract)
11:10am-11:50pm Marielle Stoelinga
  Time and Resource Interfaces: a behavioral type system for component-based design (Abstract)
11:50am-12:30pm Jean-Francois Raskin
  On optimal timed strategies (Abstract)
  
12:30pm-1:45pm Lunch Break
  
2:00pm-3:30pm Session III: Software
2:00pm-2:30pm Andreas Griesmayer and Roderick Bloem
  Repair of Boolean Programs using Games (Abstract)
2:30pm-3:00pm Dan Ghica
  Model checking concurrent programs using game semantics (Abstract)
3:00pm-3:30pm Ranko Lazic
  Data-Abstraction Refinement: A Game Semantic Approach (Abstract)
3:30pm-4:00pm Coffee Break
4:00pm-6:00pm Session IV: Algorithms and Applications
4:00pm-4:30pm Emmanuel Fleury
   Efficient On-the-fly Algorithms for the Analysis of Timed Games (Abstract)
4:30pm-5:00pm Martin Lange
  Solving parity games by a reduction to SAT (Abstract)
5:00pm-5:30pm Florian Horn
  Streett games on finite graphs (Abstract)
5:30pm-6:00pm Discussions and Closing


rupak@cs.ucla.edu Last updated: June 6, 2005