Abdelhak-Djamel Seriai

Abdelhak-Djamel Seriai

Auto-generated profile, based on publicly available information

Abdelhak-Djamel Seriai

LIRMM Lab, University of Montpellier, 34000 Montpellier, France

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2017 in Journal of Systems and Software
Verified
Journal Article
Closed access
ASAnas Shatnawi
Anas Shatnawi
ASAbdelhak-Djamel Seriai
Abdelhak-Djamel Seriai
HSHouari Sahraoui
Houari Sahraoui

1 September 2017 in Journal of Systems and Software
Verified
Journal Article
Closed access
ASAnas Shatnawi
Anas Shatnawi
ASAbdelhak-Djamel Seriai
Abdelhak-Djamel Seriai
HSHouari Sahraoui
Houari Sahraoui
ZSZakarea Mohammad Al shara
Zakarea Mohammad Al shara

3 September 2018 in Information
Verified
Journal Article
Open access
PDF file
HSHamzeh Eyal Salman
Hamzeh Eyal Salman
MHMustafa Hammad
Mustafa Hammad
ASAbdelhak-Djamel Seriai
Abdelhak-Djamel Seriai
AAAhed Al-Sbou
Ahed Al-Sbou
Software applications have become a fundamental part in the daily work of modern society as they meet different needs of users in different domains. Such needs are known as software requirements (SRs) which are separated into functional (software services) and non-functional (quality attributes). The first step of every software development project is SR elicitation. This step is a challenge task for developers as they need to understand and analyze SRs manually. For example, the collected functional SRs need to be categorized into different clusters to break-down the project into a set of sub-projects with related SRs and devote each sub-project to a separate development team. However, functional SRs clustering has never been considered in the literature. Therefore, in this paper, we propose an approach to automatically cluster functional requirements based on semantic measure. An empirical evaluation is conducted using four open-access software projects to evaluate our proposal. The experimental results demonstrate that the proposed approach identifies semantic clusters according to well-known used measures in the subject.

1 August 2013
Verified
Conference Paper
Open access
ASAnas Shatnawi
Anas Shatnawi
ASAbdelhak-Djamel Seriai
Abdelhak-Djamel Seriai
One of the most important approaches that support software reuse is Component Based Software Engineering (CBSE). Nevertheless the lack of component libraries is one of the major obstacles to widely use CBSE in the industry. To help filling this need, many approaches have been proposed to identify components from existing object-oriented software. These approaches identify components from singular software. Therefore the reusability of these components may be limited. In this paper, we propose an approach to mine reusable components from a set of similar object-oriented software, which were developed in the same domain, ideally by the same developers. Our goal is to enhance the reusability of mined components compared to those mined from single software. In order to validate our approach, we have applied it onto two open source Java applications of different sizes; small and large-scale ones. The results show that the components mined from the analysis of similar software are more reusable than those which are mined from single ones.

3 February 2022 in Information
Verified
Journal Article
Open access
PDF file
HSHamzeh Eyal Salman
Hamzeh Eyal Salman
ZSZakarea Mohammad Al shara
Zakarea Mohammad Al shara
ASAbdelhak-Djamel Seriai
Abdelhak-Djamel Seriai
Context: In a social coding platform such as GitHub, a pull-request mechanism is frequently used by contributors to submit their code changes to reviewers of a given repository. In general, these code changes are either to add a new feature or to fix an existing bug. However, this mechanism is distributed and allows different contributors to submit unintentionally similar pull-requests that perform similar development activities. Similar pull-requests may be submitted to review in parallel time by different reviewers. This will cause redundant reviewing time and efforts. Moreover, it will complicate the collaboration process. Objective: Therefore, it is useful to assign similar pull-requests to the same reviewer to be able to decide which pull-request to choose in effective time and effort. In this article, we propose to group similar pull-requests together into clusters so that each cluster is assigned to the same reviewer or the same reviewing team. This proposal allows saving reviewing efforts and time. Method: To do so, we first extract descriptive textual information from pull-requests content to link similar pull-requests together. Then, we employ the extracted information to find similarities among pull-requests. Finally, machine learning algorithms (K-Means clustering and agglomeration hierarchical clustering algorithms) are used to group similar pull-requests together. Results: To validate our proposal, we have applied it to twenty popular repositories from public dataset. The experimental results show that the proposed approach achieved promising results according to the well-known metrics in this subject: precision and recall. Furthermore, it helps to save the reviewer time and effort. Conclusion: According to the obtained results, the K-Means algorithm achieves 94% and 91% average precision and recall values over all considered repositories, respectively, while agglomeration hierarchical clustering performs 93% and 98% average precision and recall values over all considered repositories, respectively. Moreover, the proposed approach saves reviewing time and effort on average between (67% and 91%) by K-Means algorithm and between (67% and 83%) by agglomeration hierarchical clustering algorithm.