On the purpose of Event-B proof obligations

Formal Aspects of Computing

Volumn 23, Issue 1, 2011, Pages 133-150

  Hallerstede, Stefan ^a  

^a HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

Event B; Proof; Proof obligation; Semantics

Indexed keywords

EVENT-B; FORMAL MODELLING; PROOF; PROOF OBLIGATION; PROOF OBLIGATIONS; REACTIVE SYSTEM; SEQUENTIAL PROGRAMS;

FORMAL LOGIC;

SEMANTICS;

EID: 79955918426     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-009-0138-3     Document Type: Conference Paper

References (30)

1. Abrial J-R, Butler M, Hallerstede S, Voisin L (2006) An open extensible tool environment for Event-B. In: Liu Z, He J (eds) ICFEM 2006, vol 4260. Springer, Berlin, pp 588-605. (Pubitemid 44860774)
2. Abrial J-R (1996) The B-book: assigning programs to meanings. Cambridge University Press, London.
3. Abrial J-R (1999) Event driven system construction (unpublished).
4. Abrial J-R (1999) Models of computations (unpublished).
5. Abrial J-R (2003) Event based sequential program development: Application to constructing a pointer program. In: Araki K, Gnesi S, Mandrioli D (eds) FME 2003: formal methods. LNCS, vol 2805. Springer, Berlin, pp 51-74.
6. Abrial J-R (2008) Modeling in event-B: system and software engineering. Cambridge University Press, London.
7. Abrial J-R, Cansell D, Ḿery D (2003) A mechanically proved and incremental development of IEEE 1394 tree identify protocol. Formal Aspects Comput 14(3):215-227.
8. Abrial J-R, Hallerstede S (2007) Refinement, decomposition and instantiation of discrete models: application to Event-B. Fundam Inf 77(1-2):1-28. (Pubitemid 47142636)
9. Abrial J-R, Mussat L (1998) Introducing dynamic constraints in B. In: Bert D (ed) B'98 : the 2nd international B conference. LNCS, vol 1393. Springer, Berlin, pp 83-128. (Pubitemid 128064869)
10. Apt KR, Olderog E-R (1991) Verification of sequential and concurrent programs. Springer, New York.
11. Badeau F, Amelot A (2005) Using B as a high level programming language in an industrial project: Roissy VAL. In: Treharne H, King S, Henson M, Schneider S (eds) ZB 2005. LNCS, vol 3455, pp 334-354. (Pubitemid 41274327)
12. Back R-J (1989) Refinement calculus II: parallel and reactive programs. In: deBakker JW, deRoever WP, Rozenberg G (eds) Stepwise refinement of distributed systems. Lecture notes in computer science, vol 430. Springer, Berlin, pp 67-93.
13. Butler MJ (1996) Stepwise refinement of communicating systems. Sci Comput Program 27(2):139-173. (Pubitemid 126363826)
14. Back R-J, von Wright J (1998) Refinement calculus: a systematic introduction. Graduate texts in computer science. Springer, Berlin.
15. Dijkstra EW (1976) A discipline of programming. Prentice-Hall, Englewood Cliffs.
16. Fischer C (1997) CSP-OZ: a combination of Object-Z and CSP. In: Bowmann H, Derrick J (eds) FMOODS '97, vol 2. Chapman & Hall, London, pp 423-438.
17. Hallerstede S (2003) Parallel hardware design in B. In: Bert D, Bowen JP, King S, Wald́en MA (eds) ZB. LNCS, vol 2651. Springer, Berlin, pp 101-102.
18. Hallerstede S (2005) The Event-B proof obligation generator. Technical report, ETH Z̈urich.
19. Hallerstede S, Hoang TS (2007) Qualitative probabilistic modelling in Event-B. In: Davies J, Gibbons J (eds) IFM 2007. LNCS, vol 4591. Springer, Berlin, pp 293-312.
20. Hoare CAR, Jifeng H (1998) Unifying theories of programming. Prentice-Hall, Englewood Cliffs.
21. Hoare CAR (1985) Communcating sequential processes. Prentice-Hall, Englewood Cliffs.
22. Morris FL, Jones CB (1984) An early program proof by Alan Turing. Ann Hist Comput 6(2):139-143.
23. Morgan CC (1990) Of wp and CSP. In: Feijen WHJ, van Gasteren AJM, Gries D, Misra J (eds) Beauty is our business: a birthday salute to Edsger W. Dijkstra. Springer, Berlin, pp 319-326.
24. Morgan CC (1994) Programming from specifications: second edition. Prentice-Hall, Englewood Cliffs.
25. de Roever WP, Engelhardt K (1998) Data refinement: model-oriented proof methods and their comparison. Cambridge tracts in theoretical computer science 47, vol 46. Cambridge University Press.
26. Roscoe AW (1988) Unbounded nondeterminism in CSP. Technical Monograph PRG-67, Programming Research Group, Oxford University.
27. Sekerinski E (1993) A calculus for predicative programming. In: Bird RS, Morgan CC, Woodcock JCP (eds) MPC. LNCS. Springer, Berlin.
28. TuringAM(1949) Checking a large routine. In:Report of a conference on high speed automatic calculating machines, EDSAC inaugural conference, University Mathematical Laboratory, Cambridge, UK, pp 67-69.
29. van Gasteren AJM (1990) On the shape of mathematical arguments, vol 445. LNCS. Springer, Berlin.
30. Woodcock J, Davies J (1996) Using Z. Specification, refinement, and proof. Prentice-Hall, Englewood Cliffs.