J. Giesl

发表

Analyzing Runtime and Size Complexity of Integer Programs

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

Mechanizing and Improving Dependency Pairs

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

Transformation techniques for context-sensitive rewrite systems

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

Transforming Context-Sensitive Rewrite Systems

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

Maximal Termination

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

Automated Complexity Analysis for Prolog by Term Rewriting ∗

Fabian Emmes, Carsten Fuhs, J. Giesl, 2003 .

AProVE : A System for Proving Termination

S. Falke, J. Giesl, René Thiemann, 2003 .

Proving Termination with AProVE

S. Falke, J. Giesl, René Thiemann, 2004 .

Special Issue: Automatic Resource Bound Analysis

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

Termination of triangular polynomial loops

J. Giesl, Florian Frohn, Marcel Hark, 2019, Formal Methods in System Design.

L O ] 2 7 M ay 2 01 9 Computing Expected Runtimes for Constant Probability Programs ⋆

P. Giesl, J. Giesl, Marcel Hark, 2019 .

Aiming low is harder: induction for lower bounds in probabilistic program verification

Benjamin Lucien Kaminski, J. Giesl, J. Katoen, 2019, Proc. ACM Program. Lang..

Deciding Innermost Loops

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

The Termination and Complexity Competition

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

The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs

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

Improved Modular Termination Proofs Using Dependency Pairs

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

Size-Change Termination for Term Rewriting

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

Termination of Constructor Systems

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

Genetic Algorithms for Finding Polynomial Orderings

S. Forrest, J. Giesl, Fernando Esponda, 2001 .

Deaccumulation techniques for improving provability

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

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

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

Automatic Termination Proofs in the Dependency Pair Framework

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

Deciding Inductive Validity of Equations

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

Termination of term rewriting using dependency pairs

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

Proving and Disproving Termination of Higher-Order Functions

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

Modular Termination Proofs for Rewriting Using Dependency Pairs

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

Modularity of Termination Using Dependency pairs

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

The Semantics of Rational Contractions

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

Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic

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

Analyzing Program Termination and Complexity Automatically with AProVE

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

Automated termination proofs for logic programs by term rewriting

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

Automated Termination Proofs with AProVE

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

Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting

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

Proving Termination by Dependency Pairs and Inductive Theorem Proving

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

Termination Analysis by Dependency Pairs and Inductive Theorem Proving

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

Lower Bounds for Runtime Complexity of Term Rewriting

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

Context-Moving Transformations for Function Verification

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

Termination of Isabelle Functions via Termination of Rewriting

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

Automatically Proving Termination Where Simplification Orderings Fail

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

Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes pdf

Jurgen Giesl, Marcel Hark, Fabian Meyer, 2020, TACAS.

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.

Proving Non-Termination via Loop Acceleration

Jurgen Giesl, Florian Frohn, J. Giesl, 2019, 2019 Formal Methods in Computer Aided Design (FMCAD).

Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting (Short WST Version)

J. Giesl, Jan-Christoph Kassing, 2023, ArXiv.

Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs

J. Giesl, Jan-Christoph Kassing, 2023, ArXiv.

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

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

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.

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

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

Loops under Strategies ... Continued

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

Lazy Abstraction for Size-Change Termination

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

Adding constants to string rewriting

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

Proving Termination Using Recursive Path Orders and SAT Solving

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

Proving Termination by Bounded Increase

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

Automated Termination Analysis for Logic Programs by Term Rewriting

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

SAT Solving for Argument Filterings

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2006, 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.

Simulating liveness by reduction strategies

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

Improving Dependency Pairs

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

Verification of Erlang Processes by Dependency Pairs

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

Closure Induction in a Z-Like Language

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

Eliminating Dummy Elimination

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

Applying Rewriting Techniques to the Verification of Erlang Processes

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

Inferring Lower Bounds for Runtime Complexity

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

Automated Complexity Analysis for Prolog by Term Rewriting ∗

Fabian Emmes, Carsten Fuhs, J. Giesl, 2003 .

Termination Analysis for Partial Functions

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

Termination Analysis for Functional Programs using Term Orderings

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

Termination Analysis for Functional Programs

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

Inferring Lower Runtime Bounds for Integer Programs

Marc Brockschmidt, Matthias Naaf, Jurgen Giesl, 2019, ACM Trans. Program. Lang. Syst..

Current Trends in Automated Deduction

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

Proving Innermost Normalisation Automatically

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

Generating Polynomial Orderings for Termination Proofs

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

Liveness in Rewriting

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

Innermost Termination of Context-Sensitive Rewriting

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

Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs

MANH THANG NGUYEN, DANNY DE SCHREYE, J. Giesl, 2005, ICLP.

Under Consideration for Publication in Theory and Practice of Logic Programming Polytool: Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs

J. Giesl, D. D. Schreye, Peter Schneider-Kamp, 2022 .

AProVE : A System for Proving Termination

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

Preface

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

Induction Proofs with Partial Functions

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

Veri ation of Erlang Pro esses by Dependen y Pairs ?

J. Giesl, T. Arts, 2022 .

Decidable Classes of Inductive Theorems

D. Kapur, J. Giesl, 2001, IJCAR.

On the Decidability of Termination for Polynomial Loops pdf

Jurgen Giesl, Marcel Hark, Florian Frohn, 2019, ArXiv.

Termination of Polynomial Loops

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

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

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

Analyzing Runtime and Size Complexity of Integer Programs

Marc Brockschmidt, Fabian Emmes, Carsten Fuhs, 2016, ACM Trans. Program. Lang. Syst..

Lower Runtime Bounds for Integer Programs

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

Termination Competition (termCOMP 2015)

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

Proving Termination of Programs Automatically with AProVE

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

Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs

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

Proving Termination of Integer Term Rewriting

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

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting

J. Giesl, Florian Frohn, Jan-Christoph Kassing, 2023, FoSSaCS.

Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes

J. Giesl, Marcel Hark, Fabian Meyer, 2020, TACAS.

Exotic Semi-Ring Constraints

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