Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
|
sav08:lecture22 [2008/05/08 11:54] vkuncak created |
sav08:lecture22 [2008/05/14 20:21] vkuncak created |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== Examples of Abstract Interpretation ====== | + | ====== Deciding Presburger Arithmetic Using Automata ====== |
| + | |||
| + | [[Logic and Automata Introduction]] | ||
| + | |||
| + | ===== Review ===== | ||
| + | |||
| + | [[:Strings and languages]] | ||
| + | |||
| + | [[:Finite state machine]] | ||
| + | |||
| + | [[:Determinization of finite state machine]] | ||
| + | |||
| + | [[:Finite state machine with epsilon transitions]] | ||
| + | |||
| + | [[:Closure properties of finite state machines]] | ||
| + | |||
| + | [[:Regular expression]] | ||
| + | |||
| + | [[:Equivalence of finite state machine and regular expression languages]] | ||
| + | |||
| + | ===== Recognizing Relations using Automata ===== | ||
| + | |||
| + | [[:Regular expressions for automata with parallel inputs]] | ||
| + | |||
| + | [[:Using automata to decide Presburger arithmetic]] | ||
| + | |||
| + | [[:MSOL over strings]] | ||
| + | |||
| + | ===== 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: | ||
| + | * [[http://lara.epfl.ch/~kuncak/papers/WiesETAL06FieldConstraintAnalysis.html|Field constraint analysis]] | ||
| + | * [[http://www.brics.dk/PALE|Pointer Assertion Logic Engine]] | ||
| + | |||
| + | 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.irisa.fr/lande/genet/timbuk/|Timbook for Reachability Analysis and Tree Automata Calculations]] | ||
| + | |||
| + | Last year: | ||
| + | * [[:sav07_lecture_15]] | ||
| + | * [[:sav07_lecture_16]] | ||
| + | * [[:sav07_lecture_17]] | ||
| - | ====== Predicate Abstraction and Blast: Guest Lecture by Prof. Dirk Beyer ====== | ||