cs.PLMar 25, 2026

Transformers for Program Termination

Authors: Yoav Alon, Cristina David

Organizations: University of Bristol UK

Abstract

Determining whether a program terminates is a core challenge in program analysis with direct implications for correctness, verification, and security. We investigate whether transformer architectures can recognise termination patterns directly from source code and how their strengths can be amplified through ensembles. To overcome the extreme scarcity of non-terminating examples, we design an ensemble framework of compact transformer encoders, systematically trained with a suite of imbalance-aware loss functions and class-aware sampling techniques. By combining models trained with distinct loss functions, our ensembles achieve substantially stronger performance than any single transformer, outperforming both powerful off-the-shelf LLMs and graph-based methods. Finally, we introduce an attribution pipeline that produces syntax-aware explanations for the termination estimation.

Figures & tables

Explore similar work

CardsList
  1. LLMs versus the Halting Problem: Characterizing Program Termination Reasoning

    Jan 26, 2026Oren Sultan, Jordi Armengol-Estape, Pascal Kesseli +4LLM EvaluationStatic Code Analysis