Automata and Logics for Concurrent Systems: Realizability and Verification Habilitation Thesis Mémoire d’Habilitation à Diriger des Recherches submitted by

Source URL: www.lsv.ens-cachan.fr

• Computer science
• Finite-state machine
• Model checking
• Formal verification
• Nested word
• Formal methods
• Automata-based programming
• Automata theory
• Theoretical computer science
• Applied mathematics

Fédération Française de Go B.P. 95 – 75262 PARIS Cedex 06 site FFG : http://ffg.JeuDeGo.org Compte-rendu du Conseil d’Administration du 11décembre 2010 à Cachan

Source URL: ffg.jeudego.org

Conferences attended by SESAME partners AFPS Cachan (France) Juillet 2003 Anne-Marie Duval & al.

Source URL: sesame.geopsy.org

´ ´rieure de Cachan Ecole Normale Supe ´cification et Ve ´rification

Source URL: www.lsv.ens-cachan.fr

Towards an Efficient Contextual Unfolder Stefan Schwoon LSV, ENS Cachan & CNRS, INRIA ACTS III, Chennai, Opening remarks

Source URL: www.cmi.ac.in

Full Abstraction for PCF with Choice Full Abstraction for Non-Deterministic and Probabilistic Extensions of PCF Jean Goubault-Larrecq

Source URL: www.lsv.ens-cachan.fr

Noetherian Spaces vi Contents

Source URL: www.lsv.ens-cachan.fr

06-Dec-2010 Cachan, France Reasoning on words and trees with data On decidable automata on data words and data trees in relation to satisfiability of LTL and XPath.

Source URL: www.lsv.ens-cachan.fr

A Short Proof of the Schr¨ oder-Simpson Theorem A Short Proof of the Schr¨oder-Simpson Theorem Jean Goubault-Larrecq

Source URL: www.lsv.ens-cachan.fr

Unfoldings for Contetxtual Petri Nets Paolo Baldan (Padova), Andrea Corradini (Pisa), ¨ Barbara Konig (Duisburg-Essen), Stefan Schwoon (Cachan),

Source URL: www.cmi.ac.in