Modelling by Patterns for Correct-by-Construction Process

Méry, Dominique

doi:10.1007/978-3-030-03418-4_24

Cited by 7 publications

(2 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To summarize what is our notion of pattern, we simply define a pattern as a Event-B model which is solving either partially or completely a problem: for instance, the inductive pattern solves the problem of computing a value using an inductive set of values. In our previous works [31], [32] we have organized patterns with respect to paradigms identified in our refinement-based development. A paradigm is a distinct set of patterns, including theories, research methods, postulates, and standards for what constitutes legitimate contributions to designing programs.…”

Section: Introductionmentioning

confidence: 99%

Refinement-based Construction of Correct Distributed Algorithms

Méry

2021

2021 Second International Conference on Information Systems and Software Technologies (ICI2ST)

View full text Add to dashboard Cite

The verification of distributed algorithms is a challenge for formal techniques supported by tools, as model checkers and proof assistants. The difficulties, even for powerful tools, lie in the derivation of proofs of required properties, such as safety and eventuality, for distributed algorithms. Verification by construction can be achieved by using a formal framework in which models are constructed at different levels of abstraction; each level of abstraction is refined by the one below, and this refinement relationships is documented by an abstraction relation namely a gluing invariant. The highest levels of abstraction are used to express the required behavior in terms of the problem domain and the lowest level of abstraction corresponds to an implementation from which an efficient implementation can be derived automatically. We describe a methodology based on the general concept of refinement and used for developing distributed algorithms satisfying a given list of safety and liveness properties. We will show also how formal models can be used for producing distributed programs of a real programming language. The modelling methodology is defined in the Event-B modelling language using the Rodin Formal IDE.

show abstract

Section: Introductionmentioning

confidence: 99%

Refinement-based Construction of Correct Distributed Algorithms

Méry

2021

2021 Second International Conference on Information Systems and Software Technologies (ICI2ST)

View full text Add to dashboard Cite

show abstract

“…Moreover, the language is supported by the environment RODIN [2] which is extensible through the mechanism of plugin. Previous works [3,14,10,11] illustrate the correct-by-construction design of distributed algorithms using EVENT-B models and refinements; those works show that at an adequate level of concretization of models, one can derive a distributed algorithm in a pseudo algorithmic notation. However, the derivation of concrete EVENT-B models requires to develop a methodology related to a given class of problems.…”

Section: Introductionmentioning

confidence: 99%

Generating Distributed Programs from Event-B Models

Cirstea

Grall

Méry

2020

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Distributed algorithms offer challenges in checking that they meet their specifications. Verification techniques can be extended to deal with the verification of safety properties of distributed algorithms. In this paper, we present an approach for combining correct-by-construction approaches and transformations of formal models (EVENT-B) into programs (DISTALGO) to address the design of verified distributed programs. We define a subset LB (Local EVENT-B) of the EVENT-B modelling language restricted to events modelling the classical actions of distributed programs as internal or local computations, sending messages and receiving messages. We define then transformations of the various elements of the LB language into DISTALGO programs. The general methodology consists in starting from a statement of the problem to program and then progressively producing an LB model obtained after several refinement steps of the initial LB model. The derivation of the LB model is not described in the current paper and has already been addressed in other works. The transformation of LB models into DISTALGO programs is illustrated through a simple example. The refinement process and the soundness of the transformation allow one to produce correct-by-construction distributed programs.

show abstract