Jürgen Giesl
- giesl at cs.rwth-aachen.de
- Address
- Room 4212
Ahornstraße 55
D-52074 Aachen - Phone
- +49 241 80 21230
Please visit my personal page on the web
Publications
| 2026 | |
|---|---|
| DOI | Jan-Christoph Kassing, Jürgen Giesl. The annotated dependency pair framework for almost-sure termination of probabilistic term rewriting, 103417, Elsevier Science, 2026. |
| DOI | Marian Lipka. Untersuchung des Einflusses von optionalen Notizfeldern auf die Programmierfähigkeit von Programmieranfänger:innen, 1 Online-Ressource : Illustrationen, RWTH Aachen University, 2026. |
| DOI | Nils Michael Lommen, Éléanore Marie Meyer, Jürgen Giesl. Targeting Completeness: Automated Complexity Analysis of Integer Programs, 6, 57 pages, Springer Science + Business Media B.V., 2026. |
| DOI | Mats Eblenkamp. Integrating KoAT’s push-button probabilistic cost analysis into Caesar, 1 Online-Ressource : Illustrationen, RWTH Aachen University, 2026. |
| DOI | Nikan Karimi Golkar. Vergleich von Lernenden-Hilfsanfragen und LLM-Vorhersagen zur proaktiven Programmierunterstützung, 1 Online-Ressource : Illustrationen, RWTH Aachen University, 2026. |
| DOI | Florian Frohn, Jürgen Giesl. Accelerated bounded model checking with LoAT, 103497, Elsevier Science, 2026. |
| DOI | Nurullah Keskin. Integration of Pyrat into JupyterLab: extension for context-aware code feedback, 1 Online-Ressource : Illustrationen, RWTH Aachen University, 2026. |
| 2025 | |
| DOI | Marcel Tobias Hark, Florian Frohn, Jürgen Giesl. Termination of triangular polynomial loops, 70-132, Springer Science + Business Media B.V, 2025. |
| DOI | Jürgen Giesl, Jan-Christoph Kassing. Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting, Principles of verification: cycling the probabilistic landscape, part 1 / nils jansen, sebastian junges, benjamin lucien kaminski, christoph matheja, thomas noll, tim quatmann, mariëlle stoelinga, matthias volk, editors, 339-366, Springer, 2025. |
| DOI | Yuval Herr. Extension and evaluation of feedback mechanisms in the Python repair tool Pyrat through the use of LLMs, 1 Online-Ressource : Illustrationen, RWTH Aachen University, 2025. |
| DOI | Emma Katharina Ahrens, Jan-Christoph Kassing, Jürgen Giesl, Joost-Pieter Katoen. Weighted Rewriting: Semiring Semantics for Abstract Reduction Systems, 10th international conference on formal structures for computation and deduction : FSCD 2025, july 14-20, 2025, birmingham, UK / edited by maribel fernández, 6:[1]-6:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 2025. |
| DOI | Jan-Christoph Kassing, Jürgen Giesl. From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity, 28, Department of Theoretical Computer Science, Technical University of Braunschweig, 2025. |
| DOI | Jan-Christoph Kassing, Jürgen Giesl. From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity, 79 Seiten, 2025. |
| DOI | Nils Michael Lommen, Jürgen Giesl. AProVE (KoAT + LoAT), Tools and algorithms for the construction and analysis of systems: 31st international conference, TACAS 2025, held as part of the international joint conferences on theory and practice of software, ETAPS 2025, hamilton, on, canada, may 3–8, 2025, proceedings, part III / edited by arie gurfinkel, marijn heule, 205-211, Springer Nature Switzerland, 2025. |
| DOI | Éléanore Marie Meyer, Jürgen Giesl. Deciding Termination of Simple Randomized Loops, 50th international symposium on mathematical foundations of computer science : MFCS 2025, august 25-29, 2025, warsaw, poland / edited by paweł gawrychowski, filip mazowiecki, michał skrzypczaks, [76:1]-76:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 2025. |
| DOI | Jan-Christoph Kassing, Leon Valentin Spitzer, Jürgen Giesl. Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting, Proceedings of the 27th international symposium on principles and practice of declarative programming (PPDP 2025) 10-11 september 2025, rende, italy co-located with the 41st international conference on logic programming held at university of calabria, ACM, 2025. |
| DOI | Franz Baader, Jürgen Giesl. Small Term Reachability and Related Problems for Terminating Term Rewriting Systems, 14938, Logical Methods in Computer Science e.V., 2025. |
| DOI | Florian Frohn, Jürgen Giesl. Infinite State Model Checking by Learning Transitive Relations, Automated deduction – CADE 30 : 30th international conference on automated deduction, stuttgart, germany, july 28-31, 2025, proceedings / edited by clark barrett, uwe waldmann, 468-489, Springer Nature Switzerland, 2025. |
| 2024 | |
| DOI | Felix Thape. Redesign and implementation of nbgrader to improve the instructor user experience, 1 Online-Ressource: Illustrationen, RWTH Aachen University, 2024. |
| DOI | Fabian Siebes. Entwicklung einer Datenstruktur zur Klassifizierung unterschiedlicher Übungsaufgaben-Elemente, 1 Online-Ressource : Illustrationen, RWTH Aachen University, 2024. |
| DOI | Leonard Steffes. Contextual automatic code repair for Python programming novices, 1 Online-Ressource : Illustrationen, RWTH Aachen University, 2024. |
| DOI | Codruta-Andreea Gherman. Exploring the impact of ChatGPT assistance on novice programmers’ efficiency and learning in Python programming tasks, 1 Online-Ressource : Illustrationen, RWTH Aachen University, 2024. |
| DOI | Jan-Christoph Kassing, Grigory Vartanyan, Jürgen Giesl. A Dependency Pair Framework for Relative Termination of Term Rewriting, Automated reasoning : 12th international joint conference, IJCAR 2024, nancy, france, july 3–6, 2024 : proceedings/ christoph benzmüller, marijn J. H. Heule, renate a. Schmidt editors. - Part 2, 360-380, Springer, 2024. |
| DOI | Nils Michael Lommen, Éléanore Marie Meyer, Jürgen Giesl. Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT (Short Paper), Automated reasoning : 12th international joint conference, IJCAR 2024, nancy, france, july 3–6, 2024, proceedings / christoph benzmüller, marijn J.H. heule, renate a. Schmidt editors. - Part 1, 233-243, Springer, 2024. |
| DOI | Florian Frohn, Jürgen Giesl. Satisfiability Modulo Exponential Integer Arithmetic, Automated reasoning : 12th international joint conference, IJCAR 2024, nancy, france, july 3–6, 2024, proceedings / christoph benzmüller, marijn J.H. heule, renate a. Schmidt editors. - Part 1, 344-365, Springer, 2024. |
| DOI | Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl. From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting, Foundations of software science and computation structures : 27th international conference, FoSSaCS 2024, held as part of the european joint conferences on theory and practice of software, ETAPS 2024, luxembourg city, luxembourg, april 6–11, 2024 : Proceedings/ naoki kobayashi, james worrell editors. - Part 2, 206-228, Springer, 2024. |
| DOI | Jan-Christoph Kassing, Stefan Dollase, Jürgen Giesl. A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting, Functional and logic programming : 17th international symposium, FLOPS 2024, kumamoto, japan, may 15-17, 2024 : proceedings / jeremy gibbons, dale miller, editors, 62-80, Springer, 2024. |
| DOI | Franz Baader, Jürgen Giesl. On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems, 9th international conference on formal structures for computation and deduction : FSCD 2024, july 10-13, 2024, tallinn, estonia / edited by jakob rehof, 16:1-16:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, June, 2024. |
| DOI | Florian Frohn, Jürgen Giesl. Integrating Loop Acceleration Into Bounded Model Checking, Formal methods : 26th international symposium, FM 2024, milan, italy, september 9-13, 2024, proceedings / andré platzer, kristin yvonne rozier, matteo pradella matteo rossi, editors. - Part I, 73-91, Springer, 2024. |
| 2023 | |
| DOI | Maksymilian Feruga. Development of a framework for monitoring the learning process in Jupyter, 1 Online-Ressource : Illustrationen, Diagramme, RWTH Aachen University, 2023. |
| DOI | Maik Stürmer. Development of a library to analyze Python code used in ACE editor, 1 Online-Ressource : Illustrationen, Diagramme, RWTH Aachen University, 2023. |
| DOI | Elias Wirtz. Entwicklung eines Tutorials zu der Erstellung von digitalen Gamebooks, 1 Online-Ressource : Illustrationen, RWTH Aachen University, 2023. |
| DOI | Philipp Bär. Exploiting strict constraints in the computation of cylindrical algebraic coverings, 1 Online-Ressource : Illustrationen, Diagramme, RWTH Aachen University, 2023. |
| DOI | Philipp Christoph Peeß. Automatic generation of Python programming exercises in Jupyter, 1 Online-Ressource : Illustrationen, RWTH Aachen University, 2023. |
| DOI | Lejla Gusic. Enabling feedback for block-based programming through the development of an xAPI logging interface for Cubi, 1 Online-Ressource : Illustrationen, Diagramme, RWTH Aachen University, 2023. |
| DOI | Florian Frohn, Jürgen Giesl. Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper), Automated deduction – CADE 29 : 29th international conference on automated deduction, rome, italy, july 1–4, 2023, proceedings / edited by brigitte pientka, cesare tinelli, 220-233, Springer Nature Switzerland, 2023. |
| DOI | Jera Hensel, Jürgen Giesl. Proving Termination of C Programs with Lists; 1st ed., Automated deduction – CADE 29 : 29th international conference on automated deduction, rome, italy, july 1–4, 2023, proceedings / edited by brigitte pientka, cesare tinelli, 266-285, Springer Nature Switzerland, 2023. |
| DOI | Jan-Christoph Kassing, Jürgen Giesl. Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs, Automated deduction – CADE 29 : 29th international conference on automated deduction, rome, italy, july 1–4, 2023, proceedings / edited by brigitte pientka, cesare tinelli, 344-364, Springer Nature Switzerland, 2023. |
| DOI | Nils Michael Lommen, Jürgen Giesl. Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs, Frontiers of combining systems : 14th international symposium, FroCoS 2023, prague, czech republic, september 20–22, 2023, proceedings / edited by uli sattler, martin suda, 3-22, Springer Nature Switzerland, 2023. |
| DOI | Florian Frohn, Jürgen Giesl. ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses, Static analysis : 30th international symposium, SAS 2023, cascais, portugal, october 22–24, 2023, proceedings / edited by manuel V. Hermenegildo, josé F. Morales, 259-285, Springer Nature Switzerland, 2023. |
| DOI | Jera Hensel. Automated termination analysis of C programs, 1 Online-Ressource : Illustrationen, RWTH Aachen University, 2023. |
| 2022 | |
| DOI | Jera Hensel, Constantin Mensendiek, Jürgen Giesl. AProVE: Non-Termination Witnesses for C Programs, Tools and algorithms for the construction and analysis of systems : 28th international conference, TACAS 2022, held as part of the european joint conferences on theory and practice of software, ETAPS 2022, munich, germany, april 2–7, 2022, proceedings, part II / edited by dana fisman, grigore rosu, 403-407, Springer International Publishing, 2022. |
| DOI | Nils Pulte. Entwicklung eines Generators für zugängliche Gamebook-UIs zur Anwendung in der digitalen Lehre, 1 Online-Ressource : Illustrationen, RWTH Aachen University, 2022. |
| DOI | Marielle Merhi. Zielgruppengerechte Überarbeitung und Digitalisierung des Java Leitprogramms, 1 Online-Ressource : Illustrationen, Diagramme, RWTH Aachen University, 2022. |
| DOI | Jürgen Giesl, Nils Michael Lommen, Marcel Tobias Hark, Fabian Meyer. Improving Automatic Complexity Analysis of Integer Programs, The logic of software : a tasting menu of formal methods : essays dedicated to Reiner Hähnle on the occasion of his 60th birthday / Wolfgang Ahrendt, Bernhard Beckert, Richard Bubel, Einar Broch Johnsen (eds.), 193-228, Springer, 2022. |
| DOI | Florian Frohn, Jürgen Giesl. Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description), Automated reasoning : 11th international joint conference, IJCAR 2022, haifa, israel, august 8-10, 2022, proceedings / jasmin blanchette, laura kovács, dirk pattinson (eds.), 712-722, Springer, 2022. |
| DOI | Nils Michael Lommen, Fabian Meyer, Jürgen Giesl. Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops, Automated reasoning : 11th international joint conference, IJCAR 2022, haifa, israel, august 8-10, 2022, proceedings / jasmin blanchette, laura kovács, dirk pattinson (eds.), 734-754, Springer, 2022. |
| DOI | Ifthekar Ahmed. Identifying a gamification approach for a Python programming course for novices using Jupyter an an example, 1 Online-Ressource : Illustrationen, RWTH Aachen University, 2022. |
| Christian Jürgen Vonderstein. Design and evaluation of parallel assertions for MPI programs, xiii, 46 Seiten : Illustrationen, 2022. | |
| 2021 | |
| DOI | Fabian Meyer, Marcel Tobias Hark, Jürgen Giesl. Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes, Tools and algorithms for the construction and analysis of systems : 27th international conference, TACAS 2021, held as part of the european joint conferences on theory and practice of software, ETAPS 2021, luxembourg city, luxembourg, march 27 - april 1, 2021, proceedings, part I, 250-269, Springer International Publishing, 2021. |
| DOI | Marcel Tobias Hark. Towards complete methods for automatic complexity and termination analysis of (probabilistic) programs, 1 Online-Ressource : Illustrationen, RWTH Aachen University, 2021. |
| 2020 | |
| DOI | Marcel Tobias Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen. Aiming low is harder: induction for lower bounds in probabilistic program verification, 1-28, ACM, 2020. |
| DOI | Marcel Tobias Hark, Florian Frohn, Jürgen Giesl. Polynomial Loops: Beyond Termination, Proceedings of LPAR-23: 23rd international conference on logic for programming, artificial intelligence and reasoning, 279-297, 2020. |
| DOI | Florian Frohn, Matthias Ferdinand Naaf, Marc Brockschmidt, Jürgen Giesl. Inferring Lower Runtime Bounds for Integer Programs, 13, Association for Computing Machinery, 2020. |
| Jan Nowak. Konzeption eines Einführungskurses zu Dokumentenbeschreibungssprachen an außerschulischen Lernorten, 2020. | |
| DOI | Florian Frohn, Marcel Tobias Hark, Jürgen Giesl. Termination of Polynomial Loops, Static analysis : 27th international symposium, SAS 2020 : Virtual event, november 18–20, 2020 : Proceedings / pichardie, david, sighireanu, mihaela (eds.), 89-112, Springer, 2020. |
| 2019 | |
| DOI | Thomas Ströder. Symbolic execution and program synthesis : a general methodology for software verification, Online-Ressource (454 Seiten) : Illustrationen, 2019. |
| DOI | Jürgen Giesl, Peter Giesl, Marcel Tobias Hark. Computing Expected Runtimes for Constant Probability Programs, Automated deduction - CADE 27 : 27th international conference on automated deduction, natal, brazil, august 27-30, 2019 : Proceedings / pascal fontaine (ed.), 269-286, Springer, 2019. |
| DOI | Florian Frohn, Jürgen Giesl. Termination of Triangular Integer Loops is Decidable, Computer aided verification : 31st international conference, CAV 2019, new york city, NY, USA, july 15-18, 2019, proceedings, part II / edited by isil dillig, serdar tasiran, 426-444, Springer, 2019. |
| DOI | Jürgen Giesl, Albert Rubio, Christian Sternagel, Johannes Waldmann, Akihisa Yamada. The Termination and Complexity Competition, Tools and algorithms for the construction and analysis of systems : 25th international conference, TACAS 2019, held as part of the european joint conferences on theory and practice of software, ETAPS 2019, prague, czech republic, april 6-11, 2019 : proceedings. - Part 3: 25 years of TACAS: TOOLympics : held as part of ETAPS 2019, prague, czech republic, april 6-11, 2019 : proceedings / dirk beyer, marieke huisman, fabrice kordon, bernhard steffen (eds.), 156-166, Springer Open, 2019. |
| DOI | Florian Frohn, Jürgen Giesl. Proving Non-Termination via Loop Acceleration, Proceedings of the 19th conference on formal methods in computer-aided design (FMCAD 2019) : San jose, california, USA, october 22-25, 2019 / FMCAD 19 ; edited by clark barrett and jin yang ; in cooperation with: ACM special interest group on design automation, ACM special interest group on software engineering ; technical co-sponsorship of IEEE, 221-230, IEEE, 2019. |
| DOI | René Pasing. Entwicklung einer mobilen plattformübergreifenden Applikation für internationale Studierende an der RWTH Aachen, 2019. |
| 2018 | |
| DOI | Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder. Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution, 105-130, Elsevier Science, 2018. |
| DOI | Florian Frohn, Jürgen Giesl. Constant runtime complexity of term rewriting is semi-decidable, 18-23, Elsevier, 2018. |
| DOI | Florian Frohn. Automated complexity analysis of rewrite systems, 1 Online-Ressource (282 Seiten) : Illustrationen, 2018. |
| 2017 | |
| DOI | 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, 33-65, Springer Science + Business Media B.V., 2017. |
| DOI | 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, 3-31, Springer Science + Business Media B.V., 2017. |
| DOI | Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder. Lower Bounds for Runtime Complexity of Term Rewriting, 121-163, Springer Science + Business Media B.V., 2017. |
| DOI | Jürgen Giesl, Jan Hoffmann. Preface: Special Issue on Automatic Resource Bound Analysis, 1-2, Springer Science + Business Media B.V., 2017. |
| DOI | Jera Hensel, Frank Emrich, Florian Frohn, Thomas Ströder, Jürgen Giesl. AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs, Tools and algorithms for the construction and analysis of systems : 23rd international conference, TACAS 2017, held as part of the european joint conferences on theory and practice of software, ETAPS 2017, uppsala, sweden, april 22-29, 2017 : proceedings / axel legay, tiziana margaria (eds.). - Part 2, 350-354, Springer Berlin Heidelberg, 2017. |
| Florian Frohn, Jürgen Giesl. Analyzing Runtime Complexity via Innermost Runtime Complexity, [21st international conference on logic for programming, artificial intelligence and reasoning, LPAR-21, 07.05.2017-12.05.2017, maun, botswana], 249-268, 2017. | |
| . Special Issue: Automatic Resource Bound Analysis, 163 Seiten, Springer Science + Business Media B.V., 2017. | |
| DOI | Matthias Ferdinand Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs, Jürgen Giesl. Complexity Analysis for Term Rewriting by Integer Transition Systems, Frontiers of combining systems : 11th international symposium, FroCoS 2017, brasília, brazil, september 27-29, 2017 : proceedings / clare dixon, marcelo finger (eds.), 132-150, Springer International Publishing, 2017. |
| DOI | Florian Frohn, Jürgen Giesl. Complexity Analysis for Java with AProVE, Integrated formal methods : 13th international conference, IFM 2017, turin, italy, september 20-22, 2017 : proceedings / nadia polikarpova, steve schneider (eds.), 85-101, Springer International Publishing, 2017. |
| 2016 | |
| DOI | Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder. Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution, Software engineering and formal methods : 14th international conference, SEFM 2016, held as part of STAF 2016, vienna, austria, july 4-8, 2016 : proceedings / rocco de nicola, eva kühn (eds.), 234-252, Springer International Publishing, 2016. |
| DOI | Florian Frohn, Matthias Ferdinand Naaf, Jera Hensel, Marc Brockschmidt, Jürgen Giesl. Lower Runtime Bounds for Integer Programs, Automated reasoning : 8th international joint conference, IJCAR 2016, coimbra, portugal, june 27 - july 2, 2016 : proceedings / nicola olivetti, ashish tiwari (eds.), 550-567, Springer International Publishing, 2016. |
| DOI | Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl. Analyzing Runtime and Size Complexity of Integer Programs, 13, Association for Computing Machinery, 2016. |
| 2015 | |
| Carsten Otto. Java program analysis by symbolic execution, 223 S. : graph. Darst., Fachgruppe Informatik, RWTH Aachen University, 2015. | |
| DOI | Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder. Inferring Lower Bounds for Runtime Complexity, 26th international conference on rewriting techniques and applications : RTA '15, june 29 to july 1, 2015, warsaw, poland / ed. by maribel fernández, 334-349, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. |
| DOI | Jürgen Giesl, Frédéric Mesnard, Albert Rubio, René Thiemann, Johannes Waldmann. Termination Competition (termCOMP 2015), Automated deduction - CADE-25 : 25th international conference on automated deduction, berlin, germany, august 1 - 7, 2015 ; proceedings / amy P. Felty; aart middeldorp (eds.), 105-108, Springer, 2015. |
| DOI | Thomas Ströder, Cornelius Aschermann, Florian Frohn, Jera Hensel, Jürgen Giesl. AProVE : Termination and Memory Safety of C Programs ; (competition contribution), Tools and algorithms for the construction and analysis of systems : 21st international conference, TACAS 2015, held as part of the european joint conferences on theory and practice of software, ETAPS 2015, london, UK, april 11-18, 2015 ; proceedings / christel baier ... (ed.), 417-419, Springer, 2015. |
| 2014 | |
| DOI | 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, Automated reasoning : 7th international joint conference, IJCAR 2014, held as part of the vienna summer of logic, VSL 2014, vienna, austria, july 19-22, 2014 ; proceedings / stéphane demri ... (eds.), 208-223, Springer, 2014. |
| DOI | Jürgen Giesl, Marc Brockschmidt, Fabian Emmes, Florian Frohn, Carsten Fuhs, Carsten Otto, Martin Plücker, Peter Schneider-Kamp, Thomas Ströder, Stephanie Swiderski, Rene Thiemann. Proving Termination of Programs Automatically with AProVE, Automated reasoning : 7th international joint conference, IJCAR 2014, held as part of the vienna summer of logic, VSL 2014, vienna, austria, july 19-22, 2014 ; proceedings / stéphane demri ... (eds.), 184-191, Springer, 2014. |
| DOI | Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl. Alternating Runtime and Size Complexity Analysis of Integer Programs, Tools and algorithms for the construction and analysis of systems : 20th international conference, TACAS 2014 [, took place during april 7-11 2014], held as part of the european joint conferences on theory and practice of software, ETAPS 2014, grenoble, france, april 5-13, 2014 ; proceedings / erika ábrahám; klaus havelund (eds.), 140-155, Springer, 2014. |
| Marc Brockschmidt. Termination analysis for imperative programs operating on the heap, II, 224 S. : graph. Darst., Publikationsserver der RWTH Aachen University, 2014. | |
| 2013 | |
| DOI | Lars Noschinski, Fabian Emmes, Jürgen Giesl. Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs, 27-56, Springer [u.a.], 2013. |
| Jürgen Giesl. Automated Termination Analysis: From Term Rewriting to Programming Languages, SE 2013 : Software engineering 2013 - workshopband (inkl. Doktorandensymposium) : Fachtagung des GI-fachbereichs softwaretechnik, 26.02. - 01.03.2013 in aachen : enthält workshops papers / stefan wagner; horst lichter (hrsg.), 21-22, Ges. für Informatik [u.a.], 2013. | |
| Michael Codish, Yoav Fekete, Carsten Fuhs, Jürgen Giesl, Johannes Waldmann. Exotic Semiring Constraints, SMT 2012. 10th international workshop on satisfiability modulo theories, 88-97, EasyChair, 2013. | |
| 2012 | |
| Carsten Fuhs. SAT encodings: from constraint based termination analysis to circuit synthesis, II, 188 S., Fachgruppe Informatik, RWTH Aachen Univ., 2012. | |
| DOI | Michael Codish, Jürgen Giesl, Peter Schneider-Kamp, Rene Thiemann. SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs, 53-93, Springer, 2012. |
| DOI | Marc Brockschmidt, Thomas Ströder, Carsten Otto, Jürgen Giesl. Automated Detection of Non-Termination and NullPointerExceptions for Java Bytecode, Formal verification of object-oriented software : international conference, FoVeOOS 2011, Turin, Italy, October 5 - 7, 2011 ; revised selected papers / Bernhard Beckert ... (eds.), 123-141, Springer [u.a.], 2012. |
| DOI | 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, Logic-based program synthesis and transformation : 21st international symposium, LOPSTR 2011, Odense, Denmark, July 18 - 20, 2011 ; revised selected papers / Germán Vidal (ed.). - LNCS 7225, 237-252, Springer, 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, Proceedings of the 14th international symposium on principles and practice of declarative programming (PPDP '12), 1-12, ACM Press, 2012. | |
| DOI | Fabian Emmes, Tim Enger, Jürgen Giesl. Proving Non-Looping Non-Termination Automatically, Automated reasoning : 6th international joint conference, IJCAR 2012, manchester, UK, june 26 - 29, 2012 ; proceedings / bernhard gramlich ... (eds.), 225-240, Springer, 2012. |
| DOI | Marc Brockschmidt, Richard Musiol, Carsten Otto, Jürgen Giesl. Automated Termination Proofs for Java Programs with Cyclic Data, Computer aided verification : 24th international conference, CAV 2012, berkeley, CA, USA, july 7 - 13, 2012 ; proceedings / P. Madhusudan ... (eds.), 105-122, Springer, 2012. |
| 2011 | |
| DOI | Alexander Krauss, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl. Termination of Isabelle Functions via Termination of Rewriting, Interactive theorem proving : second international conference, ITP 2011, berg en dal, the netherlands, august 22-25, 2011 ; proceedings / marko van eekelen ... (eds.), 152-167, Springer, 2011. |
| DOI | Lars Noschinski, Fabian Emmes, Jürgen Giesl. A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems, Automated deduction - CADE-23 : 23rd international conference on automated deduction, wroclaw, poland, july 31- august 5, 2011 ; proceedings / nikolaj bjørner; viorica sofronie-stokkermans (eds.), 422-438, Springer, 2011. |
| DOI | Thomas Ströder, Peter Schneider-Kamp, Jürgen Giesl. Dependency Triples for Improving Termination Analysis of Logic Programs with Cut, Logic-based program synthesis and transformation : 20th international symposium, LOPSTR 2010, Hagenberg, Austria, July 23-25, 2010; revised selected papers / María Alpuente (ed.), 184-199, Springer, 2011. |
| Marc Brockschmidt, Carsten Otto, Jürgen Giesl. Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting, 22nd international conference on rewriting techniques and applications : RTA'11, may 30 - june 1, 2011, novi sad, serbia / ed. by manfred schmidt-schauss, 155-170, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, 2011. | |
| DOI | Manh Thang Nguyen, Daniel Schreye, Jürgen Giesl, Peter Schneider-Kamp. Polytool: Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs, 33-63, Univ. Press, 2011. |
| DOI | Michael Codish, Igor Gonopolskiy, Amir Ben-Amram, Carsten Fuhs, Jürgen Giesl. SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers, 503-520, Cambridge Univ. Press, 2011. |
| DOI | Jürgen Giesl, Reiner Hähnle. Preface: Special Issue of Selected Extended Papers of IJCAR 2010, 337-339, Springer, 2011. |
| DOI | Jürgen Giesl, Matthias Raffelsieper, Peter Schneider-Kamp, Stephan Swiderski, Rene Thiemann. Automated Termination Proofs for Haskell by Term Rewriting, 7:1-7:39, Association for Computing Machinery, 2011. |
| DOI | Carsten Fuhs, Jürgen Giesl, Michael Parting, Peter Schneider-Kamp, Stephan Swiderski. Proving Termination by Dependency Pairs and Inductive Theorem Proving, 133-160, Springer, 2011. |
| 2010 | |
| DOI | . Automated reasoning : 5th international joint conference, IJCAR 2010, Edinburgh, UK, July 16-19, 2010 ; proceedings, XII, 534 S. : graph. Darst., Springer, 2010. |
| . Automated Deduction, 91 S., Springer, 2010. | |
| DOI | Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp. Lazy Abstraction for Size-Change Termination, Logic for programming, artificial intelligence, and reasoning : 17th international conference, LPAR-17, yogyakarta, indonesia, october 10 - 15, 2010 ; proceedings / christian G. Fermüller ... (eds.), 217-232, Springer, 2010. |
| DOI | René Thiemann, Christian Sternagel, Jürgen Giesl, Peter Schneider-Kamp. Loops under Strategies ... Continued, Proceedings international workshop on strategies in rewriting, proving, and programming (IWS 2010) : Edinburgh, UK, 9th july 2010 / ed. by: Hélène kirchner and césar muñoz, 51-65, NICTA, 2010. |
| DOI | Carsten Otto, Marc Brockschmidt, Christian Essen, Jürgen Giesl. Automated Termination Analysis of Java Bytecode by Term Rewriting, Proceedings of the 21st international conference on rewriting techniques and applications (RTA'10) [elektronische ressource] / christopher lynch, 259-276, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. |
| Marc Brockschmidt, Carsten Otto, Jürgen Giesl. Termination Graphs for Java Bytecode, Verification, induction, termination analysis : Festschrift for christoph walther on the occasion of his 60th birthday / simon siegler; nathan wasser (eds.), 17-37, Springer, 2010. | |
| DOI | Peter Schneider-Kamp, Jürgen Giesl, Manh Thang Nguyen. The Dependency Triple Framework for Termination of Logic Programs, Logic-based program synthesis and transformation : 19th international symposium, LOPSTR 2009, Coimbra, Portugal, September 2009 ; revised selected papers / Danny De Schreye (ed.), 37-51, Springer, 2010. |
| Peter Schneider-Kamp, Jürgen Giesl, Manh Thang Nguyen. The Dependency Triple Framework for Termination of Logic Programs, Logic-based program synthesis and transformation : 19th international symposium, LOPSTR 2009, Coimbra, Portugal, September 2009 ; revised selected papers / Danny De Schreye (ed.), 37-51, Springer, 2010. | |
| DOI | Jürgen Giesl. Current Trends in Automated Deduction, 11-13, Springer, 2010. |
| DOI | Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann. Automated termination analysis for logic programs with cut, 365-381, Univ. Press, 2010. |
| 2009 | |
| DOI | Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp. Termination Analysis by Dependency Pairs and Inductive Theorem Proving, Automated deduction - CADE-22 : 22nd international conference on automated deduction, montreal, canada, august 2-7, 2009 ; proceedings / renate a. Schmidt (ed.), 322-338, Springer, 2009. |
| DOI | Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke. Proving Termination of Integer Term Rewriting, Rewriting techniques and applications : 20th international conference, RTA 2009, brasília, brazil, june 29-july 1, 2009 ; proceedings / ralf treinen (ed.), 32-47, Springer, 2009. |
| DOI | Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann. Automated termination proofs for logic programs by term rewriting, 2, ACM, 2009. |
| 2008 | |
| . Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2007) : Paris, France, 25 June 2007, 198 S., Elsevier Science, 2008. | |
| Peter Schneider-Kamp. Static termination analysis for Prolog using term rewriting and SAT solving, II, 174 S. : graph. Darst., Publikationsserver der RWTH Aachen University, 2008. | |
| DOI | René Thiemann, Jürgen Giesl, Peter Schneider-Kamp. Deciding Innermost Loops, Rewriting techniques and applications : 19th international conference ; RTA 2008 ; hagenberg, austria, july 15-17, 2008 ; proceedings / andrei voronkov (ed.), 366-380, Springer, 2008. |
| DOI | Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto, Jürgen Giesl, Salvador Lucas, Peter Schneider-Kamp. Search Techniques for Rational Polynomial Orders, Intelligent computer mathematics : 9th international conference, AISC 2008, 15th symposium, calculemus 2008, 7th international conference, MKM 2008 birmingham, UK, july 28-august 1, 2008 ; proceedings / serge autexier; john campbell; julio rubio; volker sorge; masakazu suzuki; freek wiedijk (eds.), 109-124, Springer, 2008. |
| DOI | Beatriz Alarcon, Fabian Emmes, Carsten Fuhs, Jürgen Giesl, Raul Gutierrez, Salvador Lucas, Peter Schneider-Kamp, René Thiemann. Improving Context-Sensitive Dependency Pairs, Logic for programming, artificial intelligence, and reasoning : 15th international conference, LPAR 2008, doha, qatar, november 22-27, 2008 ; proceedings / iliano cervesato; helmut veith; andrei voronkov (eds.), 636-651, Springer, 2008. |
| DOI | Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl. Maximal Termination, Rewriting techniques and applications : 19th international conference ; RTA 2008 ; hagenberg, austria, july 15-17, 2008 ; proceedings / andrei voronkov (ed.), 110-125, Springer, 2008. |
| DOI | Manh Thang Nguyen, Jürgen Giesl, Peter Schneider-Kamp, Daniel Schreye. Termination Analysis of Logic Programs based on Dependency Graphs, Logic-based program synthesis and transformation : 17th international symposium, LOPSTR 2007, Kongens Lyngby, Denmark, August 23-24, 2007 ; revised selected papers / Andy King (ed.), 8-22, Springer, 2008. |
| DOI | René Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp. Adding Constants to String Rewriting, 27-38, Springer, 2008. |
| 2007 | |
| DOI | . 16th International Conference on Rewriting Techniques and Applications : [RTA 2005 ... held on April 19 - 21, 2005, in Nara, Japan], S. 417-650, Academic Press, 2007. |
| René Thiemann. The DP framework for proving termination of term rewriting, II, 211 S. : graph. Darst., Publikationsserver der RWTH Aachen University, 2007. | |
| DOI | Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl. SAT solving for termination analysis with polynomial interpretations, 2007 : 10th international conference, lisbon, portugal, may 28-31, 2007 ; proceedings / joao marques-silva; karem a. Sakallah (eds.), 340-354, Springer, 2007. |
| DOI | Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann. Automated termination analysis for logic programs by term rewriting, Logic-based program synthesis and transformation : 16th international symposium, LOPSTR 2006, Venice, Italy, July 12-14, 2006 ; revised selected papers / Germán Puebla (ed.), 177-193, Springer, 2007. |
| DOI | Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl. Proving Termination using Recursive Path Orders and SAT Solving, Frontiers of combining systems : 6th international symposium, FroCoS 2007, liverpool, UK, september 10-12, 2007 ; proceedings / boris konev; frank wolter (eds.), 267-282, Springer, 2007. |
| DOI | Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp. Proving Termination by Bounded Increase, Automated deduction - CADE-21 : 21st international conference on automated deduction, bremen, germany, july 17 - 20, 2007 ; proceedings / frank pfenning (ed.), 443-459, Springer, 2007. |
| DOI | Jürgen Giesl, Armin Kühnemann, Janis Voigtländer. Deaccumulation techniques for improving provability, 79-113, North-Holland, 2007. |
| Jürgen Giesl. Information and computation, 417-418, Elsevier, 2007. | |
| 2006 | |
| DOI | Mike Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl. SAT solving for argument filterings, Logic for programming, artificial intelligence, and reasoning : 13th international conference, LPAR 2006, phnom penh, cambodia, november 13 - 17, 2006 ; proceedings / miki hermann; andrei voronkov (eds.), 30-44, Springer, 2006. |
| DOI | Jürgen Giesl, Peter Schneider-Kamp, René Thiemann. AProVE 1.2 : automatic termination proofs in the dependency pair framework, Automated reasoning : third international joint conference, IJCAR 2006, seattle, WA, USA, august 17-20, 2006 ; proceedings / ulrich furbach ... (eds.), 281-286, Springer, 2006. |
| DOI | Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann. Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages, Term rewriting and applications : 17th international conference, RTA 2006, seattle, WA, USA, august 12 - 14, 2006 ; proceedings / frank pfenning (ed.), 297-312, Springer, 2006. |
| DOI | Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke. Mechanizing and improving dependency pairs, 155-203, Springer [u.a.], 2006. |
| DOI | Jürgen Giesl, Deepak Kapur. Third Special Issue on Techniques for Automated Termination Proofs, 153-154, Springer, 2006. |
| 2005 | |
| DOI | . Term rewriting and applications : 16th international conference, RTA 2005, Nara, Japan, April 19-21, 2005 ; proceedings, XIII, 515 S. : graph. Darst., Springer, 2005. |
| DOI | . Special issue on techniques for automated termination proofs, 34, 103-104, Springer, 2005. |
| DOI | . Second special issue on techniques for automated termination proofs, 34, S. 323-423, Springer [u.a.], 2005. |
| DOI | Jürgen Giesl, René Thiemann, Peter Schneider-Kamp. The dependency pair framework : combining techniques for automated termination proofs, Logic for programming, artificial intelligence, and reasoning : 11th international conference, LPAR 2004, Montevideo, Uruguay, March 14 - 18, 2005 ; proceedings / Franz Baader ... (eds.), 301-331, Springer, 2005. |
| DOI | Jürgen Giesl, René Thiemann, Peter Schneider-Kamp. Proving and disproving termination of higher-order functions, Frontiers of combining systems : 5th international workshop, FroCoS 2005, vienna, austria, september 19 - 21, 2005 ; proceedings / bernhard gramlich (ed.), 216-231, Springer, 2005. |
| DOI | Jürgen Giesl, René Thiemann. The size-change principle and dependency pairs for termination of term rewriting, 229-270, Springer, 2005. |
| 2004 | |
| René Thiemann, Jürgen Giesl, Peter Schneider-Kamp. Improved modular termination proofs using dependency pairs, Automated reasoning : second international joint conference, IJCAR 2004, cork, ireland, july 4 - 8, 2004 ; proceedings / david basin ...(eds.), 75-90, Springer, 2004. | |
| Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke. Automated termination proofs with AProVE, Rewriting techniques and applications : 15th international conference, RTA 2004, aachen, germany, june 3 - 5, 2004 ; proceedings / vincent van oostrom (ed.), 210-220, Springer, 2004. | |
| Deepak Kapur, Jürgen Giesl, Mahadevan Subramaniam. Induction and decision procedures, 153-180, Real Academia de Ciencias Exactas, Físicas y Naturales, 2004. | |
| DOI | Jürgen Giesl, Aart Middeldorp. Transformation techniques for context-sensitive rewrite systems, 379-427, Cambridge University Press, 2004. |
| . Bezem, Marc ; Klop, Jan Willem ; Vrijer, Roel de [Hrsg.]: Term rewriting systems / Terese. [Ed.: Marc Bezem; Jan Willem Klop; Roel de Vrijer; ...]. - Cambridge [u.a.], 2003, 223-225, Association for Symbolic Logic, 2004. | |
| 2003 | |
| DOI | Jürgen Giesl, Hans Zantema. Liveness in rewriting, Rewriting techniques and applications : 14th international conference, valencia, spain, june 9 - 11, 2003 ; proceedings / RTA 2003. Robert nieuwenhuis (ed.), 321-336, Springer, 2003. |
| DOI | Jürgen Giesl, Hans Zantema. Simulating liveness by reduction strategies, WRS 2003, 3rd international workshop on reduction strategies in rewriting and programming - final proceedings : Valencia, spain, 08 june 2003 / ed. Bernhard gramlich ; salvador lucas, Elsevier Science, 2003. |
| DOI | Jürgen Giesl, Deepak Kapur. Deciding inductive validity of equations, Automated deduction : CADE-19, 19th international conference on automated deduction, miami beach, FL, USA, july 28 - august 2, 2003 ; proceedings / franz baader (ed.), 17-31, Springer, 2003. |
| René Thiemann, Jürgen Giesl. Size-change termination for term rewriting, Rewriting techniques and applications : 14th international conference, valencia, spain, june 9 - 11, 2003 ; proceedings / RTA 2003. Robert nieuwenhuis (ed.), 264-278, Springer, 2003. | |
| DOI | Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke. Improving dependency pairs, Logic for programming, artificial intelligence, and reasoning : 10th international conference, Almaty, Kazakhstan, September 22 - 26, 2003 ; proceedings / LPAR 2003. Moshe Y. Vardi ... (eds.), 167-182, Springer, 2003. |
| DOI | Jürgen Giesl, Aart Middeldorp. Innermost termination of context-sensitive rewriting, Developments in language theory : 6th international conference, kyoto, japan, september 18 - 21, 2002 ; revised papers / DLT 2002. [Masami ito ... (eds.)]. International conference on developments in language theory ; 6 (kyoto) : 2002.09.18-21. DLT 2002 ; 6 (kyoto) : 2002.09.18-21, 231-244, Springer, 2003. |
| Jürgen Giesl, Armin Kühnemann, Janis Voigtländer. Deaccumulation - Improving provability, Proceedings of the 8th asian computing science conference (ASIAN '03), 146-160, Springer, 2003. | |
| 2002 | |
| DOI | Jürgen Giesl, Thomas Arts, E. Ohlebusch. Modular termination proofs for rewriting using dependency pairs, 21-58, Elsevier, 2002. |
| 2001 | |
| Jürgen Giesl. Mechanized verification of imperative programs and partial functions, RWTH, 2001. | |
| Thomas Arts, Jürgen Giesl. A collection of examples for termination of term rewriting using dependency pairs, RWTH, 2001. | |
| Jürgen Giesl. Grundlagen der funktionalen Programmierung: Skript zur Vorlesung, RWTH, 2001. | |
| Jürgen Giesl. Automatisierte Programmverifikation : Skript zur Vorlesung, RWTH, 2001. | |
| Jürgen Giesl, Deepak Kapur. Dependency pairs for equational rewriting, Rewriting techniques and applications : 12th international conference ; proceedings / RTA 2001, utrecht, the netherlands, may 22 - 24, 2001. Aart middeldorp (ed.), 93-107, Springer, 2001. | |
| Jürgen Giesl, Aart Middeldorp. Transforming context-sensitive rewrite systems, Proceedings of the international workshop on rewriting in proof and computation (RPC '01), Sendai, Japan, 2001. | |
| Jürgen Giesl, Aart Middeldorp. Comparing techniques for automated termination proofs, Proceedings of the 5th international workshop on termination, Utrecht, The Netherlands, 2001. | |
| D. Duffy, Jürgen Giesl. Induction for specification languages like, Proceedings of the international workshop on verification, Siena, Italy, 2001. | |
| Jürgen Giesl, Aart Middeldorp. Eliminating dummy elimination, Proceedings of the 3rd JSSST workshop on programming and programming languages (PPL 2001), kameoko, japan, 2001. | |
| Jürgen Giesl. Process verification using dependency pairs, Deduction / organ. by ulrich furbach ... ; comp. by peter baumgartner ..., held at dagstuhl, germany during march 4 - march 9, 2001, 16-16, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), 2001. | |
| Jürgen Giesl, D. Kapur. Decidable classes of inductive theorems, Automated reasoning : first international joint conference, siena, italy, june 18 - 23, 2001 ; proceedings / IJCAR 2001. Rajeev goré ... (ed.), 469-484, Springer, 2001. | |
| DOI | Jürgen Giesl. Induction proofs with partial functions, 1-49, Springer, 2001. |
| DOI | Jürgen Giesl, Thomas Arts. Verification of Erlang processes by dependency pairs, 39-72, Springer, 2001. |
| 2000 | |
| D. Duffy, Jürgen Giesl. Closure induction in a Z-like language, Formal specification and development in Z and B : proceedings / ZB 2000, first international conference of B and Z users, york, UK, august 29 - september 2, 2000. Jonathan P. Bowen ... (ed.), 471-490, Springer, 2000. | |
| DOI | H. Ohsaki, A. Middeldorp, Jürgen Giesl. Equational termination by semantic labelling, Computer science logic : 14th InternationalWorkshop, CSL 2000 annual conference of the EACSL fischbachau, germany, august 21 – 26, 2000 proceedings / edited by peter G. Clote, helmut schwichtenberg, 457-471, Springer-Verlag Berlin Heidelberg, 2000. |
| Jürgen Giesl, E. Ohlebusch. Pushing the frontiers of combining rewrite systems farther outwards, Frontiers of combining systems 2 : Proceedings of the 2. International worhshop on frontiers of combining systems, amsterdam, the netherlands / FroCoS '98 / gabbay, D. M. [u.a.] hrsg, 141-160, Research Studies Press, 2000. | |
| Jürgen Giesl, A. Middeldorp. Eliminating dummy elimination, Automated deduction : proceedings ; pittsburgh, PA, USA, june 17 - 20, 2000 / CADE-17, 17th international conference on automated deduction. David McAllester (ed.), 309-323, Springer, 2000. | |
| DOI | Jürgen Giesl. Context-moving transformations for function verification, Logic based program synthesis and transformation : 9th international workshop; selected papers / LOPSTR '99, Venice, Italy, September 22 - 24, 1999. Annalisa Bossi (ed.), 293-312, Springer, 2000. |
| DOI | Thomas Arts, Jürgen Giesl. Termination of term rewriting using dependency pairs, 133-178, Elsevier, 2000. |
| Show all | |