Jürgen Giesl

206 papers A* 1A 25B 19C 11Misc 4Journal 84Unranked 57
YearRankTypeTitle / Venue / Authors
2026 J jnl
Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks.
CoRR
Jan-Christoph Kassing, Henri Nagel, Alexander Schlecht, Jürgen Giesl
2026 — conf
Modular Automatic Complexity Analysis of Recursive Integer Programs.
ESOP (2)
Nils Lommen, Jürgen Giesl
2026 — conf
On Deciding Constant Runtime of Linear Loops.
TACAS (2)
Florian Frohn, Jürgen Giesl, Peter Giesl, Nils Lommen
2026 J jnl
On Deciding Constant Runtime of Linear Loops.
CoRR
Florian Frohn, Jürgen Giesl, Peter Giesl, Nils Lommen
2026 J jnl
Targeting Completeness: Automated Complexity Analysis of Integer Programs.
J. Autom. Reason.
Nils Lommen, Éléanore Meyer, Jürgen Giesl
2026 J jnl
The annotated dependency pair framework for almost-sure termination of probabilistic term rewriting.
Sci. Comput. Program.
Jan-Christoph Kassing, Jürgen Giesl
2025 — conf
AProVE(KoAT+LoAT) - (Competition Contribution).
TACAS (3)
Nils Lommen, Jürgen Giesl
2025 B conf
Deciding Termination of Simple Randomized Loops.
MFCS
Éléanore Meyer, Jürgen Giesl
2025 J jnl
Deciding Termination of Simple Randomized Loops.
CoRR
Éléanore Meyer, Jürgen Giesl
2025 C conf
Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting.
PPDP
Jan-Christoph Kassing, Leon Valentin Spitzer, Jürgen Giesl
2025 J jnl
Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting.
CoRR
Jan-Christoph Kassing, Leon Spitzer, Jürgen Giesl
2025 J jnl
From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity.
Log. Methods Comput. Sci.
Jan-Christoph Kassing, Jürgen Giesl
2025 A conf
Infinite State Model Checking by Learning Transitive Relations.
CADE
Florian Frohn, Jürgen Giesl
2025 J jnl
Infinite State Model Checking by Learning Transitive Relations.
CoRR
Florian Frohn, Jürgen Giesl
2025 J jnl
Modular Automatic Complexity Analysis of Recursive Integer Programs.
CoRR
Nils Lommen, Jürgen Giesl
2025 J jnl
Small Term Reachability and Related Problems for Terminating Term Rewriting Systems.
Log. Methods Comput. Sci.
Franz Baader, Jürgen Giesl
2025 J jnl
Termination of triangular polynomial loops.
Formal Methods Syst. Des.
Marcel Hark, Florian Frohn, Jürgen Giesl
2025 B conf
Weighted Rewriting: Semiring Semantics for Abstract Reduction Systems.
FSCD
Emma Ahrens, Jan-Christoph Kassing, Jürgen Giesl, Joost-Pieter Katoen
2025 J jnl
Weighted Rewriting: Semiring Semantics for Abstract Reduction Systems.
CoRR
Emma Ahrens, Jan-Christoph Kassing, Jürgen Giesl, Joost-Pieter Katoen
2024 Misc conf
A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting.
FLOPS
Jan-Christoph Kassing, Stefan Dollase, Jürgen Giesl
2024 — conf
A Dependency Pair Framework for Relative Termination of Term Rewriting.
IJCAR (2)
Jan-Christoph Kassing, Grigory Vartanyan, Jürgen Giesl
2024 J jnl
A Dependency Pair Framework for Relative Termination of Term Rewriting.
CoRR
Jan-Christoph Kassing, Grigory Vartanyan, Jürgen Giesl
2024 J jnl
Accelerated Bounded Model Checking.
CoRR
Florian Frohn, Jürgen Giesl
2024 — conf
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting.
Principles of Verification (1)
Jan-Christoph Kassing, Jürgen Giesl
2024 J jnl
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting.
CoRR
Jan-Christoph Kassing, Jürgen Giesl
2024 — conf
Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT (Short Paper) - (Short Paper).
IJCAR (1)
Nils Lommen, Éléanore Meyer, Jürgen Giesl
2024 J jnl
Control-Flow Refinement for Probabilistic Programs in KoAT.
CoRR
Nils Lommen, Éléanore Meyer, Jürgen Giesl
2024 — conf
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting.
FoSSaCS (2)
Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl
2024 J jnl
From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity.
CoRR
Jan-Christoph Kassing, Jürgen Giesl
2024 — conf
Integrating Loop Acceleration Into Bounded Model Checking.
FM (1)
Florian Frohn, Jürgen Giesl
2024 B conf
On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems.
FSCD
Franz Baader, Jürgen Giesl
2024 — conf
Satisfiability Modulo Exponential Integer Arithmetic.
IJCAR (1)
Florian Frohn, Jürgen Giesl
2024 J jnl
Satisfiability Modulo Exponential Integer Arithmetic.
CoRR
Florian Frohn, Jürgen Giesl
2024 J jnl
Small Term Reachability and Related Problems for Terminating Term Rewriting Systems.
CoRR
Franz Baader, Jürgen Giesl
2024 J jnl
Targeting Completeness: Automated Complexity Analysis of Integer Programs.
CoRR
Nils Lommen, Éléanore Meyer, Jürgen Giesl
2024 J jnl
The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting.
CoRR
Jan-Christoph Kassing, Jürgen Giesl
2023 B conf
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses.
SAS
Florian Frohn, Jürgen Giesl
2023 J jnl
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses.
CoRR
Florian Frohn, Jürgen Giesl
2023 J jnl
AProVE: Modular Termination Analysis of Memory-Manipulating C Programs.
CoRR
Frank Emrich, Jera Hensel, Jürgen Giesl
2023 J jnl
Automated Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops (Short WST Version).
CoRR
Nils Lommen, Eleanore Meyer, Jürgen Giesl
2023 J jnl
Automated Termination Proofs for C Programs with Lists (Short WST Version).
CoRR
Jera Hensel, Jürgen Giesl
2023 J jnl
Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting (Short WST Version).
CoRR
Jan-Christoph Kassing, Jürgen Giesl
2023 J jnl
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting.
CoRR
Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl
2023 J jnl
Improving Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting.
CoRR
Jan-Christoph Kassing, Jürgen Giesl
2023 A conf
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs.
CADE
Jan-Christoph Kassing, Jürgen Giesl
2023 J jnl
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs.
CoRR
Jan-Christoph Kassing, Jürgen Giesl
2023 A conf
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper).
CADE
Florian Frohn, Jürgen Giesl
2023 J jnl
Proving Non-Termination by Acceleration Driven Clause Learning (Short WST Version).
CoRR
Florian Frohn, Jürgen Giesl
2023 J jnl
Proving Non-Termination by Acceleration Driven Clause Learning with LoAT.
CoRR
Florian Frohn, Jürgen Giesl
2023 A conf
Proving Termination of C Programs with Lists.
CADE
Jera Hensel, Jürgen Giesl
2023 J jnl
Proving Termination of C Programs with Lists.
CoRR
Jera Hensel, Jürgen Giesl
2023 — conf
Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs.
FroCoS
Nils Lommen, Jürgen Giesl
2023 J jnl
Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs.
CoRR
Nils Lommen, Jürgen Giesl
2022 — conf
AProVE: Non-Termination Witnesses for C Programs - (Competition Contribution).
TACAS (2)
Jera Hensel, Constantin Mensendiek, Jürgen Giesl
2022 A conf
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops.
IJCAR
Nils Lommen, Fabian Meyer, Jürgen Giesl
2022 J jnl
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops.
CoRR
Nils Lommen, Fabian Meyer, Jürgen Giesl
2022 — conf
Improving Automatic Complexity Analysis of Integer Programs.
The Logic of Software. A Tasting Menu of Formal Methods
Jürgen Giesl, Nils Lommen, Marcel Hark, Fabian Meyer
2022 J jnl
Improving Automatic Complexity Analysis of Integer Programs.
CoRR
Jürgen Giesl, Nils Lommen, Marcel Hark, Fabian Meyer
2022 A conf
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description).
IJCAR
Florian Frohn, Jürgen Giesl
2022 J jnl
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description).
CoRR
Florian Frohn, Jürgen Giesl
2021 — conf
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes.
TACAS (1)
Fabian Meyer, Marcel Hark, Jürgen Giesl
2020 J jnl
Aiming low is harder: induction for lower bounds in probabilistic program verification.
Proc. ACM Program. Lang.
Marcel Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen
2020 J jnl
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes.
CoRR
Fabian Meyer, Marcel Hark, Jürgen Giesl
2020 J jnl
Inferring Lower Runtime Bounds for Integer Programs.
ACM Trans. Program. Lang. Syst.
Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl
2020 B conf
Polynomial Loops: Beyond Termination.
LPAR
Marcel Hark, Florian Frohn, Jürgen Giesl
2020 B conf
Termination of Polynomial Loops.
SAS
Florian Frohn, Marcel Hark, Jürgen Giesl
2019 J jnl
Aiming Low Is Harder - Inductive Proof Rules for Lower Bounds on Weakest Preexpectations in Probabilistic Program Verification.
CoRR
Marcel Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen
2019 A conf
Computing Expected Runtimes for Constant Probability Programs.
CADE
Jürgen Giesl, Peter Giesl, Marcel Hark
2019 J jnl
Computing Expected Runtimes for Constant Probability Programs.
CoRR
Jürgen Giesl, Peter Giesl, Marcel Hark
2019 J jnl
Inferring Lower Runtime Bounds for Integer Programs.
CoRR
Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl
2019 J jnl
On the Decidability of Termination for Polynomial Loops.
CoRR
Florian Frohn, Marcel Hark, Jürgen Giesl
2019 B conf
Proving Non-Termination via Loop Acceleration.
FMCAD
Florian Frohn, Jürgen Giesl
2019 J jnl
Proving Non-Termination via Loop Acceleration.
CoRR
Florian Frohn, Jürgen Giesl
2019 — conf
Termination of Triangular Integer Loops is Decidable.
CAV (2)
Florian Frohn, Jürgen Giesl
2019 J jnl
Termination of Triangular Integer Loops is Decidable.
CoRR
Florian Frohn, Jürgen Giesl
2019 — conf
The Termination and Complexity Competition.
TACAS (3)
Jürgen Giesl, Albert Rubio, Christian Sternagel, Johannes Waldmann, Akihisa Yamada
2018 J jnl
Constant runtime complexity of term rewriting is semi-decidable.
Inf. Process. Lett.
Florian Frohn, Jürgen Giesl
2018 J jnl
Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution.
J. Log. Algebraic Methods Program.
Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder
2017 — conf
AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs - (Competition Contribution).
TACAS (2)
Jera Hensel, Frank Emrich, Florian Frohn, Thomas Ströder, Jürgen Giesl
2017 J jnl
Analyzing Program Termination and Complexity Automatically with AProVE.
J. Autom. Reason.
Jürgen Giesl, Cornelius Aschermann, Marc Brockschmidt, Fabian Emmes, Florian Frohn, Carsten Fuhs, Jera Hensel, Carsten Otto, Martin Plücker, Peter Schneider-Kamp, Thomas Ströder, Stephanie Swiderski, René Thiemann
2017 B conf
Analyzing Runtime Complexity via Innermost Runtime Complexity.
LPAR
Florian Frohn, Jürgen Giesl
2017 J jnl
Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic.
J. Autom. Reason.
Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp, Cornelius Aschermann
2017 B conf
Complexity Analysis for Java with AProVE.
IFM
Florian Frohn, Jürgen Giesl
2017 — conf
Complexity Analysis for Term Rewriting by Integer Transition Systems.
FroCoS
Matthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs, Jürgen Giesl
2017 J jnl
Lower Bounds for Runtime Complexity of Term Rewriting.
J. Autom. Reason.
Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder
2017 J jnl
Preface: Special Issue on Automatic Resource Bound Analysis.
J. Autom. Reason.
Jürgen Giesl, Jan Hoffmann
2016 J jnl
Analyzing Runtime and Size Complexity of Integer Programs.
ACM Trans. Program. Lang. Syst.
Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl
2016 A conf
Lower Runtime Bounds for Integer Programs.
IJCAR
Florian Frohn, Matthias Naaf, Jera Hensel, Marc Brockschmidt, Jürgen Giesl
2016 B conf
Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution.
SEFM
Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder
2015 A conf
AProVE: Termination and Memory Safety of C Programs - (Competition Contribution).
TACAS
Thomas Ströder, Cornelius Aschermann, Florian Frohn, Jera Hensel, Jürgen Giesl
2015 — conf
Inferring Lower Bounds for Runtime Complexity.
RTA
Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder
2015 A conf
Termination Competition (termCOMP 2015).
CADE
Jürgen Giesl, Frédéric Mesnard, Albert Rubio, René Thiemann, Johannes Waldmann
2014 A conf
Alternating Runtime and Size Complexity Analysis of Integer Programs.
TACAS
Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl
2014 A conf
Proving Termination and Memory Safety for Programs with Pointer Arithmetic.
IJCAR
Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp
2014 A conf
Proving Termination of Programs Automatically with AProVE.
IJCAR
Jürgen Giesl, Marc Brockschmidt, Fabian Emmes, Florian Frohn, Carsten Fuhs, Carsten Otto, Martin Plücker, Peter Schneider-Kamp, Thomas Ströder, Stephanie Swiderski, René Thiemann
2013 J jnl
Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs.
J. Autom. Reason.
Lars Noschinski, Fabian Emmes, Jürgen Giesl
2013 C conf
Automated Termination Analysis: From Term Rewriting to Programming Languages.
Software Engineering (Workshops)
Jürgen Giesl
2012 A* conf
Automated Termination Proofs for Java Programs with Cyclic Data.
CAV
Marc Brockschmidt, Richard Musiol, Carsten Otto, Jürgen Giesl
2012 — conf
Exotic Semi-Ring Constraints.
SMT@IJCAR
Michael Codish, Yoav Fekete, Carsten Fuhs, Jürgen Giesl, Johannes Waldmann
2012 A conf
Proving Non-looping Non-termination Automatically.
IJCAR
Fabian Emmes, Tim Enger, Jürgen Giesl
2012 J jnl
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs.
J. Autom. Reason.
Michael Codish, Jürgen Giesl, Peter Schneider-Kamp, René Thiemann
2012 C conf
Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs.
LOPSTR
Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs
2012 C conf
Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs.
PPDP
Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs
2011 A conf
A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems.
CADE
Lars Noschinski, Fabian Emmes, Jürgen Giesl
2011 C conf
A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog.
LOPSTR
Thomas Ströder, Fabian Emmes, Peter Schneider-Kamp, Jürgen Giesl, Carsten Fuhs
2011 — conf
Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode.
FoVeOOS
Marc Brockschmidt, Thomas Ströder, Carsten Otto, Jürgen Giesl
2011 J jnl
Automated termination proofs for haskell by term rewriting.
ACM Trans. Program. Lang. Syst.
Jürgen Giesl, Matthias Raffelsieper, Peter Schneider-Kamp, Stephan Swiderski, René Thiemann
2011 — conf
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting.
RTA
Marc Brockschmidt, Carsten Otto, Jürgen Giesl
2011 J jnl
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs.
Theory Pract. Log. Program.
Manh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp
2011 J jnl
Preface: Special Issue of Selected Extended Papers of IJCAR 2010.
J. Autom. Reason.
Jürgen Giesl, Reiner Hähnle
2011 J jnl
Proving Termination by Dependency Pairs and Inductive Theorem Proving.
J. Autom. Reason.
Carsten Fuhs, Jürgen Giesl, Michael Parting, Peter Schneider-Kamp, Stephan Swiderski
2011 J jnl
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers
CoRR
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl
2011 J jnl
SAT-based termination analysis using monotonicity constraints over the integers.
Theory Pract. Log. Program.
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl
2011 B conf
Termination of Isabelle Functions via Termination of Rewriting.
ITP
Alexander Krauss, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl
2010 A ed.
Automated Reasoning, 5th International Joint Conference, IJCAR 2010, Edinburgh, UK, July 16-19, 2010. Proceedings
IJCAR
Jürgen Giesl, Reiner Hähnle
2010 J jnl
Automated Termination Analysis for Logic Programs with Cut
CoRR
Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann
2010 — conf
Automated Termination Analysis of Java Bytecode by Term Rewriting.
RTA
Carsten Otto, Marc Brockschmidt, Christian von Essen, Jürgen Giesl
2010 J jnl
Automated termination analysis for logic programs with cut.
Theory Pract. Log. Program.
Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann
2010 J jnl
Current Trends in Automated Deduction.
Künstliche Intell.
Jürgen Giesl
2010 C conf
Dependency Triples for Improving Termination Analysis of Logic Programs with Cut.
LOPSTR
Thomas Ströder, Peter Schneider-Kamp, Jürgen Giesl
2010 — conf
Lazy Abstraction for Size-Change Termination.
LPAR (Yogyakarta)
Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp
2010 — conf
Loops under Strategies ... Continued
IWS
René Thiemann, Christian Sternagel, Jürgen Giesl, Peter Schneider-Kamp
2010 J jnl
Special Issue on Automated Deduction.
Künstliche Intell.
Jürgen Giesl
2010 — conf
Termination Graphs for Java Bytecode.
Verification, Induction, Termination Analysis
Marc Brockschmidt, Carsten Otto, Christian von Essen, Jürgen Giesl
2009 — conf
09411 Abstracts Collection - Interaction versus Automation: The two Faces of Deduction.
Interaction versus Automation: The two Faces of Deduction
Thomas Ball, Jürgen Giesl, Reiner Hähnle, Tobias Nipkow
2009 — conf
09411 Executive Summary - Interaction versus Automation: The two Faces of Deductions.
Interaction versus Automation: The two Faces of Deduction
Thomas Ball, Jürgen Giesl, Reiner Hähnle, Tobias Nipkow
2009 J jnl
Automated termination proofs for logic programs by term rewriting.
ACM Trans. Comput. Log.
Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann
2009 — conf
Inductive Theorem Proving meets Dependency Pairs.
Interaction versus Automation: The two Faces of Deduction
Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp
2009 — ed.
Interaction versus Automation: The two Faces of Deduction, 04.10. - 09.10.2009
Interaction versus Automation: The two Faces of Deduction
Thomas Ball, Jürgen Giesl, Reiner Hähnle, Tobias Nipkow
2009 J jnl
Polytool: polynomial interpretations as a basis for termination analysis of Logic programs
CoRR
Manh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp
2009 — conf
Proving Termination of Integer Term Rewriting.
RTA
Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke
2009 A conf
Termination Analysis by Dependency Pairs and Inductive Theorem Proving.
CADE
Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp
2009 — conf
Termination of Integer Term Rewriting.
Interaction versus Automation: The two Faces of Deduction
Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke
2009 C conf
The Dependency Triple Framework for Termination of Logic Programs.
LOPSTR
Peter Schneider-Kamp, Jürgen Giesl, Manh Thang Nguyen
2008 J jnl
Adding constants to string rewriting.
Appl. Algebra Eng. Commun. Comput.
René Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp
2008 J jnl
Automated Termination Proofs for Logic Programs by Term Rewriting
CoRR
Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann
2008 — conf
Deciding Innermost Loops.
RTA
René Thiemann, Jürgen Giesl, Peter Schneider-Kamp
2008 B conf
Improving Context-Sensitive Dependency Pairs.
LPAR
Beatriz Alarcón, Fabian Emmes, Carsten Fuhs, Jürgen Giesl, Raúl Gutiérrez, Salvador Lucas, Peter Schneider-Kamp, René Thiemann
2008 — conf
Maximal Termination.
RTA
Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl
2008 — ed.
Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming, WRS@RDP 2007, Paris, France, June 25, 2007
WRS@RDP
Jürgen Giesl
2008 — conf
Search Techniques for Rational Polynomial Orders.
AISC/MKM/Calculemus
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto, Jürgen Giesl, Salvador Lucas, Peter Schneider-Kamp
2007 — conf
07401 Abstracts Collection -- Deduction and Decision Procedures.
Deduction and Decision Procedures
Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis
2007 — conf
07401 Executive Summary -- Deduction and Decision Procedures.
Deduction and Decision Procedures
Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis
2007 J jnl
Deaccumulation techniques for improving provability.
J. Log. Algebraic Methods Program.
Jürgen Giesl, Armin Kühnemann, Janis Voigtländer
2007 — conf
Decision Procedures for Loop Detection.
Deduction and Decision Procedures
René Thiemann, Jürgen Giesl, Peter Schneider-Kamp
2007 — ed.
Deduction and Decision Procedures, 30.09. - 05.10.2007
Deduction and Decision Procedures
Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis
2007 — conf
Implementing RPO and POLO using SAT.
Deduction and Decision Procedures
Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, Harald Zankl
2007 — conf
Preface.
WRS@RDP
Jürgen Giesl
2007 — conf
Proving Termination Using Recursive Path Orders and SAT Solving.
FroCoS
Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl
2007 A conf
Proving Termination by Bounded Increase.
CADE
Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp
2007 J jnl
RTA 2005.
Inf. Comput.
Jürgen Giesl
2007 A conf
SAT Solving for Termination Analysis with Polynomial Interpretations.
SAT
Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl
2007 C conf
Termination Analysis of Logic Programs Based on Dependency Graphs.
LOPSTR
Manh Thang Nguyen, Jürgen Giesl, Peter Schneider-Kamp, Danny De Schreye
2007 — conf
Termination of Programs using Term Rewriting and SAT Solving.
Deduction and Decision Procedures
Jürgen Giesl, Peter Schneider-Kamp, René Thiemann, Stephan Swiderski, Manh Thang Nguyen, Danny De Schreye, Alexander Serebrenik
2006 — conf
Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages.
RTA
Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann
2006 C conf
Automated Termination Analysis for Logic Programs by Term Rewriting.
LOPSTR
Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann
2006 A conf
Automatic Termination Proofs in the Dependency Pair Framework.
IJCAR
Jürgen Giesl, Peter Schneider-Kamp, René Thiemann
2006 J jnl
Mechanizing and Improving Dependency Pairs.
J. Autom. Reason.
Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke
2006 J jnl
SAT Solving for Argument Filterings
CoRR
Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl
2006 B conf
SAT Solving for Argument Filterings.
LPAR
Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl
2006 J jnl
Third Special Issue on Techniques for Automated Termination Proofs.
J. Autom. Reason.
Jürgen Giesl, Deepak Kapur
2005 J jnl
Preface.
J. Autom. Reason.
Jürgen Giesl, Deepak Kapur
2005 J jnl
Preface.
J. Autom. Reason.
Jürgen Giesl, Deepak Kapur
2005 — conf
Proving and Disproving Termination in the Dependency Pair Framework.
Deduction and Applications
Jürgen Giesl, René Thiemann, Peter Schneider-Kamp
2005 — conf
Proving and Disproving Termination of Higher-Order Functions.
FroCoS
Jürgen Giesl, René Thiemann, Peter Schneider-Kamp
2005 — ed.
Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings
RTA
Jürgen Giesl
2005 J jnl
The size-change principle and dependency pairs for termination of term rewriting.
Appl. Algebra Eng. Commun. Comput.
René Thiemann, Jürgen Giesl
2004 — conf
Automated Termination Proofs with AProVE.
RTA
Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke
2004 A conf
Improved Modular Termination Proofs Using Dependency Pairs.
IJCAR
René Thiemann, Jürgen Giesl, Peter Schneider-Kamp
2004 B conf
The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs.
LPAR
Jürgen Giesl, René Thiemann, Peter Schneider-Kamp
2004 J jnl
Transformation techniques for context-sensitive rewrite systems.
J. Funct. Program.
Jürgen Giesl, Aart Middeldorp
2003 — conf
Deaccumulation - Improving Provability.
ASIAN
Jürgen Giesl, Armin Kühnemann, Janis Voigtländer
2003 A conf
Deciding Inductive Validity of Equations.
CADE
Jürgen Giesl, Deepak Kapur
2003 B conf
Improving Dependency Pairs.
LPAR
Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke
2003 — conf
Liveness in Rewriting.
RTA
Jürgen Giesl, Hans Zantema
2003 — conf
Simulating liveness by reduction strategies.
WRS
Jürgen Giesl, Hans Zantema
2003 — conf
Size-Change Termination for Term Rewriting.
RTA
René Thiemann, Jürgen Giesl
2002 C conf
Innermost Termination of Context-Sensitive Rewriting.
Developments in Language Theory
Jürgen Giesl, Aart Middeldorp
2002 J jnl
Modular Termination Proofs for Rewriting Using Dependency Pairs.
J. Symb. Comput.
Jürgen Giesl, Thomas Arts, Enno Ohlebusch
2001 A conf
Decidable Classes of Inductive Theorems.
IJCAR
Jürgen Giesl, Deepak Kapur
2001 — conf
Dependency Pairs for Equational Rewriting.
RTA
Jürgen Giesl, Deepak Kapur
2001 J jnl
Induction Proofs with Partial Functions.
J. Autom. Reason.
Jürgen Giesl
2001 J jnl
Special Issue "Termination".
Appl. Algebra Eng. Commun. Comput.
Jürgen Giesl, Pierre Lescanne
2001 J jnl
Verification of Erlang Processes by Dependency Pairs.
Appl. Algebra Eng. Commun. Comput.
Jürgen Giesl, Thomas Arts
2000 — conf
Closure Induction in a Z-Like Language.
ZB
David A. Duffy, Jürgen Giesl
2000 A conf
Eliminating Dummy Elimination.
CADE
Jürgen Giesl, Aart Middeldorp
2000 B conf
Equational Termination by Semantic Labelling.
CSL
Hitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl
2000 J jnl
Termination of term rewriting using dependency pairs.
Theor. Comput. Sci.
Thomas Arts, Jürgen Giesl
1999 B conf
Applying Rewriting Techniques to the Verification of Erlang Processes.
CSL
Thomas Arts, Jürgen Giesl
1999 J jnl
Approximating the Domains of Functional and Imperative Programs.
Sci. Comput. Program.
Jürgen Brauburger, Jürgen Giesl
1999 C conf
Context-Moving Transformations for Function Verification.
LOPSTR
Jürgen Giesl
1999 — conf
Transforming Context-Sensitive Rewrite Systems.
RTA
Jürgen Giesl, Aart Middeldorp
1998 — conf
Modularity of Termination Using Dependency pairs.
RTA
Thomas Arts, Jürgen Giesl
1998 — conf
Pushing the Frontiers of Combining Rewrite Systems Farther Outwards.
FroCoS
Jürgen Giesl, Enno Ohlebusch
1998 A conf
Termination Analysis by Inductive Evaluation.
CADE
Jürgen Brauburger, Jürgen Giesl
1997 — conf
Automatically Proving Termination Where Simplification Orderings Fail.
TAPSOFT
Thomas Arts, Jürgen Giesl
1997 — conf
Proving Innermost Normalisation Automatically.
RTA
Thomas Arts, Jürgen Giesl
1997 J jnl
Termination of Nested and Mutually Recursive Algorithms.
J. Autom. Reason.
Jürgen Giesl
1996 B conf
Termination Analysis for Partial Functions.
SAS
Jürgen Brauburger, Jürgen Giesl
1996 — conf
Termination of Constructor Systems.
RTA
Thomas Arts, Jürgen Giesl
1995 Misc conf
Automated Termination Proofs with Measure Functions.
KI
Jürgen Giesl
1995 — —
Automatisierung von Terminierungsbeweisen für rekursiv definierte Algorithmen.
Jürgen Giesl
1995 — conf
Generating Polynomial Orderings for Termination Proofs.
RTA
Jürgen Giesl
1995 B conf
Termination Analysis for Functional Programs using Term Orderings
SAS
Jürgen Giesl
1994 Misc conf
Strategies for Semantical Contractions.
KI
Jürgen Giesl, Ingrid Neumann
1993 Misc conf
The Semantics of Rational Contractions.
EPIA
Jürgen Giesl, Ingrid Neumann