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 × Canada
1 × Denmark
1 × France
1 × Hungary
1 × Poland
1 × The Netherlands
2 × Austria
2 × Germany
2 × Japan
2 × USA
2 × United Kingdom
Collaborated with:
∅ D.Hofbauer H.Zantema A.Geser J.Endrullis A.Koprowski G.Niemann J.Giesl R.C.d.Vrijer A.Bau M.Lohrey E.Nöth F.Mesnard A.Rubio R.Thiemann M.Codish Y.Fekete C.Fuhs
Talks about:
termin (11) rewrit (9) interpret (5) string (5) system (4) matrix (4) that (4) automata (3) certifi (3) term (3)

Person: Johannes Waldmann

DBLP DBLP: Waldmann:Johannes

Contributed to:

CADE 20152015
RTA 20152015
RTA 20132013
SMT 20122012
RTA 20102010
RTA 20092009
RTA 20082008
RTA 20072007
IJCAR 20062006
RTA 20062006
RTA 20052005
CIAA 20042004
CIAA 20042005
RTA 20042004
DLT 20032003
RTA 20022002
DLT 20012001
RTA 19981998

Wrote 19 papers:

CADE-2015-GieslMRTW #contest #termination
Termination Competition (termCOMP 2015) (JG, FM, AR, RT, JW), pp. 105–108.
RTA-2015-Waldmann #matrix
Matrix Interpretations on Polyhedral Domains (JW), pp. 318–333.
RTA-2013-BauLNW #analysis #term rewriting #termination
Compression of Rewriting Systems for Termination Analysis (AB, ML, EN, JW), pp. 97–112.
SMT-2012-CodishFFGW #constraints
Exotic Semi-Ring Constraints (MC, YF, CF, JG, JW), pp. 88–97.
RTA-2010-Waldmann #bound #matrix
Polynomially Bounded Matrix Interpretations (JW), pp. 357–372.
RTA-2009-EndrullisVW #termination
Local Termination (JE, RCdV, JW), pp. 270–284.
RTA-2009-Waldmann #automation #termination
Automatic Termination (JW), pp. 1–16.
RTA-2008-KoprowskiW #termination
Arctic Termination ...Below Zero (AK, JW), pp. 202–216.
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.
RTA-2006-HofbauerW #matrix #string #termination
Termination of String Rewriting with Matrix Interpretations (DH, JW), pp. 328–342.
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.
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-Waldmann #bound #named #string
Matchbox: A Tool for Match-Bounded String Rewriting (JW), pp. 85–94.
DLT-2003-HofbauerW #string #term rewriting
Deleting String Rewriting Systems Preserve Regularity (DH, JW), pp. 337–348.
RTA-2002-Waldmann #game studies
Rewrite Games (JW), pp. 144–158.
DLT-2001-NiemannW01a #regular expression
Some Regular Languages That Are Church-Rosser Congruential (GN, JW), pp. 330–339.
RTA-1998-Waldmann #decidability #normalisation
Normalization of S-Terms is Decidable (JW), pp. 138–150.
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.