Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Achraf Ghabi

dblp:90/9840 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 7 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Requirements engineering and software design · 50% Program analysis · 27% Empirical software engineering · 23%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Requirements engineering and software design
requirements traceability
0.322012
Code patterns for automatically validating requirements-to-code traces · ASE 2012
Observations on the connectedness between requirements-to-code traces and calling relationships for trace validation · ASE 2011
Program analysis
static analysis
0.112012
Code patterns for automatically validating requirements-to-code traces · ASE 2012
Empirical software engineering › software engineering research methodology
empirical study
0.112011
Observations on the connectedness between requirements-to-code traces and calling relationships for trace validation · ASE 2011

Methods — techniques the papers use, named apart from their topics

pattern-based trace validation · 0.1automated trace validation · 0.1empirical evaluation · 0.1calling relationship analysis · 0.1
YearPublicationVenuePosition
2017 Exploiting traceability uncertainty between software architectural models and extra-functional results
Catia Trubiani, Achraf Ghabi, Alexander Egyed
J. Syst. Softw.2
2015 Exploiting Traceability Uncertainty Between Software Architectural Models and Performance Analysis Results
Catia Trubiani, Achraf Ghabi, Alexander Egyed
ECSA2
2015 Exploiting traceability uncertainty among artifacts and code
Achraf Ghabi, Alexander Egyed
J. Syst. Softw.1
2015 Can method data dependencies support the assessment of traceability between requirements and source code?
abstract
Requirements traceability benefits many software engineering activities, such as change impact analysis and risk assessment. However, these activities require complete and correct traceability links which is not trivial, making traceability assessment an important field of study. In recent years, requirements traceability research has focused on using call dependencies within source code to understand how code properties contribute to the implementation of a requirement and to assess whether traceability links are correct and complete. These approaches largely ignore the role of existing data dependencies within the source code. That is, methods may never call each other, but may still depend upon another by sharing data. We identified five research questions and validated them on five software systems, covering 4 to 72 KLOC. We found that data dependencies are as relevant as call dependencies for assessing requirements traceability. Even more interesting, our analyses show that data dependencies complement call dependencies in the assessment. These findings have strong implications on code understanding, including trace capture, maintenance, and validation techniques. Copyright © 2015 John Wiley & Sons, Ltd.
Hongyu Kuang, Patrick Mäder, Hao Hu 0001, Achraf Ghabi, LiGuo Huang, Jian Lu 0001, Alexander Egyed
J. Softw. Evol. Process.4
2012 Do data dependencies in source code complement call dependencies for understanding requirements traceability?
abstract
It is common practice for requirements traceability research to consider method call dependencies within the source code (e.g., fan-in/fan-out analyses). However, current approaches largely ignore the role of data. The question this paper investigates is whether data dependencies have similar relationships to requirements as do call dependencies. For example, if two methods do not call one another, but do have access to the same data then is this information relevant? We formulated several research questions and validated them on three large software systems, covering about 120 KLOC. Our findings are that data relationships are roughly equally relevant to understanding the relationship to requirements traces than calling dependencies. However, most interestingly, our analyses show that data dependencies complement call dependencies. These findings have strong implications on all forms of code understanding, including trace capture, maintenance, and validation techniques (e.g., information retrieval).
Hongyu Kuang, Patrick Mäder, Hao Hu 0001, Achraf Ghabi, LiGuo Huang, Jian Lu 0001, Alexander Egyed
ICSM4
2012 Code patterns for automatically validating requirements-to-code traces
abstract
Traces between requirements and code reveal where requirements are implemented. Such traces are essential for code understanding and change management. Unfortunately, traces are known to be error prone. This paper introduces a novel approach for validating requirements-to-code traces through calling relationships within the code. As input, the approach requires an executable system, the corresponding requirements, and the requirements-to-code traces that need validating. As output, the approach identifies likely incorrect or missing traces by investigating patterns of traces with calling relationships. The empirical evaluation of four case study systems covering 150 KLOC and 59 requirements demonstrates that the approach detects most errors with 85-95% precision and 82-96% recall and is able to handle traces of varying levels of correctness and completeness. The approach is fully automated, tool supported, and scalable.
Achraf Ghabi, Alexander Egyed
ASE1
2011 Observations on the connectedness between requirements-to-code traces and calling relationships for trace validation
abstract
Traces between requirements and code reveal where requirements are implemented. Such traces are essential for code understanding and change management. Unfortunately, the handling of traces is highly error prone, in part due to the informal nature of requirements. This paper discusses observations on the connectedness between requirements-to-code traces and calling relationships within the source code. These observations are based on the empirical evaluation of four case study systems covering 150 KLOC and 59 sample requirements. We found that certain patterns of connectedness have high or low likelihoods of occurring. These patterns can thus be used to confirm or reject existing traceability - hence they are useful for validating requirements-to-code traces.
Achraf Ghabi, Alexander Egyed
ASE1