Eng Lieh Ouh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Eng Lieh Ouh has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- David Lo
Singapore Management University
6 shared publications - Lwin Khin Shar
Singapore Management University, Singapore, Singapore
6 shared publications - Ting Zhang
Monash University, Melbourne, Australia
5 shared publications - Hong Jin Kang
University of Sydney, Sydney, Australia
4 shared publications - Huihui Huang
Singapore Management University, Singapore, Singapore
4 shared publications - Kar Way Tan
Singapore Management University
4 shared publications
Latest Publications
- Open Access
- 11 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing Education
ChatGPT, Can You Generate Multiple-Choice Questions for an Undergraduate Computing Course? An Evaluation of its Effectiveness Using Classical Test Theory
Educators are increasingly adopting large language models such as ChatGPT to generate multiple-choice questions (MCQs), yet empirical evidence on the quality of these items in computing education assessments remains limited. This study compares 30 ChatGPT-generated and 30 manually crafted items from an undergraduate software design course, and evaluates item difficulty, discrimination, and distractor quality using Classical Test Theory. We triangulated two evaluations using within-subjects and between-subjects designs. Our quantitative findings show that all three metrics in both evaluations point in the same direction. ChatGPT-generated items are easier, less discriminating, and exhibit poorer distractor quality than manually crafted items. Distractor quality of ChatGPT-generated items is significantly worse in both designs. Difficulty metric is significant in the within-subjects design and discrimination metric is significant in the between-subjects design. We discuss the quantitative findings for each evaluation and across the two evaluations. A qualitative analysis further identifies six construction patterns in ChatGPT-generated MCQs that contribute to non-functioning distractors and help explain their psychometric characteristics. These patterns provide practical guidance for instructors to review and revise ChatGPT-generated items before deployment.
- 11 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing Education
Open AccessChatGPT, Can You Generate Multiple-Choice Questions for an Undergraduate Computing Course? An Evaluation of its Effectiveness Using Classical Test Theory
Educators are increasingly adopting large language models such as ChatGPT to generate multiple-choice questions (MCQs), yet empirical evidence on the quality of these items in computing education assessments remains limited. This study compares 30 ChatGPT-generated and 30 manually crafted items from an undergraduate software design course, and evaluates item difficulty, discrimination, and distractor quality using Classical Test Theory. We triangulated two evaluations using within-subjects and between-subjects designs. Our quantitative findings show that all three metrics in both evaluations point in the same direction. ChatGPT-generated items are easier, less discriminating, and exhibit poorer distractor quality than manually crafted items. Distractor quality of ChatGPT-generated items is significantly worse in both designs. Difficulty metric is significant in the within-subjects design and discrimination metric is significant in the between-subjects design. We discuss the quantitative findings for each evaluation and across the two evaluations. A qualitative analysis further identifies six construction patterns in ChatGPT-generated MCQs that contribute to non-functioning distractors and help explain their psychometric characteristics. These patterns provide practical guidance for instructors to review and revise ChatGPT-generated items before deployment.
- Open Access
- 23 May 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
Mapping NVD Records to Their Vulnerability-fixing Commits: How Hard is It?
Mapping National Vulnerability Database (NVD) records to vulnerability-fixing commits (VFCs) is crucial for vulnerability analysis but challenging due to sparse explicit links in NVD references. This study explores this mapping's feasibility through an empirical approach. Manual analysis of NVD references showed Git references enable over 86% success, while non-Git references achieve under 14%. Using these findings, we built an automated pipeline extracting 31,942 VFCs from 20,360 NVD records (8.7% of 235,341) with 87% precision, mainly from Git references. To fill gaps, we mined six external security databases, yielding 29,254 VFCs for 18,985 records (8.1%) at 88.4% precision, and GitHub repositories, adding 3,686 VFCs for 2,795 records (1.2%) at 73% precision. Combining these, we mapped 26,710 unique records (11.3% coverage) from 7,634 projects, with overlap between NVD and external databases, plus unique GitHub contributions. Despite success with Git references, 88.7% of records remain unmapped, highlighting the difficulty without Git links. This study offers insights for enhancing vulnerability datasets and guiding future automated security research.
- 23 May 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
Open AccessMapping NVD Records to Their Vulnerability-fixing Commits: How Hard is It?
Mapping National Vulnerability Database (NVD) records to vulnerability-fixing commits (VFCs) is crucial for vulnerability analysis but challenging due to sparse explicit links in NVD references. This study explores this mapping's feasibility through an empirical approach. Manual analysis of NVD references showed Git references enable over 86% success, while non-Git references achieve under 14%. Using these findings, we built an automated pipeline extracting 31,942 VFCs from 20,360 NVD records (8.7% of 235,341) with 87% precision, mainly from Git references. To fill gaps, we mined six external security databases, yielding 29,254 VFCs for 18,985 records (8.1%) at 88.4% precision, and GitHub repositories, adding 3,686 VFCs for 2,795 records (1.2%) at 73% precision. Combining these, we mapped 26,710 unique records (11.3% coverage) from 7,634 projects, with overlap between NVD and external databases, plus unique GitHub contributions. Despite success with Git references, 88.7% of records remain unmapped, highlighting the difficulty without Git links. This study offers insights for enhancing vulnerability datasets and guiding future automated security research.
- Open Access
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 117-126
Detecting Doubt in Reflective Learning: A Learning Analytics Study with Large and Small Language Models
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 117-126
Open AccessDetecting Doubt in Reflective Learning: A Learning Analytics Study with Large and Small Language Models
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2096-2108
Out of Distribution, Out of Luck: How Well Can LLMs Trained on Vulnerability Datasets Detect Top 25 CWE Weaknesses?
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2096-2108
Open AccessOut of Distribution, Out of Luck: How Well Can LLMs Trained on Vulnerability Datasets Detect Top 25 CWE Weaknesses?
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2161-2173
Back to the Basics: Rethinking Issue-Commit Linking with LLM-Assisted Retrieval
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2161-2173
Open AccessBack to the Basics: Rethinking Issue-Commit Linking with LLM-Assisted Retrieval
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1030-1042
Let the Trial Begin: A Mock-Court Approach to Vulnerability Detection using LLM-Based Agents
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1030-1042
Open AccessLet the Trial Begin: A Mock-Court Approach to Vulnerability Detection using LLM-Based Agents
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 76-80
PenForge: On-the-Fly Expert Agent Construction for Automated Penetration Testing
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 76-80
Open AccessPenForge: On-the-Fly Expert Agent Construction for Automated Penetration Testing
- Open Access
- 7 April 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
Revisiting Vulnerability Patch Identification on Data in the Wild
Attacks can exploit zero-day or one-day vulnerabilities that are not publicly disclosed. To detect these vulnerabilities, security researchers monitor development activities in open-source repositories to identify unreported security patches. The sheer volume of commits makes this task infeasible to accomplish manually. Consequently, security patch detectors commonly trained and evaluated on security patches linked from vulnerability reports in the National Vulnerability Database (NVD). In this study, we assess the effectiveness of these detectors when applied in-the-wild. Our results show that models trained on NVD-derived data show substantially decreased performance, with decreases in F1-score of up to 90% when tested on in-the-wild security patches, rendering them impractical for real-world use. An analysis comparing security patches identified in-the-wild and commits linked from NVD reveals that they can be easily distinguished from each other. Security patches associated with NVD have different distribution of commit messages, vulnerability types, and composition of changes. These differences suggest that NVD may be unsuitable as the sole source of data for training models to detect security patches. We find that constructing a dataset that combines security patches from NVD data with a small subset of manually identified security patches can improve model robustness.
- 7 April 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
Open AccessRevisiting Vulnerability Patch Identification on Data in the Wild
Attacks can exploit zero-day or one-day vulnerabilities that are not publicly disclosed. To detect these vulnerabilities, security researchers monitor development activities in open-source repositories to identify unreported security patches. The sheer volume of commits makes this task infeasible to accomplish manually. Consequently, security patch detectors commonly trained and evaluated on security patches linked from vulnerability reports in the National Vulnerability Database (NVD). In this study, we assess the effectiveness of these detectors when applied in-the-wild. Our results show that models trained on NVD-derived data show substantially decreased performance, with decreases in F1-score of up to 90% when tested on in-the-wild security patches, rendering them impractical for real-world use. An analysis comparing security patches identified in-the-wild and commits linked from NVD reveals that they can be easily distinguished from each other. Security patches associated with NVD have different distribution of commit messages, vulnerability types, and composition of changes. These differences suggest that NVD may be unsuitable as the sole source of data for training models to detect security patches. We find that constructing a dataset that combines security patches from NVD data with a small subset of manually identified security patches can improve model robustness.
- Open Access
- 13 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 445-451
PromptTutor: Effects of an LLM-Based Chatbot on Learning Outcomes and Motivation in Flipped Classrooms
- 13 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 445-451
Open AccessPromptTutor: Effects of an LLM-Based Chatbot on Learning Outcomes and Motivation in Flipped Classrooms
- Open Access
- 13 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 58-64
Evaluating ChatGPT to Answer Multi-Modal Exercises in Computer Science Education
- 13 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 58-64
Open AccessEvaluating ChatGPT to Answer Multi-Modal Exercises in Computer Science Education