Browse by Person

Article

Baudon, T. and Fuhs, Carsten and Gonnord, L. (2024) On Complexity Bounds and Confluence of Parallel Term Rewriting. Fundamenta Informaticae 192 (2), pp. 121-166. ISSN 0169-2968.

Frohn, F. and Fuhs, Carsten (2022) A calculus for modular loop acceleration and non-termination proofs. International Journal on Software Tools for Technology Transfer 24 , pp. 691-715. ISSN 1433-2779.

Fuhs, Carsten and Kop, C. and Nishida, N. (2017) Verifying procedural programs via constrained rewriting induction. ACM Transactions on Computational Logic 18 (2), ISSN 1529-3785.

Ströder, T. and Giesl, J. and Brockschmidt, M. and Frohn, F. and Fuhs, Carsten and Hensel, J. and Schneider-Kamp, P. and Aschermann, C. (2017) Automatically proving termination and memory safety for programs with pointer arithmetic. Journal of Automated Reasoning 58 (1), pp. 33-65. ISSN 0168-7433.

Giesl, J. and Aschermann, C. and Brockschmidt, M. and Emmes, F. and Frohn, F. and Fuhs, Carsten and Hensel, J. and Otto, C. and Plücker, M. and Schneider-Kamp, P. and Ströder, T. and Swiderski, S. and Thiemann, R. (2016) Analyzing program termination and complexity automatically with AProVE. Journal of Automated Reasoning 58 (1), pp. 3-31. ISSN 0168-7433.

Brockschmidt, M. and Emmes, F. and Falke, S. and Fuhs, Carsten and Giesl, J. (2016) Analyzing runtime and size complexity of integer programs. ACM Transactions on Programming Languages and Systems 38 (4), pp. 1-50. ISSN 0164-0925.

Book Section

Milovančević, D. and Fuhs, Carsten and Bucev, M. and Kunčak, V. (2024) Proving termination via measure transfer in equivalence checking. In: Kosmatov, N. and Kovács, L. (eds.) Integrated Formal Methods. Lecture Notes in Computer Science 15234. Springer, pp. 75-84. ISBN 9783031765537.

Baudon, T. and Fuhs, Carsten and Gonnord, L. (2022) Analysing Parallel Complexity of Term Rewriting. In: Villanueva, A. (ed.) Logic-Based Program Synthesis and Transformation: 32nd International Symposium, LOPSTR 2022, Tbilisi, Georgia, September 21–23, 2022, Proceedings. Lecture Notes in Computer Science 13474. Springer, pp. 3-23. ISBN 9783031167669.

Fuhs, Carsten (2019) Transforming derivational complexity of term rewriting to runtime complexity. In: Herzig, A. and Popescu, A. (eds.) Frontiers of Combining Systems 12th International Symposium, FroCoS 2019, London, UK, September 4-6, 2019, Proceedings. Lecture Notes in Artificial Intelligence 11715. Springer. (In Press)

Fuhs, Carsten and Kop, C. (2019) A static higher-order dependency pair framework. In: Caires, L. (ed.) Programming Languages and Systems, 28th European Symposium on Programming, ESOP 2019, Proceedings. Lecture Notes in Computer Science 11423. Springer, pp. 752-782. ISBN 9783030171834.

Naaf, M. and Frohn, F. and Brockschmidt, M. and Fuhs, Carsten and Giesl, J. (2017) Complexity analysis for term rewriting by integer transition systems. In: Dixon, C. and Finger, M. (eds.) Frontiers of Combining Systems: 11th International Symposium, FroCoS 2017, Brasília, Brazil, September 27-29, 2017, Proceedings. Lecture Notes in Artificial Intelligence 10483. Springer. ISBN 9783319661667.

Brotherston, J. and Fuhs, Carsten and Navarro Pérez, J.A. and Gorogiannis, N. (2014) A decision procedure for satisfiability in separation logic with inductive predicates. In: UNSPECIFIED (ed.) 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) - CSL-LICS '14. New York, U.S.: ACM. ISBN 9781450328869.

Brockschmidt, M. and Emmes, F. and Falke, S. and Fuhs, Carsten and Giesl, J. (2014) Alternating runtime and size complexity analysis of integer programs. In: Ábrahám, E. and Havelund, K. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science 8413. Berlin, Germany: Springer, pp. 140-155. ISBN 9783642548611.

Cook, B. and Fuhs, Carsten and Nimkar, K. and O'Hearn, P. (2014) Disproving termination with overapproximation. In: UNSPECIFIED (ed.) Formal Methods in Computer-Aided Design (FMCAD 2014). IEEE Computer Society, pp. 67-74. ISBN 9780983567844.

Fuhs, Carsten and Kop, C. (2014) First-order formative rules. In: Dowek, G. (ed.) Rewriting and Typed Lambda Calculi. Lecture Notes in Computer Science 8560. New York, U.S.: Springer, pp. 240-256. ISBN 9783319089171.

Chen, H.-Y. and Cook, B. and Fuhs, Carsten and Nimkar, K. and O’Hearn, P. (2014) Proving Nontermination via safety. In: Abraham, E. and Havelund, K. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes In Computer Science 8413. New York, U.S.: Springer, pp. 156-171. ISBN 9783642548611.

Ströder, T. and Giesl, J. and Brockschmidt, M. and Frohn, F. and Fuhs, Carsten and Hensel, J. and Schneider-Kamp, P. (2014) Proving termination and memory safety for programs with Pointer Arithmetic. In: Demri, S. and Kapur, D. and Weidenbach, C. (eds.) Automated Reasoning. Lecture Notes In Computer Science 8562 8562. New York, U.S.: Springer, pp. 208-223. ISBN 9783319085869.

Giesl, J. and Brockschmidt, M. and Emmes, F. and Frohn, F. and Fuhs, Carsten and Otto, C. and Plücker, M. and Schneider-Kamp, P. and Ströder, T. and Swiderski, S. and Thiemann, R. (2014) Proving termination of programs automatically with AProVE. In: Demri, S. and Kapur, D. and Weidenbach, C. (eds.) Automated Reasoning. Lecture Notes In Computer Science 8562. Berlin, Germany: Springer, pp. 184-191. ISBN 9783319085869.

Schneider-Kamp, P. and Fuhs, Carsten and Thiemann, R. and Giesl, J. and Annov, E. and Codish, M. and Middeldorp, A. and Zankl, H. (2007) Implementing RPO and POLO using SAT. In: Baader, F. and Cook, B. and Giesl, J. and Nieuwenhuis, R. (eds.) Deduction and Decision Procedures. Dagstuhl Seminar Proceedings 07401. Internationales Begegnungs- und Forschungszentrum fuer Informatik.

Fuhs, Carsten and Giesl, J. and Middeldorp, A. and Schneider-Kamp, P. and Thiemann, R. and Zankl, H. (2007) SAT solving for termination analysis with polynomial interpretations. In: Marques-Silva, J. and Sakallah, K.A. (eds.) Theory and Applications of Satisfiability Testing: SAT 2007, 10th International Conference. Lecture Notes in Computer Science 4501. Springer, pp. 340-354. ISBN 9783540727873.