Verified over-approximation of the diameter of propositionally factored transition systems

Mohammad Abdulaziz*, Charles Gretton, Michael Norrish

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    4 Citations (Scopus)

    Abstract

    To guarantee the completeness of bounded model checking (BMC) we require a completeness threshold. The diameter of the Kripke model of the transition system is a valid completeness threshold for BMC of safety properties. The recurrence diameter gives us an upper bound on the diameter for use in practice. Transition systems are usually described using (propositionally) factored representations. Bounds for such lifted representations are calculated in a compositional way, by first identifying and bounding atomic subsystems, and then composing those results according to subsystem dependencies to arrive at a bound for the concrete system. Compositional approaches are invalid when using the diameter to bound atomic subsystems, and valid when using the recurrence diameter. We provide a novel over approximation of the diameter, called the sublist diameter, that is tighter than the recurrence diameter. We prove that compositional approaches are valid using it to bound atomic subsystems. Those proofs are mechanised in HOL4. We also describe a novel verified compositional bounding technique which provides tighter overall bounds compared to existing bottom-up approaches.

    Original languageEnglish
    Title of host publicationInteractive Theorem Proving - 6th International Conference, ITP 2015, Proceedings
    EditorsXingyuan Zhang, Christian Urban
    PublisherSpringer Verlag
    Pages1-16
    Number of pages16
    ISBN (Print)9783319221014
    DOIs
    Publication statusPublished - 2015
    Event6th International Conference on Interactive Theorem Proving, ITP 2015 - Nanjing, China
    Duration: 24 Aug 201527 Aug 2015

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume9236
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference6th International Conference on Interactive Theorem Proving, ITP 2015
    Country/TerritoryChina
    CityNanjing
    Period24/08/1527/08/15

    Fingerprint

    Dive into the research topics of 'Verified over-approximation of the diameter of propositionally factored transition systems'. Together they form a unique fingerprint.

    Cite this