Complete Traceability for Requirements in Satisfaction Arguments

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 RequirementsSatisfaction 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.

[1]  Lui Sha,et al.  Compositional Verification of Architectural Models , 2012, NASA Formal Methods.

[2]  David H. Bailey,et al.  The NAS parallel benchmarks summary and preliminary results , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).

[3]  John L. Henning.  SPEC CPU2006 benchmark descriptions , 2006, CARN.

[4]  Darijus Strašunskas.  Traceability in Collaborative Systems Development from Lifecycle Perspective – A Position Paper , 2002 .

[5]  Robert K. Brayton,et al.  Efficient implementation of property directed reachability , 2011, 2011 Formal Methods in Computer-Aided Design (FMCAD).

[6]  Alexander Egyed,et al.  Automating requirements traceability: Beyond the record & replay paradigm , 2002, Proceedings 17th IEEE International Conference on Automated Software Engineering,.

[7]  James Demmel,et al.  Benchmarking GPUs to tune dense linear algebra , 2008, HiPC 2008.

[8]  Orna Kupferman,et al.  Vacuity Detection in Temporal Model Checking , 1999, CHARME.

[9]  Giuliano Antoniol,et al.  Traceability Fundamentals , 2012, Software and Systems Traceability.

[10]  Michael W. Whalen,et al.  Efficient generation of inductive validity cores for safety properties , 2016, SIGSOFT FSE.

[11]  Sharad Malik,et al.  Extracting small unsatis able cores from unsatis able boolean formulas , 2003 .

[12]  Stephen Clark,et al.  Best Practices for Automated Traceability , 2007, Computer.

[13]  J. Mixter.  Fast , 2012 .

[14]  Jane Huffman Hayes,et al.  Improving requirements tracing via information retrieval , 2003, Proceedings. 11th IEEE International Requirements Engineering Conference, 2003..

[15]  Jane Cleland-Huang,et al.  Trace links explained: An automated approach for generating rationales , 2015, 2015 IEEE 23rd International Requirements Engineering Conference (RE).

[16]  Joao Marques-Silva,et al.  Fast, flexible MUS enumeration , 2015, Constraints.

[17]  Sanjai Rayadurgam,et al.  Compositional verification of a medical device system , 2013 .

[18]  Jeremy Dick,et al.  Requirements Engineering , 2002, Springer International Publishing.

[19]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[20]  Mohamed Sayeed,et al.  Measuring High-Performance Computing with Real Applications , 2008, Computing in Science & Engineering.

[21]  Felix Sheng-Ho Chang,et al.  Finding Minimal Unsatisfiable Cores of Declarative Specifications , 2008, FM.

[22]  Olly Gotel,et al.  An analysis of the requirements traceability problem , 1994, Proceedings of IEEE International Conference on Requirements Engineering.

[23]  Darren D. Cofer,et al.  Requirements Analysis of a Quad-Redundant Flight Control System , 2015, NFM.

[24]  Mary Sheeran,et al.  Checking Safety Properties Using Induction and a SAT-Solver , 2000, FMCAD.

[25]  Michael Jackson,et al.  Four dark corners of requirements engineering , 1997, TSEM.