BIROn - Birkbeck Institutional Research Online

    SAT solving for termination analysis with polynomial interpretations

    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.

    Full text not available from this repository.

    Abstract

    Polynomial interpretations are one of the most popular techniques for automated termination analysis and the search for such interpretations is a main bottleneck in most termination provers. We show that one can obtain speedups in orders of magnitude by encoding this task as a SAT problem and by applying modern SAT solvers.

    Metadata

    Item Type: Book Section
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 30 Mar 2021 10:15
    Last Modified: 30 Mar 2021 10:15
    URI: https://eprints.bbk.ac.uk/id/eprint/43736

    Statistics

    Downloads
    Activity Overview
    0Downloads
    13Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item