Files in this item
Automating Event-B invariant proofs by rippling and proof patching
Item metadata
dc.contributor.author | Lin, Yuhui | |
dc.contributor.author | Bundy, Alan | |
dc.contributor.author | Grov, Gudmund | |
dc.contributor.author | Maclean, Ewen | |
dc.date.accessioned | 2019-01-10T16:30:07Z | |
dc.date.available | 2019-01-10T16:30:07Z | |
dc.date.issued | 2019-02 | |
dc.identifier.citation | Lin , Y , Bundy , A , Grov , G & Maclean , E 2019 , ' Automating Event-B invariant proofs by rippling and proof patching ' , Formal Aspects of Computing , vol. 31 , no. 1 , pp. 95-129 . https://doi.org/10.1007/s00165-018-00476-7 | en |
dc.identifier.issn | 0934-5043 | |
dc.identifier.other | PURE: 256910422 | |
dc.identifier.other | PURE UUID: c4ec876f-ab2e-4956-a73e-997efa86c581 | |
dc.identifier.other | Scopus: 85059528193 | |
dc.identifier.other | WOS: 000460838200006 | |
dc.identifier.uri | https://hdl.handle.net/10023/16838 | |
dc.description | This work is supported by EPSRC grants EP/H024204/1, EP/E005713/1, EP/M018407/1 and EP/J001058/1. | en |
dc.description.abstract | The use of formal method techniques can contribute to the production of more reliable and dependable systems. However, a common bottleneck for industrial adoption of such techniques is the needs for interactive proofs. We use a popular formal method, called Event-B, as our working domain, and set invariant preservation (INV) proofs as targets, because INV proofs can account for a significant proportion of the proofs requiring human interactions. We apply an inductive theorem proving technique, called rippling, for Event-B INV proofs. Rippling automates proofs using meta-level guidance. The guidance is in particular useful to develop proof patches to recover failed proof attempts. We are interested in the case when a missing lemma is required. We combine a scheme-based theory-exploration system, called IsaScheme [MRMDB10], with rippling to develop a proof patch via lemma discovery. We also develop two new proof patches to unfold operator definitions and to suggest case-splits, respectively. The combined use of rippling with these three proof patches as a proof method significantly improves the proof automation for our evaluation set. | |
dc.format.extent | 35 | |
dc.language.iso | eng | |
dc.relation.ispartof | Formal Aspects of Computing | en |
dc.rights | © The Author(s) 2018. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. | en |
dc.subject | Formal verification | en |
dc.subject | Event-B | en |
dc.subject | Automated reasoning | en |
dc.subject | Rippling | en |
dc.subject | Lemma conjecturing | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA75 | en |
dc.title | Automating Event-B invariant proofs by rippling and proof patching | en |
dc.type | Journal article | en |
dc.contributor.sponsor | EPSRC | en |
dc.description.version | Publisher PDF | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.identifier.doi | https://doi.org/10.1007/s00165-018-00476-7 | |
dc.description.status | Peer reviewed | en |
dc.identifier.grantnumber | EP/R010528/1 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.