An Open Extensible Tool Environment for Event-B

Abrial, Jean-Raymond; Butler, Michael; Hallerstede, Stefan; Voisin, Laurent

doi:10.1007/11901433_32

Cited by 126 publications

(89 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…As mentioned above, in [10,11] the authors present an integration of SMT solvers into Rodin [3], an IDE for Event-B development. In this scenario, the SMT solvers are used as provers in order to discharge Event-B proof obligations.…”

Section: Related Workmentioning

confidence: 99%

SMT Solvers for Validation of B and Event-B Models

Krings

Leuschel

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present an integration of the constraint solving kernel of the ProB model checker with the SMT solver Z3. We apply the combined solver to B and Event-B predicates, featuring higher-order datatypes and constructs like set comprehensions. To do so we rely on the finite set logic of Z3 and provide a new translation from B to Z3, better suited for constraint solving. Predicates can then be solved by the two solvers working hand in hand: constraints are set up in both solvers simultaneously and (intermediate) results are transferred. We thus combine a constraint logic programming based solver with a DPLL(T) based solver into a single procedure. The improved constraint solver finds application in many validation tasks, from animation of implicit specifications, to test case generation, bounded and symbolic model checking on to disproving of proof obligations. We conclude with an empirical evaluation of our approach focusing on two dimensions: comparing low and high-level encodings of B as well as comparing pure ProB to ProB combined with Z3.

show abstract

Section: Related Workmentioning

confidence: 99%

SMT Solvers for Validation of B and Event-B Models

Krings

Leuschel

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Let g and ϕ be subsets of V and s a relation. In this article we make use of the following set transformers 6 :…”

Section: Set Transformersmentioning

confidence: 99%

On the purpose of Event-B proof obligations

Hallerstede

2011

Form. Asp. Comput.

Self Cite

View full text Add to dashboard Cite

Abstract. Event-B is a formal modelling method which is claimed to be suitable for diverse modelling domains, such as reactive systems and sequential program development. This claim hinges on the fact that any particular model has an appropriate semantics. In Event-B this semantics is provided implicitly by proof obligations associated with a model. There is no fixed semantics though. In this article we argue that this approach is beneficial to modelling because we can use similar proof obligations across a variety of modelling domains. By way of two examples we show how similar proof obligations are linked to different semantics. A small set of proof obligations is thus suitable for a whole range of modelling problems in diverse modelling domains.

show abstract

“…Existing B tools [2,10] generate proof obligations due to consistency and refinement checking and they provide an environment to discharge them using automatic prover or by interaction. To ensure liveness in Event-B models we need to prove that models of distributed system are Non-Diergent and Enabledness preserving.…”

Section: Enabledness Preservationmentioning

confidence: 99%

“…The invariant (1) states that if a transaction t is not active at a site s then the variable variant is greater than or equal to zero. The invariant (2) state that the variable variant is greater than or equal to zero if the status of a transaction t at site s either precommit, pending, abort or commit.…”

Section: Fig 3 Invariant Used In Variant Proofsmentioning

confidence: 99%

Verification of Liveness Properties in Distributed Systems

Yadav

Butler

2009

Communications in Computer and Information Science

Self Cite

View full text Add to dashboard Cite

Abstract. This paper presents liveness properties that need to be preserved by Event-B models of distributed systems. Event-B is a formal technique for development of models of distributed systems related via refinement. In this paper we outline how enabledness preservation and non-divergence are related to the liveness properties of the B models of the distributed systems. We address the liveness issues related to our model of distributed transactions and outline the construction of proof obligations that need to be discharged to ensure liveness.

show abstract

An Open Extensible Tool Environment for Event-B

Cited by 126 publications

References 19 publications

SMT Solvers for Validation of B and Event-B Models

SMT Solvers for Validation of B and Event-B Models

On the purpose of Event-B proof obligations

Verification of Liveness Properties in Distributed Systems

Contact Info

Product

Resources

About