Bertram Felgenhauer

31 papers A 2B 2C 3Journal 17Unranked 7
YearRankTypeTitle / Venue / Authors
2025 J jnl
First-Order Rewriting.
Arch. Formal Proofs
René Thiemann, Christian Sternagel, Christina Kirk, Martin Avanzini, Bertram Felgenhauer, Julian Nagele, Thomas Sternagel, Sarah Winkler, Akihisa Yamada
2022 J jnl
First-Order Theory of Rewriting.
Arch. Formal Proofs
Alexander Lochmann, Bertram Felgenhauer
2021 B conf
A verified decision procedure for the first-order theory of rewriting for linear variable-separated rewrite systems.
CPP
Alexander Lochmann, Aart Middeldorp, Fabian Mitterwallner, Bertram Felgenhauer
2021 — conf
Certifying Proofs in the First-Order Theory of Rewriting.
TACAS (2)
Fabian Mitterwallner, Alexander Lochmann, Aart Middeldorp, Bertram Felgenhauer
2021 J jnl
Regular Tree Relations.
Arch. Formal Proofs
Alexander Lochmann, Bertram Felgenhauer, Christian Sternagel, René Thiemann, Thomas Sternagel
2020 J jnl
Implementing the Goodstein Function in λ-Calculus.
Arch. Formal Proofs
Bertram Felgenhauer
2019 B conf
A verified ground confluence tool for linear variable-separated rewrite systems in Isabelle/HOL.
CPP
Bertram Felgenhauer, Aart Middeldorp, T. V. H. Prathamesh, Franziska Rapp
2018 J jnl
Deciding Confluence and Normal Form Properties of Ground Term Rewrite Systems Efficiently.
Log. Methods Comput. Sci.
Bertram Felgenhauer
2018 C conf
Layer Systems for Confluence - Formalized.
ICTAC
Bertram Felgenhauer, Franziska Rapp
2018 J jnl
Minsky Machines.
Arch. Formal Proofs
Bertram Felgenhauer
2017 — conf
Beyond DRAT: Challenges in Certifying UNSAT.
ARCADE@CADE
Bertram Felgenhauer
2017 A conf
CSI: New Evidence - A Progress Report.
CADE
Julian Nagele, Bertram Felgenhauer, Aart Middeldorp
2017 J jnl
Certifying Confluence Proofs via Relative Termination and Rule Labeling.
Log. Methods Comput. Sci.
Julian Nagele, Bertram Felgenhauer, Harald Zankl
2017 C conf
Constructing Cycles in the Simplex Method for DPLL(T).
ICTAC
Bertram Felgenhauer, Aart Middeldorp
2017 J jnl
Deciding Confluence and Normal Form Properties of Ground Term Rewrite Systems Efficiently.
CoRR
Bertram Felgenhauer
2017 J jnl
Reachability, confluence, and termination analysis with state-compatible automata.
Inf. Comput.
Bertram Felgenhauer, René Thiemann
2016 J jnl
Certifying Confluence Proofs via Relative Termination and Rule Labeling.
CoRR
Julian Nagele, Bertram Felgenhauer, Harald Zankl
2016 J jnl
The Z Property.
Arch. Formal Proofs
Bertram Felgenhauer, Julian Nagele, Vincent van Oostrom, Christian Sternagel
2015 J jnl
Decreasing Diagrams II.
Arch. Formal Proofs
Bertram Felgenhauer
2015 — conf
Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules.
RTA
Julian Nagele, Bertram Felgenhauer, Aart Middeldorp
2015 J jnl
Labelings for Decreasing Diagrams.
J. Autom. Reason.
Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
2015 J jnl
Layer Systems for Proving Confluence.
ACM Trans. Comput. Log.
Bertram Felgenhauer, Aart Middeldorp, Harald Zankl, Vincent van Oostrom
2014 J jnl
Labelings for Decreasing Diagrams.
CoRR
Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
2014 J jnl
Layer Systems for Proving Confluence.
CoRR
Bertram Felgenhauer, Aart Middeldorp, Harald Zankl, Vincent van Oostrom
2014 C conf
Reachability Analysis with State-Compatible Automata.
LATA
Bertram Felgenhauer, René Thiemann
2013 J jnl
A Haskell Library for Term Rewriting.
CoRR
Bertram Felgenhauer, Martin Avanzini, Christian Sternagel
2013 — conf
Proof Orders for Decreasing Diagrams.
RTA
Bertram Felgenhauer, Vincent van Oostrom
2012 — conf
Deciding Confluence of Ground Term Rewrite Systems in Cubic Time.
RTA
Bertram Felgenhauer
2011 A conf
CSI - A Confluence Tool.
CADE
Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
2011 — conf
Labelings for Decreasing Diagrams.
RTA
Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
2011 — conf
Layer Systems for Proving Confluence.
FSTTCS
Bertram Felgenhauer, Harald Zankl, Aart Middeldorp