International Journal of Software Engineering & Applications (IJSEA), Vol.4, No.1, January 2013 Init
Increment
decrement
final
p≔1
When
When
When
q≔1
F ( r )< v
v<F(r)
F(r)=v
r ≔ (1 + n) /2
then
then
then
p ≔ r+1
q ≔ r-1
skip
r ≔ (r + 1+q) /2
r ≔(r + 1-1) /2
end
5.1.4 Pattern Design First of all, in our notion, a pattern is just a development in Event-B including specification p0 and a refinement p1 5.1.4.1 Development specification P0 Pattern design specification like initial model in the section 5.1.1
5.1.4.2 Pattern refinement P1 Pattern refinement like first and second refinement in the section 5.1.2 and 5.1.3
5.1.4 .3 Appling Pattern We have implemented our prototype for supporting our approach as a plug-in for the RODIN Platform [16] which is an open source platform based on Eclipse. The plug-in provides a wizard taking users through different steps of applying patterns, namely, matching, syntax checking, 34