Carsten Fuhs

Publication Activity (10 Years)

Years Active: 2007-2023
Publications (10 Years): 16

Top Venues

CoRR

TACAS

IJCAR

J. Autom. Reason.

RWTH Aachen University (PHD)

Education History

RWTH Aachen University

PHD

Publications

Thaïs Baudon, Carsten Fuhs, Laure Gonnord
On Complexity Bounds and Confluence of Parallel Term Rewriting. CoRR (2023)
Thaïs Baudon, Carsten Fuhs, Laure Gonnord
Analysing Parallel Complexity of Term Rewriting. CoRR (2022)
Thaïs Baudon, Carsten Fuhs, Laure Gonnord
Analysing Parallel Complexity of Term Rewriting. LOPSTR (2022)
Florian Frohn, Carsten Fuhs
A calculus for modular loop acceleration and non-termination proofs. Int. J. Softw. Tools Technol. Transf. 24 (5) (2022)
Florian Frohn, Carsten Fuhs
A Calculus for Modular Loop Acceleration and Non-Termination Proofs. CoRR (2021)
Carsten Fuhs, Philipp Rümmer, Renate A. Schmidt, Cesare Tinelli
Deduction Beyond Satisfiability (Dagstuhl Seminar 19371). Dagstuhl Reports 9 (9) (2019)
Carsten Fuhs, Cynthia Kop
A Static Higher-Order Dependency Pair Framework. ESOP (2019)
Carsten Fuhs
Transforming Derivational Complexity of Term Rewriting to Runtime Complexity. FroCos (2019)
Carsten Fuhs, Cynthia Kop
A static higher-order dependency pair framework. CoRR (2019)
Carsten Fuhs, Cynthia Kop
The unified higher-order dependency pair framework. CoRR (2018)
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. J. Autom. Reason. 58 (1) (2017)
Jasmin Christian Blanchette, Carsten Fuhs, Viorica Sofronie-Stokkermans, Cesare Tinelli
Deduction Beyond First-Order Logic (Dagstuhl Seminar 17371). Dagstuhl Reports 7 (9) (2017)
Carsten Fuhs, Cynthia Kop, Naoki Nishida
Verifying Procedural Programs via Constrained Rewriting Induction. ACM Trans. Comput. Log. 18 (2) (2017)
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. J. Autom. Reason. 58 (1) (2017)
Matthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs, Jürgen Giesl
Complexity Analysis for Term Rewriting by Integer Transition Systems. FroCoS (2017)
Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl
Analyzing Runtime and Size Complexity of Integer Programs. ACM Trans. Program. Lang. Syst. 38 (4) (2016)
Byron Cook, Carsten Fuhs, Kaustubh Nimkar, Peter W. O'Hearn
Embracing Overapproximation for Proving Nontermination. Tiny Trans. Comput. Sci. 3 (2015)
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. IJCAR (2014)
Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl
Alternating Runtime and Size Complexity Analysis of Integer Programs. TACAS (2014)
Carsten Fuhs, Cynthia Kop
First-Order Formative Rules. RTA-TLCA (2014)
Byron Cook, Carsten Fuhs, Kaustubh Nimkar, Peter W. O'Hearn
Disproving termination with overapproximation. FMCAD (2014)
James Brotherston, Carsten Fuhs, Juan Antonio Navarro Pérez, Nikos Gorogiannis
A decision procedure for satisfiability in separation logic with inductive predicates. CSL-LICS (2014)
Jü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. IJCAR (2014)
Hong Yi Chen, Byron Cook, Carsten Fuhs, Kaustubh Nimkar, Peter W. O'Hearn
Proving Nontermination via Safety. TACAS (2014)
Carsten Fuhs, Cynthia Kop
First-Order Formative Rules. CoRR (2014)
Marc Brockschmidt, Byron Cook, Carsten Fuhs
Better Termination Proving through Cooperation. CAV (2013)
Carsten Fuhs, Cynthia Kop
Polynomial Interpretations for Higher-Order Rewriting. RTA (2012)
Carsten Fuhs, Cynthia Kop
Polynomial Interpretations for Higher-Order Rewriting CoRR (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. PPDP (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. LOPSTR (2012)
Michael Codish, Yoav Fekete, Carsten Fuhs, Jürgen Giesl, Johannes Waldmann
Exotic Semi-Ring Constraints. SMT@IJCAR (2012)
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. LOPSTR (2011)
Carsten Fuhs, Jürgen Giesl, Michael Parting, Peter Schneider-Kamp, Stephan Swiderski
Proving Termination by Dependency Pairs and Inductive Theorem Proving. J. Autom. Reason. 47 (2) (2011)
Alexander Krauss, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl
Termination of Isabelle Functions via Termination of Rewriting. ITP (2011)
Carsten Fuhs, Cynthia Kop
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs. FroCoS (2011)
Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp
Optimal Base Encodings for Pseudo-Boolean Constraints. TACAS (2011)
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl
SAT-based termination analysis using monotonicity constraints over the integers. Theory Pract. Log. Program. 11 (4-5) (2011)
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers CoRR (2011)
Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp
Lazy Abstraction for Size-Change Termination. LPAR (Yogyakarta) (2010)
Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp
Optimal Base Encodings for Pseudo-Boolean Constraints CoRR (2010)
Carsten Fuhs, Peter Schneider-Kamp
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT. SAT (2010)
Carsten Fuhs, Peter Schneider-Kamp
Optimizing the AES S-Box using SAT. IWIL@LPAR (2010)
Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke
Termination of Integer Term Rewriting. Interaction versus Automation: The two Faces of Deduction (2009)
Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp
Inductive Theorem Proving meets Dependency Pairs. Interaction versus Automation: The two Faces of Deduction (2009)
Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke
Proving Termination of Integer Term Rewriting. RTA (2009)
Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp
Termination Analysis by Dependency Pairs and Inductive Theorem Proving. CADE (2009)
Beatriz 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. LPAR (2008)
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto, Jürgen Giesl, Salvador Lucas, Peter Schneider-Kamp
Search Techniques for Rational Polynomial Orders. AISC/MKM/Calculemus (2008)
Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl
Maximal Termination. RTA (2008)
Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, Harald Zankl
Implementing RPO and POLO using SAT. Deduction and Decision Procedures (2007)
Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl
SAT Solving for Termination Analysis with Polynomial Interpretations. SAT (2007)

Carsten Fuhs.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Carsten Fuhs