mlsanityData to 14 Oct 2026

SAIL: Sound Abstract Interpreters with LLMs

arXiv 2511.13663 ↗First posted 17 Nov 2025cs.PL cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

How to construct globally sound abstract interpreters to safely approximate program behaviors remains a bottleneck in abstract interpretation. In this paper, we show the potential of using state-of-the-art LLMs to automate this tedious process. Focusing on the neural network verification area, we synthesize non-trivial sound abstract transformers across diverse abstract domains using LLMs to search within infinite space from scratch. We formalize the synthesis task as a constrained optimization problem, for which we design a novel mathematically grounded cost function that measures the degree of unsoundness of each generated candidate transformer, while enforcing hard syntactic and semantic validity constraints. Building on this formulation, we introduce SAIL, a novel unified framework that combines model generation, syntactic and semantic validation, and cost-function-based refinement to synthesize globally sound abstract transformers. Evaluation results show that SAIL not only matches the performance of manually designed transformers, but also is able to synthesize sound and high-precision transformers that do not exist in the literature for complex non-linear operators.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 23 of its 87 references that are in the map. First posted on arXiv 17 Nov 2025.

Builds on

23 of 87 references.

References · 23

  1. 2022ReAct: Synergizing Reasoning and Acting in Language Modelscited by 8,695
  2. 2021Program Synthesis with Large Language Modelscited by 3,637
  3. 2023Self-Refine: Iterative Refinement with Self-Feedbackcited by 3,442
  4. 2022Competition-Level Code Generation with AlphaCodecited by 1,462
  5. 2022CodeGen: An Open Large Language Model for Code with Multi-Turn Program Synthesiscited by 885
  6. 2015Automatic differentiation in machine learning: a surveycited by 855
  7. 2020Generative Language Modeling for Automated Theorem Provingcited by 388
  8. 2024Hallucination is Inevitable: An Innate Limitation of Large Language Modelscited by 332
  9. 2018On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Modelscited by 328
  10. 2019Algorithms for Verifying Deep Neural Networkscited by 221
  11. 2019Towards Stable and Efficient Training of Verifiably Robust Neural Networkscited by 205
  12. 2020Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifierscited by 187
11 more
  1. 2021Jigsaw: Large Language Models meet Program Synthesiscited by 103
  2. 2024Symbolic Regression with a Learned Concept Librarycited by 83
  3. 2019When Deep Learning Met Code Searchcited by 46
  4. 2024The Fifth International Verification of Neural Networks Competition (VNN-COMP 2024): Summary and Resultscited by 43
  5. 2022LinSyn: Synthesizing Tight Linear Bounds for Arbitrary Neural Network Activation Functionscited by 10
  6. 2022Safe Neurosymbolic Learning with Differentiable Symbolic Executioncited by 9
  7. 2021Demanded Abstract Interpretation (Extended Version)cited by 4
  8. 2021Verification in the Loop: Correct-by-Construction Control Learning with Reach-avoid Guaranteescited by 4
  9. 2025Automated Verification of Soundness of DNN Certifierscited by 2
  10. 2021Synthesizing Abstract Transformerscited by 1
  11. 2025A Tensor-Based Compiler and a Runtime for Neuron-Level DNN Certifier Specificationscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.