A CSP Approach to Control in Event-B

Schneider, Steve; Treharne, Helen; Wehrheim, Heike

doi:10.1007/978-3-642-16265-7_19

Cited by 25 publications

(28 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fundamentally, however, the same restrictions as for action systems apply: that is the lack of synchronisation and communication primitives. Some effort has been made to combine B with CSP to reap the benefits of both worlds [ST05,STW10]. It would thus be interesting to examine whether Event-B and its combination with CSP are indeed expressive enough for SCJ handler models, and whether the refinement laws we propose can be formulated and validated in that setting.…”

Section: Resultsmentioning

confidence: 99%

Laws of mission-based programming

Zeyda

Cavalcanti

2015

Form. Asp. Comput.

View full text Add to dashboard Cite

Safety-Critical Java (SCJ) is a recent technology that changes the execution and memory model of Java in such a way that applications can be statically analysed and certified for their real-time properties and safe use of memory. Our interest is in the development of comprehensive and sound techniques for the formal specification, refinement, design, and implementation of SCJ programs, using a correct-by-construction approach. As part of this work, we present here an account of laws and patterns that are of general use for the refinement of SCJ mission specifications into designs of parallel handlers, as they are used in the SCJ programming paradigm. Our refinement notation is a combination of languages from the Circus family, supporting state-rich reactive models with the addition of class objects and real-time properties. Starting from a sequential and centralised Circus specification, our laws permit refinement into Circus models of SCJ program designs. Automation and proof of the refinement laws is examined here, too. Our work is an important step towards eliciting laws of programming for SCJ and fits into a refinement strategy that we have developed previously to derive SCJ programs from specifications in a rigorous manner.

show abstract

Section: Resultsmentioning

confidence: 99%

Laws of mission-based programming

Zeyda

Cavalcanti

2015

Form. Asp. Comput.

View full text Add to dashboard Cite

show abstract

“…The CSP||B is a method that combines specifications in CSP and B-language in such a way that CSP controllers manage concurrently running B-machines. CSP||B has been introduced in [21] and further developed in subsequent works, such as [22] or [23] where it was adjusted for Event-B. Both approaches also deal formally with refinement of translated or combined specifications, so their results will be considered when designing mechanisms for maintaining some consistency aspects of B-machines created by our transformation.…”

Section: Related Workmentioning

confidence: 99%

Petri Nets to B-Language Transformation in Software Development

Sobota

2014

APH

View full text Add to dashboard Cite

show abstract

“…To provide explicit control flow for an Event-B model, a combination of two formal methods is presented in [19] which is based on using CSP alongside Event-B. As presented in Section 2.2, control flow can only be implicitly modelled in state variables and event guards in Event-B.…”

Section: Related Workmentioning

confidence: 99%

A Systematic Approach to Atomicity Decomposition in Event-B

Fathabadi

Butler

Rezazadeh

2012

Software Engineering and Formal Methods

View full text Add to dashboard Cite

Abstract. Event-B is a state-based formal method that supports a refinement process in which an abstract model is elaborated towards an implementation in a step-wise manner. One weakness of Event-B is that control flow between events is typically modelled implicitly via variables and event guards. While this fits well with Event-B refinement, it can make models involving sequencing of events more difficult to specify and understand than if control flow was explicitly specified. New events may be introduced in Event-B refinement and these are often used to decompose the atomicity of an abstract event into a series of steps. A second weakness of Event-B is that there is no explicit link between such new events that represent a step in the decomposition of atomicity and the abstract event to which they contribute. To address these weaknesses, atomicity decomposition diagrams support the explicit modelling of control flow and refinement relationships for new events. In previous work, the atomicity decomposition approach has been evaluated manually in the development of two large case studies, a multi media protocol and a spacecraft sub-system. The evaluation results helped us to develop a systematic definition of the atomicity decomposition approach, and to develop a tool supporting the approach. In this paper we outline this systematic definition of the approach, the tool that supports it and evaluate the contribution that the tool makes.

show abstract

A CSP Approach to Control in Event-B

Cited by 25 publications

References 17 publications

Laws of mission-based programming

Laws of mission-based programming

Petri Nets to B-Language Transformation in Software Development

A Systematic Approach to Atomicity Decomposition in Event-B

Contact Info

Product

Resources

About