Structured event-B models and proofs

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

Volumn 5977 LNCS, Issue , 2010, Pages 273-286

  Hallerstede, Stefan ^a  

^a HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT PROGRAMS; EVENT-B; GRAPHICAL NOTATION; LOCAL VARIABLES; PROGRAM COUNTERS; PROOF OBLIGATIONS; SEQUENTIAL ORDERING; STRUCTURED MODEL;

CONTOUR FOLLOWERS;

ABSTRACTING;

EID: 77950854501     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11811-1_21     Document Type: Conference Paper

References (17)

1. Abrial, J.-R.: Modeling in Event-B: System and Software Engineering. Cambridge University Press, Cambridge (2009) (to appear)
2. Abrial, J.-R., Butler, M., Hallerstede, S., Voisin, L.: An open extensible tool environment for Event-B. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol.4260, pp. 588-605. Springer, Heidelberg (2006)
3. Abrial, J.-R., Hallerstede, S.: Refinement, Decomposition and Instantiation of Discrete Models: Application to Event-B. Fundam. Inform 77(1-2), 1-28 (2007)
4. Apt, K.R., de Boer, F.S., Olderog, E.-R.: Verification of Sequential and Concurrent Programs. Springer, Heidelberg (2009)
5. Börger, E., Stärk, R.: Abstract State Machines: A Method for High-Level System Design and Analysis. Springer, Heidelberg (2003)
6. Butler, M.: Decomposition Structures for Event-B. In: Leuschel, M., Wehrheim, H. (eds.) IFM 2009. LNCS, vol.5423, pp. 20-38. Springer, Heidelberg (2009)
7. Cansell, D., Méry, D., Merz, S.: Diagram refinements for the design of reactive systems. J. UCS 7(2), 159-174 (2001)
8. de Alfaro, L., Manna, Z., Sipma, H.B., Uribe, T.E.: Visual verification of reactive systems. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol.1217, pp. 334-350. Springer, Heidelberg (1997)
9. Hallerstede, S.: Justifications for the Event-B Modelling Notation. In: Julliand, J., Kouchnarenko, O. (eds.) B 2007. LNCS, vol.4355, pp. 49-63. Springer, Heidelberg (2006)
10. Hallerstede, S.: On the Purpose of Event-B Proof Obligations. In: Börger, E., Butler, M., Bowen, J.P., Boca, P. (eds.) ABZ 2008. LNCS, vol.5238, pp. 125-138. Springer, Heidelberg (2008)
11. Hallerstede, S.: Proving Quicksort Correct in Event-B. In: Refine 2009, 16 pages (2009)
12. Hoare, C.A.R.: An axiomatic basis for computer programming. Communications of the ACM 12, 576-580 (1969)
13. Ifill, W., Schneider, S.A., Treharne, H.: Augmenting B with control annotations. In: Julliand, J., Kouchnarenko, O. (eds.) B 2007. LNCS, vol.4355, pp. 34-48. Springer, Heidelberg (2006)
14. Manna, Z., Pnueli, A.: Temporal verification diagrams. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol.789, pp. 726-765. Springer, Heidelberg (1994)
15. Morgan, C.: Programming from Specifications, 2nd edn. Prentice Hall, Englewood Cliffs (1994)
16. Owicki, S., Gries, D.: An axiomatic proof technique for parallel programs. Acta Informatica 6(4), 319-340 (1976)
17. Said, M.Y., Butler, M.J., Snook, C.F.: Language and tool support for class and state machine refinement in UML-B. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.5850, pp. 579-595. Springer, Heidelberg (2009)