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

dc.contributor.authorMansour (Abdulaziz), Mohammad
dc.contributor.authorGretton, Charles
dc.contributor.authorNorrish, Michael
dc.coverage.spatialNanjing, China
dc.date.accessioned2016-06-14T23:20:22Z
dc.date.created24 August 2015 through 27 August 2015
dc.date.issued2015
dc.date.updated2016-06-14T08:48:27Z
dc.description.abstractTo 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.
dc.identifier.isbn9783319221014
dc.identifier.urihttp://hdl.handle.net/1885/103343
dc.publisherSpringer International Publishing Switzerland
dc.relation.ispartofseries6th International Conference on Interactive Theorem Proving, ITP 2015
dc.sourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.titleVerified over-approximation of the diameter of propositionally factored transition systems
dc.typeConference paper
local.bibliographicCitation.lastpage16
local.bibliographicCitation.startpage1
local.contributor.affiliationMansour (Abdulaziz), Mohammad, College of Engineering and Computer Science, ANU
local.contributor.affiliationGretton, Charles, College of Engineering and Computer Science, ANU
local.contributor.affiliationNorrish, Michael, College of Engineering and Computer Science, ANU
local.contributor.authoruidMansour (Abdulaziz), Mohammad, u5283270
local.contributor.authoruidGretton, Charles, u3223587
local.contributor.authoruidNorrish, Michael, u4087502
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor080401 - Coding and Information Theory
local.identifier.absseo970108 - Expanding Knowledge in the Information and Computing Sciences
local.identifier.ariespublicationU3488905xPUB6571
local.identifier.doi10.1007/978-3-319-22102-1_1
local.identifier.scopusID2-s2.0-84944682769
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
01_Mansour+%28Abdulaziz%29_Verified_over-approximation_of_2015.pdf
Size:
501.63 KB
Format:
Adobe Portable Document Format