paper-with-me

Papers

Static Program Slicing Using Language Models With Dataflow-Aware Pretraining and Constrained Decoding

2026-04-09 · Pengfei He, Shaowei Wang, Tse-Hsun Chen, Muhammad Asaduzzaman arxiv

Static program slicing is a fundamental software engineering technique for isolating code relevant to specific variables. While recent learning-based approaches using language models (LMs) show promise in automating slice prediction, they suffer from inaccurate dependency modeling and unconstrained generation, where LMs fail to capture precise data flow relations and produce slices containing hallucinated tokens and statements. To address these challenges, we propose Sliceformer, a novel approach that reformulates static program slicing as a sequence-to-sequence task using small language models such as CodeT5+. Sliceformer introduces two key innovations that directly target the identified limitations. First, to improve dependency modeling, we design dataflow-aware pretraining objectives that leverage data flow graphs (DFG) to teach models data dependencies through dataflow-preserving statement permutation and dataflow-aware span corruption. Second, to eliminate hallucination, we develop a constrained decoding mechanism that enforces both lexical and syntactic constraints. We evaluate Sliceformer on Java and Python program slicing benchmarks, demonstrating consistent improvements over state-of-the-art baselines with up to 22% gain in ExactMatch.

📄 PDF Abstract BibTeX arXiv:2604.26961

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Reachability Across the NL/PL Boundary: A Taxonomy-Driven Dataflow Model for LLM-Integrated Applications

2026-03-30 · Zihao Xu, Xiao Cheng, Ruijie Meng, Yuekang Li arxiv

LLM API calls have become a standard programming primitive, but they create a program boundary that disrupts traditional dataflow analysis. A runtime value may be inserted into a natural-language prompt through a templat…

Recursive Function Definitions in Static Dataflow Graphs and their Implementation in TensorFlow

2024-10-26 · Kelly Kostopoulou, Angelos Charalambidis, Panos Rondogiannis

Modern machine learning systems represent their computations as dataflow graphs. The increasingly complex neural network architectures crave for more powerful yet efficient programming abstractions. In this paper we prop…

Real-time Mode-Aware Dataflow: A Dataflow Model to Specify and Analyze Mode-dependent CPSs under Relaxed Timing Constraints

2025-01-13 · Guillaume Roumage, Selma Azaiez, Cyril Faure, Stéphane Louise

Modern Cyber-Physical Systems (CPS) often exhibit both relaxed real-time constraints and a mode-dependent execution. Relaxed real-time constraints mean that only a subset of the processes of a CPS have real-time constrai…

Ingenuity

Cavs: A Vertex-centric Programming Interface for Dynamic Neural Networks

2017-12-11 · Hao Zhang, Shizhen Xu, Graham Neubig, Wei Dai 외

Recent deep learning (DL) models have moved beyond static network architectures to dynamic ones, handling data where the network structure changes every example, such as sequences of variable lengths, trees, and graphs. …

Dynamic neural networksgraph constructionManagementScheduling

Programming Patterns in Dataflow Matrix Machines and Generalized Recurrent Neural Nets

2016-06-30 · Michael Bukatin, Steve Matthews, Andrey Radul

Dataflow matrix machines arise naturally in the context of synchronous dataflow programming with linear streams. They can be viewed as a rather powerful generalization of recurrent neural networks. Similarly to recurrent…