BIROn - Birkbeck Institutional Research Online

    Analyzing runtime and size complexity of integer programs

    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.

    [img]
    Preview
    Text
    16257.pdf - Author's Accepted Manuscript

    Download (779kB) | Preview

    Abstract

    We present a modular approach to automatic complexity analysis of integer programs. Based on a novel alternation between finding symbolic time bounds for program parts and using these to infer bounds on the absolute values of program variables, we can restrict each analysis step to a small part of the program while maintaining a high level of precision. The bounds computed by our method are polynomial or exponential expressions that depend on the absolute values of input parameters. We show how to extend our approach to arbitrary cost measures, allowing to use our technique to find upper bounds for other expended resources, such as network requests or memory consumption. Our contributions are implemented in the open source tool KoAT, and extensive experiments show the performance and power of our implementation in comparison with other tools.

    Metadata

    Item Type: Article
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Administrator
    Date Deposited: 05 Oct 2016 17:27
    Last Modified: 05 Oct 2016 17:27
    URI: http://eprints.bbk.ac.uk/id/eprint/16257

    Statistics

    Downloads
    Activity Overview
    77,296Downloads
    102Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item