default search action
Bertram Felgenhauer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j11]Alexander Lochmann, Bertram Felgenhauer:
First-Order Theory of Rewriting. Arch. Formal Proofs 2022 (2022) - 2021
- [j10]Alexander Lochmann, Bertram Felgenhauer, Christian Sternagel, René Thiemann, Thomas Sternagel:
Regular Tree Relations. Arch. Formal Proofs 2021 (2021) - [c14]Alexander Lochmann
, Aart Middeldorp
A verified decision procedure for the first-order theory of rewriting for linear variable-separated rewrite systems. CPP 2021: 250-263 - [c13]Fabian Mitterwallner
Certifying Proofs in the First-Order Theory of Rewriting. TACAS (2) 2021: 127-144 - 2020
- [j9]Bertram Felgenhauer:
Implementing the Goodstein Function in λ-Calculus. Arch. Formal Proofs 2020 (2020)
2010 – 2019
- 2019
- [c12]Bertram Felgenhauer, Aart Middeldorp
A verified ground confluence tool for linear variable-separated rewrite systems in Isabelle/HOL. CPP 2019: 132-143 - 2018
- [j8]Bertram Felgenhauer:
Minsky Machines. Arch. Formal Proofs 2018 (2018) - [j7]Bertram Felgenhauer:
Deciding Confluence and Normal Form Properties of Ground Term Rewrite Systems Efficiently. Log. Methods Comput. Sci. 14(4) (2018) - [c11]Bertram Felgenhauer, Franziska Rapp:
Layer Systems for Confluence - Formalized. ICTAC 2018: 173-190 - 2017
- [j6]Bertram Felgenhauer, René Thiemann
Reachability, confluence, and termination analysis with state-compatible automata. Inf. Comput. 253: 467-483 (2017) - [j5]Julian Nagele
Certifying Confluence Proofs via Relative Termination and Rule Labeling. Log. Methods Comput. Sci. 13(2) (2017) - [c10]Bertram Felgenhauer:
Beyond DRAT: Challenges in Certifying UNSAT. ARCADE@CADE 2017: 46-50 - [c9]Julian Nagele
CSI: New Evidence - A Progress Report. CADE 2017: 385-397 - [c8]Bertram Felgenhauer, Aart Middeldorp
Constructing Cycles in the Simplex Method for DPLL(T). ICTAC 2017: 213-228 - [i5]Bertram Felgenhauer:
Deciding Confluence and Normal Form Properties of Ground Term Rewrite Systems Efficiently. CoRR abs/1710.10991 (2017) - 2016
- [j4]Bertram Felgenhauer, Julian Nagele, Vincent van Oostrom, Christian Sternagel:
The Z Property. Arch. Formal Proofs 2016 (2016) - [i4]Julian Nagele
Certifying Confluence Proofs via Relative Termination and Rule Labeling. CoRR abs/1612.07195 (2016) - 2015
- [j3]Bertram Felgenhauer:
Decreasing Diagrams II. Arch. Formal Proofs 2015 (2015) - [j2]Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
Labelings for Decreasing Diagrams. J. Autom. Reason. 54(2): 101-133 (2015) - [j1]Bertram Felgenhauer, Aart Middeldorp
Layer Systems for Proving Confluence. ACM Trans. Comput. Log. 16(2): 14:1-14:32 (2015) - [c7]Julian Nagele
Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules. RTA 2015: 257-268 - 2014
- [c6]Bertram Felgenhauer, René Thiemann
Reachability Analysis with State-Compatible Automata. LATA 2014: 347-359 - [i3]Bertram Felgenhauer, Aart Middeldorp, Harald Zankl, Vincent van Oostrom
Layer Systems for Proving Confluence. CoRR abs/1404.1225 (2014) - [i2]Harald Zankl, Bertram Felgenhauer, Aart Middeldorp:
Labelings for Decreasing Diagrams. CoRR abs/1406.3139 (2014) - 2013
- [c5]Bertram Felgenhauer, Vincent van Oostrom
Proof Orders for Decreasing Diagrams. RTA 2013: 174-189 - [i1]Bertram Felgenhauer, Martin Avanzini, Christian Sternagel:
A Haskell Library for Term Rewriting. CoRR abs/1307.2328 (2013) - 2012
- [c4]Bertram Felgenhauer:
Deciding Confluence of Ground Term Rewrite Systems in Cubic Time. RTA 2012: 165-175 - 2011
- [c3]Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
CSI - A Confluence Tool. CADE 2011: 499-505 - [c2]Bertram Felgenhauer, Harald Zankl, Aart Middeldorp
Layer Systems for Proving Confluence. FSTTCS 2011: 288-299 - [c1]Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
Labelings for Decreasing Diagrams. RTA 2011: 377-392
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: