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 12:27] vkuncak |
sav08:lecture23 [2008/05/15 14:07] vkuncak |
||
---|---|---|---|
Line 8: | Line 8: | ||
[[:Expressing finite automata in MSOL over strings]] | [[:Expressing finite automata in MSOL over strings]] | ||
- | |||
- | [[:Expressing regular expressions in MSOL over strings]] | ||
[[:Encoding lists using MSOL over strings]] | [[:Encoding lists using MSOL over strings]] | ||
[[:Tree automata]] | [[:Tree automata]] | ||
+ | |||
+ | Verification of trees: http://lara.epfl.ch/~kuncak/jahob/ds/BinarySearchTree/ | ||
===== Additional material ===== | ===== Additional material ===== | ||
- | |||
- | Automata and languages: | ||
- | * [[http://www-math.mit.edu/~sipser/book.html|Introduction to the Theory of Computation]] | ||
- | * [[http://infolab.stanford.edu/~ullman/ialc.html|Introduction to Automata Theory, Languages, and Computation]] | ||
- | |||
- | MSOL: | ||
- | * [[http://www.brics.dk/mona/|The MONA Project]] | ||
- | |||
- | More | ||
- | * [[http://www.montefiore.ulg.ac.be/~boigelot/research/lash/|LASH Toolset]] | ||
- | * [[http://www.lsv.ens-cachan.fr/~treinen/publi/constraints.ps.gz|Constraint solving and decision problems of first-order theories of concrete domains]], by Ralf Treinen | ||
Verification of linked structures using automata or MSOL: | Verification of linked structures using automata or MSOL: |