References

  1. J. R. Abrial (2010): Modeling in Event B: System and Software Engineering. Cambridge University Press.
  2. J.-R. Abrial & S. Hallerstede (2007): Refinement, Decomposition, and Instantiation of Discrete Models: Application to Event-B. Fundamenta Informaticae 77(1-2), pp. 1–28.
  3. R.-J. R. Back & R. Kurki-Suonio (1983): Decentralization of Process Nets with Centralized Control. In: Proceedings of the 2nd ACM SIGACT-SIGOPS Symposium of Principles of Distributed Computing, pp. 131–142, doi:10.1145/800221.806716.
  4. R.-J. R. Back & K. Sere (1991): Stepwise Refinement of Action Systems. Structured Programming 12, pp. 17–30.
  5. R.-J. R. Back & J. von Wright (1998): Refinement Calculus: A Systematic Introduction. Graduate Texts in Computer Science. Springer-Verlag.
  6. R.-J. R. Back & J. von Wright (1999): Reasoning algebraically about loops. Acta Informatica 36, pp. 295–334, doi:10.1007/s002360050163.
  7. R.-J. R. Back & J. von Wright (2003): Compositional Action System Refinement. Formal Aspects of Computing 15, pp. 103–117, doi:10.1007/s00165-003-0005-6.
  8. P. Boström (2010): Creating sequential programs from Event-B models. In: IFM'10 Proceedings of the 8th international conference on Integrated formal methods, LNCS 6396. Springer-Verlag, pp. 74–88, doi:10.1007/978-3-642-16265-7_7.
  9. M. Butler (2000): csp2B: A Practical Approach to Combining CSP and B. Formal Aspects of Computing 12(3), pp. 182–198, doi:10.1007/PL00003930.
  10. S. Hallerstede (2008): On the purpose of Event-B proof obligations. In: Abstract State Machines, B and Z, LNCS 5238. Springer-Verlag, pp. 125–138, doi:10.1007/978-3-540-87603-8_11.
  11. S. Hallerstede (2010): Structured Event-B models and proofs. In: Abstract State Machines, B and Z, LNCS 5977. Springer-Verlag, pp. 273–286, doi:10.1007/978-3-642-11811-1_21.
  12. T. S. Hoang & J-.R. Abrial (2010): Event-B decomposition for parallel programs. In: ABZ2010, LNCS 5977. Springer-Verlag, pp. 319–333, doi:10.1007/978-3-642-11811-1_24.
  13. C.A.R. Hoare (1985): Communicating Sequential Processes. Prentice Hall.
  14. A. Iliasov (2009): On Event-B and control flow. Technical Report CS-TR-1159. School of Computing Science, Newcastle University.
  15. C. B. Jones (1983): Tentative steps toward a development method for interfering programs. Transactions on Programming languages and systems 5(4), pp. 596–619, doi:10.1145/69575.69577.
  16. S. S. Owicki & D. Gries (1976): An axiomatic proof technique for parallel programs I. Acta Informatica 6, pp. 319–340, doi:10.1007/BF00268134.
  17. J. Plosila, K. Sere & M. Waldén (2005): Asynchronous system synthesis. Science of Computer Programming 55, pp. 259–288, doi:10.1016/j.scico.2004.05.018.
  18. (2010): Rodin Platform. http://www.event-b.org.
  19. W. P. de Roever & et. al. (2001): Concurrency Verification: Introduction to compositional and noncompositional methods. Cambridge University Press.
  20. S. Schneider, H. Treharne & H. Wehrheim (2010): A CSP Approach to Control in Event-B. In: Integrated Formal Methods 2010, LNCS 6396. Springer-Verlag, pp. 260–274, doi:10.1007/978-3-642-16265-7_19.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org