Differences

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

--- rome13 [2013/01/15 15:53]
vkuncak
+++ rome13 [2013/01/15 15:58]
vkuncak
@@ Line 5: / Line 5: @@
 === Sunday, 20 January 2013 ===
-<code>
+| 9:00-10:00  | (VMCAI) Invited Talk: **Leonardo de Moura - A Model-Constructing Satisfiability Calculus** |
-:00-10:00 VMCAI Invited Talk: Leonardo de Moura - A Model-Constructing Satisfiability Calculus
+^ 10:00-10:30 ^ Break ^
-:00-10:30 Break
+| 10:30-11:00 | Serdar Erbatur: Unification in Blind Signatures |
-:30-11:00 Serdar Erbatur: Unification in Blind Signatures
+| 11:00-11:30 | Corneliu Popeea: On Solving Existentially Quantified Horn Clauses (and Proving CTL Properties of Programs) |
-:00-11:30 Corneliu Popeea: On Solving Existentially Quantified Horn Clauses (and Proving CTL Properties of Programs)
+| 11:30-12:00 | Stefan Ratschan: Nelson-Oppen with a Quasi-decidable Logical Theory |
-:30-12:00 Stefan Ratschan: Nelson-Oppen with a Quasi-decidable Logical Theory
+^ 12:00-14:00 ^ Lunch ^
-:00-14:00 Lunch
+| 14:00-15:00 | (VMCAI) Invited Talk: **Eran Yahav - Abstraction-Guided Synthesis** |
-:00-15:00 VMCAI Invited Talk: Eran Yahav - Abstraction-Guided Synthesis
+| 15:00-15:30 | Eva Darulova: Certified numerical computation |
-:00-15:30 Eva Darulova: Certified numerical computation
+| 15:30-16:00 | Denis Firsov: Certified normalization of context-free grammars and CYK parsing |
-:30-16:00 Denis Firsov: Certified normalization of context-free grammars and CYK parsing
+^ 16:00-16:30 ^ Break ^
-:00-16:30 Break
+| 16:30-17:00 | Yaron Welner: Games on Graphs with Robust Quantitative Objectives: Decidability and Complexity Analysis |
-:30-17:00 Yaron Welner: Games on Graphs with Robust Quantitative Objectives:
+| 17:00-18:30 | Management Committee meeting (for COST only) |
-                          Decidability and Complexity Analysis
-:00-18:30 Management Committee meeting (for COST only)
-</code>
 === Monday, 21 January 2013 ===