@article{Giesl01,
  title = {Induction Proofs with Partial Functions},
  author = {Jürgen Giesl},
  year = {2001},
  researchr = {https://researchr.org/publication/Giesl01},
  cites = {0},
  citedby = {0},
  journal = {JAR},
  volume = {26},
  number = {1},
  pages = {1-49},
}

@article{GieslA01,
  title = {Verification of Erlang Processes by Dependency Pairs},
  author = {Jürgen Giesl and Thomas Arts},
  year = {2001},
  url = {http://link.springer.de/link/service/journals/00200/bibs/1012001/10120039.htm},
  researchr = {https://researchr.org/publication/GieslA01},
  cites = {0},
  citedby = {0},
  journal = {aaecc},
  volume = {12},
  number = {1/2},
  pages = {39-72},
}

@inproceedings{Giesl95:1,
  title = {Termination Analysis for Functional Programs using Term Orderings},
  author = {Jürgen Giesl},
  year = {1995},
  tags = {program analysis, functional programming, analysis, termination},
  researchr = {https://researchr.org/publication/Giesl95%3A1},
  cites = {0},
  citedby = {0},
  pages = {154-171},
  booktitle = {SAS},
}

@inproceedings{GieslTS05,
  title = {Proving and Disproving Termination in the Dependency Pair Framework},
  author = {Jürgen Giesl and René Thiemann and Peter Schneider-Kamp},
  year = {2005},
  url = {http://drops.dagstuhl.de/opus/volltexte/2006/509},
  tags = {termination},
  researchr = {https://researchr.org/publication/GieslTS05},
  cites = {0},
  citedby = {0},
  booktitle = {Dagstuhl},
}

@inproceedings{GieslM00,
  title = {Eliminating Dummy Elimination},
  author = {Jürgen Giesl and Aart Middeldorp},
  year = {2000},
  researchr = {https://researchr.org/publication/GieslM00},
  cites = {0},
  citedby = {0},
  pages = {309-323},
  booktitle = {cade},
}

@inproceedings{FuhsNOGLS08,
  title = {Search Techniques for Rational Polynomial Orders},
  author = {Carsten Fuhs and Rafael Navarro-Marset and Carsten Otto and Jürgen Giesl and Salvador Lucas and Peter Schneider-Kamp},
  year = {2008},
  doi = {10.1007/978-3-540-85110-3_10},
  url = {http://dx.doi.org/10.1007/978-3-540-85110-3_10},
  tags = {search},
  researchr = {https://researchr.org/publication/FuhsNOGLS08},
  cites = {0},
  citedby = {0},
  pages = {109-124},
  booktitle = {AISC},
}

@article{GieslK05a,
  title = {Preface},
  author = {Jürgen Giesl and Deepak Kapur},
  year = {2005},
  doi = {10.1007/s10817-005-9021-y},
  url = {http://dx.doi.org/10.1007/s10817-005-9021-y},
  researchr = {https://researchr.org/publication/GieslK05a},
  cites = {0},
  citedby = {0},
  journal = {JAR},
  volume = {34},
  number = {4},
  pages = {323},
}

@inproceedings{ArtsG97:0,
  title = {Proving Innermost Normalisation Automatically},
  author = {Thomas Arts and Jürgen Giesl},
  year = {1997},
  researchr = {https://researchr.org/publication/ArtsG97%3A0},
  cites = {0},
  citedby = {0},
  pages = {157-171},
  booktitle = {RTA},
}

@article{GieslL01,
  title = {Special Issue  Termination },
  author = {Jürgen Giesl and Pierre Lescanne},
  year = {2001},
  url = {http://link.springer.de/link/service/journals/00200/bibs/1012001/10120001.htm},
  tags = {termination},
  researchr = {https://researchr.org/publication/GieslL01},
  cites = {0},
  citedby = {0},
  journal = {aaecc},
  volume = {12},
  number = {1/2},
  pages = {1-2},
}

@inproceedings{GieslTSF03,
  title = {Improving Dependency Pairs},
  author = {Jürgen Giesl and René Thiemann and Peter Schneider-Kamp and Stephan Falke},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2850&spage=167},
  researchr = {https://researchr.org/publication/GieslTSF03},
  cites = {0},
  citedby = {0},
  pages = {167-182},
  booktitle = {lpar},
}

@inproceedings{ArtsG98,
  title = {Modularity of Termination Using Dependency pairs},
  author = {Thomas Arts and Jürgen Giesl},
  year = {1998},
  url = {http://link.springer.de/link/service/series/0558/bibs/1379/13790226.htm},
  tags = {termination},
  researchr = {https://researchr.org/publication/ArtsG98},
  cites = {0},
  citedby = {0},
  pages = {226-240},
  booktitle = {RTA},
}

@inproceedings{Schneider-KampFTGACMZ07,
  title = {Implementing RPO and POLO using SAT},
  author = {Peter Schneider-Kamp and Carsten Fuhs and René Thiemann and Jürgen Giesl and Elena Annov and Michael Codish and Aart Middeldorp and Harald Zankl},
  year = {2007},
  url = {http://drops.dagstuhl.de/opus/volltexte/2007/1249},
  researchr = {https://researchr.org/publication/Schneider-KampFTGACMZ07},
  cites = {0},
  citedby = {0},
  booktitle = {Dagstuhl},
}

@inproceedings{CodishFGS10,
  title = {Lazy Abstraction for Size-Change Termination},
  author = {Michael Codish and Carsten Fuhs and Jürgen Giesl and Peter Schneider-Kamp},
  year = {2010},
  doi = {10.1007/978-3-642-16242-8_16},
  url = {http://dx.doi.org/10.1007/978-3-642-16242-8_16},
  tags = {laziness, termination, abstraction},
  researchr = {https://researchr.org/publication/CodishFGS10},
  cites = {0},
  citedby = {0},
  pages = {217-232},
  booktitle = {lpar},
}

@article{GieslK06,
  title = {Third Special Issue on Techniques for Automated Termination Proofs},
  author = {Jürgen Giesl and Deepak Kapur},
  year = {2006},
  doi = {10.1007/s10817-006-9052-z},
  url = {http://dx.doi.org/10.1007/s10817-006-9052-z},
  tags = {termination},
  researchr = {https://researchr.org/publication/GieslK06},
  cites = {0},
  citedby = {0},
  journal = {JAR},
  volume = {37},
  number = {3},
  pages = {153-154},
}

@inproceedings{GieslN93,
  title = {The Semantics of Rational Contractions},
  author = {Jürgen Giesl and Ingrid Neumann},
  year = {1993},
  tags = {semantics},
  researchr = {https://researchr.org/publication/GieslN93},
  cites = {0},
  citedby = {0},
  pages = {356},
  booktitle = {epia},
}

@inproceedings{Giesl99,
  title = {Context-Moving Transformations for Function Verification},
  author = {Jürgen Giesl},
  year = {1999},
  tags = {context-aware, transformation},
  researchr = {https://researchr.org/publication/Giesl99},
  cites = {0},
  citedby = {0},
  pages = {293-312},
  booktitle = {LOPSTR},
}

@inproceedings{GieslK01:0,
  title = {Dependency Pairs for Equational Rewriting},
  author = {Jürgen Giesl and Deepak Kapur},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2051/20510093.htm},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GieslK01%3A0},
  cites = {0},
  citedby = {0},
  pages = {93-108},
  booktitle = {RTA},
}

@inproceedings{FuhsGMSTZ08,
  title = {Maximal Termination},
  author = {Carsten Fuhs and Jürgen Giesl and Aart Middeldorp and Peter Schneider-Kamp and René Thiemann and Harald Zankl},
  year = {2008},
  doi = {10.1007/978-3-540-70590-1_8},
  url = {http://dx.doi.org/10.1007/978-3-540-70590-1_8},
  tags = {termination},
  researchr = {https://researchr.org/publication/FuhsGMSTZ08},
  cites = {0},
  citedby = {0},
  pages = {110-125},
  booktitle = {RTA},
}

@inproceedings{OhsakiMG00,
  title = {Equational Termination by Semantic Labelling},
  author = {Hitoshi Ohsaki and Aart Middeldorp and Jürgen Giesl},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/1862/18620457.htm},
  tags = {termination},
  researchr = {https://researchr.org/publication/OhsakiMG00},
  cites = {0},
  citedby = {0},
  pages = {457-471},
  booktitle = {csl},
}

@inproceedings{CodishSLTG06,
  title = {SAT Solving for Argument Filterings},
  author = {Michael Codish and Peter Schneider-Kamp and Vitaly Lagoon and René Thiemann and Jürgen Giesl},
  year = {2006},
  doi = {10.1007/11916277_3},
  url = {http://dx.doi.org/10.1007/11916277_3},
  researchr = {https://researchr.org/publication/CodishSLTG06},
  cites = {0},
  citedby = {0},
  pages = {30-44},
  booktitle = {lpar},
}

@article{GKV07,
  title = {Deaccumulation techniques for improving provability},
  author = {Jürgen Giesl and Armin Kühnemann and Janis Voigtländer},
  year = {2007},
  doi = {10.1016/j.jlap.2006.11.001},
  url = {http://dx.doi.org/10.1016/j.jlap.2006.11.001},
  tags = {program verification, functional programming, systematic-approach, transformation, program transformation},
  researchr = {https://researchr.org/publication/GKV07},
  cites = {0},
  citedby = {0},
  journal = {jlp},
  volume = {71},
  number = {2},
  pages = {79-113},
}

@inproceedings{GieslZ03:0,
  title = {Liveness in Rewriting},
  author = {Jürgen Giesl and Hans Zantema},
  year = {2003},
  url = {http://link.springer.de/link/service/series/0558/bibs/2706/27060321.htm},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GieslZ03%3A0},
  cites = {0},
  citedby = {0},
  pages = {321-336},
  booktitle = {RTA},
}

@article{Schneider-KampGSST10,
  title = {Automated termination analysis for logic programs with cut},
  author = {Peter Schneider-Kamp and Jürgen Giesl and Thomas Ströder and Alexander Serebrenik and René Thiemann},
  year = {2010},
  doi = {10.1017/S1471068410000165},
  url = {http://dx.doi.org/10.1017/S1471068410000165},
  tags = {program analysis, analysis, termination, logic programming, logic},
  researchr = {https://researchr.org/publication/Schneider-KampGSST10},
  cites = {0},
  citedby = {0},
  journal = {tplp},
  volume = {10},
  number = {4-6},
  pages = {365-381},
}

@article{GieslM04,
  title = {Transformation techniques for context-sensitive rewrite systems},
  author = {Jürgen Giesl and Aart Middeldorp},
  year = {2004},
  doi = {10.1017/S0956796803004945},
  url = {http://dx.doi.org/10.1017/S0956796803004945},
  tags = {graph transformation, graph-rewriting, transformation system, context-aware, rewriting, transformation},
  researchr = {https://researchr.org/publication/GieslM04},
  cites = {0},
  citedby = {0},
  journal = {JFP},
  volume = {14},
  number = {4},
  pages = {379-427},
}

@inproceedings{AlarconEFGGLST08,
  title = {Improving Context-Sensitive Dependency Pairs},
  author = {Beatriz Alarcón and Fabian Emmes and Carsten Fuhs and Jürgen Giesl and Raúl Gutiérrez and Salvador Lucas and Peter Schneider-Kamp and René Thiemann},
  year = {2008},
  doi = {10.1007/978-3-540-89439-1_44},
  url = {http://dx.doi.org/10.1007/978-3-540-89439-1_44},
  tags = {context-aware},
  researchr = {https://researchr.org/publication/AlarconEFGGLST08},
  cites = {0},
  citedby = {0},
  pages = {636-651},
  booktitle = {lpar},
}

@article{GieslZ03,
  title = {Simulating liveness by reduction strategies},
  author = {Jürgen Giesl and Hans Zantema},
  year = {2003},
  url = {http://www1.elsevier.com/gej-ng/31/29/23/135/49/show/Products/notes/index.htt#005},
  researchr = {https://researchr.org/publication/GieslZ03},
  cites = {0},
  citedby = {0},
  journal = {ENTCS},
  volume = {86},
  number = {4},
  pages = {641-656},
}

@inproceedings{GieslM02,
  title = {Innermost Termination of Context-Sensitive Rewriting},
  author = {Jürgen Giesl and Aart Middeldorp},
  year = {2002},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2450&spage=231},
  tags = {termination, graph-rewriting, context-aware, rewriting},
  researchr = {https://researchr.org/publication/GieslM02},
  cites = {0},
  citedby = {0},
  pages = {231-244},
  booktitle = {dlt},
}

@inproceedings{NguyenGSS07,
  title = {Termination Analysis of Logic Programs Based on Dependency Graphs},
  author = {Manh Thang Nguyen and Jürgen Giesl and Peter Schneider-Kamp and Danny De Schreye},
  year = {2007},
  doi = {10.1007/978-3-540-78769-3_2},
  url = {http://dx.doi.org/10.1007/978-3-540-78769-3_2},
  tags = {rule-based, program analysis, analysis, termination, graph-rewriting, logic programming, logic, rewriting logic, rewriting},
  researchr = {https://researchr.org/publication/NguyenGSS07},
  cites = {0},
  citedby = {0},
  pages = {8-22},
  booktitle = {LOPSTR},
}

@inproceedings{BrauburgerG98,
  title = {Termination Analysis by Inductive Evaluation},
  author = {Jürgen Brauburger and Jürgen Giesl},
  year = {1998},
  url = {http://link.springer.de/link/service/series/0558/bibs/1421/14210254.htm},
  tags = {analysis, termination},
  researchr = {https://researchr.org/publication/BrauburgerG98},
  cites = {0},
  citedby = {0},
  pages = {254-269},
  booktitle = {cade},
}

@article{BrauburgerG99,
  title = {Approximating the Domains of Functional and Imperative Programs},
  author = {Jürgen Brauburger and Jürgen Giesl},
  year = {1999},
  tags = {functional programming},
  researchr = {https://researchr.org/publication/BrauburgerG99},
  cites = {0},
  citedby = {0},
  journal = {SCP},
  volume = {35},
  number = {2},
  pages = {113-136},
}

@inproceedings{GieslK03,
  title = {Deciding Inductive Validity of Equations},
  author = {Jürgen Giesl and Deepak Kapur},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2741&spage=17},
  researchr = {https://researchr.org/publication/GieslK03},
  cites = {0},
  citedby = {0},
  pages = {17-31},
  booktitle = {cade},
}

@article{Giesl97,
  title = {Termination of Nested and Mutually Recursive Algorithms},
  author = {Jürgen Giesl},
  year = {1997},
  tags = {termination},
  researchr = {https://researchr.org/publication/Giesl97},
  cites = {0},
  citedby = {0},
  journal = {JAR},
  volume = {19},
  number = {1},
  pages = {1-29},
}

@article{GieslK05,
  title = {Preface},
  author = {Jürgen Giesl and Deepak Kapur},
  year = {2005},
  doi = {10.1007/s10817-006-7237-0},
  url = {http://dx.doi.org/10.1007/s10817-006-7237-0},
  researchr = {https://researchr.org/publication/GieslK05},
  cites = {0},
  citedby = {0},
  journal = {JAR},
  volume = {34},
  number = {2},
  pages = {103-104},
}

@inproceedings{GieslK01,
  title = {Decidable Classes of Inductive Theorems},
  author = {Jürgen Giesl and Deepak Kapur},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2083/20830469.htm},
  researchr = {https://researchr.org/publication/GieslK01},
  cites = {0},
  citedby = {0},
  pages = {469-484},
  booktitle = {cade},
}

@inproceedings{Giesl95:0,
  title = {Generating Polynomial Orderings for Termination Proofs},
  author = {Jürgen Giesl},
  year = {1995},
  tags = {termination},
  researchr = {https://researchr.org/publication/Giesl95%3A0},
  cites = {0},
  citedby = {0},
  pages = {426-431},
  booktitle = {RTA},
}

@inproceedings{ArtsG99,
  title = {Applying Rewriting Techniques to the Verification of Erlang Processes},
  author = {Thomas Arts and Jürgen Giesl},
  year = {1999},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ArtsG99},
  cites = {0},
  citedby = {0},
  pages = {96-110},
  booktitle = {csl},
}

@inproceedings{BaaderCGN07a,
  title = {07401 Abstracts Collection -- Deduction and Decision Procedures},
  author = {Franz Baader and Byron Cook and Jürgen Giesl and Robert Nieuwenhuis},
  year = {2007},
  url = {http://drops.dagstuhl.de/opus/volltexte/2007/1252},
  researchr = {https://researchr.org/publication/BaaderCGN07a},
  cites = {0},
  citedby = {0},
  booktitle = {Dagstuhl},
}

@inproceedings{GieslTSF04,
  title = {Automated Termination Proofs with AProVE},
  author = {Jürgen Giesl and René Thiemann and Peter Schneider-Kamp and Stephan Falke},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3091&spage=210},
  tags = {termination},
  researchr = {https://researchr.org/publication/GieslTSF04},
  cites = {0},
  citedby = {0},
  pages = {210-220},
  booktitle = {RTA},
}

@inproceedings{BrockschmidtOEG10,
  title = {Termination Graphs for Java Bytecode},
  author = {Marc Brockschmidt and Carsten Otto and Christian von Essen and Jürgen Giesl},
  year = {2010},
  doi = {10.1007/978-3-642-17172-7_2},
  url = {http://dx.doi.org/10.1007/978-3-642-17172-7_2},
  tags = {Java, termination, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BrockschmidtOEG10},
  cites = {0},
  citedby = {0},
  pages = {17-37},
  booktitle = {BIRTHDAY},
}

@article{Giesl08:0,
  title = {Preface},
  author = {Jürgen Giesl},
  year = {2008},
  doi = {10.1016/j.entcs.2008.03.049},
  url = {http://dx.doi.org/10.1016/j.entcs.2008.03.049},
  researchr = {https://researchr.org/publication/Giesl08%3A0},
  cites = {0},
  citedby = {0},
  journal = {ENTCS},
  volume = {204},
  pages = {1-2},
}

@inproceedings{ThiemannG03,
  title = {Size-Change Termination for Term Rewriting},
  author = {René Thiemann and Jürgen Giesl},
  year = {2003},
  url = {http://link.springer.de/link/service/series/0558/bibs/2706/27060264.htm},
  tags = {term rewriting, termination, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ThiemannG03},
  cites = {0},
  citedby = {0},
  pages = {264-278},
  booktitle = {RTA},
}

@inproceedings{BaaderCGN07,
  title = {07401 Executive Summary -- Deduction and Decision Procedures},
  author = {Franz Baader and Byron Cook and Jürgen Giesl and Robert Nieuwenhuis},
  year = {2007},
  url = {http://drops.dagstuhl.de/opus/volltexte/2007/1251},
  researchr = {https://researchr.org/publication/BaaderCGN07},
  cites = {0},
  citedby = {0},
  booktitle = {Dagstuhl},
}

@article{Giesl07,
  title = {RTA 2005},
  author = {Jürgen Giesl},
  year = {2007},
  doi = {10.1016/j.ic.2006.12.001},
  url = {http://dx.doi.org/10.1016/j.ic.2006.12.001},
  researchr = {https://researchr.org/publication/Giesl07},
  cites = {0},
  citedby = {0},
  journal = {iandc},
  volume = {205},
  number = {4},
  pages = {417-418},
}

@article{ThiemannG05,
  title = {The size-change principle and dependency pairs for termination of term rewriting},
  author = {René Thiemann and Jürgen Giesl},
  year = {2005},
  doi = {10.1007/s00200-005-0179-7},
  url = {http://dx.doi.org/10.1007/s00200-005-0179-7},
  tags = {term rewriting, termination, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ThiemannG05},
  cites = {0},
  citedby = {0},
  journal = {aaecc},
  volume = {16},
  number = {4},
  pages = {229-270},
}

@inproceedings{BrauburgerG96,
  title = {Termination Analysis for Partial Functions},
  author = {Jürgen Brauburger and Jürgen Giesl},
  year = {1996},
  tags = {analysis, termination},
  researchr = {https://researchr.org/publication/BrauburgerG96},
  cites = {0},
  citedby = {0},
  pages = {113-127},
  booktitle = {SAS},
}

@inproceedings{GKV03,
  title = {Deaccumulation - Improving Provability},
  author = {Jürgen Giesl and Armin Kühnemann and Janis Voigtländer},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2896&spage=146},
  tags = {rule-based, program verification, functional programming, transformation, program transformation},
  researchr = {https://researchr.org/publication/GKV03},
  cites = {0},
  citedby = {0},
  pages = {146-160},
  booktitle = {asian},
}

@inproceedings{ArtsG96,
  title = {Termination of Constructor Systems},
  author = {Thomas Arts and Jürgen Giesl},
  year = {1996},
  tags = {termination},
  researchr = {https://researchr.org/publication/ArtsG96},
  cites = {0},
  citedby = {0},
  pages = {63-77},
  booktitle = {RTA},
}

@inproceedings{FuhsGMSTZ07,
  title = {SAT Solving for Termination Analysis with Polynomial Interpretations},
  author = {Carsten Fuhs and Jürgen Giesl and Aart Middeldorp and Peter Schneider-Kamp and René Thiemann and Harald Zankl},
  year = {2007},
  doi = {10.1007/978-3-540-72788-0_33},
  url = {http://dx.doi.org/10.1007/978-3-540-72788-0_33},
  tags = {analysis, termination},
  researchr = {https://researchr.org/publication/FuhsGMSTZ07},
  cites = {0},
  citedby = {0},
  pages = {340-354},
  booktitle = {sat},
}

@article{GieslAO02,
  title = {Modular Termination Proofs for Rewriting Using Dependency Pairs},
  author = {Jürgen Giesl and Thomas Arts and Enno Ohlebusch},
  year = {2002},
  doi = {10.1006/jsco.2002.0541},
  url = {http://dx.doi.org/10.1006/jsco.2002.0541},
  tags = {termination, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GieslAO02},
  cites = {0},
  citedby = {0},
  journal = {JSC},
  volume = {34},
  number = {1},
  pages = {21-58},
}

@inproceedings{ThiemannGS04,
  title = {Improved Modular Termination Proofs Using Dependency Pairs},
  author = {René Thiemann and Jürgen Giesl and Peter Schneider-Kamp},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3097&spage=75},
  tags = {termination},
  researchr = {https://researchr.org/publication/ThiemannGS04},
  cites = {0},
  citedby = {0},
  pages = {75-90},
  booktitle = {cade},
}

@inproceedings{GieslTSS07,
  title = {Proving Termination by Bounded Increase},
  author = {Jürgen Giesl and René Thiemann and Stephan Swiderski and Peter Schneider-Kamp},
  year = {2007},
  doi = {10.1007/978-3-540-73595-3_33},
  url = {http://dx.doi.org/10.1007/978-3-540-73595-3_33},
  tags = {termination},
  researchr = {https://researchr.org/publication/GieslTSS07},
  cites = {0},
  citedby = {0},
  pages = {443-459},
  booktitle = {cade},
}

@inproceedings{ThiemannGS07,
  title = {Decision Procedures for Loop Detection},
  author = {René Thiemann and Jürgen Giesl and Peter Schneider-Kamp},
  year = {2007},
  url = {http://drops.dagstuhl.de/opus/volltexte/2007/1246},
  researchr = {https://researchr.org/publication/ThiemannGS07},
  cites = {0},
  citedby = {0},
  booktitle = {Dagstuhl},
}

@inproceedings{Giesl95,
  title = {Automated Termination Proofs with Measure Functions},
  author = {Jürgen Giesl},
  year = {1995},
  tags = {termination},
  researchr = {https://researchr.org/publication/Giesl95},
  cites = {0},
  citedby = {0},
  pages = {149-160},
  booktitle = {ki},
}

@inproceedings{GieslM99,
  title = {Transforming Context-Sensitive Rewrite Systems},
  author = {Jürgen Giesl and Aart Middeldorp},
  year = {1999},
  url = {http://link.springer.de/link/service/series/0558/bibs/1631/16310271.htm},
  tags = {graph-rewriting, context-aware, rewriting},
  researchr = {https://researchr.org/publication/GieslM99},
  cites = {0},
  citedby = {0},
  pages = {271-287},
  booktitle = {RTA},
}

@inproceedings{GieslSTSNSS07,
  title = {Termination of Programs using Term Rewriting and SAT Solving},
  author = {Jürgen Giesl and Peter Schneider-Kamp and René Thiemann and Stephan Swiderski and Manh Thang Nguyen and Danny De Schreye and Alexander Serebrenik},
  year = {2007},
  url = {http://drops.dagstuhl.de/opus/volltexte/2007/1248},
  tags = {term rewriting, termination, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GieslSTSNSS07},
  cites = {0},
  citedby = {0},
  booktitle = {Dagstuhl},
}

@article{ArtsG00,
  title = {Termination of term rewriting using dependency pairs},
  author = {Thomas Arts and Jürgen Giesl},
  year = {2000},
  doi = {10.1016/S0304-3975(99)00207-8},
  url = {http://dx.doi.org/10.1016/S0304-3975(99)00207-8},
  tags = {term rewriting, termination, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ArtsG00},
  cites = {0},
  citedby = {0},
  journal = {TCS},
  volume = {236},
  number = {1-2},
  pages = {133-178},
}

@inproceedings{ThiemannGS08,
  title = {Deciding Innermost Loops},
  author = {René Thiemann and Jürgen Giesl and Peter Schneider-Kamp},
  year = {2008},
  doi = {10.1007/978-3-540-70590-1_25},
  url = {http://dx.doi.org/10.1007/978-3-540-70590-1_25},
  researchr = {https://researchr.org/publication/ThiemannGS08},
  cites = {0},
  citedby = {0},
  pages = {366-380},
  booktitle = {RTA},
}

@inproceedings{GieslSST06,
  title = {Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages},
  author = {Jürgen Giesl and Stephan Swiderski and Peter Schneider-Kamp and René Thiemann},
  year = {2006},
  doi = {10.1007/11805618_23},
  url = {http://dx.doi.org/10.1007/11805618_23},
  tags = {programming languages, program analysis, term rewriting, analysis, Haskell, termination, graph-rewriting, programming, rewriting},
  researchr = {https://researchr.org/publication/GieslSST06},
  cites = {0},
  citedby = {0},
  pages = {297-312},
  booktitle = {RTA},
}

@inproceedings{ArtsG97,
  title = {Automatically Proving Termination Where Simplification Orderings Fail},
  author = {Thomas Arts and Jürgen Giesl},
  year = {1997},
  tags = {termination},
  researchr = {https://researchr.org/publication/ArtsG97},
  cites = {0},
  citedby = {0},
  pages = {261-272},
  booktitle = {tapsoft},
}

@inproceedings{GieslTS05:0,
  title = {Proving and Disproving Termination of Higher-Order Functions},
  author = {Jürgen Giesl and René Thiemann and Peter Schneider-Kamp},
  year = {2005},
  doi = {10.1007/11559306_12},
  url = {http://dx.doi.org/10.1007/11559306_12},
  tags = {termination},
  researchr = {https://researchr.org/publication/GieslTS05%3A0},
  cites = {0},
  citedby = {0},
  pages = {216-231},
  booktitle = {frocos},
}

@inproceedings{FuhsGPSF09,
  title = {Proving Termination of Integer Term Rewriting},
  author = {Carsten Fuhs and Jürgen Giesl and Martin Plücker and Peter Schneider-Kamp and Stephan Falke},
  year = {2009},
  doi = {10.1007/978-3-642-02348-4_3},
  url = {http://dx.doi.org/10.1007/978-3-642-02348-4_3},
  tags = {term rewriting, termination, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/FuhsGPSF09},
  cites = {0},
  citedby = {0},
  pages = {32-47},
  booktitle = {RTA},
}

@inproceedings{Schneider-KampGN09,
  title = {The Dependency Triple Framework for Termination of Logic Programs},
  author = {Peter Schneider-Kamp and Jürgen Giesl and Manh Thang Nguyen},
  year = {2009},
  doi = {10.1007/978-3-642-12592-8_4},
  url = {http://dx.doi.org/10.1007/978-3-642-12592-8_4},
  tags = {termination, logic programming, logic},
  researchr = {https://researchr.org/publication/Schneider-KampGN09},
  cites = {0},
  citedby = {0},
  pages = {37-51},
  booktitle = {LOPSTR},
}

@inproceedings{GieslTS04,
  title = {The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs},
  author = {Jürgen Giesl and René Thiemann and Peter Schneider-Kamp},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3452&spage=301},
  tags = {termination},
  researchr = {https://researchr.org/publication/GieslTS04},
  cites = {0},
  citedby = {0},
  pages = {301-331},
  booktitle = {lpar},
}

@article{GieslTSF06,
  title = {Mechanizing and Improving Dependency Pairs},
  author = {Jürgen Giesl and René Thiemann and Peter Schneider-Kamp and Stephan Falke},
  year = {2006},
  doi = {10.1007/s10817-006-9057-7},
  url = {http://dx.doi.org/10.1007/s10817-006-9057-7},
  researchr = {https://researchr.org/publication/GieslTSF06},
  cites = {0},
  citedby = {0},
  journal = {JAR},
  volume = {37},
  number = {3},
  pages = {155-203},
}

@inproceedings{GieslST06,
  title = {Automatic Termination Proofs in the Dependency Pair Framework},
  author = {Jürgen Giesl and Peter Schneider-Kamp and René Thiemann},
  year = {2006},
  doi = {10.1007/11814771_24},
  url = {http://dx.doi.org/10.1007/11814771_24},
  tags = {termination},
  researchr = {https://researchr.org/publication/GieslST06},
  cites = {0},
  citedby = {0},
  pages = {281-286},
  booktitle = {cade},
}

@inproceedings{Schneider-KampGST06,
  title = {Automated Termination Analysis for Logic Programs by Term Rewriting},
  author = {Peter Schneider-Kamp and Jürgen Giesl and Alexander Serebrenik and René Thiemann},
  year = {2006},
  doi = {10.1007/978-3-540-71410-1_13},
  url = {http://dx.doi.org/10.1007/978-3-540-71410-1_13},
  tags = {program analysis, term rewriting, analysis, termination, graph-rewriting, logic programming, logic, rewriting logic, rewriting},
  researchr = {https://researchr.org/publication/Schneider-KampGST06},
  cites = {0},
  citedby = {0},
  pages = {177-193},
  booktitle = {LOPSTR},
}

@inproceedings{OttoBEG10,
  title = {Automated Termination Analysis of Java Bytecode by Term Rewriting},
  author = {Carsten Otto and Marc Brockschmidt and Christian von Essen and Jürgen Giesl},
  year = {2010},
  doi = {10.4230/LIPIcs.RTA.2010.259},
  url = {http://dx.doi.org/10.4230/LIPIcs.RTA.2010.259},
  tags = {Java, term rewriting, analysis, termination, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/OttoBEG10},
  cites = {0},
  citedby = {0},
  pages = {259-276},
  booktitle = {RTA},
}

@article{ThiemannZGS08,
  title = {Adding constants to string rewriting},
  author = {René Thiemann and Hans Zantema and Jürgen Giesl and Peter Schneider-Kamp},
  year = {2008},
  doi = {10.1007/s00200-008-0060-6},
  url = {http://dx.doi.org/10.1007/s00200-008-0060-6},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ThiemannZGS08},
  cites = {0},
  citedby = {0},
  journal = {aaecc},
  volume = {19},
  number = {1},
  pages = {27-38},
}

@inproceedings{Schneider-KampTACG07,
  title = {Proving Termination Using Recursive Path Orders and SAT Solving},
  author = {Peter Schneider-Kamp and René Thiemann and Elena Annov and Michael Codish and Jürgen Giesl},
  year = {2007},
  doi = {10.1007/978-3-540-74621-8_18},
  url = {http://dx.doi.org/10.1007/978-3-540-74621-8_18},
  tags = {termination},
  researchr = {https://researchr.org/publication/Schneider-KampTACG07},
  cites = {0},
  citedby = {0},
  pages = {267-282},
  booktitle = {frocos},
}
@proceedings{rta:2005,
  title = {Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings},
  year = {2005},
  tags = {term rewriting, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/rta%3A2005},
  cites = {0},
  citedby = {0},
  booktitle = {Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings},
  conference = {RTA},
  editor = {Jürgen Giesl},
  volume = {3467},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-25596-6},
}

@proceedings{cade-2010,
  title = {Automated Reasoning, 5th International Joint Conference, IJCAR 2010, Edinburgh,UK, July 16-19, 2010. Proceedings},
  year = {2010},
  doi = {10.1007/978-3-642-14203-1},
  url = {http://dx.doi.org/10.1007/978-3-642-14203-1},
  researchr = {https://researchr.org/publication/cade-2010},
  cites = {0},
  citedby = {0},
  booktitle = {Automated Reasoning, 5th International Joint Conference, IJCAR 2010, Edinburgh,UK, July 16-19, 2010. Proceedings},
  conference = {cade},
  editor = {Jürgen Giesl and Reiner Hähnle},
  volume = {6173},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-14202-4},
}

@proceedings{dagstuhl:2007P7401,
  title = {Deduction and Decision Procedures, 30.09. - 05.10.2007},
  year = {2007},
  researchr = {https://researchr.org/publication/dagstuhl%3A2007P7401},
  cites = {0},
  citedby = {0},
  booktitle = {Deduction and Decision Procedures, 30.09. - 05.10.2007},
  conference = {Dagstuhl},
  editor = {Franz Baader and Byron Cook and Jürgen Giesl and Robert Nieuwenhuis},
  volume = {07401},
  series = {Dagstuhl Seminar Proceedings},
  publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany},
}