Enhancing Unsupervised Requirements Traceability with Sequential Semantics

Author(s):  
Lei Chen ◽  
Dandan Wang ◽  
Junjie Wang ◽  
Qing Wang
2008 ◽  
Vol 12 (4) ◽  
pp. 143-157 ◽  
Author(s):  
Vassilka Kirova ◽  
Neil Kirby ◽  
Darshak Kothari ◽  
Glenda Childress

Author(s):  
Andre Di Thommazo ◽  
Gabriel Malimpensa ◽  
Thiago Ribeiro de Oliveira ◽  
Guilherme Olivatto ◽  
Sandra C. P. F. Fabbri

Author(s):  
MIN DENG ◽  
R. E. K. STIREWALT ◽  
BETTY H. C. CHENG

Recently, there has been growing interest in formalizing UML, thereby enabling rigorous analysis of its many graphical diagrams. Two obstacles currently limit the adoption and use of UML formalizations in practice. First is the need to verify the consistency of artifacts under formalization. Second is the need to validate formalization approaches against domain-specific requirements. Techniques from the emerging field of requirements traceability hold promise for addressing these obstacles. This paper contributes a technique called retrieval by construction (RBC), which establishes traceability links between a UML model and a target model intended to denote its semantics under formalization. RBC provides an approach for structuring and representing the complex one-to-many links that are common between UML and target models under formalization. RBC also uses the notion of value identity in a novel way that enables the specification of the link-retrieval criteria using generative procedures. These procedures are a natural means for specifying UML formalizations. We have validated the RBC technique in a tool framework called UBanyan, written in C++. We applied the tool to three case studies, one of which was obtained from the industry. We have also assessed our results using the two well-known traceability metrics: precision and recall. Preliminary investigations suggest that RBC can be a useful traceability technique for validating and verifying UML formalizations.


2008 ◽  
Vol 15 (2) ◽  
pp. 181-202
Author(s):  
Elias Canhadas Genvigir ◽  
Nandamudi Lankalapalli Vijaykumar

Several models proposed traceability links that provide pre–definedgroups of links for requirements traceability. These models are limited to pre–defined links without the ability to add new attributes to the existing links. This work proposes a model for requirements traceability that generalizes the types of links already establishedin the literature and enables addition of new standards allowing the inclusion of attributes to the links that will be used in a specific traceability process.


Author(s):  
Hui Liu ◽  
Zhan Shi ◽  
Jia-Chen Gu ◽  
Quan Liu ◽  
Si Wei ◽  
...  

Dialogue disentanglement aims to separate intermingled messages into detached sessions. The existing research focuses on two-step architectures, in which a model first retrieves the relationships between two messages and then divides the message stream into separate clusters. Almost all existing work puts significant efforts on selecting features for message-pair classification and clustering, while ignoring the semantic coherence within each session. In this paper, we introduce the first end-to- end transition-based model for online dialogue disentanglement. Our model captures the sequential information of each session as the online algorithm proceeds on processing a dialogue. The coherence in a session is hence modeled when messages are sequentially added into their best-matching sessions. Meanwhile, the research field still lacks data for studying end-to-end dialogue disentanglement, so we construct a large-scale dataset by extracting coherent dialogues from online movie scripts. We evaluate our model on both the dataset we developed and the publicly available Ubuntu IRC dataset [Kummerfeld et al., 2019]. The results show that our model significantly outperforms the existing algorithms. Further experiments demonstrate that our model better captures the sequential semantics and obtains more coherent disentangled sessions.


Sign in / Sign up

Export Citation Format

Share Document