Vorlesungsankündigung
(Sommersemester 2004) Montags 15-17 Uhr in 02.07.014
Tree automata:
Theory and applications in compiler construction,
verification and document processing
Inhalt der Veranstaltung
Tree automata are an important tool in computer science. The
purpose of this course is to look at various notions of finite automata
on tree-like structures, their theory and applications in various areas
of computer science. These include automata on finite and infinite words
and trees, and their connection to various logics. Automata on infinite
words and trees are the basis of model-checking for formally verifying
correctness of systems. Recent extensions of tree automata, which
work on trees modulo equational theories, have been used in automatic
verification of cryptographic protocols.
In the area of compiler construction we will see how tree automata related
techniques help in compile time program analysis, to obtain information
about the run-time behavior of programs, as well as in generating efficient
code selectors.
We will also look at tree transducers, which are tree automata
with output, and which are used for processing of XML documents.
Termine in München:
Vorlesung: Montag 15:00-17:00 Uhr, 02.07.014
Übung:
Dienstag 16-17 Uhr, 02.07.014