default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarsten Fuhs
Person information
- affiliation: Birkbeck, University of London,, UK
- affiliation: University College London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Thaïs Baudon, Carsten Fuhs, Laure Gonnord:
On Complexity Bounds and Confluence of Parallel Term Rewriting. Fundam. Informaticae 192(2): 121-166 (2024)- [c30]Dragana Milovancevic, Carsten Fuhs, Mario Bucev, Viktor Kuncak
:
Proving Termination via Measure Transfer in Equivalence Checking. IFM 2024: 75-84 - 2023
- [i15]Thaïs Baudon, Carsten Fuhs, Laure Gonnord:
On Complexity Bounds and Confluence of Parallel Term Rewriting. CoRR abs/2305.18250 (2023) - 2022
- [j7]Florian Frohn, Carsten Fuhs:
A calculus for modular loop acceleration and non-termination proofs. Int. J. Softw. Tools Technol. Transf. 24(5): 691-715 (2022) - [c29]Thaïs Baudon, Carsten Fuhs, Laure Gonnord:
Analysing Parallel Complexity of Term Rewriting. LOPSTR 2022: 3-23 - [i14]Thaïs Baudon, Carsten Fuhs, Laure Gonnord:
Analysing Parallel Complexity of Term Rewriting. CoRR abs/2208.01005 (2022) - 2021
- [i13]Florian Frohn, Carsten Fuhs:
A Calculus for Modular Loop Acceleration and Non-Termination Proofs. CoRR abs/2111.13952 (2021)
2010 – 2019
- 2019
- [c28]Carsten Fuhs, Cynthia Kop:
A Static Higher-Order Dependency Pair Framework. ESOP 2019: 752-782 - [c27]Carsten Fuhs:
Transforming Derivational Complexity of Term Rewriting to Runtime Complexity. FroCos 2019: 348-364 - [i12]Carsten Fuhs, Cynthia Kop:
A static higher-order dependency pair framework. CoRR abs/1902.06733 (2019) - [i11]Carsten Fuhs, Philipp Rümmer, Renate A. Schmidt, Cesare Tinelli:
Deduction Beyond Satisfiability (Dagstuhl Seminar 19371). Dagstuhl Reports 9(9): 23-44 (2019) - 2018
- [i10]Carsten Fuhs, Cynthia Kop:
The unified higher-order dependency pair framework. CoRR abs/1805.09390 (2018) - 2017
- [j6]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): 3-31 (2017) - [j5]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): 33-65 (2017) - [j4]Carsten Fuhs, Cynthia Kop, Naoki Nishida:
Verifying Procedural Programs via Constrained Rewriting Induction. ACM Trans. Comput. Log. 18(2): 14:1-14:50 (2017) - [c26]Matthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs, Jürgen Giesl:
Complexity Analysis for Term Rewriting by Integer Transition Systems. FroCoS 2017: 132-150 - [i9]Jasmin Christian Blanchette, Carsten Fuhs, Viorica Sofronie-Stokkermans, Cesare Tinelli:
Deduction Beyond First-Order Logic (Dagstuhl Seminar 17371). Dagstuhl Reports 7(9): 26-46 (2017) - 2016
- [j3]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): 13:1-13:50 (2016) - 2015
- [i8]Byron Cook, Carsten Fuhs, Kaustubh Nimkar, Peter W. O'Hearn:
Embracing Overapproximation for Proving Nontermination. Adv. Math. Commun. 3 (2015) - 2014
- [c25]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: 184-191 - [c24]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: 208-223 - [c23]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: 25:1-25:10 - [c22]Byron Cook, Carsten Fuhs, Kaustubh Nimkar, Peter W. O'Hearn:
Disproving termination with overapproximation. FMCAD 2014: 67-74 - [c21]Carsten Fuhs, Cynthia Kop:
First-Order Formative Rules. RTA-TLCA 2014: 240-256 - [c20]Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl:
Alternating Runtime and Size Complexity Analysis of Integer Programs. TACAS 2014: 140-155 - [c19]Hong Yi Chen, Byron Cook, Carsten Fuhs, Kaustubh Nimkar, Peter W. O'Hearn:
Proving Nontermination via Safety. TACAS 2014: 156-171 - [i7]Carsten Fuhs, Cynthia Kop:
First-Order Formative Rules. CoRR abs/1404.7695 (2014) - 2013
- [c18]Marc Brockschmidt, Byron Cook, Carsten Fuhs:
Better Termination Proving through Cooperation. CAV 2013: 413-429 - 2012
- [b1]Carsten Fuhs:
SAT encodings: from constraint-based termination analysis to circuit synthesis. RWTH Aachen University, 2012, pp. 1-188 - [c17]Michael Codish, Yoav Fekete, Carsten Fuhs, Jürgen Giesl, Johannes Waldmann:
Exotic Semi-Ring Constraints. SMT@IJCAR 2012: 88-97 - [c16]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: 1 - [c15]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: 1-12 - [c14]Carsten Fuhs, Cynthia Kop:
Polynomial Interpretations for Higher-Order Rewriting. RTA 2012: 176-192 - [i6]Carsten Fuhs, Cynthia Kop:
Polynomial Interpretations for Higher-Order Rewriting. CoRR abs/1203.5754 (2012) - 2011
- [j2]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): 133-160 (2011) - [j1]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): 503-520 (2011) - [c13]Carsten Fuhs, Cynthia Kop:
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs. FroCoS 2011: 147-162 - [c12]Alexander Krauss, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl:
Termination of Isabelle Functions via Termination of Rewriting. ITP 2011: 152-167 - [c11]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: 237-252 - [c10]Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp:
Optimal Base Encodings for Pseudo-Boolean Constraints. TACAS 2011: 189-204 - [i5]Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl:
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers. CoRR abs/1107.5980 (2011) - 2010
- [c9]Carsten Fuhs, Peter Schneider-Kamp:
Optimizing the AES S-Box using SAT. IWIL@LPAR 2010: 64-70 - [c8]Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp:
Lazy Abstraction for Size-Change Termination. LPAR (Yogyakarta) 2010: 217-232 - [c7]Carsten Fuhs, Peter Schneider-Kamp:
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT. SAT 2010: 71-84 - [i4]Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp:
Optimal Base Encodings for Pseudo-Boolean Constraints. CoRR abs/1007.4935 (2010)
2000 – 2009
- 2009
- [c6]Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp:
Termination Analysis by Dependency Pairs and Inductive Theorem Proving. CADE 2009: 322-338 - [c5]Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke:
Proving Termination of Integer Term Rewriting. RTA 2009: 32-47 - [i3]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 - [i2]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 - 2008
- [c4]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: 109-124 - [c3]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: 636-651 - [c2]Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl:
Maximal Termination. RTA 2008: 110-125 - 2007
- [c1]Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl:
SAT Solving for Termination Analysis with Polynomial Interpretations. SAT 2007: 340-354 - [i1]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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
