BIROn - Birkbeck Institutional Research Online

    Browse by Person

    Up a level
    Export as [feed] Atom [feed] RSS
    Number of items: 6.

    2007

    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.

    2014

    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.

    21 October 2016

    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.

    1 January 2017

    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.

    This list was generated on Tue Nov 26 06:23:44 2024 GMT.