MétaCan
Menu
Back to cohort
Record W7113415863

Large Language Models for Code Generation and Program Comprehension: Exploring Capabilities, Context, and Developer Adaptation

2025· article· en· W7113415863 on OpenAlexfundno aff

Bibliographic record

VenueUniversity Library (University of Saskatchewan) · 2025
Typearticle
Languageen
FieldComputer Science
TopicSoftware Engineering Research
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsProgram comprehensionDocumentationAdaptation (eye)Automatic summarizationComprehensionCode (set theory)Software developmentJava
DOInot available

Abstract

fetched live from OpenAlex

Program comprehension and code generation are central to modern software engineering, influencing tasks such as problem solving, documentation, and long-term maintenance. With the rapid advancement of Large Language Models (LLMs), understanding their capabilities across both code generation and comprehensionoriented activities has become a core research priority. This thesis examines the role of LLMs in supporting software development through three interconnected empirical studies, spanning code generation, contextual understanding, and developer-adaptive summarization. The first study evaluates the code generation, and problem-solving abilities of advanced LLMs across competitive programming platforms, including LeetCode, Codeforces, and HackerRank. Using 224 problems spanning 15 categories, we compare three conversational LLMs, ChatGPT, Gemini, and Meta AI, against human programmers. Results show that LLMs achieved a 71.43% success rate on structured LeetCode problems and performed competitively in reasoning-based tasks, demonstrating human-comparable comprehension of programming logic, control flow, and problem intent. While their performance declines on more complicated, time-constrained challenges, the findings confirm that LLMs possess foundational semantic understanding essential for higher-level comprehension tasks such as summarization and documentation generation. The second study introduces HelpCOM, a dependency-aware method-level comment generation technique designed to address the contextual limitations of existing models. Analyzing 647K Java methods from ten popular GitHub repositories, we found that dependent methods constitute 69.25% of all methods and are more change-prone than independent ones. Experimental results show that HelpCOM outperforms state-ofthe-art baselines (e.g., CodeT5+, CodeBERT, and ASAP) by 5.6%–50.4% across syntactic, semantic, and LLM-based evaluation metrics. A practitioner survey involving 156 developers further confirmed HelpCOM’s effectiveness in producing more complete and comprehensible documentation for dependent methods. The third study extends this work toward Developer-Adaptive Code Summarization, where summaries are personalized to the reader’s expertise level. Adaptive prompts were integrated into GitHub Copilot Chat, enabling real-time generation of novice- and expert-oriented summaries. Semantic similarity analysis showed strong alignment between Copilot-based and API-based outputs (69% for novice and 77% for expert summaries). Additionally, interviews with five experienced developers validated the approach’s practicality and usefulness, noting that adaptive summaries enhanced clarity, reduced cognitive effort, and improved integration into daily workflows. Collectively, these studies offer a comprehensive perspective on how LLMs can support both code generation and program comprehension, from solving complex programming tasks to generating context-aware and expertise-adaptive documentation. The results highlight the promise and current limitations of LLMs, paving the way for future research on building intelligent, context-sensitive, and human-aligned tools for software engineering.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.008
metaresearch head score (Gemma)0.071
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.008
Threshold uncertainty score0.044

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.071
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0040.008
Open science0.0010.003
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0020.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.031
GPT teacher head0.212
Teacher spread0.181 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueUniversity Library (University of Saskatchewan)Same topicSoftware Engineering ResearchFrench-language works237,207