Query-driven soft traceability links for models

被引:0
|
作者
Ábel Hegedüs
Ákos Horváth
István Ráth
Rodrigo Rizzi Starr
Dániel Varró
机构
[1] Budapest University of Technology and Economics,Department of Measurement and Information Systems
[2] Embraer S.A. Av Brigadeiro Faria Lima,undefined
来源
关键词
Soft links; Incremental model queries; Derived features; Traceability;
D O I
暂无
中图分类号
学科分类号
摘要
Model repositories play a central role in the model driven development of complex software-intensive systems by offering means to persist and manipulate models obtained from heterogeneous languages and tools. Complex models can be assembled by interconnecting model fragments by hard links, i.e., regular references, where the target end points to external resources using storage-specific identifiers. This approach, in certain application scenarios, may prove to be a too rigid and error prone way of interlinking models. As a flexible alternative, we propose to combine derived features with advanced incremental model queries as means for soft interlinking of model elements residing in different model resources. These soft links can be calculated on-demand with graceful handling for temporarily unresolved references. In the background, the links are maintained efficiently and flexibly by using incremental model query evaluation. The approach is applicable to modeling environments or even property graphs for representing query results as first-class relations, which also allows the chaining of soft links that is useful for modular applications. The approach is evaluated using the Eclipse Modeling Framework (EMF) and EMF-IncQuery in two complex industrial case studies. The first case study is motivated by a knowledge management project from the financial domain, involving a complex interlinked structure of concept and business process models. The second case study is set in the avionics domain with strict traceability requirements enforced by certification standards (DO-178b). It consists of multiple domain models describing the allocation scenario of software functions to hardware components.
引用
收藏
页码:733 / 756
页数:23
相关论文
共 50 条
  • [1] Query-driven soft traceability links for models
    Hegedus, Abel
    Horvath, Akos
    Rath, Istvan
    Starr, Rodrigo Rizzi
    Varro, Daniel
    [J]. SOFTWARE AND SYSTEMS MODELING, 2016, 15 (03): : 733 - 756
  • [2] Query-driven graph models in e-commerce
    Tuteja, Sonal
    Kumar, Rajeev
    [J]. INNOVATIONS IN SYSTEMS AND SOFTWARE ENGINEERING, 2023, 19 (02) : 177 - 195
  • [3] Query-driven graph models in e-commerce
    Sonal Tuteja
    Rajeev Kumar
    [J]. Innovations in Systems and Software Engineering, 2023, 19 : 177 - 195
  • [4] Query-Driven Program Testing
    Holzer, Andreas
    Schallhart, Christian
    Tautschnig, Michael
    Veith, Helmut
    [J]. VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, 2009, 5403 : 151 - 166
  • [5] Query-driven Constraint Acquisition
    Bessiere, Christian
    Coletta, Remi
    O'Sullivan, Barry
    Paulin, Mathias
    [J]. 20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2007, : 50 - 55
  • [6] Query-Driven Graph Processing
    Bonifati, Angela
    [J]. COMPANION PROCEEDINGS OF THE WEB CONFERENCE 2022, WWW 2022 COMPANION, 2022, : 311 - 312
  • [7] A Query-Driven Topic Model
    Fang, Zheng
    He, Yulan
    Procter, Rob
    [J]. FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, ACL-IJCNLP 2021, 2021, : 1764 - 1777
  • [8] Progressive Query-Driven Entity Resolution
    Zecchini, Luca
    [J]. SIMILARITY SEARCH AND APPLICATIONS, SISAP 2021, 2021, 13058 : 395 - 401
  • [9] Query-driven Qualitative Constraint Acquisition
    Belaid, Mohamed-Bachir
    Belmecheri, Nassim
    Gotlieb, Arnaud
    Lazaar, Nadjib
    Spieker, Helge
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2024, 79 : 241 - 271
  • [10] Snicket: Query-Driven Distributed Tracing
    Berg, Jessica
    Ruffy, Fabian
    Khanh Nguyen
    Yang, Nicholas
    Kim, Taegyun
    Sivaraman, Anirudh
    Netravali, Ravi
    Narayana, Srinivas
    [J]. PROCEEDINGS OF THE THE 20TH ACM WORKSHOP ON HOT TOPICS IN NETWORKS, HOTNETS 2021, 2021, : 206 - 212