Programming Languages and Compilers Commons^™

Artificial Intelligence And Translation: Exploring Current Applications, Limitations And Future Potential Of Language Models Through Japanese-English Translation, Loklin Elias Nord

Undergraduate Theses, Capstones, and Recitals

This thesis highlights the recent improvements and capabilities of Large Language Models (LLMs), specifically their ability to produce translations between different languages. The continued up-scaling of model sizes has led to breakthroughs in the level of their observed intelligence, allowing them to produce translations that are similar in quality to highly skilled human translators. However, to facilitate the reasoning processes that LLMs now possess, their demand for computational power and the supporting hardware and resources has increased proportionally. Considering the impacts of this technology on the environment, energy resources, and its accessibility, my research explores the possibilities of smaller, highly …

Computer Organization And Assembly Language Programming, Chenxi Wang Phd, Muhammad Rashed Phd

Mavs Open Press Open Educational Resources

Computer Organization and Assembly Language Programming is an open textbook written for CSE 2312 students at The University of Texas at Arlington and for anyone who wants to see clearly how high-level code becomes machine operations. The book takes the position that assembly is not a historical curiosity but a working tool: it is where system programming, embedded development, performance tuning, and real debugging skill begin.

Across sixteen chapters, this textbook builds from number systems and base conversion through ALU operations, status flags, and shift operations, then into ARMv7 assembly syntax, the load and store architecture, endianness, addressing modes, branch …

Larger Is Not Always Better: Exploring Small Open-Source Language Models In Logging Statement Generation, Renyi Zhong, Yichen Li, Guangba Yu, Wenwei Gu, Jinxi Kuang, Yintong Huo, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Developers use logging statements to create logs that document system behavior and aid in software maintenance. As such, high-quality logging is essential for effective maintenance; however, manual logging often leads to errors and inconsistency. Recent methods emphasize using large language models (LLMs) for automated logging statement generation, but these present privacy and resource issues, hindering their suitability for enterprise use. This paper presents the first large-scale empirical study evaluating small open-source language models (SOLMs) for automated logging statement generation. We evaluate four prominent SOLMs using various prompt strategies and parameter-efficient fine-tuning techniques, such as Low-Rank Adaptation (LoRA) and Retrieval-Augmented Generation …

The Security Of Llm-Generated Code, Christopher Brian Gonzalez Ayala

Student Theses

The rapid adoption of Large Language Models (LLMs) in software development has transformed coding practices by enabling automated code generation, completion, and optimization. Despite these advantages, concerns persist regarding the security and reliability of LLM-generated code. This study presents a comprehensive evaluation of both the functional correctness and security of code produced by three prominent LLMs as of early 2026. A total of 4,800 code snippets were generated using 100 security-focused programming prompts derived from the OWASP Top 10:2025, translated across eight natural languages and two phrasing styles (literal and natural developer-oriented prompts). To assess performance, a multi-stage experimental framework …

Llms In Compiler Construction, Raffi Khatchadourian

Open Educational Resources

These lecture slides survey the use of large language models (LLMs) in compiler construction for a graduate compiler course (CSc 81010). They situate LLMs across the compiler pipeline and examine representative work: foundation models trained on LLVM IR and assembly (Meta's LLM Compiler), LLM-driven code optimization, binary decompilation (LLM4Decompile), and LLM-assisted automated refactoring—alongside the challenges of applying probabilistic models to tasks that demand correctness. The slides are a self-contained HTML (W3C Slidy) deck with editable Pandoc Markdown source. Part of a two-session unit on advanced compiler topics; see also "Deep Learning Compilers."

Deep Learning Compilers, Raffi Khatchadourian

Open Educational Resources

These lecture slides introduce deep learning compilers for a graduate compiler-construction course (CSc 81010). Building on the classical compiler pipeline, they show how modern machine-learning systems compile tensor programs: static tensor and type analysis (illustrated by a WALA/Ariadne-based refactoring of imperative TensorFlow code to graph mode), MLIR-based end-to-end compilation with IREE, and the PyTorch 2.x stack—TorchDynamo graph capture, AOTAutograd, PrimTorch operator decomposition, and TorchInductor lowering to Triton (GPU) and C++/OpenMP (CPU). The slides are a self-contained HTML (W3C Slidy) deck with editable Pandoc Markdown source. Part of a two-session unit on advanced compiler topics; see also "LLMs in Compiler Construction."

Weavecc: Symbolically-Guided Joint Exploration Of Inputs And Schedules For Concurrency Bug Detection, William Philip Dinauer

Dartmouth College Master’s Theses

Concurrent programs introduce a class of bugs that depend jointly on both program inputs and thread schedules. Exposing these bugs requires simultaneously reasoning about which code paths are reachable and which thread interleavings are possible. At the same time, many existing tools handle the problem insufficiently. Race detectors observe only the interleavings that the OS happens to produce. Fuzzers explore inputs without controlling schedules. Tools that address both dimensions together exist, but are built on interpretation-based symbolic executors that incur considerable overhead.

We present WeaveCC, a practical concurrency testing tool for C/C++ programs that jointly explores inputs and thread schedules. …

Quantitative Bounds On Resource Usage Of Probabilistic Programs, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Dorde Zikelic

Research Collection School Of Computing and Information Systems

Cost analysis, also known as resource usage analysis, is the task of finding bounds on the total cost of a program and is a well-studied problem in static analysis. In this work, we consider two classical quantitative problems in cost analysis for probabilistic programs. The first problem is to find a bound on the expected total cost of the program. This is a natural measure for the resource usage of the program and can also be directly applied to average-case runtime analysis. The second problem asks for a tail bound, i.e. ‍given a threshold t the goal is to find …

Generation Of Elaborated, Targeted And Effective Feedback For Novice Programmers Using Llm, Hua Leong Fwa

Research Collection School Of Computing and Information Systems

Programming errors and misconceptions are pervasive in novice programmers which causes difficulty in the learning of computer programming. Large Language Models (LLMs), with their ability to comprehend and generate programming codes have shown promising results in the automatic identification of errors. This can potentially benefit student programmers by providing them with timely formative feedback at efficiencies and scale that were not attainable previously. In this study, we leveraged an LLM - OpenAI o4-mini for the generation of elaborated, targeted feedback for novice programmers across PHP and JavaScript exercises. We contend that the feedback needs to be effective and targeted other …

Using Siamese Neural Networks To Effectively Detect Trojans In Fpgas When Trojans Manipulate Encryption Operations At The Bitstream Level, Kylie Arnett

Graduate Theses and Dissertations (2019 - present)

This research investigates security vulnerabilities in Field-Programmable Gate Arrays (FPGAs) at the bitstream level, focusing on hardware trojans (HTs) that manipulate encryption operations. This study addresses two critical questions: (1) The feasibility of exploiting FPGA bitstreams to selectively bypass encryption operations when a predefined input pattern is observed (all ones), thereby exposing sensitive data, and (2) the efficacy of Siamese Neural Networks (SNNs) in detecting such trojans with high accuracy. FPGAs are vulnerable to malicious modifications during manufacturing or deployment, posing risks to data integrity and system functionality. In this work, a trojan is inserted into a Xilinx series-7 FPGA …

Maddenlite, Sergio Pena

Presentations - 2026

Problem •“What If” scenarios impossible to test accurately •Commercial games rely on arcade physics •Spreadsheets lack visual engagement

Motivation •Passion for football analytics •Desire to simulate cross-era matchups •Apply math models to real-world sports data

Solution •Python based simulation engine using historical play-by-play data •Simulates outcomes based on probability

Spinlock Game Engine, Shane Misley

Posters - 2026

Modern game engines prioritize developer convenience at the cost of performance and transparency. Large frameworks like Unity and Unreal Engine abstract away implementation details, which simplifies development but introduces computational overhead—often 40-50% of CPU and memory usage goes to engine infrastructure rather than the actual game. For developers targeting low-end hardware, older systems, or performance-critical applications, this overhead becomes prohibitive. The Spinlock Engine addresses this problem by adopting a "close-to-the-metal" philosophy, stripping away unnecessary abstraction layers to deliver raw speed and predictable behavior. Built in C++ with SDL3 and Raylib, Spinlock prioritizes memory efficiency, CPU optimization, and developer transparency—allowing you …

Maddenlite, Sergio Pena

Posters - 2026

Sports simulations often rely on opaque, proprietary algorithms (like EA's Madden NFL). MaddenLite bridges the gap between sports analytics and interactive gaming by utilizing historical NFL Play-by-Play (PBP) data to drive a transparent, mathematically accurate simulation engine. The goal was to create a lightweight, UI-driven desktop application where users can simulate cross-era matchups (e.g., 2007 Patriots vs. 2025 Chiefs), manipulate rosters, and simulate entire seasons complete with official NFL tiebreaker protocols.

Scenarioxp: A Complete Scenario-Based Testing Framework For The Exploration And Exploitation Of Autonomous Vehicle Validation Scenarios, Quentin Goss

Doctoral Dissertations and Master's Theses

Today is an age of exciting emerging technology where cutting-edge research in autonomous vehicles (AVs) reduces the active human participation in driving and extends awareness beyond human limitations of perception and reaction, improving driving safety and quality of the user experience as a result. The ever-increasing complexity of these autonomous systems poses many challenges towards the validation and verification (V\&V) of these complex systems under time and resource constraints, as the use of artificial intelligence and also the intricacy of the operating environment means that these systems are also black-box and non-deterministic. Scenario-based V\&V testing of such systems, which involves …

Stock Market Price Prediction Using Big Data Models Comparison Analysis, Vibhor Pal

Shelby Hall Graduate Research Forum Posters

The stock market consists of complex financial datasets, and achieving stock price real time prediction needs an efficient big data framework for processing. This paper compares big data distributed data processing frameworks for forecasting stock prices using Graph Neural Networks (GNNs) - Apache Flink and Apache Spark. We analyze 70 publicly traded companies’ monthly data for the last 5 years from Yahoo Finance, ranked by Price-to-Earnings (P/E). In the companies’ datasets, there may be a connection or similarity between companies, and this can lead to similar stocks’ price behavior. These interfirm relationships are maintained by GNNs models, and their output …

A New Tool For Handling Multiracial And Multi-Identity Data In Health Research, Gabriel J. Merrin

Population Health Research Brief Series

When surveys ask about race or ethnicity, a growing number of Americans select more than one category. The multiracial population now represents over 10% of the U.S. population and is the fastest growing racial group in the country. Yet researchers routinely collapse these individuals into an “other race” category for statistical analysis, rendering specific subgroups invisible. This brief introduces CATAcode, a free software tool that helps researchers systematically explore, document, and prepare check-all-that-apply demographic data for statistical modeling. In a demonstration with over 8,000 high school students, CATAcode revealed 85 distinct racial identity combinations from just eight response options. The …

A Virtual-Reality-Based Dental Simulator For Endodontics With Automated Formative Feedback, Yousef Salah Abo El Ela

Theses and Dissertations

Advancements in virtual reality (VR) and haptic technology are transforming the landscape of medical and dental education, offering new avenues for safe, immersive, and repeatable training experiences. Within dentistry, endodontics presents unique challenges for preclinical education due to anatomical complexity, limited access to extracted teeth, ethical concerns, and the shortcomings of conventional plastic models. Despite endodontics specific plastic teeth being available, they fall short of replicating the hardness of real extracted teeth, are relatively costly compared to generic plastic teeth, and are ultimately a disposable item which makes them inadequate as a sustainable long-term solution. Extracted teeth do a much …

Oer Review For Open Programming: Java I - Creating An Oer Textbook For Programming Fundamentals, Peter Arsenault

Open Educational Resources Publications

This report describes the creation and implementation of a seven‑chapter Open Educational Resource (OER) for Bentley University’s CS 180 – Programming Fundamentals course, developed from the author’s teaching notes, custom examples, and course materials from Fall 2024. The project aimed to provide current, accessible, digital‑first learning resources aligned with modern programming tools, supported by generative‑AI editing in NotebookLM and open‑source formatting tools such as pandoc and Marp. Implemented during Fall 2025, the OER received highly positive student feedback, particularly regarding its clarity, accessibility, and cost savings, and it is slated for further refinement—including updates for Java 25, expanded examples, and …

Swimming In Uncertainty: Filling Data Gaps And Providing An Educational Platform For Beach Water Quality At Tybee Island, Georgia, Lukas Roberson

College of Graduate Studies: Theses & Dissertations

@font-face {font-family:"Cambria Math"; panose-1:2 4 5 3 5 4 6 3 2 4; mso-font-charset:0; mso-generic-font-family:roman; mso-font-pitch:variable; mso-font-signature:-536870145 1107305727 0 0 415 0;}p.MsoNormal, li.MsoNormal, div.MsoNormal {mso-style-unhide:no; mso-style-qformat:yes; mso-style-parent:""; margin:0in; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman",serif; mso-fareast-font-family:"Times New Roman";}.MsoChpDefault {mso-style-type:export-only; mso-default-props:yes; mso-font-kerning:0pt; mso-ligatures:none;}div.WordSection1 {page:WordSection1;}

Swimming in beaches water contaminated with high levels of bacteria can make you sick. Current monitoring at the public beaches on Tybee Island consists of weekly monitoring and enumeration of fecal indicator bacteria that takes 24 hours for results. If the number of bacteria exceed regulatory limits, a public health advisory is issued, and affected waters are retested until …

Do Developers Read Type Information? An Eye-Tracking Study On Typescript, Samuel W. Flint, Robert Dyer, Bonita Sharif

Research & Publications

Statically-annotated types have been shown to aid developers in a number of programming tasks, and this benefit holds true even when static type checking is not used. It is hypothesized that this is because developers use type annotations as in-code documentation. In this study, we aim to provide evidence that developers use type annotations as in-code documentation. Understanding this hypothesized use will help to understand how, and in what contexts, developers use type information; additionally, it may help to design better development tools and inform educational decisions. To provide this evidence, we conduct an eye tracking study with 26 undergraduate …

A Decade Of Programming Languages: Trends In Popularity And Influence, Jonathan C. Erb

Williams Honors College, Honors Research Projects

Programming languages play a central role in open-source software ecosystems, yet their adoption, visibility, and influence shift over time as technologies, developer communities, and industry practices evolve. The study aims to investigate long-term trends in programming-language usage on GitHub from 2014 through 2024, focusing on ten major languages that represent diverse domains and ecosystems. Using repository metadata, engagement metrics such as stars and forks, and language-level code statistics measured with cloc, the analysis will examine changes in repository creation, code contribution volume, and popularity. Since popularity remains an unsettled and multidimensional concept, part of this research involves determining how it …

Llm-Driven Weekly Newsletter To Assess Open Source Software Project Github Health, Christian Novalski, Christopher Chavez, Ghalian Fayyadh, Kostadin Damevski

Undergraduate Research Posters

Open Source Software (OSS) projects increasingly depend on a diverse set of contributors, including episodic participants who contribute intermittently. Episodic contributors represent a large portion of OSS communities, yet projects often struggle to retain them, leading to decreased project health and continuity. While dashboards and real-time communication tools support continuously active contributors, they often fail to serve the unique needs of episodic participants, who may struggle to remain informed and re-engage with project activity after periods of absence. In this study, we examine the effect of a weekly, email-based newsletter intervention designed to improve awareness and engagement among episodic OSS …

Topic Modeling And Culturomic Analysis Of 30,000 Books Over 100 Years Using Gensim, Michael A. Freeman

Electronic Theses and Dissertations

This thesis explores the cultural influence of historical events on English-language fiction published between 1820 and 1929. Using a corpus of 30,256 digitized books from Project Gutenberg, Latent Dirichlet Allocation (LDA) topic modeling was applied to identify recurring themes across eleven decades. The study sought to determine whether historically significant events could be detected within fictional narratives. One clear instance emerged: Napoleon Bonaparte and the Napoleonic Wars appeared explicitly in the 1820s corpus. Beyond this, several thematic patterns were observed—such as maritime language in the 1840s, national identity in the 1880s, and youth-oriented dialogue in the early 20th century—that plausibly …

The Rise Of Parameter Specialization For Knowledge Storage In Large Language Models, Yihuai Hong, Yiran Zhao, Wei Tang, Yang Deng, Yu Rong, Wenxuan Zhang

Research Collection School Of Computing and Information Systems

Over time, a growing wave of large language models from various series has been introduced to the community. Researchers are striving to maximize the performance of language models with constrained parameter sizes. However, from a microscopic perspective, there has been limited research on how to better store knowledge in model parameters, particularly within MLPs, to enable more effective utilization of this knowledge by the model. In this work, we analyze twenty publicly available open-source large language models to investigate the relationship between their strong performance and the way knowledge is stored in their corresponding MLP parameters. Our findings reveal that …

When Less Language Is More: Language-Reasoning Disentanglement Makes Llms Better Multilingual Reasoners, Weixiang Zhao, Jiahe Guo, Yang Deng, Tongtong Wu, Wenxuan Zhang, Yulin Hu, Xingyu Sui, Yanyan Zhao, Wanxiang Che, Bing Qin, Tat-Seng Chua, Ting Liu

Research Collection School Of Computing and Information Systems

Multilingual reasoning remains a significant challenge for large language models (LLMs), with performance disproportionately favoring high-resource languages. Drawing inspiration from cognitive neuroscience, which suggests that human reasoning functions largely independently of language processing, we hypothesize that LLMs similarly encode reasoning and language as separable components that can be disentangled to enhance multilingual reasoning. To evaluate this, we perform a causal intervention by ablating language-specific representations at inference time. Experiments on 10 open-weight LLMs spanning 11 typologically diverse languages show that this language-specific ablation consistently boosts multilingual reasoning performance. Layer-wise analyses further confirm that language and reasoning representations can be effectively …

A Partition Cover Approach To Tokenization, Jia Peng Lim, Shawn Tan, Davin Choo, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

Tokenization is the process of encoding strings into tokens of a fixed vocabulary size, and is widely utilized in Natural Language Processing applications. The leading tokenization algorithm today is Byte Pair Encoding (BPE), which formulates the tokenization problem as a compression problem and tackles it by performing sequences of merges. In this work, we formulate tokenization as an optimization objective, show that it is NP-hard via a simple reduction from vertex cover, and propose a polynomial-time greedy algorithm GreedTok. Our formulation naturally relaxes to the well-studied weighted maximum coverage problem which has a simple -approximation algorithm GreedWMC. Through empirical evaluations …

Backdoorllm: A Comprehensive Benchmark For Backdoor Attacks And Defenses On Large Language Models, Yige Li, Hanxun Huang, Yunhan Zhao, Xingjun Ma, Jun Sun

Research Collection School Of Computing and Information Systems

Generative large language models (LLMs) have achieved state-of-the-art results on a wide range of tasks, yet they remain susceptible to backdoor attacks: carefully crafted triggers in the input can manipulate the model to produce adversaryspecified outputs. While prior research has predominantly focused on backdoor risks in vision and classification settings, the vulnerability of LLMs in open-ended text generation remains underexplored. To fill this gap, we introduce BackdoorLLM1 , the first comprehensive benchmark for systematically evaluating backdoor threats in text-generation LLMs. BackdoorLLM provides: (i) a unified repository of benchmarks with a standardized training and evaluation pipeline; (ii) a diverse suite of …

A Learning‑Augmented Dynamic Programming Approach For Orienteering Problem With Time Windows, Guansheng Peng, Lining Xing, Fuyan Song Ma, Aldy Gunawan, Aldy Gunawan

Research Collection School Of Computing and Information Systems

Recent years have witnessed a surge of interest in solving combinatorial optimization problems (COPs) using machine learning techniques. Motivated by this trend, we propose a learning-augmented exact approach for tackling an NP-hard COP, the Orienteering Problem with Time Windows, which aims to maximize the total score collected by visiting a subset of vertices in a graph within their time windows. Traditional exact algorithms rely heavily on domain expertise and meticulous design, making it hard to achieve further improvements. By leveraging deep learning models to learn effective relaxations of problem restrictions from data, our approach enables significant performance gains in an …

Speculative Automated Refactoring Of Imperative Deep Learning Programs To Graph Execution, Raffi Khatchadourian Ph.D., Tatiana Castro Vélez, Mehdi Bagherzadeh, Nan Jia, Anita Raja

Publications and Research

Efficiency is essential to support ever-growing datasets, especially for Deep Learning (DL) systems. DL frameworks have traditionally embraced deferred execution-style DL code---supporting symbolic, graph-based Deep Neural Network (DNN) computation. While scalable, such development is error-prone, non-intuitive, and difficult to debug. Consequently, more natural, imperative DL frameworks encouraging eager execution have emerged but at the expense of run-time performance. Though hybrid approaches aim for the "best of both worlds," using them effectively requires subtle considerations. Our key insight is that, while DL programs typically execute sequentially, hybridizing imperative DL code resembles parallelizing sequential code in traditional systems. Inspired by this, we …

Speculative Automated Refactoring Of Imperative Deep Learning Programs To Graph Execution, Raffi Khatchadourian Ph.D., Tatiana Castro Vélez, Mehdi Bagherzadeh, Nan Jia, Anita Raja

Publications and Research

Efficiency is essential to support ever-growing datasets, especially for Deep Learning (DL) systems. DL frameworks have traditionally embraced deferred execution-style DL code---supporting symbolic, graph-based Deep Neural Network (DNN) computation. While scalable, such development is error-prone, non-intuitive, and difficult to debug. Consequently, more natural, imperative DL frameworks encouraging eager execution have emerged but at the expense of run-time performance. Though hybrid approaches aim for the "best of both worlds," using them effectively requires subtle considerations. Our key insight is that, while DL programs typically execute sequentially, hybridizing imperative DL code resembles parallelizing sequential code in traditional systems. Inspired by this, we …