Preliminary schedule

For Printing

pdf version
The schedule of Movep 2012 is also available on guidebook (for iOS, android and blackberry). You can find the schedule by searching "movep" on guidebook.

Overview

Below you find an overview of the schedule. The times for the coffee breaks are not tight, they depend on how precisely the tutorials are split.

	Monday December 3	Tuesday December 4	Wednesday December 5	Thursday December 6	Friday December 7
8:50	Opening
9:00-9:30	Logic and Verification Moshe Y. Vardi	Probabilistic Systems Marta Kwiatkowska	Unfoldings: A Partial Order approach to Model Checking Javier Esparza	Games for Verification and Synthesis Hugo Gimbert	Analysis of Extended AADL Models Alessandro Cimatti and Thomas Noll
9:30-10:00
10:00-10:30
10:30-11:00	Coffee break	Coffee break	Coffee break	Coffee break	Coffee break
11:00-11:30	Logic and Verification Moshe Y. Vardi	Probabilistic Systems Marta Kwiatkowska	Unfoldings: A Partial Order approach to Model Checking Javier Esparza	Games for Verification and Synthesis Hugo Gimbert	Analysis of Extended AADL Models Alessandro Cimatti and Thomas Noll
11:30-12:00
12:00-14:00	Lunch break	Lunch break	Lunch break	Lunch break	Lunch break
14:00-14:30	Runtime Verification Martin Leucker	Free time	Timed automata and their quantitative extensions Kim G. Larsen	Free time	Software Synthesis Ruzica Piskac
14:30-15:00
15:00-15:30
15:30-16:00	Coffee break		Coffee break		Coffee break
16:00-16:30	Computer-Aided Cryptographic Proofs and Designs Gilles Barthe	Static analysis by abstract Interpretation Antoine Miné	Timed automata and their quantitative extensions Kim G. Larsen	Verification of concurrent systems Ahmed Bouajjani	End of MOVEP 2012
16:30-17:00
17:00-17:30			short break and student session
17:30-18:00	short break and student session	short break and student session		short break and student session
18:00-18:30
18:30-19:00

Student Sessions

For each presentation in the student session there is a slot of 15 minutes. The talks should be planned for 12 minutes to leave time for short questions. The schedule for the student sessions is as follows:

Monday

17:30-17:40 Short Break

17:40-18:40 4 Talks

1. Durica Nikolic: Constraint-based Static Analyses for Java Bytecode Programs
2. Benedikt Nordhoff: Tree-Regular Analysis of Parallel Programs with Dynamic Thread Creation and Locks
3. Artem Khyzha: Compositional reasoning about concurrent libraries on the axiomatic TSO memory model
4. Jose A. Lopes: Hybrid type systems

Tuesday

17:30-17:40 Short Break

17:40-18:55 5 Talks

1. Amit Kumar Dhar: Model Checking Flat Counter Systems
2. Ahmet Kara: Model Checking Concurrent Systems with Unboundedly Many Processes Using Data Logics
3. Aiswarya Cyriac: Model Checking Dynamic Distributed Systems
4. Mathieu Caralp: Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness
5. Giuseppe Perelli: Recent Results and Future Directions in Strategy Logic

Wednesday

17:00-17:10 Short Break

17:10-18:55 7 Talks

1. Srinivas Pinisetty: Runtime Enforcement of Timed Properties
2. Sylvain Cotard: Runtime Verification for Real-Time Automotive Embedded Software
3. Aleksandra Jovanovic: Implementation of Real-Time Systems: Theory and Practice
4. Benjamin Monmege: A Probabilistic Kleene Theorem
5. Paulin Fournier: Parameterized verification of networks with many identical probabilistic processes
6. Shashank Pathak: Formal Verification of Agents Learning by Reinforcement
7. Laure Millet: Formal Verification of Mobile Robot Protocols

Thursday

17:30-17:40 Short Break

17:40-18:55 5 Talks

1. Florent Avellaneda: Checking Two Structural Properties of Vector Addition Systems with States
2. César Rodriguez: Construction and Verification of Unfoldings for Petri Nets with Read Arcs
3. Jan-Thierry Wegener: On Minimality and Equivalence of Petri Nets
4. Stanislav Bohm: Kaira: HPC and Petri nets
5. Maxime Folschette: Inferring Biological Regulatory Networks from Process Hitting models