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 × Brazil
1 × France
1 × Germany
1 × Portugal
1 × Serbia
1 × The Netherlands
2 × Poland
3 × United Kingdom
Collaborated with:
A.Middeldorp M.Korp J.Nagele B.Felgenhauer T.Sternagel S.Winkler F.Neurauter C.Fuhs J.Giesl P.Schneider-Kamp R.Thiemann C.Sternagel T.Aoto N.Hirokawa N.Nishida
Talks about:
termin (4) confluenc (3) interpret (2) polynomi (2) diagram (2) decreas (2) complex (2) analysi (2) label (2) tool (2)

Person: Harald Zankl

DBLP DBLP: Zankl:Harald

Contributed to:

CADE 20152015
RTA 20152015
RTA 20132013
IJCAR 20122012
CADE 20112011
RTA 20112011
IJCAR 20102010
RTA 20102010
RTA 20092009
RTA 20082008
RTA 20072007
SAT 20072007

Wrote 13 papers:

CADE-2015-AotoHN0Z #confluence #contest
Confluence Competition 2015 (TA, NH, JN, NN, HZ), pp. 101–104.
Certified Rule Labeling (JN, HZ), pp. 269–284.
RTA-2013-WinklerZM #automation #proving #sequence #termination
Beyond Peano Arithmetic — Automatically Proving Termination of the Goodstein Sequence (SW, HZ, AM), pp. 335–351.
RTA-2013-Zankl #confluence #diagrams
Confluence by Decreasing Diagrams — Formalized (HZ), pp. 352–367.
IJCAR-2012-SternagelZ #named #visualisation
KBCV — Knuth-Bendix Completion Visualizer (TS, HZ), pp. 530–536.
CADE-2011-ZanklFM #confluence #named
CSI — A Confluence Tool (HZ, BF, AM), pp. 499–505.
RTA-2011-ZanklFM #diagrams
Labelings for Decreasing Diagrams (HZ, BF, AM), pp. 377–392.
IJCAR-2010-NeurauterMZ #polynomial
Monotonicity Criteria for Polynomial Interpretations over the Naturals (FN, AM, HZ), pp. 502–517.
RTA-2010-ZanklK #analysis #complexity #composition
Modular Complexity Analysis via Relative Complexity (HZ, MK), pp. 385–400.
RTA-2009-KorpSZM #termination
Tyrolean Termination Tool 2 (MK, CS, HZ, AM), pp. 295–304.
RTA-2008-FuhsGMSTZ #termination
Maximal Termination (CF, JG, AM, PSK, RT, HZ), pp. 110–125.
RTA-2007-ZanklM #constraints
Satisfying KBO Constraints (HZ, AM), pp. 389–403.
SAT-2007-FuhsGMSTZ #analysis #polynomial #satisfiability #termination
SAT Solving for Termination Analysis with Polynomial Interpretations (CF, JG, AM, PSK, RT, HZ), pp. 340–354.

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.