Jürgen Giesl - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged termination

Lazy Abstraction for Size-Change TerminationMichael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp. lpar 2010: 217-232 [doi]

Termination Graphs for Java BytecodeMarc Brockschmidt, Carsten Otto, Christian von Essen, Jürgen Giesl. BIRTHDAY 2010: 17-37 [doi]

Automated Termination Analysis of Java Bytecode by Term RewritingCarsten Otto, Marc Brockschmidt, Christian von Essen, Jürgen Giesl. RTA 2010: 259-276 [doi]

Automated termination analysis for logic programs with cutPeter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann. tplp, 10(4-6):365-381, 2010. [doi]

Proving Termination of Integer Term RewritingCarsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke. RTA 2009: 32-47 [doi]

The Dependency Triple Framework for Termination of Logic ProgramsPeter Schneider-Kamp, Jürgen Giesl, Manh Thang Nguyen. LOPSTR 2010: 37-51 [doi]

Atrial Anatomy Influences Onset and Termination of Atrial Fibrillation: A Computer Model StudyNico Kuijpers, Huub M. M. ten Eikelder, Sander Verheule. fimh 2009: 285-294 [doi]

Maximal TerminationCarsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl. RTA 2008: 110-125 [doi]

Proving Termination by Bounded IncreaseJürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp. cade 2007: 443-459 [doi]

Proving Termination Using Recursive Path Orders and SAT SolvingPeter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl. frocos 2007: 267-282 [doi]

SAT Solving for Termination Analysis with Polynomial InterpretationsCarsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl. sat 2007: 340-354 [doi]

Termination Analysis of Logic Programs Based on Dependency GraphsManh Thang Nguyen, Jürgen Giesl, Peter Schneider-Kamp, Danny De Schreye. LOPSTR 2008: 8-22 [doi]

Termination of Programs using Term Rewriting and SAT SolvingJürgen Giesl, Peter Schneider-Kamp, René Thiemann, Stephan Swiderski, Manh Thang Nguyen, Danny De Schreye, Alexander Serebrenik. Dagstuhl 2007: [doi]

Automatic Termination Proofs in the Dependency Pair FrameworkJürgen Giesl, Peter Schneider-Kamp, René Thiemann. cade 2006: 281-286 [doi]

Third Special Issue on Techniques for Automated Termination ProofsJürgen Giesl, Deepak Kapur. JAR, 37(3):153-154, 2006. [doi]

Automated Termination Analysis for Haskell: From Term Rewriting to Programming LanguagesJürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann. RTA 2006: 297-312 [doi]

Automated Termination Analysis for Logic Programs by Term RewritingPeter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann. LOPSTR 2007: 177-193 [doi]

Proving and Disproving Termination in the Dependency Pair FrameworkJürgen Giesl, René Thiemann, Peter Schneider-Kamp. Dagstuhl 2006: [doi]

Proving and Disproving Termination of Higher-Order FunctionsJürgen Giesl, René Thiemann, Peter Schneider-Kamp. frocos 2005: 216-231 [doi]

The size-change principle and dependency pairs for termination of term rewritingRené Thiemann, Jürgen Giesl. aaecc, 16(4):229-270, 2005. [doi]

Termination of Polynomial ProgramsAaron R. Bradley, Zohar Manna, Henny B. Sipma. vmcai 2005: 113-129 [doi]

The Dependency Pair Framework: Combining Techniques for Automated Termination ProofsJürgen Giesl, René Thiemann, Peter Schneider-Kamp. lpar 2005: 301-331 [doi]

Improved Modular Termination Proofs Using Dependency PairsRené Thiemann, Jürgen Giesl, Peter Schneider-Kamp. cade 2004: 75-90 [doi]

Automated Termination Proofs with AProVEJürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke. RTA 2004: 210-220 [doi]

Size-Change Termination for Term RewritingRené Thiemann, Jürgen Giesl. RTA 2003: 264-278 [doi]

Modular Termination Proofs for Rewriting Using Dependency PairsJürgen Giesl, Thomas Arts, Enno Ohlebusch. JSC, 34(1):21-58, 2002. [doi]

Innermost Termination of Context-Sensitive RewritingJürgen Giesl, Aart Middeldorp. dlt 2003: 231-244 [doi]

Approximations for Strategies and TerminationENTCS, 70(6):1-20, 2002. [doi]

Special Issue Termination Jürgen Giesl, Pierre Lescanne. aaecc, 12(1/2):1-2, 2001. [doi]

Termination of term rewriting using dependency pairsThomas Arts, Jürgen Giesl. TCS, 236(1-2):133-178, 2000. [doi]

Equational Termination by Semantic LabellingHitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl. csl 2000: 457-471 [doi]

Ensuring Termination in ESFPAlastair Telford, David Turner. jucs, 6(4):474-488, 2000. [doi]

Modularity of Termination Using Dependency pairsThomas Arts, Jürgen Giesl. RTA 1998: 226-240 [doi]

Termination Analysis by Inductive EvaluationJürgen Brauburger, Jürgen Giesl. cade 1998: 254-269 [doi]

Automatically Proving Termination Where Simplification Orderings FailThomas Arts, Jürgen Giesl. tapsoft 1997: 261-272

Termination of Nested and Mutually Recursive AlgorithmsJürgen Giesl. JAR, 19(1):1-29, 1997.

Termination Modulo Equations by Abstract Commutation with an Application to IterationWan Fokkink, Hans Zantema. TCS, 177(2):407-423, 1997. [doi]

Task Dependence and Termination in AdaLaura K. Dillon. TOSEM, 6(1):80-110, 1997. [doi]

Termination of Constructor SystemsThomas Arts, Jürgen Giesl. RTA 1996: 63-77

Termination Analysis for Partial FunctionsJürgen Brauburger, Jürgen Giesl. SAS 1996: 113-127

Strong Termination for the Epsilong Substitution MethodGrigori Mints. JSYML, 61(4):1193-1205, 1996.

Generating Polynomial Orderings for Termination ProofsJürgen Giesl. RTA 1995: 426-431

Automated Termination Proofs with Measure FunctionsJürgen Giesl. ki 1995: 149-160

Termination Analysis for Functional Programs using Term OrderingsJürgen Giesl. SAS 1995: 154-171

Termination Criteria for Linear ProblemsSpassimir H. Paskov. jc, 11(1):105-137, 1995. [doi]

Some Undecidable Termination Problems for Semi-Thue Systems (Abstract)Géraud Sénizergues. RTA 1993: 434

Distributed Termination EnforcementMartin Rudalics. parle 1992: 363-378

Algorithms for Distributed Termination DetectionFriedemann Mattern. dc, 2(3):161-175, 1987.

A Formalism for Reasoning about Fair TerminationWillem P. de Roever. lop 1982: 113-121

Distributed TerminationNissim Francez. TOPLAS, 2(1):42-55, 1980. [doi]

runs on WebDSL