BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Finland
1 × Germany
1 × Iceland
1 × Israel
1 × New Zealand
1 × Spain
2 × France
2 × Italy
2 × United Kingdom
4 × USA
Collaborated with:
J.Vuillemin I.Durand C.Delhommé G.Sénizergues G.Berry J.Engelfriet G.Rozenberg G.Kahn S.Arnborg A.Proskurowski D.Seese
Talks about:
graph (17) order (10) second (9) monad (9) logic (9) structur (4) properti (4) set (4) decomposit (3) languag (3)

Person: Bruno Courcelle

DBLP DBLP: Courcelle:Bruno

Contributed to:

CIAA 20112011
LATA 20092009
ICALP (1) 20082008
CSL 20052005
DLT 20042004
FoSSaCS 20022002
RTA 19991999
Handbook of Graph Grammars 19971997
TAGT 19941994
GG 19901990
LICS 19901990
ICALP 19891989
GG 19861986
ICALP 19811981
ICALP 19771977
ICALP 19761976
ICALP 19741974
STOC 19741974

Wrote 23 papers:

CIAA-2011-CourcelleD
Fly-Automata, Their Properties and Applications (BC, ID), pp. 264–272.
LATA-2009-Courcelle #algorithm #graph #higher-order #logic #monad
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications (BC), pp. 19–22.
ICALP-A-2008-Courcelle #aspect-oriented #graph #higher-order #logic #monad
Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects (BC), pp. 1–13.
CSL-2005-CourcelleD #composition #graph #higher-order #logic #monad
The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic (BC, CD), pp. 325–338.
DLT-2004-Courcelle #graph #overview #relational #set
Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey (BC), pp. 1–11.
FoSSaCS-2002-Courcelle #higher-order #monad #semantics
Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations (BC), pp. 1–4.
RTA-1999-Courcelle #graph #logic
Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas (BC), pp. 90–91.
GG-Handbook-Vol1-Courcelle #graph transformation #higher-order #logic #monad
The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic (BC), pp. 313–400.
TAGT-1994-Courcelle #composition #graph #higher-order #logic #monad
The Definition in Monadic Second-Order Logic of Modular Decompositions of Ordered Graphs (BC), pp. 487–501.
TAGT-1994-CourcelleS #graph #set
The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed (BC, GS), pp. 351–367.
GG-1990-ArnborgCPS #algebra #graph #reduction
An Algebraic Theory of Graph Reduction (SA, BC, AP, DS), pp. 70–83.
GG-1990-Courcelle #graph #logic
The Logical Exprssion of Graph Properties (BC), pp. 38–40.
GG-1990-Courcelle90a #algebra #approach #graph #logic #relational
Graphs as Relational Structures: An Algebraic an Logical Approach (BC), pp. 238–252.
GG-1990-CourcelleER #graph grammar
Context-free Handle-rewriting Hypergraph Grammars (BC, JE, GR), pp. 253–268.
LICS-1990-Courcelle #graph #higher-order #monad #on the #set
On the Expression of Monadic Second-Order Graph Properties Without Quantifications Over Sets of Edges (BC), pp. 190–196.
ICALP-1989-Courcelle #equation #graph #higher-order #logic #monad
The Definability of Equational Graphs in Monadic Second-Order Logic (BC), pp. 207–221.
GG-1986-Courcelle #algebra #graph #graph grammar #representation #term rewriting
A representation of graphs by algebraic expressions and its use for graph rewriting systems (BC), pp. 112–132.
GG-1986-Courcelle86a #graph #higher-order #monad #on the #set
On context-free sets of graphs and their monadic second-order theory (BC), pp. 133–146.
ICALP-1981-Courcelle #algorithm #approach #axiom
An Axiomatic Approach to the Korenjak-Hopcroft Algorithms (BC), pp. 393–407.
ICALP-1977-Courcelle #on the
On the Definition of Classes of Interpretations (BC), pp. 554–569.
ICALP-1976-BerryC #canonical #equivalence
Program Equivalence and Canonical Forms in Stable Discrete Interpretations (GB, BC), pp. 168–188.
ICALP-1974-CourcelleKV #equation #equivalence #french #recursion #reduction
Algorithmes d’equivalence et de reduction a des expressions minimales dans une classe d’equations recursives simples (BC, GK, JV), pp. 200–213.
STOC-1974-CourcelleV #axiom #recursion #semantics
Semantics and Axiomatics of a Simple Recursive Language (BC, JV), pp. 13–26.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.