AbstractNoting that the usual ‘propositionally’ based way of composing retrenchments can yield many ‘junk’ cases, alternative approaches to composition are introduced (via notions of tidy, neat, and fastidious retrenchments) that behave better in this regard. These alternatives do however make other issues such as associativity harder. The technical details are presented for vertical composition of retrenchments (i.e. the composition of successive retrenchment steps)
Some of the success stories of model based refinement are recalled, as well as some of the annoyance...
We address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such a ...
International audienceWhen rewriting is used to generate convergent and complete rewrite systems in ...
AbstractNoting that the usual ‘propositionally’ based way of composing retrenchments can yield many ...
Retrenchment is a flexible model evolution formalism that arose as a reaction to the limitations imp...
AbstractRetrenchment is a flexible model evolution formalism that arose as a reaction to the limitat...
Refinement is reviewed, highlighting in particular the distinction between its use as a specificatio...
It is argued that refinement, in which I/O signatures stay the same, preconditions are weakened and ...
6 pagesInternational audienceRefactoring tools are commonly used for remodularization tasks. Basic r...
Dans les approches traditionnelles de développement, les composants logiciels sont assemblés en fonc...
The development of specifications often is a combination of smaller sub-components. Focusing on reus...
Discussion of a simple example demonstrates various expressive limitations of the refinement calculu...
AbstractRefinement is reviewed, highlighting in particular the distinction between its use as a spec...
Simple retrenchment is briefly reviewed in the B language of J.-R. Abrial [ref] as a liberalization ...
AbstractWe propose novel algebraic proof techniques for rewrite systems. Church–Rosser theorems and ...
Some of the success stories of model based refinement are recalled, as well as some of the annoyance...
We address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such a ...
International audienceWhen rewriting is used to generate convergent and complete rewrite systems in ...
AbstractNoting that the usual ‘propositionally’ based way of composing retrenchments can yield many ...
Retrenchment is a flexible model evolution formalism that arose as a reaction to the limitations imp...
AbstractRetrenchment is a flexible model evolution formalism that arose as a reaction to the limitat...
Refinement is reviewed, highlighting in particular the distinction between its use as a specificatio...
It is argued that refinement, in which I/O signatures stay the same, preconditions are weakened and ...
6 pagesInternational audienceRefactoring tools are commonly used for remodularization tasks. Basic r...
Dans les approches traditionnelles de développement, les composants logiciels sont assemblés en fonc...
The development of specifications often is a combination of smaller sub-components. Focusing on reus...
Discussion of a simple example demonstrates various expressive limitations of the refinement calculu...
AbstractRefinement is reviewed, highlighting in particular the distinction between its use as a spec...
Simple retrenchment is briefly reviewed in the B language of J.-R. Abrial [ref] as a liberalization ...
AbstractWe propose novel algebraic proof techniques for rewrite systems. Church–Rosser theorems and ...
Some of the success stories of model based refinement are recalled, as well as some of the annoyance...
We address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such a ...
International audienceWhen rewriting is used to generate convergent and complete rewrite systems in ...