researchr

explore
calendar
search

You are not signed in
Sign in
Sign up

All Publications

Unidentified publications

Filter by Year

Filter by Type

Filter by Topic

Filter by Venue

Filter by Co-author

Filter by Top terms

Download

BibTeX
Compact BibTeX
RSS
HTML
YAML
Compact YAML

External Links

Homepage

Profile Name

jrgengiesl

Statistics

Publications: 69
Edited: 3

Aliases

Giesl, Jürgen
Jürgen Giesl
J. Giesl
Giesl, J.
Giesl

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Jürgen Giesl's Profile

Publications

Unidentified Publications

Publications with a 'Jürgen Giesl' as author, editor, or advisor:

Closure Induction in a Z-Like LanguageDavid A. Duffy, Jürgen Giesl. zum 2000: 471-490 [doi]
Modular Termination Proofs of Recursive Java Bytecode Programs by Term RewritingMarc Brockschmidt, Carsten Otto, Jürgen Giesl. RTA 2011: 155-170 [doi]
Complexity Analysis for Term Rewriting by Integer Transition SystemsMatthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs, Jürgen Giesl. frocos 2017: 132-150 [doi]
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency PairsJan-Christoph Kassing, Jürgen Giesl. cade 2023: 344-364 [doi]
Termination of Triangular Integer Loops is DecidableFlorian Frohn, Jürgen Giesl. cav 2019: 426-444 [doi]
Improving Automatic Complexity Analysis of Integer ProgramsJürgen Giesl, Nils Lommen, Marcel Hark, Fabian Meyer. BIRTHDAY 2022: 193-228 [doi]
Targeting Completeness: Using Closed Forms for Size Bounds of Integer ProgramsNils Lommen, Jürgen Giesl. frocos 2023: 3-22 [doi]
Polynomial Loops: Beyond TerminationMarcel Hark, Florian Frohn, Jürgen Giesl. lpar 2020: 279-297 [doi]
Special Issue on Automated DeductionJürgen Giesl. ki, 24(1):7-9, 2010. [doi]
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear LoopsNils Lommen, Fabian Meyer, Jürgen Giesl. cade 2022: 734-754 [doi]
AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs - (Competition Contribution)Jera Hensel, Frank Emrich, Florian Frohn, Thomas Ströder, Jürgen Giesl. TACAS 2017: 350-354 [doi]
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)Florian Frohn, Jürgen Giesl. cade 2022: 712-722 [doi]
Proving Termination and Memory Safety for Programs with Pointer ArithmeticThomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp. cade 2014: 208-223 [doi]
Automated Termination Proofs for Java Programs with Cyclic DataMarc Brockschmidt, Richard Musiol, Carsten Otto, Jürgen Giesl. cav 2012: 105-122 [doi]
Inductive Theorem Proving meets Dependency PairsStephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp. Dagstuhl 2009: [doi]
Preface: Special Issue of Selected Extended Papers of IJCAR 2010Jürgen Giesl, Reiner Hähnle. JAR, 47(4):337-339, 2011. [doi]
Analyzing Runtime and Size Complexity of Integer ProgramsMarc Brockschmidt, Fabian Emmes, Stephan Falke 0001, Carsten Fuhs, Jürgen Giesl. TOPLAS, 38(4):13, 2016. [doi]
Termination of Integer Term RewritingCarsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke 0001. Dagstuhl 2009: [doi]
Lower Runtime Bounds for Integer ProgramsFlorian Frohn, M. Naaf, Jera Hensel, Marc Brockschmidt, Jürgen Giesl. cade 2016: 550-567 [doi]
Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency PairsLars Noschinski, Fabian Emmes, Jürgen Giesl. JAR, 51(1):27-56, 2013. [doi]
Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programsJürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs. ppdp 2012: 1-12 [doi]
Current Trends in Automated DeductionJürgen Giesl. ki, 24(1):11-13, 2010. [doi]
A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite SystemsLars Noschinski, Fabian Emmes, Jürgen Giesl. cade 2011: 422-438 [doi]
Polytool: Polynomial interpretations as a basis for termination analysis of logic programsManh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp. tplp, 11(1):33-63, 2011. [doi]
09411 Abstracts Collection - Interaction versus Automation: The two Faces of DeductionThomas Ball, Jürgen Giesl, Reiner Hähnle, Tobias Nipkow. Dagstuhl 2009: [doi]
Inferring Lower Runtime Bounds for Integer ProgramsFlorian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl. TOPLAS, 42(3), 2020. [doi]
From Innermost to Full Almost-Sure Termination of Probabilistic Term RewritingJan-Christoph Kassing, Florian Frohn, Jürgen Giesl. fossacs 2024: 206-228 [doi]
Proving Non-Termination via Loop AccelerationFlorian Frohn, Jürgen Giesl. FMCAD 2019: 221-230 [doi]
Interaction versus Automation: The two Faces of Deduction, 04.10. - 09.10.2009Thomas Ball, Jürgen Giesl, Reiner Hähnle, Tobias Nipkow, editors, Volume 09411 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009. [doi]
Preface: Special Issue on Automatic Resource Bound AnalysisJürgen Giesl, Jan Hoffmann. JAR, 59(1):1-2, 2017. [doi]
Exotic Semi-Ring ConstraintsMichael Codish, Yoav Fekete, Carsten Fuhs, Jürgen Giesl, Johannes Waldmann. cade 2013: 88-97 [doi]
Complexity Analysis for Java with AProVEFlorian Frohn, Jürgen Giesl. IFM 2017: 85-101 [doi]
Alternating Runtime and Size Complexity Analysis of Integer ProgramsMarc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl. TACAS 2014: 140-155 [doi]
The Termination and Complexity CompetitionJürgen Giesl, Albert Rubio, Christian Sternagel, Johannes Waldmann, Akihisa Yamada 0002. TACAS 2019: 156-166 [doi]
AProVE: Termination and Memory Safety of C Programs - (Competition Contribution)Thomas Ströder, Cornelius Aschermann, Florian Frohn, Jera Hensel, Jürgen Giesl. TACAS 2015: 417-419 [doi]
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency PairsMichael Codish, Jürgen Giesl, Peter Schneider-Kamp, René Thiemann. JAR, 49(1):53-93, 2012. [doi]
Automated termination proofs for haskell by term rewritingJürgen Giesl, Matthias Raffelsieper, Peter Schneider-Kamp, Stephan Swiderski, René Thiemann. TOPLAS, 33(2):7, 2011. [doi]
Aiming low is harder: induction for lower bounds in probabilistic program verificationMarcel Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen. PACMPL, 4(POPL), 2020. [doi]
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected SizesFabian Meyer, Marcel Hark, Jürgen Giesl. TACAS 2021: 250-269 [doi]
Automatisierung von Terminierungsbeweisen für rekursiv definierte AlgorithmenJürgen Giesl. Volume 96 of DISKI, Infix, 1995.
Automatically Proving Termination and Memory Safety for Programs with Pointer ArithmeticThomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp, Cornelius Aschermann. JAR, 58(1):33-65, 2017. [doi]
Constant runtime complexity of term rewriting is semi-decidableFlorian Frohn, Jürgen Giesl. ipl, 139:18-23, 2018. [doi]
Automated Detection of Non-termination and NullPointerExceptions for Java BytecodeMarc Brockschmidt, Thomas Ströder, Carsten Otto, Jürgen Giesl. foveoos 2012: 123-141 [doi]
Pushing the Frontiers of Combining Rewrite Systems Farther OutwardsJürgen Giesl, Enno Ohlebusch. frocos 1998: 141-160
A Linear Operational Semantics for Termination and Complexity Analysis of ISO PrologThomas Ströder, Fabian Emmes, Peter Schneider-Kamp, Jürgen Giesl, Carsten Fuhs. LOPSTR 2012: 237-252 [doi]
Proving Termination of Programs with Bitvector Arithmetic by Symbolic ExecutionJera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder. SEFM 2016: 234-252 [doi]
Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic ProgramsJürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs. LOPSTR 2013: 1 [doi]
Computing Expected Runtimes for Constant Probability ProgramsJürgen Giesl, Peter Giesl, Marcel Hark. cade 2019: 269-286 [doi]
ADCL: Acceleration Driven Clause Learning for Constrained Horn ClausesFlorian Frohn, Jürgen Giesl. SAS 2023: 259-285 [doi]
Lower Bounds for Runtime Complexity of Term RewritingFlorian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder. JAR, 59(1):121-163, 2017. [doi]
Inferring Lower Bounds for Runtime ComplexityFlorian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder. RTA 2015: 334-349 [doi]
Automated Termination Analysis: From Term Rewriting to Programming LanguagesJürgen Giesl. se 2013: 21-22
Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming, WRS@RDP 2007, Paris, France, June 25, 2007Jürgen Giesl, editor, Volume 204 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008. [doi]
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)Florian Frohn, Jürgen Giesl. cade 2023: 220-233 [doi]
Analyzing Program Termination and Complexity Automatically with AProVEJü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. JAR, 58(1):3-31, 2017. [doi]
Dependency Triples for Improving Termination Analysis of Logic Programs with CutThomas Ströder, Peter Schneider-Kamp, Jürgen Giesl. LOPSTR 2011: 184-199 [doi]
Analyzing Runtime Complexity via Innermost Runtime ComplexityFlorian Frohn, Jürgen Giesl. lpar 2017: 249-268 [doi]
Strategies for Semantical ContractionsJürgen Giesl, Ingrid Neumann. ki 1994: 396
Proving Termination of C Programs with ListsJera Hensel, Jürgen Giesl. cade 2023: 266-285 [doi]
AProVE: Non-Termination Witnesses for C Programs - (Competition Contribution)Jera Hensel, Constantin Mensendiek, Jürgen Giesl. TACAS 2022: 403-407 [doi]
Termination Competition (termCOMP 2015)Jürgen Giesl, Frédéric Mesnard, Albert Rubio, René Thiemann, Johannes Waldmann. cade 2015: 105-108 [doi]
Termination of Polynomial LoopsFlorian Frohn, Marcel Hark, Jürgen Giesl. SAS 2020: 89-112 [doi]
Proving Termination of Programs Automatically with AProVEJü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. cade 2014: 184-191 [doi]
Proving Non-looping Non-termination AutomaticallyFabian Emmes, Tim Enger, Jürgen Giesl. cade 2012: 225-240 [doi]
09411 Executive Summary - Interaction versus Automation: The two Faces of DeductionsThomas Ball, Jürgen Giesl, Reiner Hähnle, Tobias Nipkow. Dagstuhl 2009: [doi]
Termination and complexity analysis for programs with bitvector arithmetic by symbolic executionJera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder. jlp, 97:105-130, 2018. [doi]

About
Contact
Credits
Help
Web Service API
Blog
FAQ
Feedback

runs on WebDSL