Demo Data from EDBT 2026 / reviewers in the wild / expert
Tahir Ullah
dblp:373/6720
· DBLP profile ↗
4ranked-venue papers
2as first author
4since 2021 · last 2026
0000-0003-1434-0498ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021
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
1 paper |
Empirical software engineering · 67% Debugging and program repair · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Debugging and program repair
automated program repair |
0.9 | 1 | 2025 | LLM-Based Identification of Null Pointer Exception Patches · ASE 2025 |
Empirical software engineering › mining software repositories › commit analysis
commit classification |
0.9 | 1 | 2025 | LLM-Based Identification of Null Pointer Exception Patches · ASE 2025 |
Empirical software engineering
mining software repositories |
0.9 | 1 | 2025 | LLM-Based Identification of Null Pointer Exception Patches · ASE 2025 |
Methods — techniques the papers use, named apart from their topics
large language model · 0.9agentic commit classification · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Exploring and mining rationale information for low-rating software applications
Tahir Ullah, Javed Ali Khan, Nek Dil Khan, Affan Yasin, Hasna Arshad |
Soft Comput. | 1 |
| 2025 | LLM-Based Identification of Null Pointer Exception PatchesabstractNull Pointer Exceptions (NPEs) are one of the leading causes of software crashes and runtime errors. Although existing methods attempt to detect and classify NPE fixes, they often fall short due to irrelevant or noisy data, a lack of contextual understanding, and inefficiency in processing large and imbalanced datasets. To overcome these challenges, we propose an approach, called Augmented Agentic Commit Classification (AACC for short), to accurately categorize commit patches as NPE fixes or non-NPE. AACC leverages the code structure and contextual insights from commit messages to capture the semantic intent behind code modifications. It features four key advancements: (1) Best example selection that filters high-quality, contextually relevant commits to ensure the model learns from contextual rich and accurate data; (2) an augmented knowledge base that enriches classification by combining contextual metadata, program semantics, and bug fix patterns; (3) a prioritise agent that ranks commits based on relevance and impact, optimizing resource allocation and boosting efficiency; and (4) an iterative refinement process that enables the model to learn from feedback to correct misclassifications, reducing false negative rates. Our evaluation results on ChatGPT-4o suggest that it outperforms the state-of-the-art approaches by improving the F1 score from 72.07% to 98.03%. Tahir Ullah, Waseem Akram 0005, Fiza Khaliq |
ASE | 1 |
| 2025 | Leveraging Large Language Model ChatGPT for enhanced understanding of end-user emotions in social media feedbacks
Nek Dil Khan, Javed Ali Khan, Jianqiang Li 0002, Tahir Ullah, Qing Zhao 0005 |
Expert Syst. Appl. | 4 |
| 2024 | Can end-user feedback in social media be trusted for software evolution: Exploring and analyzing fake reviewsabstractSummary End‐user feedback in social media platforms, particularly in the app stores, is increasing exponentially with each passing day. Software researchers and vendors started to mine end‐user feedback by proposing text analytics methods and tools to extract useful information for software evolution and maintenance. In addition, research shows that positive feedback and high‐star app ratings attract more users and increase downloads. However, it emerged in the fake review market, where software vendors started incorporating fake reviews against their corresponding applications to improve overall software ratings. For this purpose, we conducted an exploratory study to understand how end‐users register and write fake reviews in the Google Play Store. We curated a research data set containing 68,000 end‐user comments from the Google Play Store and a fake review generator, that is, the Testimonial generator (TG). Its purpose is to understand fake reviews on these platforms and identify the common patterns potential end‐users and professionals use to report fake reviews by critically analyzing the end‐user feedback. We conducted a detailed survey at the University of Science and Technology Bannu, Pakistan, to identify the intelligence and accuracy of crowd‐users in manually identifying fake reviews. In addition, we developed a ground truth to be compared with the results obtained from the automated machine and deep learning (M&DL) classifier experiment. In the survey, 512 end‐users participated and recorded their responses in identifying fake reviews. Finally, various M&DL classifiers are employed to classify and identify end‐user reviews into real and fake to automate the process. Unlike humans, the M&DL classifiers performed well in automatically classifying reviews into real and fake by obtaining much higher accuracy, precision, recall, and f‐measures. The accuracy of manually identifying fake reviews by the crowd‐users is 44.4%. In contrast, the M&DL classifiers obtained an average accuracy of 96%. The experimental results obtained with various M&DL classifiers are encouraging. It is the first step towards identifying fake reviews in the app store by studying its implications in software and requirements engineering. Javed Ali Khan, Tahir Ullah, Arif Ali Khan, Affan Yasin, Muhammad Azeem Akbar, Khursheed Aurangzeb |
Concurr. Comput. Pract. Exp. | 2 |