Dependencies between requirements are a crucial factor for any software development since they impact many project areas. Nevertheless, their identification remains a challenge. Some methods have been proposed but none of them are really applicable to real projects due to their high cost or low accuracy. DIM is a lightweight method for identifying dependencies proposed on a previous paper. This paper presents an experiment comparing the sets of dependencies found by DIM and a method based on pair-wise comparison. The experiment was executed using a requirement specification for an open source project. These requirements were extracted by reverse engineering. Our results have provided evidence confirming that DIM finds more dependencies and its results (the dependencies identified) do not depend on the profile of the practitioner applying it. Another important result is that DIM requires fewer resources when applied, since it does not rely on pair-wise comparisons and it can be easily automated. / Avda. Espana 101 P6 Bj-E 28341, Madrid, Spain. Telephone number: +34627770492
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:bth-3280 |
| Date | January 2010 |
| Creators | Gomez, Arturo, Rueda, Gema |
| Publisher | Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0018 seconds