Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Last revision Both sides next revision | ||
sav07_lecture_16 [2007/05/10 13:02] vkuncak |
sav07_lecture_16 [2007/05/10 18:38] vkuncak |
||
---|---|---|---|
Line 10: | Line 10: | ||
* [[Using automata to decide Presburger arithmetic]] | * [[Using automata to decide Presburger arithmetic]] | ||
* [[MSOL over strings]] | * [[MSOL over strings]] | ||
+ | |||
* [[Using automata to decide MSOL over finite strings]] | * [[Using automata to decide MSOL over finite strings]] | ||
* [[Regular expressions for automata with parallel inputs]] | * [[Regular expressions for automata with parallel inputs]] | ||
Line 16: | Line 17: | ||
* [[Encoding lists using MSOL over strings]] | * [[Encoding lists using MSOL over strings]] | ||
+ | * Tree automata | ||
+ | * Field constraint analysis | ||
Automata and languages: | Automata and languages: | ||
Line 22: | Line 25: | ||
MSOL: | MSOL: | ||
- | * [[http://www.grappa.univ-lille3.fr/tata/|Tree Automata Techniques and Applications (Tata book)]] | ||
* [[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]] | ||
- | |||
- | Verification of linked structures using automata or MSOL: | ||
- | * [[http://lara.epfl.ch/~kuncak/papers/WiesETAL06FieldConstraintAnalysis.html|Field constraint analysis]] | ||
- | * [[http://www.brics.dk/PALE|Pointer Assertion Logic Engine]] | ||
More | More |