reverse engineering – recent advances and applications - OpenLibra

More documents

Recommendations

Info

66 Reverse Engineering – Recent Advances and Applications NEREUS is an intermediate notation open to many other formal languages such as algebraic, logic or functional. We define its semantics by giving a precise formal meaning to each of the constructs of the NEREUS language in terms of the CASL language (Bidoit & Mosses, 2004). 3.2 Transforming metamodels into NEREUS We define a bridge between EMOF- and Ecore- metamodels and NEREUS. The NEREUS specification is completed gradually. First, the signature and some axioms of classes are obtained by instantiating reusable schemes. Associations are transformed by using a reusable component ASSOCIATION. Next, OCL specifications are transformed using a set of transformation rules and a specification that reflects all the information of MOF metamodels is constructed. The OCL basic types are associated with NEREUS basic types with the same name. NEREUS provides classes for collection type hierarchies. The types Set, Ordered Set, Bag and Sequence are subtypes of Collection. The transformation process of OCL specifications to NEREUS is supported by a system of transformation rules. By analyzing OCL specifications we can derive axioms that will be included in the NEREUS specifications. Preconditions written in OCL are used to generate preconditions in NEREUS. Postconditions and invariants allow us to generate axioms in NEREUS. We define a system of transformation rules that only considers expressions based on Essential OCL (OCL, 2010). The following metaclasses defined in complete OCL are not part of the EssentialOCL: MessageType, StateExp, ElementType, AssociationClassCallExp, MessageExp, and UnspecifiedValueExp. Any well-formed rules defined for these classes are consequently not part of the definition of the transformation rule system. The system includes a small set with around fifty rules. It was built by means of an iterative approach through successive refinements. The set of rules was validated by analyzing the different OCL expression attached to the UML metamodels, MOF and QVT. As an example we show a few rules of the system. A detailed description of the system may be found at (Favre, 2010). In each rule the shaded text denotes an OCL expression that can be translated by the non-shaded text in NEREUS: Rule OCL NEREUS R1 v. operation(parameters) operation(TranslateNEREUS(v),TranslateNEREUS (parameters)) R2 v->operation (parameters) operation(TranslateNEREUS(v),TranslateNEREUS (parameters)) R3 v.attribute attribute (v) R4 context Assoc object.rolename Let a:Assoc get_rolename (a, object)
MDA-Based Reverse Engineering R5 e.op e: expression op(TranslateNEREUS(e)) R6 exp1 infix-op exp2 TranslateNEREUS(exp1)TranslateNEREUS(infix-op) TranslateNEREUS(exp2) TranslateNEREUS(infix-oper) (TranslateNEREUS(exp1),TranslateNEREUS(exp2)) R7 T-> operationName (v :Type | bool-expr-with-v) OperationName ::= forAll│exists│select│reject T ::= Collection|Set|OrderedSet|Bag operationName (v) (TranslateNEREUS (T), [TranslateNEREUS (bool-expr-with-v)]) As an example, we show the formalization in NEREUS of a simplified QVT Core metamodel (Figure 2). The Core language is as powerful as the Relation language and may be used as a reference for the semantics of relations, which are mapped to Core. The complete diagram may be found at (QVT, 2008, pp.15). Figure 2 shows a simplified metamodel including transformation and rules classes. Fig. 2. A simplified metamodel A transformation defines how one set of models can be transformed into another. It is composed by a set of rules that specify its execution behavior. The following constraints (extendingRule and transitiveRule) may be attached to Figure 2 specifying that the rules of the extended transformation are included in the extending transformation and the extension is transitive: extendingRule = Transformation.allInstances -> forAll (t |t.extends.size = 1 implies t.extends.rule -> include (t.rule)) transitiveRule = Transformation.allInstances -> forAll (t1, t2, t3 | t1.extends.size = 1 and t2.extends.size = 1 and t3.extends.size = 1 and (t1.extends.rule -> includes (t2.rule) and t2.extends.rule -> includes (t3.rules)) implies t1.extends.rule -> includes (t3.rule) The OCL specification, extendingRule and transformationRule can be translated into the shaded axioms of the following specification: PACKAGE QVTBase CLASS Transformation IMPORTS EMOF::Tag INHERITS EMOF::MetaClass, EMOF::Package 67
Page 1 and 2:
REVERSE ENGINEERING - RECENT ADVANC
Page 5 and 6:
Contents Preface IX Part 1 Software
Page 9 and 10:
Preface Introduction In the recent
Page 11 and 12:
Preface XI and con’s related to t
Page 13 and 14:
Preface XIII the step-by-step appli
Page 17:
Part 1 Software Reverse Engineering
Page 20 and 21:
4 Reverse Engineering - Recent Adva
Page 22 and 23:
Page 24 and 25:
Page 26 and 27:
10 Reverse Engineering - Recent Adv
Page 28 and 29:
Page 30 and 31:
Page 32 and 33: 16 Reverse Engineering - Recent Adv
Page 74 and 75: 58 2. Model driven architecture: An
Page 78 and 79: 62 Fig. 1. Model, metamodels and tr
Page 116 and 117: 100 Reverse Engineering - Recent Ad
Page 124 and 125: 108 Table 1. Number of smoothers an
Page 133 and 134:
1. Introduction 60 Surface Reconstr
Page 135 and 136:
Surface Reconstruction from Unorgan
Page 137 and 138:
Page 139 and 140:
Page 141 and 142:
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
1. Introduction A Systematic Approa
Page 151 and 152:
A Systematic Approach for Geometric
Page 153 and 154:
Page 155 and 156:
Page 157 and 158:
Page 159 and 160:
Page 161 and 162:
Page 163 and 164:
Page 165 and 166:
Page 167 and 168:
Page 169 and 170:
Page 171 and 172:
Page 173 and 174:
Page 175 and 176:
Page 177 and 178:
A Review on Shape Engineering and D
Page 179 and 180:
Page 181 and 182:
Page 183 and 184:
Page 185 and 186:
Page 187 and 188:
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
Page 195 and 196:
Page 197 and 198:
Page 199 and 200:
Page 201 and 202:
Page 203 and 204:
Integrating Reverse Engineering and
Page 205 and 206:
Page 207 and 208:
Page 209 and 210:
Page 211 and 212:
Page 213 and 214:
Page 215 and 216:
Page 217 and 218:
Page 219 and 220:
Page 221 and 222:
Page 223 and 224:
Page 225 and 226:
Page 227 and 228:
Page 229 and 230:
Page 231:
Part 3 Reverse Engineering in Medic
Page 234 and 235:
218 Reverse Engineering - Recent Ad
Page 236 and 237:
Page 238 and 239:
Page 240 and 241:
Page 242 and 243:
Page 244 and 245:
Page 246 and 247:
Page 248 and 249:
Page 250 and 251:
Page 252 and 253:
Page 254 and 255:
238 5. Summary and discussions Reve
Page 256 and 257:
Page 258 and 259:
Page 260 and 261:
Page 262 and 263:
Page 264 and 265:
Page 266 and 267:
Page 268 and 269:
Page 270 and 271:
Page 272 and 273:
Page 274 and 275:
Page 276 and 277:
Page 278 and 279:
Page 280 and 281:
Page 282 and 283:
Page 284 and 285:
268 Fig. 6. A closed polygon mesh r
Page 286 and 287:
Page 288 and 289:
272 3. Results Reverse Engineering
Page 290 and 291:
Page 292:
show all

reverse engineering – recent advances and applications - OpenLibra

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?