[HTML][HTML] Trace preservation in B and Event-B refinements

S Stock, A Mashkoor, M Leuschel, A Egyed�- Journal of Logical and�…, 2024 - Elsevier
Journal of Logical and Algebraic Methods in Programming, 2024Elsevier
Refinement guarantees that the concrete version of a model does not violate the constraints
introduced at the abstract level. The peculiarity of refinement, however, is that we have no
guarantee about the preservation of the behavior of the model. For example, a trace (a set of
desirable states and transitions) created on the abstract model may not replay on the
concrete model. Its manual recreation, usually via animation, is necessary to run the trace,
as the model may have changed significantly during refinement. However, this is a labor�…
Abstract
Refinement guarantees that the concrete version of a model does not violate the constraints introduced at the abstract level. The peculiarity of refinement, however, is that we have no guarantee about the preservation of the behavior of the model. For example, a trace (a set of desirable states and transitions) created on the abstract model may not replay on the concrete model. Its manual recreation, usually via animation, is necessary to run the trace, as the model may have changed significantly during refinement. However, this is a labor-intensive and error-prone task. To this end, this article presents an automatic trace refining technique and tool called BERT (B and Event-B Trace Refinement Technique) that allows modelers to ensure the behavioral integrity of high-level traces at the concrete level. The cost- and time-effectiveness of BERT are shown in industrial-strength case studies from the automotive and aviation domains.
Elsevier
Showing the best result for this search. See all results