BIROn - Birkbeck Institutional Research Online

    Browse by Person

    Up a level
    Export as [feed] Atom [feed] RSS
    Group by: Item Type | Date | Journal or Publication Title | No Grouping
    Number of items: 7.

    ACM Transactions on Computational Logic

    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.

    ACM Transactions on Programming Languages and Systems

    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.

    Fundamenta Informaticae

    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.

    International Journal on Software Tools for Technology Transfer

    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.

    Journal of Automated Reasoning

    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.

    Lecture Notes in Computer Science

    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.

    This list was generated on Tue Nov 26 07:16:45 2024 GMT.