Justifications for the event-b modelling notation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4355 LNCS, Issue , 2006, Pages 49-63

  Hallerstede, Stefan ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPLEX MODEL; DISCRETE SYSTEMS; EVENT-B; MODELLING TOOLS; TOOL SUPPORT;

ARTIFICIAL INTELLIGENCE;

EID: 84997078466     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11955757_7     Document Type: Conference Paper

References (22)

1. J.-R. Abrial. The B-Book: Assigning Programs to Meanings. CUP, 1996.
2. J.-R. Abrial. Event based sequential program development: Application to constructing a pointer program. In K. Araki, S. Gnesi, and D. Mandrioli, editors, FME, volume 2805 of LNCS, pages 51–74. Springer, 2003.
3. J.-R. Abrial, M. Butler, S. Hallerstede, and L. Voisin. An open extensible tool environment for Event-B. In Z. Liu and J. He, editors, ICFEM, volume 4260 of LNCS, pages 588–605. Springer, 2006.
4. J.-R. Abrial and D. Cansell. Click’n’Prove: Interactive Proofs within Set Theory. In TPHOL, volume 2758 of LNCS, pages 1–24, 2003.
5. J.-R. Abrial, D. Cansell, and D. Méry. A mechanically proved and incremental development of IEEE 1394 tree identify protocol. FAC, 14(3):215–227, 2003.
6. J.-R. Abrial and S. Hallerstede. Refinement, Decomposition and Instantiation of Discrete Models: Application to Event-B. Fundamentae Informatica, 2006.
7. J.-R. Abrial and L. Mussat. On using conditional definitions in formal theories. In D. Bert et al., editor, ZB, volume 2272 of LNCS, pages 242–269, 2002.
8. Jean-Raymond Abrial. Event driven system construction, 1999.
9. E. Astesiano, M. Bidoit, B. Krieg-Brückner, H. Kirchner, P. D. Mosses, D. Sannella, and A. Tarlecki. CASL - the common algebraic specification language. TCS, 286:153–196, 2002. Special issue on Abstract Data Types.
10. R.-J. Back. Refinement Calculus II: Parallel and Reactive Programs. In J. W. deBakker, W. P. deRoever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems, volume 430 of LNCS, pages 67–93. Springer, 1989.
11. M. Barnett, B.-Y. E. Chang, R. DeLine, B. Jacobs, and K. R. M. Leino. Boogie: A modular reusable verifier for object-oriented programs. In F. S. de Boer et al., editor, FMCO 2005, volume 4111 of LNCS, 2006.
12. P. Behm, L. Burdy, and J.-M. Meynadier. Well defined B. In D. Bert, editor, B’98: 2nd Int. B Conference, volume 1393 of LNCS, pages 29–45. Springer, 1998.
13. M. Butler. csp2B: A practical approach to combining CSP and B. FAC, 12(3):182– 198, 2000.
14. E. W. Dijkstra. The notational conventions I adopted, and why. Technical Report EWD1300, University of Texas, 2000.
15. Stefan Hallerstede. Parallel hardware design in B. In D. Bert et al., editor, ZB, volume 2651 of LNCS, pages 101–102. Springer, 2003.
16. Carroll Morgan. Programming from Specifications: Second Edition. PHI, 1994.
17. C. Morgan, T. Hoang, and J. Abrial. The Challenge of Probabilistic Event B. In H. Treharne at al., editor, ZB, volume 3455 of LNCS, pages 162–171. Springer, 2005.
18. J. Rushby, S. Owre, and N. Shankar. Subtypes for specifications: Predicate subtyping in PVS. IEEE Trans. Soft. Eng., 24(9):709–720, 1998.
19. S. Schneider and H. Treharne. CSP theorems for communicating B machines. FAC, 17(4):390–422, 2005.
20. J. M. Spivey. The Z Notation: A Reference Manual. PHI, 2nd edition, 1992.
21. S. T. Taft and R. A. Duff, editors. Ada 95 Reference Manual. Springer, 1997.
22. J. Woodcock and J. Davies. Using Z. Specification, Refinement, and Proof. PH, 1996.