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 × Brazil
1 × Italy
1 × Poland
1 × Portugal
1 × Serbia
1 × United Kingdom
2 × Austria
2 × Canada
2 × France
2 × Japan
2 × The Netherlands
2 × USA
3 × Germany
3 × Spain
Collaborated with:
∅ A.Geser J.Endrullis J.Waldmann A.Middeldorp M.C.F.Ferreira D.Hofbauer H.J.S.Bruggink B.König D.Sabel V.v.Oostrom M.Raffelsieper C.Marché A.Koprowski J.v.d.Pol J.Giesl E.Ohlebusch T.Arts H.R.Walters H.Geuvers H.Ohsaki D.Nolte
Talks about:
termin (19) rewrit (18) sup (8) prove (6) term (6) system (5) automata (4) transform (3) undecid (3) infinit (3)

Person: Hans Zantema

DBLP DBLP: Zantema:Hans

Contributed to:

ICGT 20152015
RTA 20152015
RTA-TLCA 20142014
RTA 20122012
RTA 20112011
LATA 20102010
RTA 20102010
CSL 20092009
RTA 20092009
RTA 20082008
RTA 20072007
IJCAR 20062006
RTA 20052005
CIAA 20042004
CIAA 20042005
RTA 20042004
RTA 20032003
RTA 19971997
CADE 19961996
CSL 19961996
LOPSTR 19951995
RTA 19951995
ALP 19941994
CADE 19941994
RTA 19931993
TAPSOFT CAAP/FASE 19971997

Wrote 31 papers:

ICGT-2015-Bruggink0NZ #graph #graph transformation #proving #termination #using
Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings (HJSB, BK, DN, HZ), pp. 52–68.
RTA-2015-EndrullisZ #automaton #finite #proving
Proving non-termination by finite automata (JE, HZ), pp. 160–176.
RTA-2015-SabelZ #string
Transforming Cycle Rewriting into String Rewriting (DS, HZ), pp. 285–300.
RTA-TLCA-2014-ZantemaKB #termination
Termination of Cycle Rewriting (HZ, BK, HJSB), pp. 476–490.
RTA-2012-OostromZ
Triangulation in Rewriting (VvO, HZ), pp. 240–255.
RTA-2011-ZantemaE #automation #proving #similarity
Proving Equality of Streams Automatically (HZ, JE), pp. 393–408.
LATA-2010-Zantema #complexity
Complexity of Guided Insertion-Deletion in RNA-Editing (HZ), pp. 608–619.
RTA-2010-ZantemaR #data type #infinity #proving
Proving Productivity in Infinite Data Structures (HZ, MR), pp. 401–416.
CSL-2009-EndrullisGZ #term rewriting
Degrees of Undecidability in Term Rewriting (JE, HG, HZ), pp. 255–270.
RTA-2009-Zantema #termination
Well-Definedness of Streams by Termination (HZ), pp. 164–178.
RTA-2008-Zantema #infinity #normalisation
Normalization of Infinite Terms (HZ), pp. 441–455.
RTA-2007-MarcheZ #contest #termination
The Termination Competition (CM, HZ), pp. 303–313.
RTA-2007-ZantemaW #termination
Termination by Quasi-periodic Interpretations (HZ, JW), pp. 404–418.
IJCAR-2006-EndrullisWZ #matrix #proving #term rewriting #termination
Matrix Interpretations for Proving Termination of Term Rewriting (JE, JW, HZ), pp. 574–588.
IJCAR-2006-KoprowskiZ #automation #infinity #order #recursion #term rewriting
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems (AK, HZ), pp. 332–346.
RTA-2005-GeserHWZ #automaton #linear #on the #term rewriting #termination
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems (AG, DH, JW, HZ), pp. 353–367.
RTA-2005-PolZ
Generalized Innermost Rewriting (JvdP, HZ), pp. 2–16.
CIAA-2004-GeserHWZ #automaton #finite #string #termination
Finding Finite Automata That Certify Termination of String Rewriting (AG, DH, JW, HZ), pp. 134–145.
CIAA-J-2004-GeserHWZ05 #automaton #finite #string #term rewriting #termination
Finding finite automata that certify termination of string rewriting systems (AG, DH, JW, HZ), pp. 471–486.
RTA-2004-Zantema #automation #named #termination
TORPA: Termination of Rewriting Proved Automatically (HZ), pp. 95–104.
RTA-2003-GieslZ #liveness
Liveness in Rewriting (JG, HZ), pp. 321–336.
RTA-1997-Zantema #termination
Termination of Context-Sensitive Rewriting (HZ), pp. 172–186.
CADE-1996-MiddeldorpOZ #self #termination
Transforming Termination by Self-Labelling (AM, HO, HZ), pp. 373–387.
CSL-1996-GeserMOZ #term rewriting
Relative Undecidability in Term Rewriting (AG, AM, EO, HZ), pp. 150–166.
LOPSTR-1995-ArtsZ #logic programming #semantics #source code #termination #unification #using
Termination of Logic Programs Using Semantic Unification (TA, HZ), pp. 219–233.
RTA-1995-WaltersZ #integer #term rewriting
Rewrite Systems for Integer Arithmetic (HRW, HZ), pp. 324–338.
RTA-1995-ZantemaG #termination
A Complete Characterization of Termination of Op 1q -> 1r Os (HZ, AG), pp. 41–55.
ALP-1994-FerreiraZ #analysis #termination
Syntactical Analysis of Total Termination (MCFF, HZ), pp. 204–222.
CADE-1994-MiddeldorpZ #revisited #termination
Simple Termination Revisited (AM, HZ), pp. 451–465.
RTA-1993-FerreiraZ #term rewriting #termination
Total Termination of Term Rewriting (MCFF, HZ), pp. 213–227.
TAPSOFT-1997-GeserMOZ #termination
Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules (AG, AM, EO, HZ), pp. 237–248.
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.