default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJürgen Giesl
Person information
- affiliation: RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j37]Marcel Hark, Florian Frohn, Jürgen Giesl:
Termination of triangular polynomial loops. Formal Methods Syst. Des. 65(1): 70-132 (2025)- [c100]Nils Lommen, Jürgen Giesl:
AProVE(KoAT+LoAT) - (Competition Contribution). TACAS (3) 2025: 205-211 - [i47]Florian Frohn, Jürgen Giesl:
Infinite State Model Checking by Learning Transitive Relations. CoRR abs/2502.04761 (2025) - 2024
- [c99]Jan-Christoph Kassing
, Jürgen Giesl:
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting. Principles of Verification (1) 2024: 339-366 - [c98]Jan-Christoph Kassing, Stefan Dollase, Jürgen Giesl:
A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting. FLOPS 2024: 62-80 - [c97]Florian Frohn, Jürgen Giesl:
Integrating Loop Acceleration Into Bounded Model Checking. FM (1) 2024: 73-91 - [c96]Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl:
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting. FoSSaCS (2) 2024: 206-228 - [c95]Franz Baader, Jürgen Giesl:
On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems. FSCD 2024: 16:1-16:18 - [c94]Nils Lommen, Éléanore Meyer, Jürgen Giesl:
Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT (Short Paper) - (Short Paper). IJCAR (1) 2024: 233-243 - [c93]Florian Frohn, Jürgen Giesl:
Satisfiability Modulo Exponential Integer Arithmetic. IJCAR (1) 2024: 344-365 - [c92]Jan-Christoph Kassing, Grigory Vartanyan, Jürgen Giesl:
A Dependency Pair Framework for Relative Termination of Term Rewriting. IJCAR (2) 2024: 360-380 - [d4]Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl:
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting - AProVE Artifact. Version 1. Zenodo, 2024 [all versions]
- [d3]Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl:
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting - AProVE Artifact. Version 2. Zenodo, 2024 [all versions] - [d2]Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl:
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting - AProVE Artifact. Version 3. Zenodo, 2024 [all versions] - [d1]Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl:
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting - AProVE Artifact. Version 4. Zenodo, 2024 [all versions] - [i46]Florian Frohn, Jürgen Giesl:
Accelerated Bounded Model Checking. CoRR abs/2401.09973 (2024) - [i45]Florian Frohn, Jürgen Giesl:
Satisfiability Modulo Exponential Integer Arithmetic. CoRR abs/2402.01501 (2024) - [i44]Nils Lommen, Éléanore Meyer, Jürgen Giesl:
Control-Flow Refinement for Probabilistic Programs in KoAT. CoRR abs/2402.03891 (2024) - [i43]Jan-Christoph Kassing, Grigory Vartanyan, Jürgen Giesl:
A Dependency Pair Framework for Relative Termination of Term Rewriting. CoRR abs/2404.15248 (2024) - [i42]Jan-Christoph Kassing, Jürgen Giesl:
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting. CoRR abs/2408.06768 (2024) - [i41]Jan-Christoph Kassing, Jürgen Giesl:
From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity. CoRR abs/2409.17714 (2024) - [i40]Nils Lommen, Éléanore Meyer, Jürgen Giesl:
Targeting Completeness: Automated Complexity Analysis of Integer Programs. CoRR abs/2412.01832 (2024) - [i39]Franz Baader, Jürgen Giesl:
Small Term Reachability and Related Problems for Terminating Term Rewriting Systems. CoRR abs/2412.06047 (2024) - [i38]Jan-Christoph Kassing, Jürgen Giesl:
The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting. CoRR abs/2412.20220 (2024) - 2023
- [c91]Florian Frohn, Jürgen Giesl:
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper). CADE 2023: 220-233 - [c90]Jera Hensel, Jürgen Giesl:
Proving Termination of C Programs with Lists. CADE 2023: 266-285 - [c89]Jan-Christoph Kassing, Jürgen Giesl:
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs. CADE 2023: 344-364 - [c88]Nils Lommen, Jürgen Giesl:
Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs. FroCoS 2023: 3-22 - [c87]Florian Frohn, Jürgen Giesl:
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses. SAS 2023: 259-285 - [i37]Frank Emrich, Jera Hensel, Jürgen Giesl:
AProVE: Modular Termination Analysis of Memory-Manipulating C Programs. CoRR abs/2302.02382 (2023) - [i36]Florian Frohn, Jürgen Giesl:
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses. CoRR abs/2303.01827 (2023) - [i35]Florian Frohn, Jürgen Giesl:
Proving Non-Termination by Acceleration Driven Clause Learning with LoAT. CoRR abs/2304.10166 (2023) - [i34]Jan-Christoph Kassing, Jürgen Giesl:
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs. CoRR abs/2305.11741 (2023) - [i33]Jera Hensel, Jürgen Giesl:
Proving Termination of C Programs with Lists. CoRR abs/2305.12159 (2023) - [i32]Nils Lommen, Jürgen Giesl:
Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs. CoRR abs/2307.06921 (2023) - [i31]Florian Frohn, Jürgen Giesl:
Proving Non-Termination by Acceleration Driven Clause Learning (Short WST Version). CoRR abs/2307.09839 (2023) - [i30]Jan-Christoph Kassing, Jürgen Giesl:
Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting (Short WST Version). CoRR abs/2307.10002 (2023) - [i29]Nils Lommen, Eleanore Meyer, Jürgen Giesl:
Automated Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops (Short WST Version). CoRR abs/2307.10061 (2023) - [i28]Jera Hensel, Jürgen Giesl:
Automated Termination Proofs for C Programs with Lists (Short WST Version). CoRR abs/2307.11024 (2023) - [i27]Jan-Christoph Kassing, Jürgen Giesl:
Improving Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting. CoRR abs/2309.00344 (2023) - [i26]Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl:
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting. CoRR abs/2310.06121 (2023) - 2022
- [c86]Jürgen Giesl, Nils Lommen, Marcel Hark, Fabian Meyer:
Improving Automatic Complexity Analysis of Integer Programs. The Logic of Software. A Tasting Menu of Formal Methods 2022: 193-228 - [c85]Florian Frohn, Jürgen Giesl:
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description). IJCAR 2022: 712-722 - [c84]Nils Lommen, Fabian Meyer, Jürgen Giesl:
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops. IJCAR 2022: 734-754 - [c83]Jera Hensel, Constantin Mensendiek, Jürgen Giesl:
AProVE: Non-Termination Witnesses for C Programs - (Competition Contribution). TACAS (2) 2022: 403-407 - [i25]Jürgen Giesl, Nils Lommen, Marcel Hark, Fabian Meyer:
Improving Automatic Complexity Analysis of Integer Programs. CoRR abs/2202.01769 (2022) - [i24]Florian Frohn, Jürgen Giesl:
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description). CoRR abs/2202.04546 (2022) - [i23]Nils Lommen, Fabian Meyer, Jürgen Giesl:
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops. CoRR abs/2205.08869 (2022) - 2021
- [c82]Fabian Meyer, Marcel Hark, Jürgen Giesl:
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes. TACAS (1) 2021: 250-269 - 2020
- [j36]Marcel Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen:
Aiming low is harder: induction for lower bounds in probabilistic program verification. Proc. ACM Program. Lang. 4(POPL): 37:1-37:28 (2020) - [j35]Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl:
Inferring Lower Runtime Bounds for Integer Programs. ACM Trans. Program. Lang. Syst. 42(3): 13:1-13:50 (2020) - [c81]Marcel Hark, Florian Frohn, Jürgen Giesl:
Polynomial Loops: Beyond Termination. LPAR 2020: 279-297 - [c80]Florian Frohn, Marcel Hark, Jürgen Giesl:
Termination of Polynomial Loops. SAS 2020: 89-112 - [i22]Fabian Meyer, Marcel Hark, Jürgen Giesl:
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes. CoRR abs/2010.06367 (2020)
2010 – 2019
- 2019
- [c79]Jürgen Giesl, Peter Giesl, Marcel Hark:
Computing Expected Runtimes for Constant Probability Programs. CADE 2019: 269-286 - [c78]Florian Frohn, Jürgen Giesl:
Termination of Triangular Integer Loops is Decidable. CAV (2) 2019: 426-444 - [c77]Florian Frohn, Jürgen Giesl:
Proving Non-Termination via Loop Acceleration. FMCAD 2019: 221-230 - [c76]Jürgen Giesl, Albert Rubio, Christian Sternagel, Johannes Waldmann, Akihisa Yamada:
The Termination and Complexity Competition. TACAS (3) 2019: 156-166 - [i21]Marcel Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen:
Aiming Low Is Harder - Inductive Proof Rules for Lower Bounds on Weakest Preexpectations in Probabilistic Program Verification. CoRR abs/1904.01117 (2019) - [i20]Florian Frohn, Jürgen Giesl:
Termination of Triangular Integer Loops is Decidable. CoRR abs/1905.08664 (2019) - [i19]Jürgen Giesl, Peter Giesl, Marcel Hark:
Computing Expected Runtimes for Constant Probability Programs. CoRR abs/1905.09544 (2019) - [i18]Florian Frohn, Jürgen Giesl:
Proving Non-Termination via Loop Acceleration. CoRR abs/1905.11187 (2019) - [i17]Florian Frohn, Marcel Hark, Jürgen Giesl:
On the Decidability of Termination for Polynomial Loops. CoRR abs/1910.11588 (2019) - [i16]Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl:
Inferring Lower Runtime Bounds for Integer Programs. CoRR abs/1911.01077 (2019) - 2018
- [j34]Florian Frohn, Jürgen Giesl:
Constant runtime complexity of term rewriting is semi-decidable. Inf. Process. Lett. 139: 18-23 (2018) - [j33]Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder:
Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution. J. Log. Algebraic Methods Program. 97: 105-130 (2018) - 2017
- [j32]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:
Analyzing Program Termination and Complexity Automatically with AProVE. J. Autom. Reason. 58(1): 3-31 (2017) - [j31]Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp, Cornelius Aschermann:
Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic. J. Autom. Reason. 58(1): 33-65 (2017) - [j30]Jürgen Giesl, Jan Hoffmann:
Preface: Special Issue on Automatic Resource Bound Analysis. J. Autom. Reason. 59(1): 1-2 (2017) - [j29]Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder:
Lower Bounds for Runtime Complexity of Term Rewriting. J. Autom. Reason. 59(1): 121-163 (2017) - [c75]Matthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs, Jürgen Giesl:
Complexity Analysis for Term Rewriting by Integer Transition Systems. FroCoS 2017: 132-150 - [c74]Florian Frohn, Jürgen Giesl:
Complexity Analysis for Java with AProVE. IFM 2017: 85-101 - [c73]Florian Frohn, Jürgen Giesl:
Analyzing Runtime Complexity via Innermost Runtime Complexity. LPAR 2017: 249-268 - [c72]Jera Hensel, Frank Emrich, Florian Frohn, Thomas Ströder, Jürgen Giesl:
AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs - (Competition Contribution). TACAS (2) 2017: 350-354 - 2016
- [j28]Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl:
Analyzing Runtime and Size Complexity of Integer Programs. ACM Trans. Program. Lang. Syst. 38(4): 13:1-13:50 (2016) - [c71]Florian Frohn, Matthias Naaf, Jera Hensel, Marc Brockschmidt, Jürgen Giesl:
Lower Runtime Bounds for Integer Programs. IJCAR 2016: 550-567 - [c70]Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder:
Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution. SEFM 2016: 234-252 - 2015
- [c69]Jürgen Giesl, Frédéric Mesnard, Albert Rubio, René Thiemann, Johannes Waldmann:
Termination Competition (termCOMP 2015). CADE 2015: 105-108 - [c68]Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder:
Inferring Lower Bounds for Runtime Complexity. RTA 2015: 334-349 - [c67]Thomas Ströder, Cornelius Aschermann, Florian Frohn, Jera Hensel, Jürgen Giesl:
AProVE: Termination and Memory Safety of C Programs - (Competition Contribution). TACAS 2015: 417-419 - 2014
- [c66]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:
Proving Termination of Programs Automatically with AProVE. IJCAR 2014: 184-191 - [c65]Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp:
Proving Termination and Memory Safety for Programs with Pointer Arithmetic. IJCAR 2014: 208-223 - [c64]Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl:
Alternating Runtime and Size Complexity Analysis of Integer Programs. TACAS 2014: 140-155 - 2013
- [j27]Lars Noschinski, Fabian Emmes, Jürgen Giesl:
Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs. J. Autom. Reason. 51(1): 27-56 (2013) - [c63]Jürgen Giesl:
Automated Termination Analysis: From Term Rewriting to Programming Languages. Software Engineering (Workshops) 2013: 21-22 - 2012
- [j26]Michael Codish, Jürgen Giesl, Peter Schneider-Kamp, René Thiemann:
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs. J. Autom. Reason. 49(1): 53-93 (2012) - [c62]Michael Codish, Yoav Fekete, Carsten Fuhs, Jürgen Giesl, Johannes Waldmann:
Exotic Semi-Ring Constraints. SMT@IJCAR 2012: 88-97 - [c61]Fabian Emmes, Tim Enger, Jürgen Giesl:
Proving Non-looping Non-termination Automatically. IJCAR 2012: 225-240 - [c60]Marc Brockschmidt, Richard Musiol, Carsten Otto, Jürgen Giesl:
Automated Termination Proofs for Java Programs with Cyclic Data. CAV 2012: 105-122 - [c59]Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs:
Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs. LOPSTR 2012: 1 - [c58]Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs:
Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs. PPDP 2012: 1-12 - 2011
- [j25]Carsten Fuhs, Jürgen Giesl, Michael Parting, Peter Schneider-Kamp, Stephan Swiderski:
Proving Termination by Dependency Pairs and Inductive Theorem Proving. J. Autom. Reason. 47(2): 133-160 (2011) - [j24]Jürgen Giesl, Reiner Hähnle:
Preface: Special Issue of Selected Extended Papers of IJCAR 2010. J. Autom. Reason. 47(4): 337-339 (2011) - [j23]Jürgen Giesl, Matthias Raffelsieper, Peter Schneider-Kamp, Stephan Swiderski, René Thiemann:
Automated termination proofs for haskell by term rewriting. ACM Trans. Program. Lang. Syst. 33(2): 7:1-7:39 (2011) - [j22]Manh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp:
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs. Theory Pract. Log. Program. 11(1): 33-63 (2011) - [j21]Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl:
SAT-based termination analysis using monotonicity constraints over the integers. Theory Pract. Log. Program. 11(4-5): 503-520 (2011) - [c57]Lars Noschinski, Fabian Emmes, Jürgen Giesl:
A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems. CADE 2011: 422-438 - [c56]Marc Brockschmidt, Thomas Ströder, Carsten Otto, Jürgen Giesl:
Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode. FoVeOOS 2011: 123-141 - [c55]Alexander Krauss, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl:
Termination of Isabelle Functions via Termination of Rewriting. ITP 2011: 152-167 - [c54]Thomas Ströder, Fabian Emmes, Peter Schneider-Kamp, Jürgen Giesl, Carsten Fuhs:
A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog. LOPSTR 2011: 237-252 - [c53]Marc Brockschmidt, Carsten Otto, Jürgen Giesl:
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting. RTA 2011: 155-170 - [i15]Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl:
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers. CoRR abs/1107.5980 (2011) - 2010
- [j20]Jürgen Giesl:
Special Issue on Automated Deduction. Künstliche Intell. 24(1): 7-9 (2010) - [j19]Jürgen Giesl:
Current Trends in Automated Deduction. Künstliche Intell. 24(1): 11-13 (2010) - [j18]Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann:
Automated termination analysis for logic programs with cut. Theory Pract. Log. Program. 10(4-6): 365-381 (2010) - [c52]Marc Brockschmidt, Carsten Otto, Christian von Essen, Jürgen Giesl:
Termination Graphs for Java Bytecode. Verification, Induction, Termination Analysis 2010: 17-37 - [c51]Thomas Ströder, Peter Schneider-Kamp, Jürgen Giesl:
Dependency Triples for Improving Termination Analysis of Logic Programs with Cut. LOPSTR 2010: 184-199 - [c50]Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp:
Lazy Abstraction for Size-Change Termination. LPAR (Yogyakarta) 2010: 217-232 - [c49]Carsten Otto, Marc Brockschmidt, Christian von Essen, Jürgen Giesl:
Automated Termination Analysis of Java Bytecode by Term Rewriting. RTA 2010: 259-276 - [c48]René Thiemann, Christian Sternagel, Jürgen Giesl, Peter Schneider-Kamp:
Loops under Strategies ... Continued. IWS 2010: 51-65 - [e5]Jürgen Giesl, Reiner Hähnle:
Automated Reasoning, 5th International Joint Conference, IJCAR 2010, Edinburgh, UK, July 16-19, 2010. Proceedings. Lecture Notes in Computer Science 6173, Springer 2010, ISBN 978-3-642-14202-4 [contents] - [i14]Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann:
Automated Termination Analysis for Logic Programs with Cut. CoRR abs/1007.4908 (2010)
2000 – 2009
- 2009
- [j17]Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann:
Automated termination proofs for logic programs by term rewriting. ACM Trans. Comput. Log. 11(1): 2:1-2:52 (2009) - [c47]Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp:
Termination Analysis by Dependency Pairs and Inductive Theorem Proving. CADE 2009: 322-338 - [c46]Peter Schneider-Kamp, Jürgen Giesl, Manh Thang Nguyen:
The Dependency Triple Framework for Termination of Logic Programs. LOPSTR 2009: 37-51 - [c45]Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke:
Proving Termination of Integer Term Rewriting. RTA 2009: 32-47 - [e4]Thomas Ball, Jürgen Giesl, Reiner Hähnle, Tobias Nipkow:
Interaction versus Automation: The two Faces of Deduction, 04.10. - 09.10.2009. Dagstuhl Seminar Proceedings 09411, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i13]Thomas Ball, Jürgen Giesl, Reiner Hähnle, Tobias Nipkow:
09411 Abstracts Collection - Interaction versus Automation: The two Faces of Deduction. Interaction versus Automation: The two Faces of Deduction 2009 - [i12]Thomas Ball, Jürgen Giesl, Reiner Hähnle, Tobias Nipkow:
09411 Executive Summary - Interaction versus Automation: The two Faces of Deductions. Interaction versus Automation: The two Faces of Deduction 2009 - [i11]Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke:
Termination of Integer Term Rewriting. Interaction versus Automation: The two Faces of Deduction 2009 - [i10]Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp:
Inductive Theorem Proving meets Dependency Pairs. Interaction versus Automation: The two Faces of Deduction 2009 - [i9]Manh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp:
Polytool: polynomial interpretations as a basis for termination analysis of Logic programs. CoRR abs/0912.4360 (2009) - 2008
- [j16]René Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp:
Adding constants to string rewriting. Appl. Algebra Eng. Commun. Comput. 19(1): 27-38 (2008) - [c44]Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto, Jürgen Giesl, Salvador Lucas, Peter Schneider-Kamp:
Search Techniques for Rational Polynomial Orders. AISC/MKM/Calculemus 2008: 109-124 - [c43]Beatriz Alarcón, Fabian Emmes, Carsten Fuhs, Jürgen Giesl, Raúl Gutiérrez, Salvador Lucas, Peter Schneider-Kamp, René Thiemann:
Improving Context-Sensitive Dependency Pairs. LPAR 2008: 636-651 - [c42]Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl:
Maximal Termination. RTA 2008: 110-125 - [c41]René Thiemann, Jürgen Giesl, Peter Schneider-Kamp:
Deciding Innermost Loops. RTA 2008: 366-380 - [e3]Jürgen Giesl:
Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming, WRS@RDP 2007, Paris, France, June 25, 2007. Electronic Notes in Theoretical Computer Science 204, Elsevier 2008 [contents] - [i8]Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann:
Automated Termination Proofs for Logic Programs by Term Rewriting. CoRR abs/0803.0014 (2008) - 2007
- [j15]Jürgen Giesl:
RTA 2005. Inf. Comput. 205(4): 417-418 (2007) - [j14]Jürgen Giesl, Armin Kühnemann, Janis Voigtländer:
Deaccumulation techniques for improving provability. J. Log. Algebraic Methods Program. 71(2): 79-113 (2007) - [c40]Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp:
Proving Termination by Bounded Increase. CADE 2007: 443-459 - [c39]Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl:
Proving Termination Using Recursive Path Orders and SAT Solving. FroCoS 2007: 267-282 - [c38]Manh Thang Nguyen, Jürgen Giesl, Peter Schneider-Kamp, Danny De Schreye:
Termination Analysis of Logic Programs Based on Dependency Graphs. LOPSTR 2007: 8-22 - [c37]Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl:
SAT Solving for Termination Analysis with Polynomial Interpretations. SAT 2007: 340-354 - [c36]Jürgen Giesl:
Preface. WRS@RDP 2007: 1-2 - [e2]Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis:
Deduction and Decision Procedures, 30.09. - 05.10.2007. Dagstuhl Seminar Proceedings 07401, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [i7]Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis:
07401 Executive Summary -- Deduction and Decision Procedures. Deduction and Decision Procedures 2007 - [i6]Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis:
07401 Abstracts Collection -- Deduction and Decision Procedures. Deduction and Decision Procedures 2007 - [i5]Jürgen Giesl, Peter Schneider-Kamp, René Thiemann, Stephan Swiderski, Manh Thang Nguyen, Danny De Schreye, Alexander Serebrenik:
Termination of Programs using Term Rewriting and SAT Solving. Deduction and Decision Procedures 2007 - [i4]Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, Harald Zankl:
Implementing RPO and POLO using SAT. Deduction and Decision Procedures 2007 - [i3]René Thiemann, Jürgen Giesl, Peter Schneider-Kamp:
Decision Procedures for Loop Detection. Deduction and Decision Procedures 2007 - 2006
- [j13]Jürgen Giesl, Deepak Kapur:
Third Special Issue on Techniques for Automated Termination Proofs. J. Autom. Reason. 37(3): 153-154 (2006) - [j12]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke:
Mechanizing and Improving Dependency Pairs. J. Autom. Reason. 37(3): 155-203 (2006) - [c35]Jürgen Giesl, Peter Schneider-Kamp, René Thiemann:
Automatic Termination Proofs in the Dependency Pair Framework. IJCAR 2006: 281-286 - [c34]Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann:
Automated Termination Analysis for Logic Programs by Term Rewriting. LOPSTR 2006: 177-193 - [c33]Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl:
SAT Solving for Argument Filterings. LPAR 2006: 30-44 - [c32]Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann:
Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. RTA 2006: 297-312 - [i2]Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl:
SAT Solving for Argument Filterings. CoRR abs/cs/0605074 (2006) - 2005
- [j11]René Thiemann, Jürgen Giesl:
The size-change principle and dependency pairs for termination of term rewriting. Appl. Algebra Eng. Commun. Comput. 16(4): 229-270 (2005) - [j10]Jürgen Giesl, Deepak Kapur:
Preface. J. Autom. Reason. 34(2): 103-104 (2005) - [j9]Jürgen Giesl, Deepak Kapur:
Preface. J. Autom. Reason. 34(4): 323 (2005) - [c31]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp:
Proving and Disproving Termination of Higher-Order Functions. FroCoS 2005: 216-231 - [e1]Jürgen Giesl:
Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings. Lecture Notes in Computer Science 3467, Springer 2005, ISBN 3-540-25596-6 [contents] - [i1]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp:
Proving and Disproving Termination in the Dependency Pair Framework. Deduction and Applications 2005 - 2004
- [j8]Jürgen Giesl, Aart Middeldorp:
Transformation techniques for context-sensitive rewrite systems. J. Funct. Program. 14(4): 379-427 (2004) - [c30]René Thiemann, Jürgen Giesl, Peter Schneider-Kamp:
Improved Modular Termination Proofs Using Dependency Pairs. IJCAR 2004: 75-90 - [c29]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp:
The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. LPAR 2004: 301-331 - [c28]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke:
Automated Termination Proofs with AProVE. RTA 2004: 210-220 - 2003
- [c27]Jürgen Giesl, Armin Kühnemann, Janis Voigtländer:
Deaccumulation - Improving Provability. ASIAN 2003: 146-160 - [c26]Jürgen Giesl, Deepak Kapur:
Deciding Inductive Validity of Equations. CADE 2003: 17-31 - [c25]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke:
Improving Dependency Pairs. LPAR 2003: 167-182 - [c24]René Thiemann, Jürgen Giesl:
Size-Change Termination for Term Rewriting. RTA 2003: 264-278 - [c23]Jürgen Giesl, Hans Zantema:
Liveness in Rewriting. RTA 2003: 321-336 - [c22]Jürgen Giesl, Hans Zantema:
Simulating liveness by reduction strategies. WRS 2003: 641-656 - 2002
- [j7]Jürgen Giesl, Thomas Arts, Enno Ohlebusch:
Modular Termination Proofs for Rewriting Using Dependency Pairs. J. Symb. Comput. 34(1): 21-58 (2002) - [c21]Jürgen Giesl, Aart Middeldorp:
Innermost Termination of Context-Sensitive Rewriting. Developments in Language Theory 2002: 231-244 - 2001
- [j6]Jürgen Giesl, Pierre Lescanne:
Special Issue "Termination". Appl. Algebra Eng. Commun. Comput. 12(1/2): 1-2 (2001) - [j5]Jürgen Giesl, Thomas Arts:
Verification of Erlang Processes by Dependency Pairs. Appl. Algebra Eng. Commun. Comput. 12(1/2): 39-72 (2001) - [j4]Jürgen Giesl:
Induction Proofs with Partial Functions. J. Autom. Reason. 26(1): 1-49 (2001) - [c20]Jürgen Giesl, Deepak Kapur:
Decidable Classes of Inductive Theorems. IJCAR 2001: 469-484 - [c19]Jürgen Giesl, Deepak Kapur:
Dependency Pairs for Equational Rewriting. RTA 2001: 93-108 - 2000
- [j3]Thomas Arts, Jürgen Giesl:
Termination of term rewriting using dependency pairs. Theor. Comput. Sci. 236(1-2): 133-178 (2000) - [c18]Jürgen Giesl, Aart Middeldorp:
Eliminating Dummy Elimination. CADE 2000: 309-323 - [c17]Hitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl:
Equational Termination by Semantic Labelling. CSL 2000: 457-471 - [c16]David A. Duffy, Jürgen Giesl:
Closure Induction in a Z-Like Language. ZB 2000: 471-490
1990 – 1999
- 1999
- [j2]Jürgen Brauburger, Jürgen Giesl:
Approximating the Domains of Functional and Imperative Programs. Sci. Comput. Program. 35(2): 113-136 (1999) - [c15]Thomas Arts, Jürgen Giesl:
Applying Rewriting Techniques to the Verification of Erlang Processes. CSL 1999: 96-110 - [c14]Jürgen Giesl:
Context-Moving Transformations for Function Verification. LOPSTR 1999: 293-312 - [c13]Jürgen Giesl, Aart Middeldorp:
Transforming Context-Sensitive Rewrite Systems. RTA 1999: 271-287 - 1998
- [c12]Jürgen Brauburger, Jürgen Giesl:
Termination Analysis by Inductive Evaluation. CADE 1998: 254-269 - [c11]Jürgen Giesl, Enno Ohlebusch:
Pushing the Frontiers of Combining Rewrite Systems Farther Outwards. FroCoS 1998: 141-160 - [c10]Thomas Arts, Jürgen Giesl:
Modularity of Termination Using Dependency pairs. RTA 1998: 226-240 - 1997
- [j1]Jürgen Giesl:
Termination of Nested and Mutually Recursive Algorithms. J. Autom. Reason. 19(1): 1-29 (1997) - [c9]Thomas Arts, Jürgen Giesl:
Proving Innermost Normalisation Automatically. RTA 1997: 157-171 - [c8]Thomas Arts, Jürgen Giesl:
Automatically Proving Termination Where Simplification Orderings Fail. TAPSOFT 1997: 261-272 - 1996
- [c7]Thomas Arts, Jürgen Giesl:
Termination of Constructor Systems. RTA 1996: 63-77 - [c6]Jürgen Brauburger, Jürgen Giesl:
Termination Analysis for Partial Functions. SAS 1996: 113-127 - 1995
- [b1]Jürgen Giesl:
Automatisierung von Terminierungsbeweisen für rekursiv definierte Algorithmen. Darmstadt University of Technology, Germany, DISKI 96, Infix 1995, ISBN 978-3-89601-096-4, pp. 1-306 - [c5]Jürgen Giesl:
Automated Termination Proofs with Measure Functions. KI 1995: 149-160 - [c4]Jürgen Giesl:
Generating Polynomial Orderings for Termination Proofs. RTA 1995: 426-431 - [c3]Jürgen Giesl:
Termination Analysis for Functional Programs using Term Orderings. SAS 1995: 154-171 - 1994
- [c2]Jürgen Giesl, Ingrid Neumann:
Strategies for Semantical Contractions. KI 1994: 396 - 1993
- [c1]Jürgen Giesl, Ingrid Neumann:
The Semantics of Rational Contractions. EPIA 1993: 356
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-22 00:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
