Carsten Fuhs

55 papers A* 1A 9B 5C 4Journal 20Unranked 15
YearRankTypeTitle / Venue / Authors
2025 B conf
An Innermost DP Framework for Constrained Higher-Order Rewriting.
FSCD
Carsten Fuhs, Liye Guo, Cynthia Kop
2024 J jnl
On Complexity Bounds and Confluence of Parallel Term Rewriting.
Fundam. Informaticae
Thaïs Baudon, Carsten Fuhs, Laure Gonnord
2024 B conf
Proving Termination via Measure Transfer in Equivalence Checking.
IFM
Dragana Milovancevic, Carsten Fuhs, Mario Bucev, Viktor Kuncak
2023 J jnl
On Complexity Bounds and Confluence of Parallel Term Rewriting.
CoRR
Thaïs Baudon, Carsten Fuhs, Laure Gonnord
2022 J jnl
A calculus for modular loop acceleration and non-termination proofs.
Int. J. Softw. Tools Technol. Transf.
Florian Frohn, Carsten Fuhs
2022 C conf
Analysing Parallel Complexity of Term Rewriting.
LOPSTR
Thaïs Baudon, Carsten Fuhs, Laure Gonnord
2022 J jnl
Analysing Parallel Complexity of Term Rewriting.
CoRR
Thaïs Baudon, Carsten Fuhs, Laure Gonnord
2021 J jnl
A Calculus for Modular Loop Acceleration and Non-Termination Proofs.
CoRR
Florian Frohn, Carsten Fuhs
2019 A conf
A Static Higher-Order Dependency Pair Framework.
ESOP
Carsten Fuhs, Cynthia Kop
2019 J jnl
A static higher-order dependency pair framework.
CoRR
Carsten Fuhs, Cynthia Kop
2019 J jnl
Deduction Beyond Satisfiability (Dagstuhl Seminar 19371).
Dagstuhl Reports
Carsten Fuhs, Philipp Rümmer, Renate A. Schmidt, Cesare Tinelli
2019 — conf
Transforming Derivational Complexity of Term Rewriting to Runtime Complexity.
FroCos
Carsten Fuhs
2018 J jnl
The unified higher-order dependency pair framework.
CoRR
Carsten Fuhs, Cynthia Kop
2017 J jnl
Analyzing Program Termination and Complexity Automatically with AProVE.
J. Autom. Reason.
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
2017 J jnl
Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic.
J. Autom. Reason.
Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp, Cornelius Aschermann
2017 — conf
Complexity Analysis for Term Rewriting by Integer Transition Systems.
FroCoS
Matthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs, Jürgen Giesl
2017 J jnl
Deduction Beyond First-Order Logic (Dagstuhl Seminar 17371).
Dagstuhl Reports
Jasmin Christian Blanchette, Carsten Fuhs, Viorica Sofronie-Stokkermans, Cesare Tinelli
2017 J jnl
Verifying Procedural Programs via Constrained Rewriting Induction.
ACM Trans. Comput. Log.
Carsten Fuhs, Cynthia Kop, Naoki Nishida
2016 J jnl
Analyzing Runtime and Size Complexity of Integer Programs.
ACM Trans. Program. Lang. Syst.
Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl
2015 J jnl
Embracing Overapproximation for Proving Nontermination.
Tiny Trans. Comput. Sci.
Byron Cook, Carsten Fuhs, Kaustubh Nimkar, Peter W. O'Hearn
2014 — conf
A decision procedure for satisfiability in separation logic with inductive predicates.
CSL-LICS
James Brotherston, Carsten Fuhs, Juan Antonio Navarro Pérez, Nikos Gorogiannis
2014 A conf
Alternating Runtime and Size Complexity Analysis of Integer Programs.
TACAS
Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl
2014 B conf
Disproving termination with overapproximation.
FMCAD
Byron Cook, Carsten Fuhs, Kaustubh Nimkar, Peter W. O'Hearn
2014 — conf
First-Order Formative Rules.
RTA-TLCA
Carsten Fuhs, Cynthia Kop
2014 J jnl
First-Order Formative Rules.
CoRR
Carsten Fuhs, Cynthia Kop
2014 A conf
Proving Nontermination via Safety.
TACAS
Hong Yi Chen, Byron Cook, Carsten Fuhs, Kaustubh Nimkar, Peter W. O'Hearn
2014 A conf
Proving Termination and Memory Safety for Programs with Pointer Arithmetic.
IJCAR
Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp
2014 A conf
Proving Termination of Programs Automatically with AProVE.
IJCAR
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
2013 A* conf
Better Termination Proving through Cooperation.
CAV
Marc Brockschmidt, Byron Cook, Carsten Fuhs
2012 — conf
Exotic Semi-Ring Constraints.
SMT@IJCAR
Michael Codish, Yoav Fekete, Carsten Fuhs, Jürgen Giesl, Johannes Waldmann
2012 J jnl
Polynomial Interpretations for Higher-Order Rewriting
CoRR
Carsten Fuhs, Cynthia Kop
2012 — conf
Polynomial Interpretations for Higher-Order Rewriting.
RTA
Carsten Fuhs, Cynthia Kop
2012 — —
SAT encodings: from constraint-based termination analysis to circuit synthesis.
Carsten Fuhs
2012 C conf
Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs.
LOPSTR
Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs
2012 C conf
Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs.
PPDP
Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs
2011 C conf
A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog.
LOPSTR
Thomas Ströder, Fabian Emmes, Peter Schneider-Kamp, Jürgen Giesl, Carsten Fuhs
2011 — conf
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs.
FroCoS
Carsten Fuhs, Cynthia Kop
2011 A conf
Optimal Base Encodings for Pseudo-Boolean Constraints.
TACAS
Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp
2011 J jnl
Proving Termination by Dependency Pairs and Inductive Theorem Proving.
J. Autom. Reason.
Carsten Fuhs, Jürgen Giesl, Michael Parting, Peter Schneider-Kamp, Stephan Swiderski
2011 J jnl
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers
CoRR
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl
2011 J jnl
SAT-based termination analysis using monotonicity constraints over the integers.
Theory Pract. Log. Program.
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl
2011 B conf
Termination of Isabelle Functions via Termination of Rewriting.
ITP
Alexander Krauss, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl
2010 — conf
Lazy Abstraction for Size-Change Termination.
LPAR (Yogyakarta)
Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp
2010 J jnl
Optimal Base Encodings for Pseudo-Boolean Constraints
CoRR
Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp
2010 — conf
Optimizing the AES S-Box using SAT.
IWIL@LPAR
Carsten Fuhs, Peter Schneider-Kamp
2010 A conf
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT.
SAT
Carsten Fuhs, Peter Schneider-Kamp
2009 — conf
Inductive Theorem Proving meets Dependency Pairs.
Interaction versus Automation: The two Faces of Deduction
Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp
2009 — conf
Proving Termination of Integer Term Rewriting.
RTA
Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke
2009 A conf
Termination Analysis by Dependency Pairs and Inductive Theorem Proving.
CADE
Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp
2009 — conf
Termination of Integer Term Rewriting.
Interaction versus Automation: The two Faces of Deduction
Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke
2008 B conf
Improving Context-Sensitive Dependency Pairs.
LPAR
Beatriz Alarcón, Fabian Emmes, Carsten Fuhs, Jürgen Giesl, Raúl Gutiérrez, Salvador Lucas, Peter Schneider-Kamp, René Thiemann
2008 — conf
Maximal Termination.
RTA
Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl
2008 — conf
Search Techniques for Rational Polynomial Orders.
AISC/MKM/Calculemus
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto, Jürgen Giesl, Salvador Lucas, Peter Schneider-Kamp
2007 — conf
Implementing RPO and POLO using SAT.
Deduction and Decision Procedures
Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, Harald Zankl
2007 A conf
SAT Solving for Termination Analysis with Polynomial Interpretations.
SAT
Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl