LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
sav07_lecture_17 [2007/05/14 17:30]
vkuncak
sav07_lecture_17 [2007/05/16 00:12]
vkuncak
Line 1: Line 1:
 ====== Lecture 17 ====== ====== Lecture 17 ======
 +
 +A sequel to [[SAV07 Lecture 16]] and [[SAV07 Lecture 15]].
  
 Preliminary reading: Preliminary reading:
   * [[http://​www.grappa.univ-lille3.fr/​tata/​|Tree Automata Techniques and Applications (Tata book)]], pages 13-20   * [[http://​www.grappa.univ-lille3.fr/​tata/​|Tree Automata Techniques and Applications (Tata book)]], pages 13-20
   * [[http://​www.brics.dk/​mona/​papers/​implementation-secrets/​journal.pdf]]   * [[http://​www.brics.dk/​mona/​papers/​implementation-secrets/​journal.pdf]]
-  * [[http://​wam.inrialpes.fr/​people/​geneves/​geneves-pldi07.pdf|Efficient Static Analysis of XML Paths and Types]] 
  
-(A sequel ​to [[SAV07 Lecture 16]].)+Topics ​to cover:
  
   * [[Using automata to decide MSOL over finite strings]]   * [[Using automata to decide MSOL over finite strings]]
Line 14: Line 15:
  
   * [[Encoding lists using MSOL over strings]]   * [[Encoding lists using MSOL over strings]]
-  * Tree automata +  * [[Tree automata]]
-  * Field constraint analysis+
  
 MSOL: MSOL:
Line 28: Line 28:
 More More
   * [[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   * [[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
- +  * [[http://​wam.inrialpes.fr/​people/​geneves/​geneves-pldi07.pdf|Efficient Static Analysis of XML Paths and Types]]