Dieses Dokuwiki verwendet ein von Anymorphic Webdesign erstelltes Thema.

Differences

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

Link to this comparison view

lectures [2014/05/28 09:20]
mellies
lectures [2014/06/20 09:06] (current)
mellies
Line 27: Line 27:
 |14h00-15h00|Bruno Vallette| Théorie de la déformation des algèbres de Batalin—Vilkovisky | |14h00-15h00|Bruno Vallette| Théorie de la déformation des algèbres de Batalin—Vilkovisky |
 ^Monday 16 June||| ^Monday 16 June|||
-|11h00-12h30|Olivier Serre| Tree Automata, Logic and Verification of (Higher-Order-) Functional Programs|+|11h00-12h30|Olivier Serre| Tree Automata, Logic and Verification of (Higher-Order-) Functional Programs ​[[http://​www.pps.univ-paris-diderot.fr/​~mellies/​IHP-Serre-Mini-Course-Part1.pdf|slides of the first lecture]]|
 ^Wednesday 18 June||| ^Wednesday 18 June|||
-|11h00-12h30|Olivier Serre| Tree Automata, Logic and Verification of (Higher-Order-) Functional Programs|+|10h30-12h00|Olivier Serre| Tree Automata, Logic and Verification of (Higher-Order-) Functional Programs ​[[http://​www.pps.univ-paris-diderot.fr/​~mellies/​IHP-Serre-Mini-Course-Part2.pdf|slides of the second lecture]] ​|
 ^Thursday 19 June||| ^Thursday 19 June|||
-|10h30-12h00|Marc Pouzet| +|10h30-12h00|Marc Pouzet| ​Synchronous Languages and their extension to mix discrete and continuous time [[http://​www.pps.univ-paris-diderot.fr/​~mellies/​IHP-Pouzet-Mini-Course-Part1A.pdf|slides of the first lecture part A]][[http://​www.pps.univ-paris-diderot.fr/​~mellies/​IHP-Pouzet-Mini-Course-Part1B.pdf|slides of the first lecture part B]]|
-|14h00-15h00|Martin Hyland|+
 ^Friday 20 June||| ^Friday 20 June|||
-|10h30-12h|Marc Pouzet| +|10h30-12h|Marc Pouzet| Synchronous Languages and their extension to mix discrete and continuous time
-|14h00-15h00|Thomas Streicher|+|14h00-15h00|Thomas Streicher| A Model of Control Operators in Coherence Spaces giving rise to a New Model of Classical Set Theory ​|
 ===== Abstracts ===== ===== Abstracts =====
  
Line 76: Line 75:
  
 >Finally we will combine these two concepts, automata/​logic and higher-order recursion schemes, and argue that they can successfully be used to solve important questions related to verification of programs, in particular the model-checking problem (both local and global) as well as the synthesis problem. >Finally we will combine these two concepts, automata/​logic and higher-order recursion schemes, and argue that they can successfully be used to solve important questions related to verification of programs, in particular the model-checking problem (both local and global) as well as the synthesis problem.
 +
 +> Note: the slides of the two lectures are available [[http://​www.pps.univ-paris-diderot.fr/​~mellies/​IHP-Serre-Mini-Course-Part1.pdf|here]] and [[http://​www.pps.univ-paris-diderot.fr/​~mellies/​IHP-Serre-Mini-Course-Part2.pdf|here]].
  
 **Bruno Vallette (Université Nice Sophia Antipolis)**\\ **Bruno Vallette (Université Nice Sophia Antipolis)**\\
lectures.1401261638.txt.gz · Last modified: 2014/05/28 09:20 by mellies
Dieses Dokuwiki verwendet ein von Anymorphic Webdesign erstelltes Thema.
www.chimeric.de Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0