Search the dblp DataBase
Jürgen Giesl :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Jürgen Giesl , Armin Kühnemann , Janis Voigtländer Deaccumulation - Improving Provability. [Citation Graph (0, 0)][DBLP ] ASIAN, 2003, pp:146-160 [Conf ] Jürgen Brauburger , Jürgen Giesl Termination Analysis by Inductive Evaluation. [Citation Graph (0, 0)][DBLP ] CADE, 1998, pp:254-269 [Conf ] Jürgen Giesl , Deepak Kapur Decidable Classes of Inductive Theorems. [Citation Graph (0, 0)][DBLP ] IJCAR, 2001, pp:469-484 [Conf ] Jürgen Giesl , Deepak Kapur Deciding Inductive Validity of Equations. [Citation Graph (0, 0)][DBLP ] CADE, 2003, pp:17-31 [Conf ] Jürgen Giesl , Aart Middeldorp Eliminating Dummy Elimination. [Citation Graph (0, 0)][DBLP ] CADE, 2000, pp:309-323 [Conf ] Jürgen Giesl , Peter Schneider-Kamp , René Thiemann Automatic Termination Proofs in the Dependency Pair Framework. [Citation Graph (0, 0)][DBLP ] IJCAR, 2006, pp:281-286 [Conf ] René Thiemann , Jürgen Giesl , Peter Schneider-Kamp Improved Modular Termination Proofs Using Dependency Pairs. [Citation Graph (0, 0)][DBLP ] IJCAR, 2004, pp:75-90 [Conf ] Thomas Arts , Jürgen Giesl Applying Rewriting Techniques to the Verification of Erlang Processes. [Citation Graph (0, 0)][DBLP ] CSL, 1999, pp:96-110 [Conf ] Hitoshi Ohsaki , Aart Middeldorp , Jürgen Giesl Equational Termination by Semantic Labelling. [Citation Graph (0, 0)][DBLP ] CSL, 2000, pp:457-471 [Conf ] Jürgen Giesl , René Thiemann , Peter Schneider-Kamp Proving and Disproving Termination in the Dependency Pair Framework. [Citation Graph (0, 0)][DBLP ] Deduction and Applications, 2005, pp:- [Conf ] Jürgen Giesl , Aart Middeldorp Innermost Termination of Context-Sensitive Rewriting. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 2002, pp:231-244 [Conf ] Jürgen Giesl , Ingrid Neumann The Semantics of Rational Contractions. [Citation Graph (0, 0)][DBLP ] EPIA, 1993, pp:356- [Conf ] Jürgen Giesl , René Thiemann , Peter Schneider-Kamp Proving and Disproving Termination of Higher-Order Functions. [Citation Graph (0, 0)][DBLP ] FroCos, 2005, pp:216-231 [Conf ] Jürgen Giesl Automated Termination Proofs with Measure Functions. [Citation Graph (0, 0)][DBLP ] KI, 1995, pp:149-160 [Conf ] Jürgen Giesl , Ingrid Neumann Strategies for Semantical Contractions. [Citation Graph (0, 0)][DBLP ] KI, 1994, pp:396- [Conf ] Jürgen Giesl Context-Moving Transformations for Function Verification. [Citation Graph (0, 0)][DBLP ] LOPSTR, 1999, pp:293-312 [Conf ] Peter Schneider-Kamp , Jürgen Giesl , Alexander Serebrenik , René Thiemann Automated Termination Analysis for Logic Programs by Term Rewriting. [Citation Graph (0, 0)][DBLP ] LOPSTR, 2006, pp:177-193 [Conf ] Michael Codish , Peter Schneider-Kamp , Vitaly Lagoon , René Thiemann , Jürgen Giesl SAT Solving for Argument Filterings. [Citation Graph (0, 0)][DBLP ] LPAR, 2006, pp:30-44 [Conf ] Jürgen Giesl , René Thiemann , Peter Schneider-Kamp The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. [Citation Graph (0, 0)][DBLP ] LPAR, 2004, pp:301-331 [Conf ] Jürgen Giesl , René Thiemann , Peter Schneider-Kamp , Stephan Falke Improving Dependency Pairs. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:167-182 [Conf ] Thomas Arts , Jürgen Giesl Termination of Constructor Systems. [Citation Graph (0, 0)][DBLP ] RTA, 1996, pp:63-77 [Conf ] Thomas Arts , Jürgen Giesl Proving Innermost Normalisation Automatically. [Citation Graph (0, 0)][DBLP ] RTA, 1997, pp:157-171 [Conf ] Thomas Arts , Jürgen Giesl Modularity of Termination Using Dependency pairs. [Citation Graph (0, 0)][DBLP ] RTA, 1998, pp:226-240 [Conf ] Jürgen Giesl , Aart Middeldorp Transforming Context-Sensitive Rewrite Systems. [Citation Graph (0, 0)][DBLP ] RTA, 1999, pp:271-287 [Conf ] Jürgen Giesl , Deepak Kapur Dependency Pairs for Equational Rewriting. [Citation Graph (0, 0)][DBLP ] RTA, 2001, pp:93-108 [Conf ] Jürgen Giesl , Stephan Swiderski , Peter Schneider-Kamp , René Thiemann Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. [Citation Graph (0, 0)][DBLP ] RTA, 2006, pp:297-312 [Conf ] Jürgen Giesl , René Thiemann , Peter Schneider-Kamp , Stephan Falke Automated Termination Proofs with AProVE. [Citation Graph (0, 0)][DBLP ] RTA, 2004, pp:210-220 [Conf ] Jürgen Giesl , Hans Zantema Liveness in Rewriting. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:321-336 [Conf ] Jürgen Giesl Generating Polynomial Orderings for Termination Proofs. [Citation Graph (0, 0)][DBLP ] RTA, 1995, pp:426-431 [Conf ] René Thiemann , Jürgen Giesl Size-Change Termination for Term Rewriting. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:264-278 [Conf ] Jürgen Brauburger , Jürgen Giesl Termination Analysis for Partial Functions. [Citation Graph (0, 0)][DBLP ] SAS, 1996, pp:113-127 [Conf ] Jürgen Giesl Termination Analysis for Functional Programs using Term Orderings [Citation Graph (0, 0)][DBLP ] SAS, 1995, pp:154-171 [Conf ] Thomas Arts , Jürgen Giesl Automatically Proving Termination Where Simplification Orderings Fail. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:261-272 [Conf ] David A. Duffy , Jürgen Giesl Closure Induction in a Z-Like Language. [Citation Graph (0, 0)][DBLP ] ZB, 2000, pp:471-490 [Conf ] Jürgen Giesl , Thomas Arts Verification of Erlang Processes by Dependency Pairs. [Citation Graph (0, 0)][DBLP ] Appl. Algebra Eng. Commun. Comput., 2001, v:12, n:1/2, pp:39-72 [Journal ] Jürgen Giesl , Pierre Lescanne Special Issue "Termination". [Citation Graph (0, 0)][DBLP ] Appl. Algebra Eng. Commun. Comput., 2001, v:12, n:1/2, pp:1-2 [Journal ] René Thiemann , Jürgen Giesl The size-change principle and dependency pairs for termination of term rewriting. [Citation Graph (0, 0)][DBLP ] Appl. Algebra Eng. Commun. Comput., 2005, v:16, n:4, pp:229-270 [Journal ] Jürgen Giesl , Hans Zantema Simulating liveness by reduction strategies. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2003, v:86, n:4, pp:- [Journal ] Jürgen Giesl Induction Proofs with Partial Functions. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 2001, v:26, n:1, pp:1-49 [Journal ] Jürgen Giesl Termination of Nested and Mutually Recursive Algorithms. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 1997, v:19, n:1, pp:1-29 [Journal ] Jürgen Giesl , Deepak Kapur Preface. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 2005, v:34, n:2, pp:103-104 [Journal ] Jürgen Giesl , Deepak Kapur Preface. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 2005, v:34, n:4, pp:323- [Journal ] Jürgen Giesl , Deepak Kapur Third Special Issue on Techniques for Automated Termination Proofs. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 2006, v:37, n:3, pp:153-154 [Journal ] Jürgen Giesl , René Thiemann , Peter Schneider-Kamp , Stephan Falke Mechanizing and Improving Dependency Pairs. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 2006, v:37, n:3, pp:155-203 [Journal ] Jürgen Giesl , Aart Middeldorp Transformation techniques for context-sensitive rewrite systems. [Citation Graph (0, 0)][DBLP ] J. Funct. Program., 2004, v:14, n:4, pp:379-427 [Journal ] Jürgen Giesl , Thomas Arts , Enno Ohlebusch Modular Termination Proofs for Rewriting Using Dependency Pairs. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 2002, v:34, n:1, pp:21-58 [Journal ] Jürgen Brauburger , Jürgen Giesl Approximating the Domains of Functional and Imperative Programs. [Citation Graph (0, 0)][DBLP ] Sci. Comput. Program., 1999, v:35, n:2, pp:113-136 [Journal ] Thomas Arts , Jürgen Giesl Termination of term rewriting using dependency pairs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2000, v:236, n:1-2, pp:133-178 [Journal ] Jürgen Giesl , René Thiemann , Stephan Swiderski , Peter Schneider-Kamp Proving Termination by Bounded Increase. [Citation Graph (0, 0)][DBLP ] CADE, 2007, pp:443-459 [Conf ] Peter Schneider-Kamp , René Thiemann , Elena Annov , Michael Codish , Jürgen Giesl Proving Termination Using Recursive Path Orders and SAT Solving. [Citation Graph (0, 0)][DBLP ] FroCos, 2007, pp:267-282 [Conf ] Carsten Fuhs , Jürgen Giesl , Aart Middeldorp , Peter Schneider-Kamp , René Thiemann , Harald Zankl SAT Solving for Termination Analysis with Polynomial Interpretations. [Citation Graph (0, 0)][DBLP ] SAT, 2007, pp:340-354 [Conf ] Michael Codish , Peter Schneider-Kamp , Vitaly Lagoon , René Thiemann , Jürgen Giesl SAT Solving for Argument Filterings [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Jürgen Giesl RTA 2005. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2007, v:205, n:4, pp:417-418 [Journal ] Jürgen Giesl , Armin Kühnemann , Janis Voigtländer Deaccumulation techniques for improving provability. [Citation Graph (0, 0)][DBLP ] J. Log. Algebr. Program., 2007, v:71, n:2, pp:79-113 [Journal ] Search Techniques for Rational Polynomial Orders. [Citation Graph (, )][DBLP ] Termination Analysis by Dependency Pairs and Inductive Theorem Proving. [Citation Graph (, )][DBLP ] 07401 Abstracts Collection -- Deduction and Decision Procedures. [Citation Graph (, )][DBLP ] Implementing RPO and POLO using SAT. [Citation Graph (, )][DBLP ] Termination of Programs using Term Rewriting and SAT Solving. [Citation Graph (, )][DBLP ] Decision Procedures for Loop Detection. [Citation Graph (, )][DBLP ] 07401 Executive Summary -- Deduction and Decision Procedures. [Citation Graph (, )][DBLP ] Termination Analysis of Logic Programs Based on Dependency Graphs. [Citation Graph (, )][DBLP ] The Dependency Triple Framework for Termination of Logic Programs. [Citation Graph (, )][DBLP ] Improving Context-Sensitive Dependency Pairs. [Citation Graph (, )][DBLP ] Proving Termination of Integer Term Rewriting. [Citation Graph (, )][DBLP ] Maximal Termination. [Citation Graph (, )][DBLP ] Deciding Innermost Loops. [Citation Graph (, )][DBLP ] Automated Termination Analysis of Java Bytecode by Term Rewriting. [Citation Graph (, )][DBLP ] Adding constants to string rewriting. [Citation Graph (, )][DBLP ] Automated Termination Proofs for Logic Programs by Term Rewriting [Citation Graph (, )][DBLP ] Polytool: polynomial interpretations as a basis for termination analysis of Logic programs [Citation Graph (, )][DBLP ] Automated Termination Analysis for Logic Programs with Cut [Citation Graph (, )][DBLP ] Preface. [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.457secs