Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/efficient-approximate-verification-of-b-and-z-models-via-symmetry-ifBqxx1f25
References (62)
-
A. Donaldson, Alice Miller, M. Calder (2005)
Finding Symmetry in Models of Concurrent Systems by Static Channel Diagram Analysis -
G. Holzmann (1997)
The Model Checker SPINIEEE Trans. Software Eng., 23
-
Steve Schneider (2001)
The B-Method: an Introduction -
S. Barner, O. Grumberg (2002)
Combining Symmetry Reduction and Under-Approximation for Symbolic Model CheckingFormal Methods in System Design, 27
-
D. Dill, Andreas Drexler, A. Hu, Han Yang (1992)
Protocol verification as a hardware design aidProceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors
-
J. Derrick, Siobhán North, A. Simons (2009)
Z2SAL: a translation-based model checker for ZFormal Aspects of Computing, 23
-
M. Leuschel, T. Massart (2008)
ffi cient Approximate Verification of B via Symmetry Markers -
M Leuschel, MJ Butler (2008)
ProB: an automated analysis toolset for the B methodSTTT, 10
-
G. Manku, R. Hojati, R. Brayton (1998)
Structural Symmetry and Model Checking -
Indeed, either d occurs in s 1 , then d is replaced by paths(d, s 1 ) to obtain the marker m(s 1 ), and hence m(s 1 ) = m(s 2 ) as paths(d, s 1 ) cannot occur in m -
Similarly, w i is the only element y ∈ D such that V ∈ paths(y, s 2 ). Hence, we must have by construction of f that f (v i ) = w i -
Nauty user ’ s guide -
G. Holzmann (2003)
The SPIN Model Checker - primer and reference manual -
(2001)
In Code: A Mathematical Adventure -
By Lemma 1 we know that w i must also be of the form {y 1 , . . . , yn}, which also are the only values y such that V.el ∈ paths(y, s 2 ). Hence, f (x i ) ∈ w i . Furthermore, as f is a bijection -
Norris Ip, D. Dill (1996)
Better verification through symmetryFormal Methods in System Design, 9
-
D. Bosnacki, A. Donaldson, M. Leuschel, T. Massart (2007)
Efficient Approximate Verification of Promela Models Via Symmetry Markers -
(1999)
On-line manual Available at http://www.b-core.com/ONLINEDOC/Contents -
A pair of values can simply be viewed as representing two separate variables. Hence, we can inductively apply the above reasoning on the components -
Daniel Plagge, M. Leuschel (2010)
Seven at one stroke: LTL model checking for high-level specifications in B, Z, CSP, and moreInternational Journal on Software Tools for Technology Transfer, 12
-
Let v i = {x 1 , . . . , xn}. {x 1 , . . . , xn} are the only values x such that V.el ∈ paths(x, s 1 ) -
D. Jackson, S. Jha, C. Damon (1998)
Isomorph-free model enumeration: a new method for checking relational specificationsACM Trans. Program. Lang. Syst., 20
-
G. Holzmann (1988)
An improved protocol reachability analysis techniqueSoftware: Practice and Experience, 18
-
M. Ben-Ari (2008)
Principles of the spin model checker -
M. Hendriks, G. Behrmann, K. Larsen, P. Niebert, F. Vaandrager (2003)
Adding Symmetry Reduction to Uppaal -
J. Abrial (2010)
Modeling in Event-B - System and Software Engineering -
If for some d ∈ D we have that for all d ∈ D paths(d, s 1 ) = paths(f (d), s 2 ), then necessarily , m(s 1 ) = m(s 2 ) -
(1981)
Practical graph isomorphism -
J. Derrick, Siobhán North, Tony Simons (2006)
Issues in Implementing a Model Checker for Z -
(2006)
Tool and Manuals -
AssumptionsE. Emerson, A. SistlayMay (1997)
Utilizing symmetry when model-checking under fairness assumptions: an automata-theoretic approachACM Trans. Program. Lang. Syst., 19
-
Stephan Merz (2000)
Model Checking -
M. Leuschel (2008)
The High Road to Formal Validation: -
E. Turner, M. Leuschel, Corinna Spermann, M. Butler (2007)
Symmetry Reduced Model Checking for BFirst Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)
-
A. Donaldson, Alice Miller (2005)
Automatic Symmetry Detection for Model Checking Using Computational Group Theory -
J. Abrial, M. Butler, S. Hallerstede, L. Voisin (2006)
An Open Extensible Tool Environment for Event-B -
E. Allen, Emerson Sistla, H. Weyl, In Symmetry (1993)
Symmetry and model checkingFormal Methods in System Design, 9
-
Frank Waters (1971)
The B Book -
J. Derrick, Siobhán North, A. Simons (2008)
Z2SAL - Building a Model Checker for Z -
D. Bosnacki, D. Dams, L. Holenderski (2000)
Symmetric SpinInternational Journal on Software Tools for Technology Transfer, 4
-
M. Leuschel, M. Butler (2005)
Automatic Refinement Checking for B -
We now prove that f (s 1 ) = s 2 , by proving that f (v i ) = w i for 1 ≤ i ≤ n, inspecting the cases of Definition -
Donald Kreher, Douglas Stinson (1998)
Combinatorial algorithms: generation, enumeration, and searchSIGACT News, 30
-
In other words, as m(s 1 ) = m(s 2 ), we have that for every d ∈ D we can find a corresponding d such that paths(d, s 1 ) = paths(d , s 2 ) -
A. Donaldson, Alice Miller, M. Calder (2005)
Spin-to-Grape: A Tool for Analysing Symmetry in Promela Models -
최진영, 방기석, 유혁, 허윤정 (1998)
Holzmann의 ˝The Model Checker SPIN˝에 대하여, 25
-
In this case ms 1 (v i ) = v i and hence for any permutation f , we have f (v i ) = v i . By Lemma 1, we also know ms 1 (w i ) = w i ; hence f (v i ) = w i -
Alice Miller, A. Donaldson, M. Calder (2006)
Symmetry in temporal logic model checkingACM Comput. Surv., 38
-
G. Peterson (1981)
Myths About the Mutual Exclusion ProblemInf. Process. Lett., 12
-
A. Sistla, Viktor Gyuris, E. Emerson (2000)
SMC: a symmetry-based model checker for verification of safety and liveness propertiesACM Trans. Softw. Eng. Methodol., 9
-
M. Leuschel, M. Butler, Corinna Spermann, E. Turner (2007)
Symmetry Reduction for B by Permutation Flooding -
M Leuschel, M Butler, C Spermann, E Turner (2007)
Proceedings B2007, LNCS 4355 -
We can generalise the above reasoning, to conclude that for every d ∈ D with p = paths(d, s 1 ) we have card({e ∈ D | paths(e, s 1 ) = p}) -
(2007)
Software Tools for Technology Transfer manuscript No. (will be inserted by the editor) ProB: An Automated Analysis Toolset for the B Method ⋆ -
M. Leuschel, M. Butler (2003)
ProB: A Model Checker for B -
E. Clarke, S. Jha, R. Enders, Thomas Filkorn (1993)
Exploiting symmetry in temporal logic model checkingFormal Methods in System Design, 9
-
Daniel Plagge, M. Leuschel (2007)
Validating Z Specifications Using the ProBAnimator and Model Checker -
Corinna Spermann, M. Leuschel (2008)
ProB gets Nauty: Effective Symmetry Reduction for B and Z Models2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering
-
Paulo Matos, B. Fischer, Joao Marques-Silva (2009)
A Lazy Unbounded Model Checker for Event-B -
E. Clarke, S. Jha (1995)
Symmetry and Induction in Model Checking -
A. Donaldson, Alice Miller (2006)
Exact and Approximate Strategies for Symmetry Reduction in Model Checking -
W. Kocay, Donald Kreher (2004)
Graphs, algorithms and optimization
- Publisher
- Springer Journals
- Copyright
- Copyright © 2010 by Springer Science+Business Media B.V.
- Subject
- Computer Science; Statistical Physics, Dynamical Systems and Complexity; Mathematics, general; Computer Science, general; Artificial Intelligence (incl. Robotics)
- ISSN
- 1012-2443
- eISSN
- 1573-7470
- DOI
- 10.1007/s10472-010-9208-8
- Publisher site
- See Article on Publisher Site
Abstract
We present a new approximate verification technique for falsifying the invariants of B models. The technique employs symmetry of B models induced by the use of deferred sets. The basic idea is to efficiently compute markers for states, so that symmetric states are guaranteed to have the same marker (but not the other way around). The falsification algorithm then assumes that two states with the same marker can be considered symmetric. We describe how symmetry markers can be efficiently computed and empirically evaluate an implementation, showing both very good performance results and a high degree of precision (i.e., very few non-symmetric states receive the same marker). We also identify a class of B models for which the technique is precise and therefore provides an efficient and complete verification method. Finally, we show that the technique can be applied to Z models as well.
Journal
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Aug 14, 2010