Skip to content

Graph Neural Networks for Program Abstraction and Optimization

Aug 2026 · Zenodo (CERN European Organization for Nuclear Research)

Abstract

This paper explores the application of Graph Neural Networks (GNNs) to the problem of program abstraction and optimization. Traditional approaches to program abstraction often rely on manually crafted rules or limited pattern matching, which can be brittle and difficult to scale. This work proposes a novel framework that leverages the power of GNNs to learn a high-level, abstract representation of program code from its underlying graph structure. The learned representations are then utilized to perform optimizations such as variable renaming, code simplification, and potentially, the generation of equivalent, more efficient code. We demonstrate the feasibility and potential benefits of this approach, highlighting its ability to capture complex relationships within code and offer a more robust and scalable solution compared to rule-based methods. The core claim is to utilize GNNs to learn program code's abstract representation and optimize the code for improved efficiency and maintainability. The core mechanism involves representing code as a graph structure and applying GNNs for both abstraction and optimization. This approach overcomes the limitations of traditional methods by incorporating deep learning capabilities for a more nuanced understanding of program semantics. ---

View source

Similar papers

Locality-Preserving Graph Laplacian Manifold Learning Based Model Predictive Control for Three-Phase Inverters

This article presents a model predictive control (MPC) strategy for three-phase inverters based on locality preserving projections (LPPs). Unlike conventional machine learning–based MPC approaches that rely on predefined or high-dimensional input features, the proposed LPP-MPC automatically extracts compact, informative representations by preserving the data’s intrinsic geometric structure. This dimensionality reduction enables fast linear control-law evaluation with computational complexity O(1), making the controller well-suited for real-time implementation. Experimental results demonstrate that the LPP-MPC achieves lower total harmonic distortion (THD) and reduced tracking error compared to quadratic-programming MPC under both linear and nonlinear load conditions, and the proposed controller maintains consistently lower THD throughout load transients than other methods such as two-degree-of-freedom MPC. Compared to existing model-free MPC and deep learning neural network, the LPP-MPC has the lowest THD and root mean square error with the least computational time owing to its efficient linear structure and strong generalization capability.

Jianwu Zeng, Lizheng Cheng, V. Winstead et al. · 1 citation

Related blog posts