The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "René Thiemann" ( http://dblp.L3S.de/Authors/René_Thiemann )

  Author page on DBLP  Author page in RDF  Community of René Thiemann in ASPL-2

Publication years (Num. hits)
2003-2007 (21) 2008-2010 (19) 2011-2012 (15) 2013-2015 (23) 2016-2017 (15) 2018-2019 (10)
Publication types (Num. hits)
article(51) inproceedings(51) phdthesis(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 10 occurrences of 5 keywords

Results
Found 104 publication records. Showing 103 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Ralph Bottesch, Max W. Haslbeck, René Thiemann Farkas' Lemma and Motzkin's Transposition Theorem. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2019 DBLP  BibTeX  RDF
1Ralph Bottesch, Alban Reynaud, René Thiemann Linear Inequalities. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2019 DBLP  BibTeX  RDF
1Vivek Nigam, René Thiemann Logical and Semantic Frameworks with Applications. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Christian Sternagel, René Thiemann First-Order Terms. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2018 DBLP  BibTeX  RDF
1Jose Divasón, Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada 0002 A verified LLL algorithm. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2018 DBLP  BibTeX  RDF
1Filip Maric, Mirko Spasic, René Thiemann An Incremental Simplex Algorithm with Unsatisfiable Core Generation. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2018 DBLP  BibTeX  RDF
1Jose Divasón, Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada 0002 A verified factorization algorithm for integer polynomials with polynomial complexity. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2018 DBLP  BibTeX  RDF
1Jose Divasón, Sebastiaan J. C. Joosten, Ondrej Kuncar, René Thiemann, Akihisa Yamada 0002 Efficient certification of complexity proofs: formalizing the Perron-Frobenius theorem (invited talk paper). Search on Bibsonomy CPP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ralph Bottesch, Max W. Haslbeck, René Thiemann A Verified Efficient Implementation of the LLL Basis Reduction Algorithm. Search on Bibsonomy LPAR The full citation details ... 2018 DBLP  BibTeX  RDF
1Jose Divasón, Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada 0002 A Formalization of the LLL Basis Reduction Algorithm. Search on Bibsonomy ITP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bertram Felgenhauer, René Thiemann Reachability, confluence, and termination analysis with state-compatible automata. Search on Bibsonomy Inf. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1René Thiemann Stochastic Matrices and the Perron-Frobenius Theorem. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2017 DBLP  BibTeX  RDF
1Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada 0002 Subresultants. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2017 DBLP  BibTeX  RDF
1Jü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. Search on Bibsonomy J. Autom. Reasoning The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jose Divasón, Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada 0002 A formalization of the Berlekamp-Zassenhaus factorization algorithm. Search on Bibsonomy CPP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Marc Brockschmidt, Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada 0002 Certifying Safety and Termination Proofs for Integer Transition Systems. Search on Bibsonomy CADE The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Julian Biendarra, Jasmin Christian Blanchette, Aymeric Bouzy, Martin Desharnais, Mathias Fleury, Johannes Hölzl, Ondrej Kuncar, Andreas Lochbihler, Fabian Meier, Lorenz Panny, Andrei Popescu 0001, Christian Sternagel, René Thiemann, Dmitriy Traytel Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic. Search on Bibsonomy FroCoS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Mario R. F. Benevides, René Thiemann Preface. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jose Divasón, Ondrej Kuncar, René Thiemann, Akihisa Yamada 0002 Perron-Frobenius Theorem for Spectral Radius Analysis. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2016 DBLP  BibTeX  RDF
1René Thiemann, Akihisa Yamada 0002 Polynomial Factorization. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2016 DBLP  BibTeX  RDF
1Jose Divasón, Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada 0002 The Factorization Algorithm of Berlekamp and Zassenhaus. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2016 DBLP  BibTeX  RDF
1René Thiemann, Akihisa Yamada 0002 Polynomial Interpolation. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2016 DBLP  BibTeX  RDF
1René Thiemann, Akihisa Yamada 0002 Formalizing jordan normal forms in Isabelle/HOL. Search on Bibsonomy CPP The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1René Thiemann, Akihisa Yamada 0002 Algebraic Numbers in Isabelle/HOL. Search on Bibsonomy ITP The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Akihisa Yamada 0002, Christian Sternagel, René Thiemann, Keiichirou Kusakari AC Dependency Pairs Revisited. Search on Bibsonomy CSL The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Christian Sternagel, René Thiemann A Framework for Developing Stand-Alone Certifiers. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Julian Nagele, René Thiemann Certification of Confluence Proofs using CeTA. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1René Thiemann, Akihisa Yamada 0002 Algebraic Numbers in Isabelle/HOL. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2015 DBLP  BibTeX  RDF
1René Thiemann, Akihisa Yamada 0002 Matrices, Jordan Normal Forms, and Spectral Radius Theory. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2015 DBLP  BibTeX  RDF
1Christian Sternagel, René Thiemann Deriving class instances for datatypes. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2015 DBLP  BibTeX  RDF
1Martin Avanzini, Christian Sternagel, René Thiemann Certification of Complexity Proofs using CeTA. Search on Bibsonomy RTA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Christian Sternagel, René Thiemann Deriving Comparators and Show Functions in Isabelle/HOL. Search on Bibsonomy ITP The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jürgen Giesl, Frédéric Mesnard, Albert Rubio, René Thiemann, Johannes Waldmann Termination Competition (termCOMP 2015). Search on Bibsonomy CADE The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Sarah Winkler, René Thiemann Formalizing Soundness and Completeness of Unravelings. Search on Bibsonomy FroCos The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Christian Sternagel, René Thiemann The Certification Problem Format. Search on Bibsonomy UITP The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1René Thiemann Mutually Recursive Partial Functions. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2014 DBLP  BibTeX  RDF
1Christian Sternagel, René Thiemann Haskell's Show-Class in Isabelle/HOL. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2014 DBLP  BibTeX  RDF
1Christian Sternagel, René Thiemann XML. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2014 DBLP  BibTeX  RDF
1Christian Sternagel, René Thiemann Certification Monads. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2014 DBLP  BibTeX  RDF
1René Thiemann Implementing field extensions of the form Q[sqrt(b)]. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2014 DBLP  BibTeX  RDF
1René Thiemann Lifting Definition Option. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2014 DBLP  BibTeX  RDF
1Christian Sternagel, René Thiemann Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs. Search on Bibsonomy RTA-TLCA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Bertram Felgenhauer, René Thiemann Reachability Analysis with State-Compatible Automata. Search on Bibsonomy LATA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Julian Nagele, René Thiemann, Sarah Winkler Certification of Nontermination Proofs Using Strategies and Nonlooping Derivations. Search on Bibsonomy VSTTE The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Jü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. Search on Bibsonomy IJCAR The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1René Thiemann Computing Square Roots using the Babylonian Method. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2013 DBLP  BibTeX  RDF
1Christian Sternagel, René Thiemann Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion. Search on Bibsonomy RTA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1René Thiemann Formalizing Bounded Increase. Search on Bibsonomy ITP The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Christian Sternagel, René Thiemann, Sarah Winkler, Harald Zankl CeTA - A Tool for Certified Termination Analysis Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Thomas Sternagel, René Thiemann, Harald Zankl, Christian Sternagel Recording Completion for Finding and Certifying Proofs in Equational Logic Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1René Thiemann Towards the Certification of Complexity Proofs Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Christian Sternagel, René Thiemann Certification extends Termination Techniques Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Christian Sternagel, René Thiemann A Relative Dependency Pair Framework Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1René Thiemann Generating linear orders for datatypes. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2012 DBLP  BibTeX  RDF
1René Thiemann Executable Transitive Closures. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2012 DBLP  BibTeX  RDF
1Michael Codish, Jürgen Giesl, Peter Schneider-Kamp, René Thiemann SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs. Search on Bibsonomy J. Autom. Reasoning The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1René Thiemann, Guillaume Allais, Julian Nagele On the Formalization of Termination Techniques based on Multiset Orderings. Search on Bibsonomy RTA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Christian Sternagel, René Thiemann Certification of Nontermination Proofs. Search on Bibsonomy ITP The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Christian Sternagel, René Thiemann Executable Transitive Closures of Finite Relations. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2011 DBLP  BibTeX  RDF
1Jürgen Giesl, Matthias Raffelsieper, Peter Schneider-Kamp, Stephan Swiderski, René Thiemann Automated termination proofs for haskell by term rewriting. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christian Sternagel, René Thiemann Modular and Certified Semantic Labeling and Unlabeling. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Alexander Krauss, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl Termination of Isabelle Functions via Termination of Rewriting. Search on Bibsonomy ITP The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christian Sternagel, René Thiemann Generalized and Formalized Uncurrying. Search on Bibsonomy FroCoS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann Automated Termination Analysis for Logic Programs with Cut Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1René Thiemann, Christian Sternagel, Jürgen Giesl, Peter Schneider-Kamp Loops under Strategies ... Continued Search on Bibsonomy IWS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Christian Sternagel, René Thiemann Abstract Rewriting. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2010 DBLP  BibTeX  RDF
1Christian Sternagel, René Thiemann Executable Multivariate Polynomials. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2010 DBLP  BibTeX  RDF
1Christian Sternagel, René Thiemann Executable Matrix Operations on Matrices of Arbitrary Dimensions. Search on Bibsonomy Archive of Formal Proofs The full citation details ... 2010 DBLP  BibTeX  RDF
1Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann Automated termination analysis for logic programs with cut. Search on Bibsonomy TPLP The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Christian Sternagel, René Thiemann Certified Subterm Criterion and Certified Usable Rules. Search on Bibsonomy RTA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Christian Sternagel, René Thiemann Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs. Search on Bibsonomy CSL The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann Automated termination proofs for logic programs by term rewriting. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1René Thiemann, Christian Sternagel Loops under Strategies. Search on Bibsonomy RTA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1René Thiemann From Outermost Termination to Innermost Termination. Search on Bibsonomy SOFSEM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1René Thiemann, Christian Sternagel Certification of Termination Proofs Using CeTA. Search on Bibsonomy TPHOLs The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1René Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp Adding constants to string rewriting. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Termination, Term rewriting, Confluence, String rewriting
1René Thiemann, Aart Middeldorp Innermost Termination of Rewrite Systems by Labeling. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann Automated Termination Proofs for Logic Programs by Term Rewriting Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Moritz de Greck, Michael Rotte, Rabea Paus, Diana Moritz, René Thiemann, U. Proesch, U. Bruer, S. Moerth, Claus Tempelmann, Bernhard Bogerts, Georg Northoff Is our self based on reward? Self-relatedness recruits neural activity in the reward system. Search on Bibsonomy NeuroImage The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1René Thiemann, Jürgen Giesl, Peter Schneider-Kamp Deciding Innermost Loops. Search on Bibsonomy RTA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl Maximal Termination. Search on Bibsonomy RTA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Beatriz 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. Search on Bibsonomy LPAR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Jü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. Search on Bibsonomy Deduction and Decision Procedures The full citation details ... 2007 DBLP  BibTeX  RDF
1Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, Harald Zankl Implementing RPO and POLO using SAT. Search on Bibsonomy Deduction and Decision Procedures The full citation details ... 2007 DBLP  BibTeX  RDF
1René Thiemann, Jürgen Giesl, Peter Schneider-Kamp Decision Procedures for Loop Detection. Search on Bibsonomy Deduction and Decision Procedures The full citation details ... 2007 DBLP  BibTeX  RDF
1Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp Proving Termination by Bounded Increase. Search on Bibsonomy CADE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl SAT Solving for Termination Analysis with Polynomial Interpretations. Search on Bibsonomy SAT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl Proving Termination Using Recursive Path Orders and SAT Solving. Search on Bibsonomy FroCoS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1René Thiemann The DP framework for proving termination of term rewriting. Search on Bibsonomy 2007   RDF
1Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl SAT Solving for Argument Filterings Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke 0001 Mechanizing and Improving Dependency Pairs. Search on Bibsonomy J. Autom. Reasoning The full citation details ... 2006 DBLP  DOI  BibTeX  RDF termination, term rewriting, dependency pairs
1Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. Search on Bibsonomy RTA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl SAT Solving for Argument Filterings. Search on Bibsonomy LPAR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann Automated Termination Analysis for Logic Programs by Term Rewriting. Search on Bibsonomy LOPSTR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Jürgen Giesl, Peter Schneider-Kamp, René Thiemann Automatic Termination Proofs in the Dependency Pair Framework. Search on Bibsonomy IJCAR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1René Thiemann, Jürgen Giesl The size-change principle and dependency pairs for termination of term rewriting. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Size-change principle, Termination, Term rewriting, Dependency pairs
1Jürgen Giesl, René Thiemann, Peter Schneider-Kamp Proving and Disproving Termination in the Dependency Pair Framework. Search on Bibsonomy Deduction and Applications The full citation details ... 2005 DBLP  BibTeX  RDF
1Jürgen Giesl, René Thiemann, Peter Schneider-Kamp Proving and Disproving Termination of Higher-Order Functions. Search on Bibsonomy FroCoS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke 0001 Automated Termination Proofs with AProVE. Search on Bibsonomy RTA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Jürgen Giesl, René Thiemann, Peter Schneider-Kamp The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. Search on Bibsonomy LPAR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 103 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license