Optimising the ProB model checker for B using partial order reduction.
Saved in:
| Title: | Optimising the ProB model checker for B using partial order reduction. |
|---|---|
| Authors: | Dobrikov, Ivaylo1 dobrikov@cs.uni-duesseldorf.de, Leuschel, Michael1 |
| Source: | Formal Aspects of Computing. Apr2016, Vol. 28 Issue 2, p295-323. 29p. |
| Subjects: | Checker problems, Computer software correctness, Mathematical optimization, Mathematical variables, Mathematical simplification |
| Abstract: | Partial order reduction has been very successful at combatting the state explosion problem for lower-level formalisms, but has thus far made hardly any impact for model checking higher-level formalisms such as B, Z or TLA. This paper attempts to remedy this issue in the context of Event-B, with its much more fine-grained events and thus increased potential for event-independence and partial order reduction. In this work, we provide a detailed description of a partial order reduction for explicit state model checking in ProB. The technique is evaluated on a variety of models. The implementation of the method is discussed, which is based on new constraint-based analyses. Further, we give a comprehensive description for elaborating the implementation into the LTL model checker of ProB for checking LTL formulae. [ABSTRACT FROM AUTHOR] |
| Copyright of Formal Aspects of Computing is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
