SayedHassan Khatoonabadi

SayedHassan Khatoonabadi

Auto-generated profile, based on publicly available information

SayedHassan Khatoonabadi

Concordia University, Canada

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
31 January 2023 in ACM Transactions on Software Engineering and Methodology
Verified
Journal Article
Open access
SKSayedhassan Khatoonabadi
Sayedhassan Khatoonabadi
Diego Elias CostaDiego Elias Costa
Diego Elias Costa
RARabe Abdalkareem
Rabe Abdalkareem
ESEmad Shihab
Emad Shihab
Pull-based development has enabled numerous volunteers to contribute to open-source projects with fewer barriers. Nevertheless, a considerable amount of pull requests (PRs) with valid contributions are abandoned by their contributors , wasting the effort and time put in by both the contributors and maintainers. To better understand the underlying dynamics of contributor-abandoned PRs, we conduct a mixed-methods study using both quantitative and qualitative methods. We curate a dataset consisting of 265,325 PRs including 4,450 abandoned ones from ten popular and mature GitHub projects and measure 16 features characterizing PRs, contributors, review processes, and projects. Using statistical and machine learning techniques, we find that complex PRs, novice contributors, and lengthy reviews have a higher probability of abandonment and the rate of PR abandonment fluctuates alongside the projects’ maturity or workload. To identify why contributors abandon their PRs, we also manually examine a random sample of 354 abandoned PRs. We observe that the most frequent abandonment reasons are related to the obstacles faced by contributors, followed by the hurdles imposed by maintainers during the review process. Finally, we survey the top core maintainers of the studied projects to understand their perspectives on dealing with PR abandonment and on our findings.

13 August 2024 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
SKSayedHassan Khatoonabadi
SayedHassan Khatoonabadi
AAAhmad Abdellatif
Ahmad Abdellatif
Diego Elias CostaDiego Elias Costa
Diego Elias Costa
ESEmad Shihab
Emad Shihab
The success of a Pull Request (PR) depends on the responsiveness of the maintainers and the contributor during the review process. Being aware of the expected waiting times can lead to better interactions and managed expectations for both the maintainers and the contributor. In this paper, we propose a machine-learning approach to predict the first response latency of the maintainers following the submission of a PR, and the first response latency of the contributor after receiving the first response from the maintainers. We curate a dataset of 20 large and popular open-source projects on GitHub and extract 21 features to characterize projects, contributors, PRs, and review processes. Using these features, we then evaluate seven types of classifiers to identify the best-performing models. We also conduct permutation feature importance and SHAP analyses to understand the importance and the impact of different features on the predicted response latencies. We find that our CatBoost models are the most effective for predicting the first response latencies of both maintainers and contributors. Compared to a dummy classifier that always returns the majority class, these models achieved an average improvement of 29% in AUC-ROC and 51% in AUC-PR for maintainers, as well as 39% in AUC-ROC and 89% in AUC-PR for contributors across the studied projects. The results indicate that our models can aptly predict the first response latencies using the selected features. We also observe that PRs submitted earlier in the week, containing an average number of commits, and with concise descriptions are more likely to receive faster first responses from the maintainers. Similarly, PRs with a lower first response latency from maintainers, that received the first response of maintainers earlier in the week, and containing an average number of commits tend to receive faster first responses from the contributors. Additionally, contributors with a higher acceptance rate and a history of timely responses in the project are likely to both obtain and provide faster first responses. Moreover, we show the effectiveness of our approach in a cross-project setting. Finally, we discuss key guidelines for maintainers, contributors, and researchers to help facilitate the PR review process.

23 December 2023 in ACM Transactions on Software Engineering and Methodology
Verified
Journal Article
Open access
SKSayedhassan Khatoonabadi
Sayedhassan Khatoonabadi
Diego Elias CostaDiego Elias Costa
Diego Elias Costa
SMSuhaib Mujahid
Suhaib Mujahid
ESEmad Shihab
Emad Shihab
Pull Requests (PRs) that are neither progressed nor resolved clutter the list of PRs, making it difficult for the maintainers to manage and prioritize unresolved PRs. To automatically track, follow up, and close such inactive PRs, Stale bot was introduced by GitHub. Despite its increasing adoption, there are ongoing debates on whether using Stale bot alleviates or exacerbates the problem of inactive PRs. To better understand if and how Stale bot helps projects in their pull-based development workflow, we perform an empirical study of 20 large and popular open source projects. We find that Stale bot can help deal with a backlog of unresolved PRs, as the projects closed more PRs within the first few months of adoption. Moreover, Stale bot can help improve the efficiency of the PR review process as the projects reviewed PRs that ended up merged and resolved PRs that ended up closed faster after the adoption. However, Stale bot can also negatively affect the contributors, as the projects experienced a considerable decrease in their number of active contributors after the adoption. Therefore, relying solely on Stale bot to deal with inactive PRs may lead to decreased community engagement and an increased probability of contributor abandonment.

6 June 2026 in ACM Transactions on Software Engineering and Methodology
Verified
Journal Article
Open access
EAEbube Alor
Ebube Alor
SKSayedHassan Khatoonabadi
SayedHassan Khatoonabadi
ESEmad Shihab
Emad Shihab
Large Language Models (LLMs) offer new potential for automating documentation-to-code traceability, yet their capabilities and limitations remain underexplored. We evaluate three LLMs (Claude Sonnet, GPT-4o, and o3-mini) on documentation-to-code traceability across diverse software projects. We create two datasets from open-source systems (Unity Catalog and Crawl4AI), curated to minimize training-data overlap with the evaluated models, and derive a 27-project benchmark from CoDocBench and TransArc to study generalizability across established codebases. Our experiments assess three capabilities: (1) trace link identification, (2) relationship explanation quality, and (3) multi-step chain reconstruction, while comparing LLMs against TF-IDF, BM25, and CodeBERT baselines. On the curated datasets, the best LLM attains F1-scores of 79.4% and 80.4%, and on the Established Projects benchmark, LLMs reach average F1 up to 92.3%, substantially outperforming traditional baselines except in a single dense system. Fully correct explanations cover 42.9%–71.1% of links, while partial correctness exceeds 97%, and chain endpoints are almost always recovered, though intermediate steps are often imperfect. We also show that task framing, particularly one-to-many matching, is crucial for recall, whereas naive many-to-many prompts achieve around 5% F1 due to enumeration bias. Overall, LLMs are promising assistants for trace discovery when combined with human oversight and careful tool design.

9 February 2026 in ACM Transactions on Software Engineering and Methodology
Verified
Journal Article
Open access
SASamuel Abedu
Samuel Abedu
SKSayedHassan Khatoonabadi
SayedHassan Khatoonabadi
ESEmad Shihab
Emad Shihab
Software repositories contain valuable information for understanding the development process. However, extracting insights from repository data is time-consuming and requires technical expertise. While software engineering chatbots support natural language interactions with repositories, chatbots struggle to understand questions beyond their trained intents and to accurately retrieve the relevant data. This study aims to improve the accuracy of LLM-based chatbots in answering repositoryrelated questions by augmenting them with knowledge graphs. We use a two-step approach: constructing a knowledge graph from repository data, and synergizing the knowledge graph with an LLM to handle natural language questions and answers. We curated 150 questions of varying complexity and evaluated the approach on five popular open-source projects. Our initial results revealed the limitations of the approach, with most errors due to the reasoning ability of the LLM. We therefore applied few-shot chain-of-thought prompting, which improved accuracy to 84%. We also compared against baselines (MSRBot and GPT-4o-search-preview), and our approach performed significantly better. In a task-based user study with 20 participants, users completed more tasks correctly and in less time with our approach, and they reported that it was useful. Our findings demonstrate that LLMs and knowledge graphs are a viable solution for making repository data accessible.

17 June 2025
Verified
Conference Paper
Open access
MRMusfiqur Rahman
Musfiqur Rahman
SKSayedhassan Khatoonabadi
Sayedhassan Khatoonabadi
AAAhmad Abdellatif
Ahmad Abdellatif
HSHaya Samaana
Haya Samaana
ESEmad Shihab
Emad Shihab