Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
sav08:lecture23 [2008/05/15 14:07] vkuncak |
sav08:lecture23 [2008/09/17 23:01] vkuncak |
||
|---|---|---|---|
| Line 13: | Line 13: | ||
| [[:Tree automata]] | [[:Tree automata]] | ||
| - | Verification of trees: http://lara.epfl.ch/~kuncak/jahob/ds/BinarySearchTree/BinarySearchTree.java | + | Verification of trees: http://lara.epfl.ch/~kuncak/jahob/ds/BinarySearchTree/ |
| ===== Additional material ===== | ===== Additional material ===== | ||
| + | |||
| + | * {{sav08:thomas97languagesautomatalogic.pdf|Languages, Automata, and Logic, by Wolfgang Thomas}} | ||
| Verification of linked structures using automata or MSOL: | Verification of linked structures using automata or MSOL: | ||
| Line 25: | Line 27: | ||
| * [[http://www.brics.dk/mona/|The MONA Project]] | * [[http://www.brics.dk/mona/|The MONA Project]] | ||
| * [[http://www.irisa.fr/lande/genet/timbuk/|Timbook for Reachability Analysis and Tree Automata Calculations]] | * [[http://www.irisa.fr/lande/genet/timbuk/|Timbook for Reachability Analysis and Tree Automata Calculations]] | ||
| + | |||
| + | * {{sav08:rabin69s2s.pdf|Decidability of Second-Order Theories and Automata on Infinite Trees}} | ||
| Last year: | Last year: | ||