Bruno Courcelle
Publications
Publications
|
|
Betweenness in order-theoretic treesJournées sur les Arithmétiques Faibles, May 2020, Fontainebleau, France |
Model-checking by infinite fly-automata5th Conference on Algebraic Informatics, Sep 2013, Porquerolles, France. pp.211-222 |
|
Infinite transducers on terms denoting graphsEuropean Lisp Symposium, Jun 2013, Madrid, Spain. pp.47-58 |
|
Fly-automata, their properties and applications16th International Conference on Implementation and Application of Automata, Jul 2011, Blois, France. pp.264-272 |
|
Automata for Monadic Second-order model checkingReachability Problems, Sep 2011, Genoa, Italy |
|
Special tree-width and the verification of monadic second-order graph pr opertiesFSTTCS 2010, Dec 2010, Chennai, India |
|
Tractable constructions of finite automata from monadic second-order formulaWorkshop on Logical Approaches to Barriers in Computing and Complexity, Feb 2010, Greifswald, Germany |
|
Verifying monadic second order graph properties with tree automata3rd European Lisp Symposium, May 2010, Lisboa, France. pp.7--21 |
|
On several proofs of the recognizability theoremCAI 2009 : Conference on Algebraic Informatics, May 2009, Thessaloniki, Greece. pp.78-80 |
|
Monadic second-order logic for graphs : algorithmic and language theoretical applicationsLanguage Automata Theory and Applications, Apr 2009, Tarragona, Spain. pp.19-22 |
|
Graph structure and monadic second-order logic : Language theoretical aspectsICALP 2008, 2008, Reykjavik, Iceland. pp.1-13 |
|
Efficient First-Order Model-Checking Using Short LabelsFrontiers in Algorithmics, Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings, Jun 2008, Changsha, China. pp.159-170, ⟨10.1007/978-3-540-69311-6_18⟩ |
|
Graph operations characterizing rank-width and balanced graph expressionsProccedings of the 33rd International Workshop on Graphs (WG07), Jun 2007, Germany. pp.66--75 |
|
|
|
Graph Operations Characterizing Rank-Width and Balanced Graph ExpressionsGraph-Theoretic Concepts in Computer Science, 2007, Dornburg, Germany. pp.66--75, ⟨10.1007/978-3-540-74839-7_7⟩ |
Compact forbidden-set routingProceedings STACS 2007, 2007, Aachen, Germany. pp.37-48 |
|
Forbidden-Set Labeling on Graphs2nd Workshop on Locality Preserving Distributed Computing Methods (LOCALITY), Portland, Etats-Unis, Aug 2007, Portland, United States |
|
Monadic second-order queries on graphs : Vertex labelling for efficient evaluation and linear delay enumerationAlgorithms and Complexity in Durham, Third Workshop, Durham, England, 2007, Durham, United Kingdom. pp.3-12 |
|
The modular decomposition of countable graphs : Constructions in monadic second-order logicComputer Science Logic, 2005, Oxford, United Kingdom. pp.325-338 |
|
|
Graph structure and monadic second-order logic. A language-theoretic approach.Cambridge University Press, pp.728, 2012, Encyclopedia of Mathematics and its applications, Vol. 138, 978-0-521-89833-1 |
|
|
Model Checking with Fly-AutomataMing-Yang Kao Encyclopedia of Algorithms, second edition., Chapitre 20, 2015, 978-3-642-27848-8. ⟨10.1007/978-3-642-27848-8_692-1⟩ |
|
|
The common structure of the curves having a same Gauss wordA. Adamatzky. Automata, Computation, Universality, Springer, pp.1-37, 2015, Automata, Computation, Universality |
Model Checking with Fly-AutomataEncyclopedia of Algorithms, 2015 |
|
Structuration des graphes et logiqueF. Bayart et E. Charpentier. Leçons de Mathématiques d'Aujourd'hui, Volume 4, Cassini, pp.167-194, 2010, Le sel et le fer |
|
Program semantics and infinite regular termsY. Bertot et al. From Semantics to Computer Science, Essays in Honour of Gilles Kahn, Cambridge University Press, pp.160-163, 2009 |
|
|
|
Quantifier-free definable graph operations preserving recognizabilityJ. Flum, E. Graedel, T. Wilke. Logic and Automata, History and perspectives, Amsterdam University Press, pp.251-260, 2008, Texts in Logic and Games |
Décompositions arborescentesJean-Claude Fournier. Graphes et applications 2, Lavoisier, pp.195-231, 2007 |
|
|
|
Algorithms for equivalence and reduction to minimal form for a class of simple recursive equationsYves Bertot; Gérard Huet; Jean-Jacques Lévy; Gordon Plotkin. From Semantics to Computer Science Essays in Honour of Gilles Kahn, Cambridge University Press 1974, From Semantics to Computer Science Essays in Honour of Gilles Kahn, 9780521518253. ⟨10.1017/CBO9780511770524.009⟩ |