Structured Event-B Models and Proofs

Hallerstede, Stefan

doi:10.1007/978-3-642-11811-1_21

Cited by 11 publications

(14 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Compared to the structured model developed by Hallerstede in [7] shown in 9 we see a very similar shape. .…”

Section: Flow Graph Case Studysupporting

confidence: 56%

“…In this section, we will apply the concept to a model of the extended GCD algorithm taken from [7] using our prototype. The model consists of a refinement chain, where the last model consists of two loops.…”

Section: Enable Graph Case Studymentioning

confidence: 99%

“…. Structural model from [7] However, the automatic flow analysis helped us to discover an interesting property. The flow graph contains a state that corresponds to concrete states where no event is enabled, i.e., states where the system deadlocks.…”

Section: Flow Graph Case Studymentioning

confidence: 99%

“…Hallerstede introduced in [7] a new approach to support refinement in Event-B that contains information about the structure of a component. Also Butler showed in [4] how structural information can be kept during refinement of a component.…”

Section: Specifying Flow Informationmentioning

confidence: 99%

See 3 more Smart Citations

Automatic Flow Analysis for Event-B

Bendisposto

Leuschel

2011

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. In Event-B a system is developed using refinement. The language is based on a relatively small core; in particular there is only a very small number of substitutions. This results in much simpler proof obligations, that can be handled by automatic tools. However, the downside is that, in case of software development, structural information is not explicitly available but hidden in the chain of refinements. This paper discusses a method to uncover these implicit algorithmic structures and use them in a model checker. Other applications are code generation, model comprehension, and test-case generation.

show abstract

“…Compared to the structured model developed by Hallerstede in [7] shown in 9 we see a very similar shape. .…”

Section: Flow Graph Case Studysupporting

confidence: 56%

Section: Enable Graph Case Studymentioning

confidence: 99%

Section: Flow Graph Case Studymentioning

confidence: 99%

Section: Specifying Flow Informationmentioning

confidence: 99%

See 2 more Smart Citations

Automatic Flow Analysis for Event-B

Bendisposto

Leuschel

2011

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

show abstract

“…However, the advances made by Event-B with respect to incremental proving [3] are mainly due to the lack of control structures. Avoiding the reintroduction of control structures we use state machine notation to provide the needed features [7]. The refinement method of [14] could be named "node refinement": nodes are replaced by state machines.…”

Section: Introductionmentioning

confidence: 99%

Refining Nodes and Edges of State Machines

Hallerstede

Snook

2011

Formal Methods and Software Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. State machines are hierarchical automata that are widely used to structure complex behavioural specifications. We develop two notions of refinement of state machines, node refinement and edge refinement. We compare the two notions by means of examples and argue that, by adopting simple conventions, they can be combined into one method of refinement. In the combined method, node refinement can be used to develop architectural aspects of a model and edge refinement to develop algorithmic aspects. The two notions of refinement are grounded in previous work. Event-B is used as the foundation for our refinement theory and UML-B state machine refinement influences the style of node refinement. Hence we propose a method with direct proof of state machine refinement avoiding the detour via Event-B that is needed by UML-B.

show abstract

Creating Sequential Programs from Event-B Models

Boström

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Structured Event-B Models and Proofs

Cited by 11 publications

References 13 publications

Automatic Flow Analysis for Event-B

Automatic Flow Analysis for Event-B

Refining Nodes and Edges of State Machines

Creating Sequential Programs from Event-B Models

Contact Info

Product

Resources

About