BIROn - Birkbeck Institutional Research Online

    A decision procedure for satisfiability in separation logic with inductive predicates

    Brotherston, J. and Fuhs, Carsten and Navarro Pérez, J.A. and Gorogiannis, N. (2014) A decision procedure for satisfiability in separation logic with inductive predicates. In: UNSPECIFIED (ed.) Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS '14. New York, U.S.: ACM. ISBN 9781450328869.

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

    Download (394kB) | Preview

    Abstract

    We show that the satisfiability problem for the "symbolic heap" fragment of separation logic with general inductively defined predicates - which includes most fragments employed in program verification - is decidable. Our decision procedure is based on the computation of a certain fixed point from the definition of an inductive predicate, called its "base", that exactly characterises its satisfiability. A complexity analysis of our decision procedure shows that it runs, in the worst case, in exponential time. In fact, we show that the satisfiability problem for our inductive predicates is EXPTIME-complete, and becomes NP-complete when the maximum arity over all predicates is bounded by a constant. Finally, we provide an implementation of our decision procedure, and analyse its performance both on a synthetically generated set of test formulas, and on a second test set harvested from the separation logic literature. For the large majority of these test cases, our tool reports times in the low milliseconds.

    Metadata

    Item Type: Book Section
    Additional Information: CSL-LICS '14; Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
    Keyword(s) / Subject(s): separation logic, inductive predicates, satisfiability, decision procedure
    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:20
    Last Modified: 27 Jul 2019 02:53
    URI: http://eprints.bbk.ac.uk/id/eprint/13548

    Statistics

    Downloads
    Activity Overview
    137Downloads
    139Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item