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 × Brazil
1 × Croatia
1 × Estonia
1 × France
1 × Germany
1 × Greece
1 × Hungary
1 × Ireland
1 × Italy
2 × Austria
2 × Japan
2 × United Kingdom
6 × USA
Collaborated with:
A.Tiwari C.Creus R.Nieuwenhuis A.Gascón S.Tison E.Huntingford M.Bofill F.Jacquemard M.Schmidt-Schauß A.Rubio L.Ramos P.Fernández S.Maneth M.Fernández O.Giménez C.Àlvarez F.Massanes L.Barguñó C.Vacher
Talks about:
rewrit (8) system (5) right (5) shallow (4) problem (4) normal (4) decid (4) tree (4) term (4) constraint (3)

Person: Guillem Godoy

DBLP DBLP: Godoy:Guillem

Contributed to:

RTA-TLCA 20142014
SAT 20142014
LICS 20122012
RTA 20122012
LICS 20102010
STOC 20102010
LICS 20092009
RTA 20092009
SAS 20092009
FoSSaCS 20082008
LICS 20082008
CADE 20072007
RTA 20072007
CADE 20052005
CSL 20052005
RTA 20052005
IJCAR 20042004
ICALP 20012001
LICS 20012001
LICS 20002000
LICS 19991999

Wrote 24 papers:

RTA-TLCA-2014-CreusG #automation #context-free grammar #evaluation
Automatic Evaluation of Context-Free Grammars (CC, GG), pp. 139–148.
RTA-TLCA-2014-CreusG14a #automaton #constraints
Tree Automata with Height Constraints between Brothers (CC, GG), pp. 149–163.
SAT-2014-CreusFG #automation #evaluation #problem #reduction
Automatic Evaluation of Reductions between NP-Complete Problems (CC, PF, GG), pp. 415–421.
LICS-2012-CreusGGR #problem
The HOM Problem is EXPTIME-Complete (CC, AG, GG, LR), pp. 255–264.
RTA-2012-CreusGG #unification
One-context Unification with STG-Compressed Terms is in NP (CC, AG, GG), pp. 149–164.
LICS-2010-BargunoCGJV #automaton #constraints #problem
The Emptiness Problem for Tree Automata with Global Constraints (LB, CC, GG, FJ, CV), pp. 263–272.
STOC-2010-GodoyGRA #decidability #problem
The HOM problem is decidable (GG, OG, LR, ), pp. 485–494.
LICS-2009-CreusGMT #normalisation #term rewriting
Non-linear Rewrite Closure and Weak Normalization (CC, GG, FM, AT), pp. 365–374.
RTA-2009-GasconGS #unification
Unification with Singleton Tree Grammars (AG, GG, MSS), pp. 365–379.
RTA-2009-GodoyJ #normalisation
Unique Normalization for Shallow TRS (GG, FJ), pp. 63–77.
SAS-2009-GodoyT #invariant #source code
Invariant Checking for Programs with Procedure Calls (GG, AT), pp. 326–342.
FoSSaCS-2008-GodoyMT #decidability #morphism
Classes of Tree Homomorphisms with Decidable Preservation of Regularity (GG, SM, ST), pp. 127–141.
Context Matching for Compressed Terms (AG, GG, MSS), pp. 93–102.
CADE-2007-GodoyT #normalisation #on the #term rewriting
On the Normalization and Unique Normalization Properties of Term Rewrite Systems (GG, ST), pp. 247–262.
RTA-2007-GodoyH #decidability #term rewriting
Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems (GG, EH), pp. 184–199.
RTA-2007-GodoyHT #termination
Termination of Rewriting with Right-Flat Rules (GG, EH, AT), pp. 200–213.
CADE-2005-GodoyT #linear #term rewriting #termination
Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules (GG, AT), pp. 164–176.
CSL-2005-GodoyT #confluence #linear #term rewriting
Confluence of Shallow Right-Linear Rewrite Systems (GG, AT), pp. 541–556.
RTA-2005-FernandezGR #order #termination
Orderings for Innermost Termination (MLF, GG, AR), pp. 17–31.
IJCAR-2004-GodoyT #term rewriting
Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure (GG, AT), pp. 91–106.
ICALP-2001-BofillG #on the
On the Completeness of Arbitrary Selection Strategies for Paramodulation (MB, GG), pp. 951–962.
LICS-2001-GodoyN #constraints #deduction #monad #on the
On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups (GG, RN), pp. 38–47.
Paramodulation with Built-in Abelian Groups (GG, RN), pp. 413–424.
LICS-1999-BofillGNR #order
Paramodulation with Non-Monotonic Orderings (MB, GG, RN, AR), pp. 225–233.

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.