Travelled to:1 × Brazil
1 × Canada
1 × Denmark
1 × France
1 × Germany
1 × Japan
1 × Portugal
1 × Russia
2 × Belgium
2 × United Kingdom
4 × Austria
Collaborated with:P.Schneider-Kamp J.Giesl C.Kop F.Emmes T.Ströder M.Brockschmidt M.Codish B.Cook Y.Fekete R.Thiemann S.Falke A.Middeldorp H.Zankl M.Plücker J.Brotherston J.A.N.Pérez N.Gorogiannis F.Frohn H.Y.Chen K.Nimkar P.W.O'Hearn J.Waldmann I.Gonopolskiy A.M.Ben-Amram S.Swiderski M.Parting J.Hensel C.Otto S.Swiderski
Talks about:termin (9) program (6) prove (6) analysi (5) rewrit (4) constraint (3) order (3) logic (3) integ (3) term (3)
Person: Carsten Fuhs
DBLP: Fuhs:Carsten
Contributed to:
2014
2014
2014
2014
2013
2012
20122012
2012
201120112011
2010
2009200920082007
2019Wrote 20 papers:
- IJCAR-2014-GieslBEFFOPSSST #automation #proving #source code #termination
- Proving Termination of Programs Automatically with AProVE (JG, MB, FE, FF, CF, CO, MP, PSK, TS, SS, RT), pp. 184–191.
- IJCAR-2014-StroderGBFFHS #memory management #pointer #proving #safety #source code #termination
- Proving Termination and Memory Safety for Programs with Pointer Arithmetic (TS, JG, MB, FF, CF, JH, PSK), pp. 208–223.
- LICS-CSL-2014-BrotherstonFPG #induction #logic #satisfiability
- A decision procedure for satisfiability in separation logic with inductive predicates (JB, CF, JANP, NG), p. 10.
- RTA-TLCA-2014-FuhsK #first-order
- First-Order Formative Rules (CF, CK), pp. 240–256.
- TACAS-2014-BrockschmidtEFFG #analysis #complexity #integer #runtime #source code
- Alternating Runtime and Size Complexity Analysis of Integer Programs (MB, FE, SF, CF, JG), pp. 140–155.
- TACAS-2014-ChenCFNO #proving #safety
- Proving Nontermination via Safety (HYC, BC, CF, KN, PWO), pp. 156–171.
- CAV-2013-BrockschmidtCF #proving #termination
- Better Termination Proving through Cooperation (MB, BC, CF), pp. 413–429.
- LOPSTR-2012-GieslSSEF #evaluation #graph #logic programming #source code #symbolic computation #term rewriting
- Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs (JG, TS, PSK, FE, CF), p. 1.
- PPDP-2012-GieslSSEF #evaluation #graph #logic programming #source code #symbolic computation #term rewriting
- Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs (JG, TS, PSK, FE, CF), pp. 1–12.
- RTA-2012-FuhsK #higher-order #polynomial
- Polynomial Interpretations for Higher-Order Rewriting (CF, CK), pp. 176–192.
- SMT-2012-CodishFFGW #constraints
- Exotic Semi-Ring Constraints (MC, YF, CF, JG, JW), pp. 88–97.
- ICLP-J-2011-CodishGBFG #analysis #constraints #integer #satisfiability #termination #using
- SAT-based termination analysis using monotonicity constraints over the integers (MC, IG, AMBA, CF, JG), pp. 503–520.
- LOPSTR-2011-StroderESGF #analysis #complexity #linear #prolog #semantics #termination
- A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog (TS, FE, PSK, JG, CF), pp. 237–252.
- TACAS-2011-CodishFFS #constraints #encoding #pseudo
- Optimal Base Encodings for Pseudo-Boolean Constraints (MC, YF, CF, PSK), pp. 189–204.
- SAT-2010-FuhsS #linear #satisfiability #source code #using
- Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT (CF, PSK), pp. 71–84.
- CADE-2009-SwiderskiPGFS #analysis #dependence #induction #proving #termination #theorem proving
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving (SS, MP, JG, CF, PSK), pp. 322–338.
- RTA-2009-FuhsGPSF #integer #proving #term rewriting #termination
- Proving Termination of Integer Term Rewriting (CF, JG, MP, PSK, SF), pp. 32–47.
- RTA-2008-FuhsGMSTZ #termination
- Maximal Termination (CF, JG, AM, PSK, RT, HZ), pp. 110–125.
- SAT-2007-FuhsGMSTZ #analysis #polynomial #satisfiability #termination
- SAT Solving for Termination Analysis with Polynomial Interpretations (CF, JG, AM, PSK, RT, HZ), pp. 340–354.
- ESOP-2019-FuhsK #dependence #framework #higher-order
- A Static Higher-Order Dependency Pair Framework (CF, CK), pp. 752–782.