An open extensible tool environment for event-B

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

Volumn 4260 LNCS, Issue , 2006, Pages 588-605

  Abrial, Jean Raymond ^a   Butler, Michael ^b   Hallerstede, Stefan ^a   Voisin, Laurent ^a  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; LOGIC PROGRAMMING; MATHEMATICAL MODELS; THEOREM PROVING;

APPLICATION DOMAINS; FORMAL MODELING; MODELING TOOL;

LARGE SCALE SYSTEMS;

EID: 33845255024     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11901433_32     Document Type: Article

References (30)

1. Jean-Raymond Abrial. The B-Book: Assigning Programs to Meanings. Cambridge University Press, 1996.
2. Jean-Raymond Abrial and Dominique Cansell. Click'n'Prove: Interactive Proofs within Set Theory. In Theorem Proving in Higher Order Logics, volume 2758 of LNCS, pages 1-24, 2003.
3. Jean-Raymond Abrial and Stefan Hallerstede. Refinement, decomposition and instantiation of discrete models. Fundamentae Informatica, 2006. To appear.
4. R. J. R. Back. Refinement calculus, part II: Parallel and reactive programs. In J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems, volume 430 of Lecture Notes in Computer Science, pages 67-93. Springer-Verlag, 1990.
5. Frédéric Badeau and Arnaud Amelot. Using B as a high level programming language in an industrial project: Roissy VAL. In Helen Trehame, Steve King, Martin Henson, and Steve Schneider, editors, ZB 2005, volume 3455 of LNCS, pages 334-354, 2005.
6. M. Balser, W. Reif, G. Schellhorn, K. Stenzel, and A. Thums. Formal system development with KIV. In T. Maibaum, editor, Fundamental Approaches to Software Engineering, number 1783 in LNCS. Springer, 2000.
7. Mike Barnett, Bor-Yuh Chang, Robert DeLine, Bart Jacobs, and K. Rustan M. Leino. Boogie: A Modular Reusable Verifier for Object-Oriented Programs. In FMCO 2005, volume LNCS. Springer-Verlag, 2005. to appear.
8. Yves Bertot and P. (Pierre) Castéran. Interactive theorem proving and program development: Coq'Art: the calculus of inductive constructions. Texts in theoretical computer science. Springer-Verlag, 2004.
9. Egon Borger and Robert Stärk. Abstract State Machines: A Method for High-level System Design and Analysis. Springer-Verlag, 2003.
10. Achim D. Brucker, Frank Rittinger, and Burkhart Wolff. HOL-Z 2.0: A proof environment for Z-specifications. Journal of Universal Computer Science, 9(2):152-172, February 2003.
11. Clearsy. Atelier B tool homepage. http://www.atelierb.societe.com/.
12. David Detlefs, Greg Nelson, and James B. Saxe. Simplify: a theorem prover for program checking. J. ACM, 52(3):365-473, 2005.
13. Eclipse. Eclipse platform homepage. http://www.eclipse.org/.
14. J.-C. Filliâtre. Verification of Non-Functional Programs using Interpretations in Type Theory. Journal of Functional Programming, 13(4):709-745, July 2003.
15. Erich Gamma and Kent Beck. Contributing to Eclipse. Addison Wesley, 2003.
16. Matt Kaufmann and J. Strother Moore. An industrial strength theorem prover for a logic based on common lisp. IEEE Transactions on Software Engineering, 23(4):203-213, 1997.
17. James C. King. A new approach to program testing. In Proceedings of the international conference on Reliable software, pages 228-233, New York, NY, USA, 1975. ACM Press.
18. Leslie Lamport. Specifying Systems, The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley, 2002.
19. Thomas Långbacka and Joakim von Wright. Refining reactive systems in HOL using action systems. In Elsa L. Gunter and Amy P. Felty, editors, Theorem Proving in Higher Order Logics, 10th International Conference, TPHOLs'97, volume 1275 of Lecture Notes in Computer Science, pages 183-197. Springer, 1997.
20. M. Leuschel and M. Butler. ProB: A Model Checker for B. In Keijiro Araki, Stefania Gnesi, and Dino Mandrioli, editors, Proceedings FME 2003, Pisa, Italy, LNCS 2805, pages 855-874. Springer, 2003.
21. Carroll Morgan, Thai Son Hoang, and Jean-Raymond Abrial. The challenge of probabilistic event B - extended abstract. In Helen Treharne, Steve King, Martin C. Henson, and Steve A. Schneider, editors, ZB 2005: Formal Specification and Development in Z and B, 4th International Conference of B and Z Users, volume 3455 of Lecture Notes in Computer Science, pages 162-171. Springer, 2005.
22. Tobias Nipkow. Structured Proofs in Isar/HOL. In H. Geuvers and F. Wiedijk, editors, Types for Proofs and Programs (TYPES 2002), volume 2646 of LNCS, pages 259-278. Springer, 2003.
23. Lawrence C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer Verlag, 1994.
24. RODIN. RODIN project homepage. http://rodin.cs.ncl.ac.uk/.
25. RODIN. Deliverable D16: Prototype Plug-in Tools, http://rodin.cs.ncl.ac. uk/deliverables.htm, 2006.
26. Mark Saaltink. The Z/EVES system. In Jonathan P. Bowen, Michael G. Hinchey, and David Till, editors, ZUM '97: The Z Formal Specification Notation, 10th International Conference of Z Users, volume 1212 of Lecture Notes in Computer Science, pages 72-85. Springer, 1997.
27. C. Snook and M. Butler. UML-B: Formal modelling and design aided by UML. ACM Transactions on Software Engineering and Methodology, 2006. To appear. eprints.ecs.soton.ac.uk/10169/.
28. C. Snook and K. Sandstrom. Using UML-B and U2B for formal refinement of digital components. In Proceedings of Forum on specification and design languages (FDL03), 2003.
29. J. Michael Spivey. The Z Notation: A Reference Manual. International Series in Computer Science. Prentice-Hall, New York, NY, second edition, 1992.
30. Daniel Winterstein, David Aspinall, and Christoph Lüth. Proof general / eclipse: A generic interface for interactive proof. In IJCAI, pages 1587-1588, 2005.