Carsten Fuhs

According to our database, Carsten Fuhs authored at least 44 papers between 2007 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2023

On Complexity Bounds and Confluence of Parallel Term Rewriting.

Thaïs Baudon, Carsten Fuhs, Laure Gonnord

CoRR, 2023

2022

A calculus for modular loop acceleration and non-termination proofs.

Florian Frohn, Carsten Fuhs

Int. J. Softw. Tools Technol. Transf., 2022

Analysing Parallel Complexity of Term Rewriting.

Thaïs Baudon, Carsten Fuhs, Laure Gonnord

Proceedings of the Logic-Based Program Synthesis and Transformation, 2022

2019

Deduction Beyond Satisfiability (Dagstuhl Seminar 19371).

Carsten Fuhs, Philipp Rümmer, Renate A. Schmidt, Cesare Tinelli

Dagstuhl Reports, 2019

Transforming Derivational Complexity of Term Rewriting to Runtime Complexity.

Carsten Fuhs

Proceedings of the Frontiers of Combining Systems - 12th International Symposium, 2019

A Static Higher-Order Dependency Pair Framework.

Carsten Fuhs, Cynthia Kop

Proceedings of the Programming Languages and Systems, 2019

2018

The unified higher-order dependency pair framework.

Carsten Fuhs, Cynthia Kop

CoRR, 2018

2017

Verifying Procedural Programs via Constrained Rewriting Induction.

Carsten Fuhs, Cynthia Kop, Naoki Nishida

ACM Trans. Comput. Log., 2017

Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic.

Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp, Cornelius Aschermann

J. Autom. Reason., 2017

Analyzing Program Termination and Complexity Automatically with AProVE.

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

J. Autom. Reason., 2017

Deduction Beyond First-Order Logic (Dagstuhl Seminar 17371).

Jasmin Christian Blanchette, Carsten Fuhs, Viorica Sofronie-Stokkermans, Cesare Tinelli

Dagstuhl Reports, 2017

Complexity Analysis for Term Rewriting by Integer Transition Systems.

Matthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs, Jürgen Giesl

Proceedings of the Frontiers of Combining Systems - 11th International Symposium, 2017

2016

Analyzing Runtime and Size Complexity of Integer Programs.

Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl

ACM Trans. Program. Lang. Syst., 2016

2015

Embracing Overapproximation for Proving Nontermination.

Byron Cook, Carsten Fuhs, Kaustubh Nimkar, Peter W. O'Hearn

Tiny Trans. Comput. Sci., 2015

2014

Proving Nontermination via Safety.

Hong Yi Chen, Byron Cook, Carsten Fuhs, Kaustubh Nimkar, Peter W. O'Hearn

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2014

Alternating Runtime and Size Complexity Analysis of Integer Programs.

Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2014

First-Order Formative Rules.

Carsten Fuhs, Cynthia Kop

Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

Disproving termination with overapproximation.

Byron Cook, Carsten Fuhs, Kaustubh Nimkar, Peter W. O'Hearn

Proceedings of the Formal Methods in Computer-Aided Design, 2014

A decision procedure for satisfiability in separation logic with inductive predicates.

James Brotherston, Carsten Fuhs, Juan Antonio Navarro Pérez, Nikos Gorogiannis

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Proving Termination and Memory Safety for Programs with Pointer Arithmetic.

Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp

Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

Proving Termination of Programs Automatically with AProVE.

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

Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013

Better Termination Proving through Cooperation.

Marc Brockschmidt, Byron Cook, Carsten Fuhs

Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012

SAT encodings: from constraint-based termination analysis to circuit synthesis.

Carsten Fuhs

PhD thesis, 2012

Polynomial Interpretations for Higher-Order Rewriting.

Carsten Fuhs, Cynthia Kop

Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs.

Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs

Proceedings of the Principles and Practice of Declarative Programming, 2012

Exotic Semi-Ring Constraints.

Michael Codish, Yoav Fekete, Carsten Fuhs, Jürgen Giesl, Johannes Waldmann

Proceedings of the 10th International Workshop on Satisfiability Modulo Theories, 2012

2011

SAT-based termination analysis using monotonicity constraints over the integers.

Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl

Theory Pract. Log. Program., 2011

Proving Termination by Dependency Pairs and Inductive Theorem Proving.

Carsten Fuhs, Jürgen Giesl, Michael Parting, Peter Schneider-Kamp, Stephan Swiderski

J. Autom. Reason., 2011

Optimal Base Encodings for Pseudo-Boolean Constraints.

Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2011

A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog.

Thomas Ströder, Fabian Emmes, Peter Schneider-Kamp, Jürgen Giesl, Carsten Fuhs

Proceedings of the Logic-Based Program Synthesis and Transformation, 2011

Termination of Isabelle Functions via Termination of Rewriting.

Alexander Krauss, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl

Proceedings of the Interactive Theorem Proving - Second International Conference, 2011

Harnessing First Order Termination Provers Using Higher Order Dependency Pairs.

Carsten Fuhs, Cynthia Kop

Proceedings of the Frontiers of Combining Systems, 8th International Symposium, 2011

2010

Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT.

Carsten Fuhs, Peter Schneider-Kamp

Proceedings of the Theory and Applications of Satisfiability Testing, 2010

Optimizing the AES S-Box using SAT.

Carsten Fuhs, Peter Schneider-Kamp

Proceedings of the 8th International Workshop on the Implementation of Logics, 2010

Lazy Abstraction for Size-Change Termination.

Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009

Proving Termination of Integer Term Rewriting.

Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke

Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

Inductive Theorem Proving meets Dependency Pairs.

Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp

Proceedings of the Interaction versus Automation: The two Faces of Deduction, 04.10., 2009

Termination of Integer Term Rewriting.

Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke

Proceedings of the Interaction versus Automation: The two Faces of Deduction, 04.10., 2009

Termination Analysis by Dependency Pairs and Inductive Theorem Proving.

Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp

Proceedings of the Automated Deduction, 2009

2008

Maximal Termination.

Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl

Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Improving Context-Sensitive Dependency Pairs.

Beatriz Alarcón, Fabian Emmes, Carsten Fuhs, Jürgen Giesl, Raúl Gutiérrez, Salvador Lucas, Peter Schneider-Kamp, René Thiemann

Proceedings of the Logic for Programming, 2008

Search Techniques for Rational Polynomial Orders.

Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto, Jürgen Giesl, Salvador Lucas, Peter Schneider-Kamp

Proceedings of the Intelligent Computer Mathematics, 9th International Conference, 2008

2007

SAT Solving for Termination Analysis with Polynomial Interpretations.

Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Implementing RPO and POLO using SAT.

Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, Harald Zankl

Proceedings of the Deduction and Decision Procedures, 30.09. - 05.10.2007, 2007