Jürgen Giesl

发表

Rta 2005

Jürgen Giesl, 2007, Inf. Comput..

Mechanizing and Improving Dependency Pairs

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2006, Journal of Automated Reasoning.

Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs

Jürgen Giesl, Peter Schneider-Kamp, Thomas Ströder, 2012, LOPSTR.

Modularity of Termination Using Dependency pairs

Jürgen Giesl, Thomas Arts, J. Giesl, 1998, RTA.

Proving liveness in ring protocols by termination

Hans Zantema, Jürgen Giesl, 2003 .

Termination of term rewriting using dependency pairs

Jürgen Giesl, Thomas Arts, J. Giesl, 2000, Theor. Comput. Sci..

Termination of Constructor Systems

Jürgen Giesl, Thomas Arts, J. Giesl, 1996, RTA.

Termination of Integer Term Rewriting

Jürgen Giesl, Peter Schneider-Kamp, Stephan Falke, 2009, Interaction versus Automation: The two Faces of Deduction.

Mechanized verification of imperative and functional programs

Jürgen Giesl, 1999 .

Current Trends in Automated Deduction

Jürgen Giesl, J. Giesl, 2010, KI - Künstliche Intelligenz.

Termination of Nested and Mutually Recursive Algorithms

Jürgen Giesl, 2004, Journal of Automated Reasoning.

Proceedings of the 16th international conference on Term Rewriting and Applications

Jürgen Giesl, 2005 .

Aiming Low Is Harder - Inductive Proof Rules for Lower Bounds on Weakest Preexpectations in Probabilistic Program Verification pdf

Joost-Pieter Katoen, Jürgen Giesl, Benjamin Lucien Kaminski, 2019, ArXiv.

SAT Solving for Termination Analysis with Polynomial Interpretations

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2007, SAT.

Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode

Jürgen Giesl, Marc Brockschmidt, Thomas Ströder, 2011, FoVeOOS.

Deaccumulation - Improving Provability

Jürgen Giesl, Armin Kühnemann, Janis Voigtländer, 2003, ASIAN.

Analyzing Program Termination and Complexity Automatically with AProVE

Jürgen Giesl, Marc Brockschmidt, René Thiemann, 2016, Journal of Automated Reasoning.

A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems

Jürgen Giesl, Fabian Emmes, Lars Noschinski, 2011, CADE.

07401 Abstracts Collection -- Deduction and Decision Procedures

Jürgen Giesl, Franz Baader, Robert Nieuwenhuis, 2007, Deduction and Decision Procedures.

Constant runtime complexity of term rewriting is semi-decidable

Jürgen Giesl, Florian Frohn, 2018, Inf. Process. Lett..

Termination Analysis for Partial Functions

Jürgen Giesl, Jürgen Brauburger, J. Giesl, 1996, SAS.

Liveness in Rewriting

Hans Zantema, Jürgen Giesl, J. Giesl, 2003, RTA.

Modular Termination Proofs for Rewriting Using Dependency Pairs

Enno Ohlebusch, Jürgen Giesl, Thomas Arts, 2002, J. Symb. Comput..

Automated Termination Analysis: From Term Rewriting to Programming Languages

Jürgen Giesl, 2013, Software Engineering.

Exotic Semi-Ring Constraints

Jürgen Giesl, Carsten Fuhs, Michael Codish, 2013, SMT@IJCAR.

Polytool: Polynomial interpretations as a basis for termination analysis of logic programs

Jürgen Giesl, Danny De Schreye, Peter Schneider-Kamp, 2011, Theory Pract. Log. Program..

Complexity Analysis for Term Rewriting by Integer Transition Systems

Jürgen Giesl, Marc Brockschmidt, Carsten Fuhs, 2017, FroCoS.

Preface

Jürgen Giesl, Deepak Kapur, 2006, Journal of Automated Reasoning.

Improving Context-Sensitive Dependency Pairs

Raúl Gutiérrez, Salvador Lucas, Jürgen Giesl, 2008, LPAR.

Approximating the Domains of Functional and Imperative Programs

Jürgen Giesl, Jürgen Brauburger, 1999, Sci. Comput. Program..

Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings

Jürgen Giesl, 2005, RTA.

Automated Reasoning, 5th International Joint Conference, IJCAR 2010, Edinburgh, UK, July 16-19, 2010. Proceedings

Jürgen Giesl, Reiner Hähnle, 2010, IJCAR.

The Semantics of Rational Contractions

Jürgen Giesl, Ingrid Neumann, J. Giesl, 1993, EPIA.

Termination Analysis by Dependency Pairs and Inductive Theorem Proving

Jürgen Giesl, Peter Schneider-Kamp, Carsten Fuhs, 2009, CADE.

Automated Termination Proofs with AProVE

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2004, RTA.

Dependency Triples for Improving Termination Analysis of Logic Programs with Cut

Jürgen Giesl, Peter Schneider-Kamp, Thomas Ströder, 2010, LOPSTR.

Proving Termination and Memory Safety for Programs with Pointer Arithmetic

Jürgen Giesl, Marc Brockschmidt, Peter Schneider-Kamp, 2014, IJCAR.

Decision Procedures for Loop Detection

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2007, Deduction and Decision Procedures.

Termination of Polynomial Loops

Jürgen Giesl, Marcel Hark, Florian Frohn, 2020, SAS.

Inferring Lower Bounds for Runtime Complexity

Jürgen Giesl, Thomas Ströder, Cornelius Aschermann, 2015, RTA.

Innermost Termination of Context-Sensitive Rewriting

Jürgen Giesl, Aart Middeldorp, J. Giesl, 2002, Developments in Language Theory.

AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs - (Competition Contribution)

Jürgen Giesl, Thomas Ströder, Florian Frohn, 2017, TACAS.

Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting

Jürgen Giesl, Marc Brockschmidt, Carsten Otto, 2011, RTA.

Proceedings of the 5th international conference on Automated Reasoning

Jürgen Giesl, Reiner Hähnle, 2010 .

Automated termination proofs for haskell by term rewriting

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2011, TOPL.

Termination Competition (termCOMP 2015)

Albert Rubio, Jürgen Giesl, Frédéric Mesnard, 2015, CADE.

The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2005, LPAR.

Automated termination proofs for logic programs by term rewriting

Jürgen Giesl, Alexander Serebrenik, René Thiemann, 2008, TOCL.

Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution

Jürgen Giesl, Thomas Ströder, Florian Frohn, 2016, SEFM.

Proving and Disproving Termination of Higher-Order Functions

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2005, FroCoS.

Termination Analysis of Logic Programs Based on Dependency Graphs

Jürgen Giesl, Danny De Schreye, Peter Schneider-Kamp, 2007, LOPSTR.

09411 Abstracts Collection - Interaction versus Automation: The two Faces of Deduction

Tobias Nipkow, Jürgen Giesl, Reiner Hähnle, 2009, Interaction versus Automation: The two Faces of Deduction.

Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution

Jürgen Giesl, Thomas Ströder, Florian Frohn, 2018, J. Log. Algebraic Methods Program..

Deaccumulation techniques for improving provability

Jürgen Giesl, Armin Kühnemann, Janis Voigtländer, 2007, J. Log. Algebraic Methods Program..

Decidable Classes of Inductive Theorems

Jürgen Giesl, Deepak Kapur, 2001, IJCAR.

Dependency Pairs for Equational Rewriting

Jürgen Giesl, Deepak Kapur, 2001, RTA.

Proving Termination Using Recursive Path Orders and SAT Solving

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2007, FroCoS.

Size-Change Termination for Term Rewriting

Jürgen Giesl, René Thiemann, J. Giesl, 2003, RTA.

Automated Termination Analysis for Logic Programs by Term Rewriting

Jürgen Giesl, Alexander Serebrenik, René Thiemann, 2006, LOPSTR.

Preface: Special Issue on Automatic Resource Bound Analysis

Jürgen Giesl, Jan Hoffmann, 2016, Journal of Automated Reasoning.

Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs

Jürgen Giesl, Peter Schneider-Kamp, Thomas Ströder, 2012, PPDP.

Automatically Proving Termination Where Simplification Orderings Fail

Jürgen Giesl, Thomas Arts, J. Giesl, 1997, TAPSOFT.

Strategies for Semantical Contractions

Jürgen Giesl, Ingrid Neumann, 1994, KI.

07401 Executive Summary -- Deduction and Decision Procedures

Jürgen Giesl, Franz Baader, Robert Nieuwenhuis, 2007, Deduction and Decision Procedures.

Proving Non-looping Non-termination Automatically

Jürgen Giesl, Fabian Emmes, Tim Enger, 2012, IJCAR.

Automated termination analysis for logic programs with cut

Jürgen Giesl, Alexander Serebrenik, René Thiemann, 2010, Theory Pract. Log. Program..

Termination Analysis for Functional Programs

Jürgen Giesl, Christoph Walther, Jürgen Brauburger, 1998 .

Adding constants to string rewriting

Hans Zantema, Jürgen Giesl, René Thiemann, 2008, Applicable Algebra in Engineering, Communication and Computing.

Improving Dependency Pairs

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2003, LPAR.

Termination of Isabelle Functions via Termination of Rewriting

Jürgen Giesl, René Thiemann, Carsten Fuhs, 2011, ITP.

Equational Termination by Semantic Labelling

Jürgen Giesl, Aart Middeldorp, Hitoshi Ohsaki, 2000, CSL.

Termination of Programs using Term Rewriting and SAT Solving

Jürgen Giesl, Alexander Serebrenik, Danny De Schreye, 2007, Deduction and Decision Procedures.

Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs

Jürgen Giesl, Fabian Emmes, Lars Noschinski, 2013, Journal of Automated Reasoning.

Deciding Inductive Validity of Equations

Jürgen Giesl, Deepak Kapur, D. Kapur, 2003, CADE.

Proving Termination of Integer Term Rewriting

Jürgen Giesl, Peter Schneider-Kamp, Stephan Falke, 2009, RTA.

Special Issue: Automatic Resource Bound Analysis

Jürgen Giesl, Jan Hoffmann, Jan Hoffmann, 2017 .

Induction Proofs with Partial Functions

Jürgen Giesl, J. Giesl, 2004, Journal of Automated Reasoning.

SAT-based termination analysis using monotonicity constraints over the integers

Jürgen Giesl, Carsten Fuhs, Michael Codish, 2011, Theory Pract. Log. Program..

09411 Executive Summary - Interaction versus Automation: The two Faces of Deductions

Tobias Nipkow, Jürgen Giesl, Reiner Hähnle, 2009, Interaction versus Automation: The two Faces of Deduction.

AProVE: Termination and Memory Safety of C Programs - (Competition Contribution)

Jürgen Giesl, Thomas Ströder, Cornelius Aschermann, 2015, TACAS.

The Termination and Complexity Competition

Albert Rubio, Jürgen Giesl, Christian Sternagel, 2019, TACAS.

Termination Analysis by Inductive Evaluation

Jürgen Giesl, Jürgen Brauburger, 1998, CADE.

A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog

Jürgen Giesl, Peter Schneider-Kamp, Thomas Ströder, 2011, LOPSTR.

Deciding Innermost Loops

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2008, RTA.

Closure Induction in a Z-Like Language

Jürgen Giesl, David A. Duffy, J. Giesl, 2000, ZB.

Simulating liveness by reduction strategies

Hans Zantema, Jürgen Giesl, J. Giesl, 2003, WRS.

Automatic Termination Proofs in the Dependency Pair Framework

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2006, IJCAR.

The Dependency Triple Framework for Termination of Logic Programs

Jürgen Giesl, Peter Schneider-Kamp, Manh Thang Nguyen, 2009, LOPSTR.

Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2006, RTA.

Eliminating Dummy Elimination

Jürgen Giesl, Aart Middeldorp, J. Giesl, 2000, CADE.

Loops under Strategies ... Continued

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2010, IWS.

Implementing RPO and POLO using SAT

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2007, Deduction and Decision Procedures.

Alternating Runtime and Size Complexity Analysis of Integer Programs

Jürgen Giesl, Marc Brockschmidt, Stephan Falke, 2014, TACAS.

Transformation techniques for context-sensitive rewrite systems

Jürgen Giesl, Aart Middeldorp, J. Giesl, 2004, J. Funct. Program..

Automatisierung von Terminierungsbeweisen für rekursiv definierte Algorithmen

Jürgen Giesl, 1995, DISKI.

Preface

Jürgen Giesl, J. Giesl, 2023, WRS@RDP.

Automated Termination Analysis of Java Bytecode by Term Rewriting

Christian von Essen, Jürgen Giesl, Marc Brockschmidt, 2010, RTA.

Proving Termination by Dependency Pairs and Inductive Theorem Proving

Jürgen Giesl, Peter Schneider-Kamp, Carsten Fuhs, 2011, Journal of Automated Reasoning.

Interaction versus Automation: The two Faces of Deduction, 04.10. - 09.10.2009

Tobias Nipkow, Jürgen Giesl, Reiner Hähnle, 2009, Interaction versus Automation: The two Faces of Deduction.

Special Issue on Automated Deduction

Jürgen Giesl, 2010, KI - Künstliche Intelligenz.

Lower Bounds for Runtime Complexity of Term Rewriting

Jürgen Giesl, Thomas Ströder, Cornelius Aschermann, 2017, Journal of Automated Reasoning.

Proving partial correctness of partial functions

Jürgen Giesl, 1996 .

Lower Runtime Bounds for Integer Programs

Jürgen Giesl, Marc Brockschmidt, Matthias Naaf, 2016, IJCAR.

Search Techniques for Rational Polynomial Orders

Salvador Lucas, Jürgen Giesl, Peter Schneider-Kamp, 2008, AISC/MKM/Calculemus.

Special Issue “Termination”

Jürgen Giesl, Pierre Lescanne, 2001, Applicable Algebra in Engineering, Communication and Computing.

Polynomial Loops: Beyond Termination

Jürgen Giesl, Marcel Hark, Florian Frohn, 2020, LPAR.

Verification of Erlang Processes by Dependency Pairs

Jürgen Giesl, Thomas Arts, J. Giesl, 2001, Applicable Algebra in Engineering, Communication and Computing.

Maximal Termination

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2008, RTA.

Complexity Analysis for Java with AProVE

Jürgen Giesl, Florian Frohn, 2017, IFM.

Inductive Theorem Proving meets Dependency Pairs

Jürgen Giesl, Peter Schneider-Kamp, Carsten Fuhs, 2009, Interaction versus Automation: The two Faces of Deduction.

Proving and Disproving Termination in the Dependency Pair Framework

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2005, Deduction and Applications.

Generating Polynomial Orderings for Termination Proofs

Jürgen Giesl, J. Giesl, 1995, RTA.

Preface: Special Issue of Selected Extended Papers of IJCAR 2010

Jürgen Giesl, Reiner Hähnle, 2011, Journal of Automated Reasoning.

Termination analysis for logic programs by term rewriting revisited (Extended abstract)

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2006 .

SAT Solving for Argument Filterings

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2006, LPAR.

Analyzing Runtime and Size Complexity of Integer Programs

Jürgen Giesl, Marc Brockschmidt, Stephan Falke, 2016, ACM Trans. Program. Lang. Syst..

Improved Modular Termination Proofs Using Dependency Pairs

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2004, IJCAR.

Preface

Jürgen Giesl, Deepak Kapur, 2005, Journal of Automated Reasoning.

Proving Innermost Normalisation Automatically

Jürgen Giesl, Thomas Arts, J. Giesl, 1997, RTA.

Transforming Context-Sensitive Rewrite Systems

Jürgen Giesl, Aart Middeldorp, J. Giesl, 1999, RTA.

Termination Analysis for Functional Programs using Term Orderings

Jürgen Giesl, J. Giesl, 1995, SAS.

Lazy Abstraction for Size-Change Termination

Jürgen Giesl, Peter Schneider-Kamp, Carsten Fuhs, 2010, LPAR.

Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic

Jürgen Giesl, Marc Brockschmidt, Peter Schneider-Kamp, 2014, Journal of Automated Reasoning.

Third Special Issue on Techniques for Automated Termination Proofs

Jürgen Giesl, Deepak Kapur, 2006, Journal of Automated Reasoning.

Analyzing Runtime Complexity via Innermost Runtime Complexity

Jürgen Giesl, Florian Frohn, 2017, LPAR.

The size-change principle and dependency pairs for termination of term rewriting

Jürgen Giesl, René Thiemann, J. Giesl, 2005, Applicable Algebra in Engineering, Communication and Computing.

Context-Moving Transformations for Function Verification

Jürgen Giesl, J. Giesl, 1999, LOPSTR.

Automated Termination Proofs with Measure Functions

Jürgen Giesl, 1995, KI.

Applying Rewriting Techniques to the Verification of Erlang Processes

Jürgen Giesl, Thomas Arts, J. Giesl, 1999, CSL.

Proving Termination of Programs Automatically with AProVE

Jürgen Giesl, Marc Brockschmidt, René Thiemann, 2014, IJCAR.

Termination Graphs for Java Bytecode

Christian von Essen, Jürgen Giesl, Marc Brockschmidt, 2010, Verification, Induction, Termination Analysis.

Automated Termination Proofs for Java Programs with Cyclic Data

Jürgen Giesl, Marc Brockschmidt, Carsten Otto, 2012, CAV.

Proving Termination by Bounded Increase

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2007, CADE.

SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2012, Journal of Automated Reasoning.

Terese. Term rewriting systems, edited by Marc Bezem, Jan Willem Klop, and Roel de Vrijer, Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press, 2003, xxii + 884 pp.

Jürgen Giesl, 2004 .

Exotic Semiring Constraints ( Extended Abstract )

Jürgen Giesl, Carsten Fuhs, Michael Codish, 2012 .

A SAT-based Implementation for RPO Termination ?

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2000 .

Invariant Generation for Linear Probabilistic Programs

Jürgen Giesl, Friedrich Gretz, 2010 .