BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Canada
1 × Denmark
1 × Greece
1 × Israel
1 × Japan
1 × Poland
1 × Spain
2 × Germany
5 × USA
Collaborated with:
Y.Jurski V.Cortier F.Jacquemard R.Nieuwenhuis A.Boudet J.Mitchell A.Rubio M.Haberstrau J.Jouannaud P.Narendran M.Rusinowitch A.Caron J.Coquidé M.Dauchet
Talks about:
order (5) constraint (4) automata (4) complet (4) algebra (4) tree (4) theori (3) rewrit (3) term (3) solv (3)

Person: Hubert Comon

DBLP DBLP: Comon:Hubert

Facilitated 2 volumes:

CAV 2001Ed
RTA 1997Ed

Contributed to:

ICALP 20012001
CSL 20002000
CAV 19981998
LICS 19981998
RTA 19981998
CSL 19971997
LICS 19971997
LICS 19951995
ICALP 19941994
ICALP 19921992
LICS 19921992
ICALP 19911991
ICALP 19901990
LICS 19901990
RTA 19891989
ALP 19881988
CADE 19861986

Wrote 19 papers:

ICALP-2001-ComonCM #automaton #constraints #memory management #protocol #set
Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols (HC, VC, JM), pp. 682–693.
Flatness Is Not a Weakness (HC, VC), pp. 262–276.
CAV-1998-ComonJ #analysis #automaton #multi #safety
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic (HC, YJ), pp. 268–279.
LICS-1998-ComonNNR #order #problem
Decision Problems in Ordered Rewriting (HC, PN, RN, MR), pp. 276–286.
RTA-1998-Comon #consistency #proving
About Proofs by Consistency (HC), pp. 136–137.
CSL-1997-ComonJ #automaton #higher-order
Higher-Order Matching and Tree Automata (HC, YJ), pp. 157–176.
Ground Reducibility is EXPTIME-Complete (HC, FJ), pp. 26–34.
LICS-1995-Comon #automaton #higher-order #logic #monad
Sequentiality, Second Order Monadic Logic and Tree Automata (HC), pp. 508–517.
LICS-1995-ComonNR #constraints #order #theorem proving
Orderings, AC-Theories and Symbolic Constraint Solving (HC, RN, AR), pp. 375–385.
ICALP-1994-CaronCCDJ #constraints
Pumping, Cleaning and Symbolic Constraints Solving (ACC, HC, JLC, MD, FJ), pp. 436–449.
ICALP-1992-Comon #constraints #term rewriting
Completion of Rewrite Systems with Membership Constraints (HC), pp. 392–403.
LICS-1992-ComonHJ #decidability #equation #problem
Decidable Problems in Shallow Equational Theories (HC, MH, JPJ), pp. 255–265.
ICALP-1991-Comon #algebra #axiom
Complete Axiomatizations of Some Quotient Term Algebras (HC), pp. 469–480.
ICALP-1990-Comon #algebra #equation #order
Equational Formulas in Order-Sorted Algebras (HC), pp. 674–688.
LICS-1990-Comon #algebra #equation
Solving Inequations in Term Algebras (HC), pp. 62–69.
RTA-1989-Comon #induction #proving #specification
Inductive Proofs by Specification Transformation (HC), pp. 76–91.
ALP-1988-Comon #algebra #effectiveness
An Effective Method for Handling Initial Algebras (HC), pp. 108–118.
CADE-1986-Comon #anti #term rewriting
Sufficient Completeness, Term Rewriting Systems and “Anti-Unification” (HC), pp. 128–140.
TAPSOFT-1993-BoudetC #formal method
About the Theory of Tree Embedding (AB, HC), pp. 376–390.

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.