Download ZB 2005: Formal Specification and Development in Z and B: by Cliff B. Jones (auth.), Helen Treharne, Steve King, Martin PDF

By Cliff B. Jones (auth.), Helen Treharne, Steve King, Martin Henson, Steve Schneider (eds.)

This ebook constitutes the refereed complaints of the 4th foreign convention of Z and B clients, ZB 2005, held in Guildford, united kingdom in April 2005.

The 25 revised complete papers offered including prolonged abstracts of two invited papers have been rigorously reviewed and chosen for inclusion within the booklet. The papers record the new advances for the Z formal specification notation and for the B approach, starting from foundational, theoretical, and methodological concerns to complicated purposes, instruments, and case experiences.

Show description

Read Online or Download ZB 2005: Formal Specification and Development in Z and B: 4th International Conference of B and Z Users, Guildford, UK, April 13-15, 2005. Proceedings PDF

Best international conferences and symposiums books

Virtual Systems and Multimedia: 13th International Conference, VSMM 2007, Brisbane, Australia, September 23-26, 2007, Revised Selected Papers (Lecture ... Applications, incl. Internet/Web, and HCI)

This ebook constitutes the completely refereed post-conference complaints of the thirteenth overseas convention on digital structures and Multimedia, VSMM 2007, held in Brisbane, Australia, in September 2007. The 18 revised complete papers offered have been conscientiously reviewed and chosen from ninety seven preliminary submissions in the course of rounds of reviewing and development.

Practical Aspects of Declarative Languages: 4th International Symposium, PADL 2002 Portland, OR, USA, January 19–20, 2002 Proceedings

Declarative languages construct on sound theoretical bases to supply appealing frameworks for software improvement. those languages were succe- totally utilized to a wide selection of real-world occasions together with database m- agement, energetic networks, software program engineering, and decision-support structures.

FM 2005: Formal Methods: International Symposium of Formal Methods Europe, Newcastle, UK, July 18-22, 2005. Proceedings

This quantity includes the court cases of Formal equipment 2005, the thirteenth InternationalSymposiumonFormalMethodsheldinNewcastleuponTyne,UK, in the course of July 18–22, 2005. Formal equipment Europe (FME, www. fmeurope. org) is an autonomous organization which goals to stimulate using, and examine on, formal tools for method improvement.

Additional resources for ZB 2005: Formal Specification and Development in Z and B: 4th International Conference of B and Z Users, Guildford, UK, April 13-15, 2005. Proceedings

Example text

19. M. Leuschel and E. Turner. Visualising larger states spaces in ProB. Technical report, School of Electronics and Computer Science, University of Southampton, January 2005. 20. A. Malcher. Minimizing Finite Automata is Computationally Hard. SpringerVerlag Berlin Heidelberg, 2710:386–397, August 2003. 21. N. L. N. Dulac, T. -A. Storey. On the use of Visualization in Formal Requirements Specification. In IEEE Joint International Conference on Requirements Engineering, pages 71–81, Essen, Germany, September 2002.

Bowen, A. Fett, and M. G. Hinchey, editors, ZUM’98: The Z Formal Specification Notation, volume 1493 of Lecture Notes in Computer Science, pages 284–307. Springer-Verlag, September 1998. 23. H. Treharne and S. Schneider. Using a process algebra to control B operations. In K. Araki, A. Galloway, and K. Taguchi, editors, International Conference on Integrated Formal Methods 1999 (IFM’99), pages 437–456, York, July 1999. Springer. 44 J. Derrick and H. Wehrheim 24. R. van Glabbeek and U. Goltz. Equivalence notions for concurrent systems and refinement of actions.

0 uA × m? = uC c ∧ ¬b xC = xA ; yC = yA ; vC = vA m = m? , m? ; uA × m? ; n iff xC ? ) = [ CState | ¬c ] which is in fact implied by R TransX ,MultU . , m? , m? : Z xA = xC − xC ? uA × m? = uC ¬c ∧ ¬b ∧ c yC = yA ; vC = vA ; yC = yC + yC ? xC = xC ; uC = uC b = b; m = m? n iff (yC ? > 0); n iff (xC ? < 0) xA = xC = xA + xC ? yA = yC = yA + yC ? uA × m? = uC ; uA = uA vA = vA = vC (xC ? )∨ (yC ? ) c ∧ ¬b m = m? MultU ) Applying ∃ AState to the right schema we see that the implication required by S3 holds.

Download PDF sample

Rated 4.09 of 5 – based on 13 votes