Neural Modeling of Reasoning About Program Behaviors

Guardat en:
Dades bibliogràfiques
Publicat a:ProQuest Dissertations and Theses (2025)
Autor principal: Yadavally, Aashish
Publicat:
ProQuest Dissertations & Theses
Matèries:
Accés en línia:Citation/Abstract
Full Text - PDF
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!

MARC

LEADER 00000nab a2200000uu 4500
001 3279300678
003 UK-CbPIL
020 |a 9798265455963 
035 |a 3279300678 
045 2 |b d20250101  |b d20251231 
084 |a 66569  |2 nlm 
100 1 |a Yadavally, Aashish 
245 1 |a Neural Modeling of Reasoning About Program Behaviors 
260 |b ProQuest Dissertations & Theses  |c 2025 
513 |a Dissertation/Thesis 
520 3 |a Programming languages, much like natural languages, exhibit a high degree of repetitiveness and regularity, often referred to as the naturalness of software. This characteristic, combined with the improved capabilities of neural language models (NLMs) to statistically learn from such patterns, has led to their widespread adoption in software engineering (SE) tasks ranging from code generation to automated bug detection and program repair. While these applications of automated software engineering offer a useful proxy for assessing the downstream performance of NLMs, their ability to reason about intrinsic program properties, such as structure, semantics, and execution behaviors, remains underexplored. This dissertation addresses this gap through the lens of program analysis, using the latter’s formalisms to probe the reasoning capabilities of NLMs over intrinsic program behaviors. In general, analyzing programs entails either examining all possible behaviors based on program semantics (i.e., static) or establishing precise execution behaviors by running the entire test suite (i.e., dynamic), each with trade-offs in generalizability and scalability. As an alternative, we introduce a new paradigm of predictive program analysis, which aims to learn to analyze program behaviors from similar analyses of open-source software repositories. This approximation helps extend such analyses to partial programs, enables a static estimation of runtime behaviors, and facilitates multilingual program analysis, all at scale. Using dependence analysis as a representative setting, this dissertation investigates how NLMs can model program structure, semantics, and execution behaviors across three key dimensions: (i) the granularity of dependencies, ranging from inter-statement and variable-statement to inter-constraint dependencies; (ii) nature of reasoning, spanning both static and dynamic program behaviors; and (iii) reasoning modality, which involves reasoning in the latent space or through verbalized natural language explanations. Overall, these contributions show that predictive analysis can generalize, bridging the gap between static and dynamic analysis, while offering insights into how language models internalize reasoning about program behaviors. 
653 |a Computer engineering 
653 |a Computer science 
653 |a Information science 
773 0 |t ProQuest Dissertations and Theses  |g (2025) 
786 0 |d ProQuest  |t ProQuest Dissertations & Theses Global 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/3279300678/abstract/embedded/ZKJTFFSVAI7CB62C?source=fedsrch 
856 4 0 |3 Full Text - PDF  |u https://www.proquest.com/docview/3279300678/fulltextPDF/embedded/ZKJTFFSVAI7CB62C?source=fedsrch