Against Use Case Interleaving

نویسندگان

  • Pierre Metz
  • John O'Brien
  • Wolfgang Weber
چکیده

Use cases are a powerful and widely recognised tool for functional requirements elicitation and specification of prospective software applications. However, there still are major problems and misunderstandings about the use case approach. One of these is the troublesome notion of use case interleaving which is discussed in this work. Interleaving is still present in the current UML specification. A. Simons correctly realised that interleaving compares with goto/comefrom semantics that were already judged harmful by Dijkstra at the emergence of the Structured Programming era. Simons, thus, has requested the explicit dropping of interleaving semantics. The authors give further support for Simons ́ request by showing that interleaving causes severe inconsistencies within UML and contradicts other proven and practically relevant use case concepts such as Goal-Based Use Cases of A. Cockburn, and contractual specifications of use cases expressed by preand postcondition approaches. Significant fixes to UML are proposed, in addition to those suggested by Simons. These will dramatically clarify prevailing problems and confusion with use cases and use case relationships among both practitioners and researchers. 1 Use Case Interleaving Semantics From Jacobson to UML v1.2 In [15], Jacobson et al. introduced the notion of use case interleaving. On the one hand, abstract use cases that are attached by a use case relationship may represent continuous interaction courses which are plugged into another use case as a whole [7], [8], [15], [22]. On the other hand, instead of embedding an abstract use case as a unit, it is also proposed to interleave the interaction elements of an abstract use case into the base use case [7], [8], [15]. Interleaving can be understood as cutting a given use case interaction into pieces and weaving them into the interaction description of another use case (see Fig. 1). Any interleaving is possible as long as the relative order of all use case elements is preserved [15], [21]. Originally, interleaving was introduced for the Uses relationship only [15] (predecessor of UML v1.3 ́s «include» relationship), but not for Jacobson et al. ́s Extends relationship (predecessor of UML v1.3 ́s «extend» relationship). 1 An abstract use case does not represent a complete external system functionality. Abstract use cases are a mechanism for structuring and refactoring descriptions of complete system behaviour [15]. They represent extracted parts of other use cases and are meaningful only in the context of the surrounding base use case definition. Hence, abstract use cases cannot be processed in isolation; thus, in the use case model, they do not have an actor attached directly.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diversity Selection Based o n Decoding Syndrome in Correlated Fading Channels

In TDMA digital transmission for use in portable indoor mdiocommunications,oneof the impairmentsencountered is correlated slow fading. At low pomble speeds typical of slow user mobility in the indoor communications, the frequency and duntion of e m r bursts due to deep fades influence the choice of the Forward Error Correction scheme to be used. FUI is effective against Rayleigh fading only whe...

متن کامل

Partial Order Models for Quantitative Extensions of

Event structures are a prominent model for non-interleaving concurrency. The use of event structures for providing a compositional non-interleaving semantics to LOTOS without data is studied. In particular, several quantitative extensions of event structures are proposed that incorporate notions like time|both of deterministic and stochastic nature|and probability. The suitability of these mode...

متن کامل

Interleaving Pattern Databases

Pattern databases are a method for improving search performance through the use of a pre-computed lookup table, which maps abstracted problem states to a lower bound on the cost for achieving the goal state. A wide variety of domain abstractions can be used to achieve a pattern database of a given size, and it is often the case that some abstractions provide better lower bounds than others. How...

متن کامل

Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking

The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for XML manipulation languages. XML applications would benefit from the extension of REs with interleaving and counting, but this is not feasible in general, since inclusion is EXPSPACE-complete for such extended REs. In Colazzo et al. (2009) [1] we introduced a notion of ‘‘conflict-free REs’’, which are ext...

متن کامل

A Sub-threshold 9T SRAM Cell with High Write and Read ability with Bit Interleaving Capability

This paper proposes a new sub-threshold low power 9T static random-access memory (SRAM) cell compatible with bit interleaving structure in which the effective sizing adjustment of access transistors in write mode is provided  by isolating writing and reading paths. In the proposed cell, we consider a weak inverter to make better write mode operation. Moreover applying boosted word line feature ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001