Tien N. Nguyen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tien N. Nguyen has a total of 135 co-authors. Here are the top co-authors by number of shared publications:
- Aashish Yadavally
University of Central Florida, Orlando, USA
16 shared publications - Shaohua Wang
Central University of Finance and Economics, Beijing, China
8 shared publications - Yi Li
University of Texas at Dallas, Dallas, USA
7 shared publications - Hoan Anh Nguyen
Computer Science Department Iowa State University USA
6 shared publications - Hridya Dhulipala
University of Texas at Dallas, Dallas, USA
6 shared publications - Vu Nguyen
Faculty of Information Technology, University of Science, Ho Chi Minh, Vietnam
6 shared publications
Latest Publications
- Open Access
- 7 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 3303-3314
Post-hoc Attention Steering of Large Language Models for Robust Code Understanding under Obfuscation
- 7 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 3303-3314
Open AccessPost-hoc Attention Steering of Large Language Models for Robust Code Understanding under Obfuscation
- Open Access
- 1 October 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3 (ISSTA) , 2543-2565
On Behavioral Alignment of Model-Code and Human-Code Understandability via Behavioral Proxies
Code understandability is a critical aspect of software quality. Prior research has largely focused on this attribute from a human-centric or code-centric perspective, while it should be viewed as a relational property arising from the interaction between a reader and the code. With the increasing adoption of large language models (LLMs) in software engineering, we posit that the notion of “reader” should be generalized to encompass both humans and models. Building on this relational perspective, we extend the concept of code understandability to distinguish between human and model code understandability, aiming to investigate the behavioral alignment between the two. To this end, we use a dataset from a prior study containing human-rated judgments of understandability across diverse participant groups, and evaluate multiple open and closed-source LLMs. To operationalize such behavioral alignment, we introduce four behavioral proxies of model-code understandability (BPMU): P0, based on program comprehension-focused question answering; and P1–P3, based on program intent summarization (derived from our proposed semantic self-consistency). Our findings show that LLMs exhibit stronger behavioral alignment with general human code understandability than previously used shallow machine learning baselines. Stratified analyses further reveal that model code understandability aligns most closely with professional developers, but significantly less with other student groups. Role-conditioned prompting does not improve the alignment for the latter, suggesting that current LLMs cannot accurately mimic the perspectives of human readers with varying expertise. Finally, we demonstrate that semantic self-consistency is a reliable and extensible measure to be used as a behavioral proxy for quantifying model code understandability, with broad implications in both software engineering research and practice.
- 1 October 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3 (ISSTA) , 2543-2565
Open AccessOn Behavioral Alignment of Model-Code and Human-Code Understandability via Behavioral Proxies
Code understandability is a critical aspect of software quality. Prior research has largely focused on this attribute from a human-centric or code-centric perspective, while it should be viewed as a relational property arising from the interaction between a reader and the code. With the increasing adoption of large language models (LLMs) in software engineering, we posit that the notion of “reader” should be generalized to encompass both humans and models. Building on this relational perspective, we extend the concept of code understandability to distinguish between human and model code understandability, aiming to investigate the behavioral alignment between the two. To this end, we use a dataset from a prior study containing human-rated judgments of understandability across diverse participant groups, and evaluate multiple open and closed-source LLMs. To operationalize such behavioral alignment, we introduce four behavioral proxies of model-code understandability (BPMU): P0, based on program comprehension-focused question answering; and P1–P3, based on program intent summarization (derived from our proposed semantic self-consistency). Our findings show that LLMs exhibit stronger behavioral alignment with general human code understandability than previously used shallow machine learning baselines. Stratified analyses further reveal that model code understandability aligns most closely with professional developers, but significantly less with other student groups. Role-conditioned prompting does not improve the alignment for the latter, suggesting that current LLMs cannot accurately mimic the perspectives of human readers with varying expertise. Finally, we demonstrate that semantic self-consistency is a reliable and extensible measure to be used as a behavioral proxy for quantifying model code understandability, with broad implications in both software engineering research and practice.
- Open Access
- 1 October 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3 (ISSTA) , 4428-4449
AdaptAgent: A Multi-agent, Domain-Guided Reasoning Framework for Code Adaptation
Developers often need to adapt into their projects the code generated from LLMs or code snippets from online forums. However, integrating them into an existing repository remains challenging in a manual process. A successful integration typically requires more than copying code as a user must produce correct adapting changes at a designated location in the target repository. We formalize this as the code adaptation problem: given a snippet, functional intent, a target repository, and an adaptation location, generate a patch that adapts the snippet into the repository. We present AdaptAgent, a multi-agent, domain-guided reasoning framework for code adaptation. Rather than relying on single-shot prompting, AdaptAgent decomposes adaptation into specialized agents that communicate via typed artifacts: an Intent Summarizer extracts adaptation goals from Q&A text; a Policy Agent derives domain policies from six adaptation categories; a Domain Planner generates a self-ordered plan; a Context Miner distills sibling-method semantics from the target codebase; and a Code Adapter realizes the plan as a minimal unified diff, iteratively refined using a compiler-based Verifier. This division of labor enables robust, policy-aligned adaptations and supports adapting code snippets into a project. On a real-world dataset, AdaptAgent outperforms strong baselines in semantic correctness and produces patches that mirror developers’ actual adaptation patterns. Our ablation study shows each agent’s necessity, especially planning for code-hardening and exception-handling, and intent for logic customization.
- 1 October 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3 (ISSTA) , 4428-4449
Open AccessAdaptAgent: A Multi-agent, Domain-Guided Reasoning Framework for Code Adaptation
Developers often need to adapt into their projects the code generated from LLMs or code snippets from online forums. However, integrating them into an existing repository remains challenging in a manual process. A successful integration typically requires more than copying code as a user must produce correct adapting changes at a designated location in the target repository. We formalize this as the code adaptation problem: given a snippet, functional intent, a target repository, and an adaptation location, generate a patch that adapts the snippet into the repository. We present AdaptAgent, a multi-agent, domain-guided reasoning framework for code adaptation. Rather than relying on single-shot prompting, AdaptAgent decomposes adaptation into specialized agents that communicate via typed artifacts: an Intent Summarizer extracts adaptation goals from Q&A text; a Policy Agent derives domain policies from six adaptation categories; a Domain Planner generates a self-ordered plan; a Context Miner distills sibling-method semantics from the target codebase; and a Code Adapter realizes the plan as a minimal unified diff, iteratively refined using a compiler-based Verifier. This division of labor enables robust, policy-aligned adaptations and supports adapting code snippets into a project. On a real-world dataset, AdaptAgent outperforms strong baselines in semantic correctness and produces patches that mirror developers’ actual adaptation patterns. Our ablation study shows each agent’s necessity, especially planning for code-hardening and exception-handling, and intent for logic customization.
- Open Access
- 1 October 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10 (OOPSLA2) , 149-176
T-REX: Teaching Large Language Models to Reason with Verbalized Execution Semantics
Large language models (LLMs) have shown strong performance in static code tasks like code search, summarization, and generation, but remain limited in dynamic code reasoning, which involves inferring how programs behave during execution without actually running them. This limitation stems from LLMs being trained on static code and lacking the necessary runtime context. In this paper, we present T-REX, a novel teacher-student framework for execution prediction that addresses these limitations by grounding LLM training in actual execution and corresponding execution semantics. T-REX uses a large teacher model (Explainer) to generate fine-grained, stepwise natural language rationales explaining how program state transitions from one statement to another during actual execution. These rationales are used to train a smaller student model (Reasoner) to predict next program states, enabling accurate simulation of program behavior with lower computational cost. Our execution-grounded, rationale-driven training aligns with transition-aware execution semantics at the statement level, enhancing prediction accuracy. Our experiments show that T-REX enables Reasoner to outperform much larger GPT-4o and GPT-4o-mini models across multiple dimensions of runtime behavior prediction, while also aiding in static detection of runtime errors as well as in debugging. Finally, we discuss how T-REX can be generalized to static emulation of any dynamic analysis through such a teacher-student distillation, illustrating with the specific case of dynamic program slicing in Python.
- 1 October 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10 (OOPSLA2) , 149-176
Open AccessT-REX: Teaching Large Language Models to Reason with Verbalized Execution Semantics
Large language models (LLMs) have shown strong performance in static code tasks like code search, summarization, and generation, but remain limited in dynamic code reasoning, which involves inferring how programs behave during execution without actually running them. This limitation stems from LLMs being trained on static code and lacking the necessary runtime context. In this paper, we present T-REX, a novel teacher-student framework for execution prediction that addresses these limitations by grounding LLM training in actual execution and corresponding execution semantics. T-REX uses a large teacher model (Explainer) to generate fine-grained, stepwise natural language rationales explaining how program state transitions from one statement to another during actual execution. These rationales are used to train a smaller student model (Reasoner) to predict next program states, enabling accurate simulation of program behavior with lower computational cost. Our execution-grounded, rationale-driven training aligns with transition-aware execution semantics at the statement level, enhancing prediction accuracy. Our experiments show that T-REX enables Reasoner to outperform much larger GPT-4o and GPT-4o-mini models across multiple dimensions of runtime behavior prediction, while also aiding in static detection of runtime errors as well as in debugging. Finally, we discuss how T-REX can be generalized to static emulation of any dynamic analysis through such a teacher-student distillation, illustrating with the specific case of dynamic program slicing in Python.
- 28 July 2026
- Published by Springer Nature in Automated Software Engineering
- Vol. 33 (3) , 97
CoFiLoc: A Coarse-to-fine LLM-based framework for method-level bug localization
- 28 July 2026
- Published by Springer Nature in Automated Software Engineering
- Vol. 33 (3) , 97
CoFiLoc: A Coarse-to-fine LLM-based framework for method-level bug localization
- Open Access
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 192-196
CoRenameAgent: A Human-In-The-Loop, Multi-Agent Tool for Coordinated Rename Refactoring
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 192-196
Open AccessCoRenameAgent: A Human-In-The-Loop, Multi-Agent Tool for Coordinated Rename Refactoring
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 679-691
Large Language Model-Aided Partial Program Dependence Analysis
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 679-691
Open AccessLarge Language Model-Aided Partial Program Dependence Analysis
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1288-1300
TestWeaver: Execution-aware, Feedback-driven Regression Testing Generation with Large Language Models
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1288-1300
Open AccessTestWeaver: Execution-aware, Feedback-driven Regression Testing Generation with Large Language Models
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 349-361
Synthetic Repo-level Bug Dataset for Training Automated Program Repair Models
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 349-361
Open AccessSynthetic Repo-level Bug Dataset for Training Automated Program Repair Models
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1301-1313
RBCTest: Leveraging LLMs to Mine and Verify Oracles of API Response Bodies for RESTful API Testing
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1301-1313
Open AccessRBCTest: Leveraging LLMs to Mine and Verify Oracles of API Response Bodies for RESTful API Testing