Registration
This shows you the differences between two versions of the page.
|
lectures [2014/06/19 09:05] mellies |
lectures [2014/06/20 09:06] (current) mellies |
||
|---|---|---|---|
| Line 31: | Line 31: | ||
| |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]] | | |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| Synchronous Languages and their extension to mix discrete and continuous time| | + | |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]]| |
| ^Friday 20 June||| | ^Friday 20 June||| | ||
| |10h30-12h|Marc Pouzet| Synchronous Languages and their extension to mix discrete and continuous time| | |10h30-12h|Marc Pouzet| Synchronous Languages and their extension to mix discrete and continuous time| | ||
| Line 76: | Line 76: | ||
| >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-Part1.pdf|here]]. | + | > 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)**\\ | ||