Carsten Fuhs

发表

Analyzing Runtime and Size Complexity of Integer Programs

Jürgen Giesl, Marc Brockschmidt, Stephan Falke, 2016, ACM Trans. Program. Lang. Syst..

Maximal Termination

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2008, RTA.

Optimizing the AES S-Box using SAT

Peter Schneider-Kamp, Carsten Fuhs, Carsten Fuhs, 2010, IWIL@LPAR.

Synthesizing Shortest Linear Straight-Line Programs over GF(2) for the AES using SAT ?

Carsten Fuhs, 2011 .

Proving nontermination via safety January 18 , 2014

Carsten Fuhs, B. Cook, P. O'Hearn, 2014 .

Automated Complexity Analysis for Prolog by Term Rewriting ∗

Fabian Emmes, Carsten Fuhs, J. Giesl, 2003 .

Synthesizing Shortest Straight-Line Programs over GF(2) using SAT

Peter Schneider-Kamp, Carsten Fuhs, Carsten Fuhs, 2010 .

Improving Static Dependency Pairs for Higher-Order Rewriting

Carsten Fuhs, Cynthia Kop, 2018 .

Proving Nontermination via Safety

Peter W. O'Hearn, Kaustubh Nimkar, Carsten Fuhs, 2014, TACAS.

Better Termination Proving through Cooperation

Marc Brockschmidt, Carsten Fuhs, Byron Cook, 2013, CAV.

Optimal Base Encodings for Pseudo-Boolean Constraints

Peter Schneider-Kamp, Carsten Fuhs, Michael Codish, 2010, TACAS.

13th International Workshop on Termination (WST 2013)

Marc Brockschmidt, Fabian Emmes, Carsten Fuhs, 2013 .

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

Jürgen Giesl, Peter Schneider-Kamp, Thomas Ströder, 2011, LOPSTR.

Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic

Jürgen Giesl, Marc Brockschmidt, Peter Schneider-Kamp, 2014, Journal of Automated Reasoning.

Analyzing Program Termination and Complexity Automatically with AProVE

Jürgen Giesl, Marc Brockschmidt, René Thiemann, 2016, Journal of Automated Reasoning.

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

Carsten Fuhs, Carsten Fuhs, 2012 .

Proving Termination by Dependency Pairs and Inductive Theorem Proving

Jürgen Giesl, Peter Schneider-Kamp, Carsten Fuhs, 2011, Journal of Automated Reasoning.

Termination Analysis by Dependency Pairs and Inductive Theorem Proving

Jürgen Giesl, Peter Schneider-Kamp, Carsten Fuhs, 2009, CADE.

Termination of Isabelle Functions via Termination of Rewriting

Jürgen Giesl, René Thiemann, Carsten Fuhs, 2011, ITP.

Verifying Procedural Programs via Constrained Rewriting Induction

Carsten Fuhs, Cynthia Kop, Naoki Nishida, 2014, ACM Trans. Comput. Log..

SAT Solving for Termination Analysis with Polynomial Interpretations

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, 2007, SAT.

On Complexity Bounds and Confluence of Parallel Term Rewriting

Carsten Fuhs, L. Gonnord, Thais Baudon, 2023, ArXiv.

Analysing Parallel Complexity of Term Rewriting

Carsten Fuhs, L. Gonnord, Thais Baudon, 2022, LOPSTR.

The unified higher-order dependency pair framework pdf

Carsten Fuhs, Cynthia Kop, Carsten Fuhs, 2018, ArXiv.

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

Jürgen Giesl, Peter Schneider-Kamp, Thomas Ströder, 2012, PPDP.

Lazy Abstraction for Size-Change Termination

Jürgen Giesl, Peter Schneider-Kamp, Carsten Fuhs, 2010, LPAR.

On Confluence of Parallel-Innermost Term Rewriting *

Carsten Fuhs, L. Gonnord, Thais Baudon, 2022 .

Parallel Complexity of Term Rewriting Systems ∗

Carsten Fuhs, L. Gonnord, Thais Baudon, 2021 .

SAT Instances for Termination Analysis with AProVE

Carsten Fuhs, Carsten Fuhs, 2009 .

Automated Complexity Analysis for Prolog by Term Rewriting ∗

Fabian Emmes, Carsten Fuhs, J. Giesl, 2003 .

A decision procedure for satisfiability in separation logic with inductive predicates

James Brotherston, Carsten Fuhs, Juan Antonio Navarro Pérez, 2014, CSL-LICS.

A calculus for modular loop acceleration and non-termination proofs

Carsten Fuhs, Florian Frohn, F. Frohn, 2021, International Journal on Software Tools for Technology Transfer.

Analyzing Runtime and Size Complexity of Integer Programs

Marc Brockschmidt, Fabian Emmes, Carsten Fuhs, 2016, ACM Trans. Program. Lang. Syst..

Proving Termination of Programs Automatically with AProVE

Jürgen Giesl, Marc Brockschmidt, René Thiemann, 2014, IJCAR.

Harnessing First Order Termination Provers Using Higher Order Dependency Pairs

Carsten Fuhs, Cynthia Kop, Carsten Fuhs, 2011, FroCoS.

Proving Termination of Integer Term Rewriting

Jürgen Giesl, Peter Schneider-Kamp, Stephan Falke, 2009, RTA.

Exotic Semi-Ring Constraints

Jürgen Giesl, Carsten Fuhs, Michael Codish, 2013, SMT@IJCAR.

14th International Workshop on Termination (WST 2014)

Carsten Fuhs, Carsten Fuhs, 2014 .