Here, we propose a new first-order predicate-transformer formulation of upward simulation suitable to be adopted by B for backward refinement.
Abstract. The B Method exploits a direct first-order wp predicate- transformer formulation of downward simulation to generate its proof.
In this paper we describe a method for verifying arbitrary refinements between B machines, in the absence of unbounded nondeterminism, in a single step ...
We describe various necessary and sufficient conditions with which to augment B's existing refinement proof obligations for forward and backward refinement ...
We propose f-BRS (feature backpropagating refinement scheme) that solves an optimization problem with respect to auxiliary variables instead of the network ...
Introducing Backward Refinement into B ; Автор: Dunne S. ; Количество экземпляров: 1 ; Вид: Статья из сборника или журнала ; Год: 2003 ; Ключевые слова: b.
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 ...
Refinement in Event-B involves refining the model state by adding or substituting variables and refining events into corresponding concrete versions, and by ...
Missing: Backward | Show results with:Backward
Dunne S Introducing backward refinement into B Proceedings of the 3rd international conference on Formal specification and development in Z and B, (178-196).
An interactive image segmentation algorithm, which accepts user-annotations about a target object and the background, is proposed in this work.