Abstract
When establishing associations, known as tracelinks, between a requirement and the artifacts that lead to itssatisfaction, it is essential to know what the links mean. Whileresearch into this type of traceability - what we call Requirements Satisfaction Traceability - has been an active research area forsome time, none of the literature discusses the fact that thereare often multiple ways in which a requirement can be satisfied, i.e., there are multiple satisfaction arguments. The distinctionbetween establishing a single satisfaction argument between arequirement and its implementation (tracing one way the requirement is implemented) vs. tracing all satisfaction arguments, and the possible ramifications for how the trace links can beused in analysis, has not been well studied. We examine how thisdistinction changes the way traceability is perceived, established, maintained, and used. In this RE@Next! paper, we introduce anddiscuss the notion of "complete" traceability, which considersall trace links between the requirements and the artifacts thatwork to satisfy the requirements, and contrast it with the partialtraceability common in practice.
Original language | English (US) |
---|---|
Title of host publication | Proceedings - 2016 IEEE 24th International Requirements Engineering Conference, RE 2016 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 359-364 |
Number of pages | 6 |
ISBN (Electronic) | 9781509041213 |
DOIs | |
State | Published - Dec 2 2016 |
Event | 24th IEEE International Requirements Engineering Conference, RE 2016 - Beijing, China Duration: Sep 12 2016 → Sep 16 2016 |
Publication series
Name | Proceedings - 2016 IEEE 24th International Requirements Engineering Conference, RE 2016 |
---|
Other
Other | 24th IEEE International Requirements Engineering Conference, RE 2016 |
---|---|
Country/Territory | China |
City | Beijing |
Period | 9/12/16 → 9/16/16 |
Bibliographical note
Publisher Copyright:© 2016 IEEE.
Keywords
- Requirements
- Satisfaction Arguments
- Traceability