DOI: 10.1007/978-3-540-75209-7_14
|View full text |Cite
|
Sign up to set email alerts
|

Deriving Operation Contracts from UML Class Diagrams

Abstract: Class diagrams must be complemented with a set of system operations that describes how users can modify and evolve the system state. To be useful, such a set must be complete (i.e. through these operations, users should be able to modify the population of all elements in the class diagram) and executable (i.e. for each operation, there must exist a system state over which the operation can be successfully applied). Manual specification of these operations is an error-prone and time-consuming activity. Therefor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Publication Types

Select...
4

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 15 publications
(17 reference statements)
0
3
0
Order By: Relevance
“…Table 1 provides the rules to compute the dependencies for each kind of action, linked with the AND and OR operators, if necessary. These rules are adapted from [4]. The third column (Shareable) determines, for each dependency, if two or more dependee actions can be mapped (i.e.…”
Section: Computing the Dependenciesmentioning
confidence: 99%
See 1 more Smart Citation
“…Table 1 provides the rules to compute the dependencies for each kind of action, linked with the AND and OR operators, if necessary. These rules are adapted from [4]. The third column (Shareable) determines, for each dependency, if two or more dependee actions can be mapped (i.e.…”
Section: Computing the Dependenciesmentioning
confidence: 99%
“…In the following, we present an algorithm for determining the weak executability of an execution path path on a class diagram cd. For non-executable paths, the algorithm returns a set of possible repair action alternatives (output parameter requiredActions) that could be included in the path to make it executable 4 . Roughly, the algorithm works by executing two loops 5 .…”
Section: Algorithm To Determine the Weak Executability Of A Pathmentioning
confidence: 99%
“…In this context, we may find several proposals that provide an automatic definition of the basic operations (such as entity insertion or deletion, attribute modification, etc.) from a conceptual schema which allow updating the contents of the IB [3,4,5,6]. Their main drawback is that either they do not take into account the integrity constraints to be preserved during the automatic generation of the operations or they consider them only up to a limited extent.…”
Section: Introductionmentioning
confidence: 99%