Jürgen Giesl

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 63

Top Venues

Darmstadt University of Technology, Germany (PHD)

Education History

Darmstadt University of Technology, Germany

PHD

Publications

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)
Florian Frohn, Jürgen Giesl
Accelerated Bounded Model Checking. CoRR (2024)
Jan-Christoph Kassing, Grigory Vartanyan, Jürgen Giesl
A Dependency Pair Framework for Relative Termination of Term Rewriting. IJCAR (2) (2024)
Jan-Christoph Kassing, Stefan Dollase, Jürgen Giesl
A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting. FLOPS (2024)
Jan-Christoph Kassing, Grigory Vartanyan, Jürgen Giesl
A Dependency Pair Framework for Relative Termination of Term Rewriting. CoRR (2024)
Nils Lommen, Éléanore Meyer, Jürgen Giesl
Control-Flow Refinement for Probabilistic Programs in KoAT. CoRR (2024)
Florian Frohn, Jürgen Giesl
Satisfiability Modulo Exponential Integer Arithmetic. CoRR (2024)
Florian Frohn, Jürgen Giesl
Satisfiability Modulo Exponential Integer Arithmetic. IJCAR (1) (2024)
Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting. FoSSaCS (2) (2024)
Franz Baader, Jürgen Giesl
On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems. FSCD (2024)
Jera Hensel, Jürgen Giesl
Automated Termination Proofs for C Programs with Lists (Short WST Version). CoRR (2023)
Florian Frohn, Jürgen Giesl
Proving Non-Termination by Acceleration Driven Clause Learning with LoAT. CoRR (2023)
Jan-Christoph Kassing, Jürgen Giesl
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs. CADE (2023)
Nils Lommen, Jürgen Giesl
Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs. CoRR (2023)
Florian Frohn, Jürgen Giesl
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses. CoRR (2023)
Florian Frohn, Jürgen Giesl
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses. SAS (2023)
Jera Hensel, Jürgen Giesl
Proving Termination of C Programs with Lists. CoRR (2023)
Nils Lommen, Jürgen Giesl
Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs. FroCoS (2023)
Florian Frohn, Jürgen Giesl
Proving Non-Termination by Acceleration Driven Clause Learning (Short WST Version). CoRR (2023)
Jera Hensel, Jürgen Giesl
Proving Termination of C Programs with Lists. CADE (2023)
Jan-Christoph Kassing, Jürgen Giesl
Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting (Short WST Version). CoRR (2023)
Frank Emrich, Jera Hensel, Jürgen Giesl
AProVE: Modular Termination Analysis of Memory-Manipulating C Programs. CoRR (2023)
Jan-Christoph Kassing, Jürgen Giesl
Improving Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting. CoRR (2023)
Jan-Christoph Kassing, Jürgen Giesl
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs. CoRR (2023)
Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting. CoRR (2023)
Nils Lommen, Eleanore Meyer, Jürgen Giesl
Automated Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops (Short WST Version). CoRR (2023)
Florian Frohn, Jürgen Giesl
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper). CADE (2023)
Jera Hensel, Constantin Mensendiek, Jürgen Giesl
AProVE: Non-Termination Witnesses for C Programs - (Competition Contribution). TACAS (2) (2022)
Jürgen Giesl, Nils Lommen, Marcel Hark, Fabian Meyer
Improving Automatic Complexity Analysis of Integer Programs. CoRR (2022)
Nils Lommen, Fabian Meyer, Jürgen Giesl
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops. IJCAR (2022)
Nils Lommen, Fabian Meyer, Jürgen Giesl
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops. CoRR (2022)
Florian Frohn, Jürgen Giesl
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description). IJCAR (2022)
Florian Frohn, Jürgen Giesl
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description). CoRR (2022)
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)
Fabian Meyer, Marcel Hark, Jürgen Giesl
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes. TACAS (1) (2021)
Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl
Inferring Lower Runtime Bounds for Integer Programs. ACM Trans. Program. Lang. Syst. 42 (3) (2020)
Fabian Meyer, Marcel Hark, Jürgen Giesl
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes. CoRR (2020)
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) (2020)
Marcel Hark, Florian Frohn, Jürgen Giesl
Polynomial Loops: Beyond Termination. LPAR (2020)
Florian Frohn, Marcel Hark, Jürgen Giesl
Termination of Polynomial Loops. SAS (2020)
Jürgen Giesl, Peter Giesl, Marcel Hark
Computing Expected Runtimes for Constant Probability Programs. CoRR (2019)
Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl
Inferring Lower Runtime Bounds for Integer Programs. CoRR (2019)
Florian Frohn, Jürgen Giesl
Proving Non-Termination via Loop Acceleration. FMCAD (2019)
Florian Frohn, Jürgen Giesl
Proving Non-Termination via Loop Acceleration. CoRR (2019)
Florian Frohn, Jürgen Giesl
Termination of Triangular Integer Loops is Decidable. CAV (2) (2019)
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 (2019)
Jürgen Giesl, Albert Rubio, Christian Sternagel, Johannes Waldmann, Akihisa Yamada
The Termination and Complexity Competition. TACAS (3) (2019)
Florian Frohn, Marcel Hark, Jürgen Giesl
On the Decidability of Termination for Polynomial Loops. CoRR (2019)
Jürgen Giesl, Peter Giesl, Marcel Hark
Computing Expected Runtimes for Constant Probability Programs. CADE (2019)
Florian Frohn, Jürgen Giesl
Termination of Triangular Integer Loops is Decidable. CoRR (2019)
Florian Frohn, Jürgen Giesl
Constant runtime complexity of term rewriting is semi-decidable. Inf. Process. Lett. 139 (2018)
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 (2018)
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) (2017)
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) (2017)
Jürgen Giesl, Jan Hoffmann
Preface: Special Issue on Automatic Resource Bound Analysis. J. Autom. Reason. 59 (1) (2017)
Florian Frohn, Jürgen Giesl
Analyzing Runtime Complexity via Innermost Runtime Complexity. LPAR (2017)
Florian Frohn, Jürgen Giesl
Complexity Analysis for Java with AProVE. IFM (2017)
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) (2017)
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)
Matthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs, Jürgen Giesl
Complexity Analysis for Term Rewriting by Integer Transition Systems. FroCoS (2017)
Florian Frohn, Matthias Naaf, Jera Hensel, Marc Brockschmidt, Jürgen Giesl
Lower Runtime Bounds for Integer Programs. IJCAR (2016)
Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder
Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution. SEFM (2016)
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) (2016)
Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder
Inferring Lower Bounds for Runtime Complexity. RTA (2015)
Thomas Ströder, Cornelius Aschermann, Florian Frohn, Jera Hensel, Jürgen Giesl
AProVE: Termination and Memory Safety of C Programs - (Competition Contribution). TACAS (2015)
Jürgen Giesl, Frédéric Mesnard, Albert Rubio, René Thiemann, Johannes Waldmann
Termination Competition (termCOMP 2015). CADE (2015)
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)
Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl
Alternating Runtime and Size Complexity Analysis of Integer Programs. TACAS (2014)
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)
Lars Noschinski, Fabian Emmes, Jürgen Giesl
Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs. J. Autom. Reason. 51 (1) (2013)
Jürgen Giesl
Automated Termination Analysis: From Term Rewriting to Programming Languages. Software Engineering (Workshops) (2013)
Marc Brockschmidt, Richard Musiol, Carsten Otto, Jürgen Giesl
Automated Termination Proofs for Java Programs with Cyclic Data. CAV (2012)
Fabian Emmes, Tim Enger, Jürgen Giesl
Proving Non-looping Non-termination Automatically. IJCAR (2012)
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) (2012)
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)
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)
Michael Codish, Yoav Fekete, Carsten Fuhs, Jürgen Giesl, Johannes Waldmann
Exotic Semi-Ring Constraints. SMT@IJCAR (2012)
Jürgen Giesl, Reiner Hähnle
Preface: Special Issue of Selected Extended Papers of IJCAR 2010. J. Autom. Reason. 47 (4) (2011)
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) (2011)
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)
Marc Brockschmidt, Thomas Ströder, Carsten Otto, Jürgen Giesl
Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode. FoVeOOS (2011)
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) (2011)
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) (2011)
Alexander Krauss, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl
Termination of Isabelle Functions via Termination of Rewriting. ITP (2011)
Marc Brockschmidt, Carsten Otto, Jürgen Giesl
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting. RTA (2011)
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) (2011)
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers CoRR (2011)
Lars Noschinski, Fabian Emmes, Jürgen Giesl
A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems. CADE (2011)
Jürgen Giesl
Current Trends in Automated Deduction. Künstliche Intell. 24 (1) (2010)
Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann
Automated Termination Analysis for Logic Programs with Cut CoRR (2010)
Carsten Otto, Marc Brockschmidt, Christian von Essen, Jürgen Giesl
Automated Termination Analysis of Java Bytecode by Term Rewriting. RTA (2010)
Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp
Lazy Abstraction for Size-Change Termination. LPAR (Yogyakarta) (2010)
Jürgen Giesl
Special Issue on Automated Deduction. Künstliche Intell. 24 (1) (2010)
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) (2010)
Marc Brockschmidt, Carsten Otto, Christian von Essen, Jürgen Giesl
Termination Graphs for Java Bytecode. Verification, Induction, Termination Analysis (2010)
Thomas Ströder, Peter Schneider-Kamp, Jürgen Giesl
Dependency Triples for Improving Termination Analysis of Logic Programs with Cut. LOPSTR (2010)
René Thiemann, Christian Sternagel, Jürgen Giesl, Peter Schneider-Kamp
Loops under Strategies ... Continued IWS (2010)
Peter Schneider-Kamp, Jürgen Giesl, Manh Thang Nguyen
The Dependency Triple Framework for Termination of Logic Programs. LOPSTR (2009)
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)
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)

Jürgen Giesl.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jürgen Giesl