Image de couverture de livre

Not All Invariants Are Equal: Curating Training Data to Accelerate Program Verification with SLMs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Pinto, Ido, Elboher, Yizhak Yisrael, Wu, Haoze, Narodytska, Nina, Katz, Guy
Format:	Preprint
Publié:	2026
Sujets:	Machine Learning 68Q45
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Abstraction-Based Proof Production in Formal Verification of Neural Networks
par: Elboher, Yizhak Yisrael, et autres
Publié: (2025)

Bridging Efficiency and Safety: Formal Verification of Neural Networks with Early Exits
par: Elboher, Yizhak Yisrael, et autres
Publié: (2025)

Reduced Jeffries-Matusita distance: A Novel Loss Function to Improve Generalization Performance of Deep Classification Models
par: Lashkari, Mohammad, et autres
Publié: (2024)

Analysis of multivariate symbol statistics in primitive rational models
par: Goldwurm, Massimiliano, et autres
Publié: (2026)

Bandwidth of Nondeterministic Finite Automata
par: Cho, Da-Jung, et autres
Publié: (2026)

Semidirect Product Decompositions for Periodic Regular Languages
par: Inoue, Yusuke, et autres
Publié: (2024)

Current-State Opacity in Safe Partially Observed Quantum Petri Nets: True-Concurrency Semantics and Exact Symbolic Verification
par: Ding, Sichen, et autres
Publié: (2026)

On Quantum Context-Free Grammars
par: Aruja, Merina, et autres
Publié: (2025)

The Shape of Math To Come
par: Kontorovich, Alex
Publié: (2025)

Explaining, Fast and Slow: Abstraction and Refinement of Provable Explanations
par: Bassan, Shahaf, et autres
Publié: (2025)

On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages
par: Yordzhev, Krasimir
Publié: (2026)

Product gales and Finite state dimension
par: S, Akhil
Publié: (2025)

Quantitative Convergence of Wasserstein Gradient Flows of Kernel Mean Discrepancies
par: Chizat, Lénaïc, et autres
Publié: (2026)

Languages given by Finite Automata over the Unary Alphabet
par: Czerwiński, Wojciech, et autres
Publié: (2023)

Provable Post-Training Quantization: Theoretical Analysis of OPTQ and Qronos
par: Zhang, Haoyu, et autres
Publié: (2025)

Multimodal Structure-Aware Quantum Data Processing
par: Hawashin, Hala, et autres
Publié: (2024)

Cone-Induced Observation Congruences for Vector-Valued Quantitative Languages
par: Alpay, Faruk, et autres
Publié: (2026)

Rational and algebraic series in combinatorial enumeration
par: Bousquet-Mélou, Mireille
Publié: (2008)

A hierarchy of reversible finite automata
par: Radionova, Maria, et autres
Publié: (2024)

On Computational Completeness of Semi-Conditional Matrix Grammars
par: Fernau, Henning, et autres
Publié: (2024)

Nondeterministic tree-walking automata are not closed under complementation
par: Martynova, Olga, et autres
Publié: (2024)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata
par: Petrov, Semyon, et autres
Publié: (2024)

Mostowski Index via extended register games
par: Idir, Olivier, et autres
Publié: (2024)

An $L^{\#}$ Based Algorithm for Active Learning of Minimal Separating Automata
par: Laumen, Jasper, et autres
Publié: (2026)

From regular expressions to deterministic finite automata: $2^{\frac{n}{2}+\sqrt{n}(\log n)^{Θ(1)}}$ states are necessary and sufficient
par: Martynova, Olga, et autres
Publié: (2025)

Bounded Languages Described by GF(2)-grammars
par: Makarov, Vladislav
Publié: (2019)

Linear equations and recursively enumerable sets
par: Honkala, Juha
Publié: (2024)

A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group
par: Zhu, Yinfeng
Publié: (2024)

Around Don's conjecture for binary completely reachable automata
par: Zhu, Yinfeng
Publié: (2024)

Don's conjecture for binary completely reachable automata: an approach and its limitations
par: Casas, David, et autres
Publié: (2023)

Noncommutative rational Pólya series
par: Bell, Jason, et autres
Publié: (2019)

Lemur: Integrating Large Language Models in Automated Program Verification
par: Wu, Haoze, et autres
Publié: (2023)

Runs, Squares, Palindromes, and Unbordered Factors of a Family of Binary Pattern Sequences with the All-One Pattern
par: Hendel, Russell Jay
Publié: (2025)

On Halting vs Converging in Recurrent Graph Neural Networks
par: Bollen, Jeroen, et autres
Publié: (2026)

Formal Foundations for Controlled Stochastic Activity Networks
par: Movaghar, Ali
Publié: (2025)

Formal Languages and TQFTs with Defects
par: Boateng, Luisa, et autres
Publié: (2024)

Identities of triangular Boolean matrices
par: Volkov, Mikhail V.
Publié: (2024)

A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata
par: German, Samuel
Publié: (2026)

Density of rational languages under shift invariant measures
par: Berthé, Valérie, et autres
Publié: (2025)

Monitoring Hyperproperties over Observed and Constructed Traces
par: Chalupa, Marek, et autres
Publié: (2025)