BIROn - Birkbeck Institutional Research Online

    Proving Nontermination via safety

    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.

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

    Download (411kB) | Preview

    Abstract

    We show how the problem of nontermination proving can be reduced to a question of underapproximation search guided by a safety prover. This reduction leads to new nontermination proving implementation strategies based on existing tools for safety proving. Our preliminary implementation beats existing tools. Furthermore, our approach leads to easy support for programs with unbounded nondeterminism.

    Metadata

    Item Type: Book Section
    Keyword(s) / Subject(s): Proceedings, 20th International Conference, TACAS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-54862-8_11
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Dr. Carsten Fuhs
    Date Deposited: 10 Dec 2015 13:09
    Last Modified: 27 Jul 2019 04:20
    URI: http://eprints.bbk.ac.uk/id/eprint/13545

    Statistics

    Downloads
    Activity Overview
    94Downloads
    190Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item