Cover Image

Towards LLM-based Generation of Human-Readable Proofs in Polynomial Formal Verification

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Drechsler, Rolf
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Hardware Architecture Symbolic Computation 68W30, 68M07, 68W35 B.2.1; B.6.3; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

Design and Implementation of a Takum Arithmetic Hardware Codec
by: Hunhold, Laslo
Published: (2024)

Recent Developments in Real Quantifier Elimination and Cylindrical Algebraic Decomposition
by: England, Matthew
Published: (2024)

Jacobi Stability Analysis for Systems of ODEs Using Symbolic Computation
by: Huang, Bo, et al.
Published: (2024)

Towards Verified Polynomial Factorisation
by: Davenport, James H.
Published: (2024)

A Monadic Calculus with Episodic Flows
by: Henning, Sotirios
Published: (2024)

First steps towards Computational Polynomials in Lean
by: Davenport, James Harold
Published: (2024)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
by: Opris, Andre
Published: (2025)

Point Location in Constant Time
by: Chaganti, Sairam, et al.
Published: (2023)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

Iterated Resultants and Rational Functions in Real Quantifier Elimination
by: Davenport, James H., et al.
Published: (2023)

Misfortunes of a mathematicians' trio using Computer Algebra Systems: Can we trust?
by: Durán, Antonio J., et al.
Published: (2013)

Symbolic Model Checking in External Memory
by: Sølvsten, Steffan Christ, et al.
Published: (2025)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)

Optimizing Genetic Algorithms Using the Binomial Distribution
by: Cicirello, Vincent A.
Published: (2024)

Runtime Analyses of NSGA-III on Many-Objective Problems
by: Opris, Andre, et al.
Published: (2024)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
by: Opris, Andre, et al.
Published: (2024)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
by: Opris, Andre
Published: (2025)

Computing bases in Hermite normal form of lattices of integer relations
by: Labahn, George, et al.
Published: (2026)

Runtime Analyses of NSGA-III on Many-Objective Problems: Provable Exponential Speedup via Stochastic Population Update
by: Opris, Andre
Published: (2025)

Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
by: Doerr, Benjamin, et al.
Published: (2025)

Integer multiplication is at least as hard as matrix transposition
by: Harvey, David, et al.
Published: (2025)

An Optimized Path Planning of Manipulator Using Spline Curves and Real Quantifier Elimination Based on Comprehensive Gröbner Systems
by: Shirato, Yusuke, et al.
Published: (2024)

Proof-Carrying Verification for ReLU Networks via Rational Certificates
by: Gokavarapu, Chandrasekhar
Published: (2025)

Architecture-Induced Recoverability Bias in Differentiable Symbolic Regression
by: Gupta, Chakshu, et al.
Published: (2026)

FePySR: A Neural Feature Extraction Framework for Efficient and Scalable Symbolic Regression
by: Yu, Zhiming, et al.
Published: (2026)

Parametric "Non-nested" Discriminants for Multiplicities of Univariate Polynomials
by: Hong, Hoon, et al.
Published: (2023)

pETNNs: Partial Evolutionary Tensor Neural Networks for Solving Time-dependent Partial Differential Equations
by: Kao, Tunan, et al.
Published: (2024)

Open Source Evolutionary Computation with Chips-n-Salsa
by: Cicirello, Vincent A.
Published: (2024)

Enhanced CAD-Based Quantifier Elimination With Multiple Equational Constraints
by: Davenport, James H., et al.
Published: (2026)

O-Forge: An LLM + Computer Algebra Framework for Asymptotic Analysis
by: Khaitan, Ayush, et al.
Published: (2025)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

Efficient Binary Decision Diagram Manipulation in External Memory
by: Sølvsten, Steffan Christ, et al.
Published: (2021)

Certifying solutions of degenerate semidefinite programs
by: Kolmogorov, Vladimir, et al.
Published: (2024)

Provability in BI's Sequent Calculus is Decidable
by: Gheorghiu, Alexander, et al.
Published: (2021)

Extending Exact Integrality Gap Computations for the Metric TSP
by: Cook, William, et al.
Published: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
by: Heimann, Sophia, et al.
Published: (2026)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
by: Zhong, Xianghui
Published: (2019)

Exascale Multi-Task Graph Foundation Models for Imbalanced, Multi-Fidelity Atomistic Data
by: Pasini, Massimiliano Lupo, et al.
Published: (2026)

Finding Complex Patterns in Trajectory Data via Geometric Set Cover
by: Conradi, Jacobus, et al.
Published: (2023)