Difference between revisions of "Lat21"
Radu iosif (Talk | contribs) |
Radu iosif (Talk | contribs) |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 35: | Line 35: | ||
* April 14: [http://nts.imag.fr/images/b/bb/Lecture7.pdf slides] [https://veri-bbb.imag.fr/playback/presentation/2.0/playback.html?meetingId=5f07ea99b4367d97904b14147bb9178d7fd90fd8-1618400923673 video] | * April 14: [http://nts.imag.fr/images/b/bb/Lecture7.pdf slides] [https://veri-bbb.imag.fr/playback/presentation/2.0/playback.html?meetingId=5f07ea99b4367d97904b14147bb9178d7fd90fd8-1618400923673 video] | ||
| − | * | + | * May 5: [http://nts.imag.fr/images/c/c0/Lecture8.pdf slides] [https://veri-bbb.imag.fr/playback/presentation/2.0/playback.html?meetingId=5f07ea99b4367d97904b14147bb9178d7fd90fd8-1620213733308 video] |
'''Additional material''' | '''Additional material''' | ||
| Line 59: | Line 59: | ||
* D. Perrin and J.E. Pin. Infinite Words. ISBN 0-12-532111-2 | * D. Perrin and J.E. Pin. Infinite Words. ISBN 0-12-532111-2 | ||
* H. Comon, M. Dauchet, R. Gilleron, C. Loeding, F. Jacquemard, D. Lugiez, S. Tison and M. Tommasi. [http://tata.gforge.inria.fr/ Tree Automata: Theory and Applications] | * H. Comon, M. Dauchet, R. Gilleron, C. Loeding, F. Jacquemard, D. Lugiez, S. Tison and M. Tommasi. [http://tata.gforge.inria.fr/ Tree Automata: Theory and Applications] | ||
| + | * F. Gécseg and M. Steinby. [https://www.researchgate.net/publication/220688732_Tree_Automata Tree Automata] | ||
[[Lat|Past LAT courses]] | [[Lat|Past LAT courses]] | ||
Latest revision as of 10:18, 31 March 2022
Logic and Automata Theory
Lecturer: Radu Iosif
Objectives: Many major hardware (Intel, IBM) and software (Microsoft) companies are now using the technique of Model Checking in practice. Examples of its use include the verification of VLSI circuits, communication protocols, software device drivers, real-time embedded systems, and security algorithms. Model checking and verification of computer systems are grounded in the seminal works of A. Pnueli, E. Clarke, E.A Emerson and J. Sifakis, which have been awarded the 1996 and 2007 Turing awards. The basis of these works is the relation of logic with automata theory, which was introduced by Büchi (1960) and Rabin (1969). The goal of this course is to introduce the student to these techniques, focusing on decision methods for classical non-interpreted logics and integer arithmetic theories.
Syllabus:
- Classical first- and second-order logic, finite word and tree automata, closure properties and language emptiness.
- Relationship between Weak Monadic Second-Order Logic and finite automata.
- Infinite automata on words (Buechi, Muller) and on trees (Rabin) automata, and their relationship with Monadic Second-Order Logic.
- Game theory. Proof of Rabin's Complementation Theorem. Application of game theory to logic.
Prerequisites: basic notions of boolean logic and discrete mathematics (sets, relations, orders, functions)
Level: PhD and Master 1-2
Schedule: Wednesdays between 14h00 and 17h00, from March 3rd to April 21st
Location: https://veri-bbb.imag.fr/b/rad-jbd-yvz-lwk (BigBlueButton virtual meeting). Here are some guidelines for online participation.
Course material
Additional material
- Equivalence of first-order and star-free languages: First-order definable languages by Volker Diekert and Paul Gastin, pp 1--10
- Equivalence of star-free and aperiodic languages aka Schutzenberger's theorem: slides
- Textbook proof of McNaughton Theorem
- Proof of Buechi Complementation Theorem using Ramseyan factorizations
- M. Vardi. From Philosophical to Industrial Logics slides
- M. Vardi and P. Wolper. Reasoning about Infinite Computations
- Talks by M. Vardi: And Logic Begat Computer Science: When Giants Roamed the Earth, The Rise and Fall of Linear Temporal Logic
- A. Doxiadis and C. Papadimitriou. Logicomix. ISBN 9780747597209
- Integer arithmetic: definability and recognizability
Software
Bibliography
- B. Khoussainov and A. Nerode. Automata Theory and its Applications. ISBN 0-8176-4207-2
- D. Perrin and J.E. Pin. Infinite Words. ISBN 0-12-532111-2
- H. Comon, M. Dauchet, R. Gilleron, C. Loeding, F. Jacquemard, D. Lugiez, S. Tison and M. Tommasi. Tree Automata: Theory and Applications
- F. Gécseg and M. Steinby. Tree Automata
