Difference between revisions of "Lat"

From Numerical Transition Systems
Jump to: navigation, search
Line 34: Line 34:
 
* The Mona Project : http://www.brics.dk/mona/
 
* The Mona Project : http://www.brics.dk/mona/
 
* The Goal Project : http://goal.im.ntu.edu.tw/wiki/doku.php
 
* The Goal Project : http://goal.im.ntu.edu.tw/wiki/doku.php
* The Gastex Package for Latex : http://www.lsv.ens-cachan.fr/~gastin/gastex/gastex.html
+
* LTL2BA: http://www.lsv.ens-cachan.fr/~gastin/ltl2ba/
 
* GAVS+: An Open Platform for the Research of Algorithmic Game Solving: http://www6.in.tum.de/~chengch/gavs/
 
* GAVS+: An Open Platform for the Research of Algorithmic Game Solving: http://www6.in.tum.de/~chengch/gavs/
  

Revision as of 15:48, 23 September 2014

Logic and Automata Theory

Lecturers: Radu_Iosif and Barbara Jobstmann

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. The works of A. Pnueli, E. Clarke, E.A Emerson and J. Sifakis on algorithmic verification of systems using the Model Checking has been awarded the 1996 and 2007 Turing awards. The basis of this work is the relation of logic with automata theory, which was introduced by the seminal works of Buechi (1960) and Rabin (1969). This course is intended 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, Mueller) 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 Mu-calculus, a widely used tool for specification and verification of systems.
  • Logical theory of integer arithmetic. Decidability results using both quantifier elimination and automata theory. Cobham's base dependence theorem.

Similar or related lectures:

Bibliography

Software

ENS Lyon Course on Automata-Theoretic Model Checking

ER01 : vérification et certification du logiciel

Ecole Doctorale Grenoble

Ecole Doctorale Mathématiques, Sciences et Technologies de l'Information, Informatique

Slides for lectures on game theory (23/11/2010 and 30/11/2010)

SNSB Bucharest

Scoala Normala Superioara Bucharest (SNSB)


Outline of the first week (19/04/2010 - 24/04/2010) :

Outline of the second week (24/05/2010 - 29/05/2010) :