Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Translating B machines into UML diagrams

Identifieur interne : 000C48 ( Crin/Checkpoint ); précédent : 000C47; suivant : 000C49

Translating B machines into UML diagrams

Auteurs : Houda Fekih ; Stephan Merz

Source :

RBID : CRIN:fekih03a

English descriptors

Abstract

This report describes transformations of B abstract machines into UML class and state-transition diagrams. The basic goal of this work is to produce translation rules for deriving UML class diagrams and state machines from sets, variables and operations in a B model. Our translation is interactive and does not necessarily produce a unique UML model, but it takes into account the use of the elements in the B model as a whole to constrain the translation into UML. We also consider how the refinement relationship of B machines maps to relations between the resulting UML models.

Links toward previous steps (curation, corpus...)


Links to Exploration step

CRIN:fekih03a

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" wicri:score="271">Translating B machines into UML diagrams</title>
</titleStmt>
<publicationStmt>
<idno type="RBID">CRIN:fekih03a</idno>
<date when="2003" year="2003">2003</date>
<idno type="wicri:Area/Crin/Corpus">003C21</idno>
<idno type="wicri:Area/Crin/Curation">003C21</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003C21</idno>
<idno type="wicri:Area/Crin/Checkpoint">000C48</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">000C48</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Translating B machines into UML diagrams</title>
<author>
<name sortKey="Fekih, Houda" sort="Fekih, Houda" uniqKey="Fekih H" first="Houda" last="Fekih">Houda Fekih</name>
</author>
<author>
<name sortKey="Merz, Stephan" sort="Merz, Stephan" uniqKey="Merz S" first="Stephan" last="Merz">Stephan Merz</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>b method</term>
<term>class diagram</term>
<term>refinement</term>
<term>state-transitions diagram</term>
<term>uml</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en" wicri:score="1575">This report describes transformations of B abstract machines into UML class and state-transition diagrams. The basic goal of this work is to produce translation rules for deriving UML class diagrams and state machines from sets, variables and operations in a B model. Our translation is interactive and does not necessarily produce a unique UML model, but it takes into account the use of the elements in the B model as a whole to constrain the translation into UML. We also consider how the refinement relationship of B machines maps to relations between the resulting UML models.</div>
</front>
</TEI>
<BibTex type="techreport">
<ref>fekih03a</ref>
<crinnumber>A03-R-502</crinnumber>
<category>15</category>
<author>
<e>Fekih, Houda</e>
<e>Merz, Stephan</e>
</author>
<title>Translating B machines into UML diagrams</title>
<institution>LORIA</institution>
<year>2003</year>
<type>Rapport de recherche</type>
<month>Dec</month>
<url>http://www.loria.fr/publications/2003/A03-R-502/A03-R-502.ps</url>
<keywords>
<e>uml</e>
<e>class diagram</e>
<e>state-transitions diagram</e>
<e>b method</e>
<e>refinement</e>
</keywords>
<abstract>This report describes transformations of B abstract machines into UML class and state-transition diagrams. The basic goal of this work is to produce translation rules for deriving UML class diagrams and state machines from sets, variables and operations in a B model. Our translation is interactive and does not necessarily produce a unique UML model, but it takes into account the use of the elements in the B model as a whole to constrain the translation into UML. We also consider how the refinement relationship of B machines maps to relations between the resulting UML models.</abstract>
</BibTex>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000C48 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Crin/Checkpoint/biblio.hfd -nk 000C48 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Crin
   |étape=   Checkpoint
   |type=    RBID
   |clé=     CRIN:fekih03a
   |texte=   Translating B machines into UML diagrams
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022