2011 16th IEEE International Conference on Engineering of Complex Computer Systems 2011
DOI: 10.1109/iceccs.2011.20
|View full text |Cite
|
Sign up to set email alerts
|

Required Behavior of Sequence Diagrams: Semantics and Refinement

Abstract: ✦ Abstract-Sequence diagrams are a widely used design notation for describing software behaviors. Many reusable software artifacts such as design patterns and design aspects make use of sequence diagrams to describe interaction behaviors. When a pattern or an aspect is reused in an application, it is important to ensure that the sequence diagrams for the application conform to the corresponding sequence diagrams for the pattern or aspect. Reasoning about conformance relationship between sequence diagrams has n… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
19
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 12 publications
(19 citation statements)
references
References 64 publications
0
19
0
Order By: Relevance
“…Refinement based on trace semantics requires a meticulous work that consists in generating of all possible traces of SD, then in their categorization into required and possible traces (Lu andKim., 2011) and(øys-tein Haugen et al, 2005); where possible traces correspond to all possible combinations of SD events, that are obtained by rules of derivation of traces of the considered semantics, and required traces are those that must be preserved when refining the SD. Moreover, these semantics are based on rules of standard semantics that are not suitable for SD that model distributed systems.…”
Section: Operational Semantics Of Sequence Diagrammentioning
confidence: 99%
See 3 more Smart Citations
“…Refinement based on trace semantics requires a meticulous work that consists in generating of all possible traces of SD, then in their categorization into required and possible traces (Lu andKim., 2011) and(øys-tein Haugen et al, 2005); where possible traces correspond to all possible combinations of SD events, that are obtained by rules of derivation of traces of the considered semantics, and required traces are those that must be preserved when refining the SD. Moreover, these semantics are based on rules of standard semantics that are not suitable for SD that model distributed systems.…”
Section: Operational Semantics Of Sequence Diagrammentioning
confidence: 99%
“…The majority of the existing approaches, (Harald, 2003), (Lu andKim., 2011), (øystein Haugen et al, 2005), of the second category, required the computation of positive and negative traces sets, but they are based on rules of standard semantics. Hence, they do not permit the computation of all possible traces for SD that models a distributed system.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…We shall use SDs in Figure 1 as a running example. These SDs have been used to illustrate refinement, a special case of conformance [Lu and Kim 2011]. In SD Login, the opt fragment is labeled a, and the sending and receiving events for a message are labeled with two consecutive numbers.…”
Section: Introductionmentioning
confidence: 99%