SPIN Unprocessed October 28, 2026 ai_technology research
How Stable Are LLM-Generated Proofs Under Program Refactoring? A Stress Test for Verifiable Code Generation
View original on arxiv.orgOverview
arXiv:2610.36328v1 Announce Type: new Abstract: Benchmarks for verifiable code generation usually test a proof against one fixed implementation. We ask whether the same proof remains valid after a program refactoring that preserves behavior. We introduce RefactorProof, which derives 458 Lean-certified variants from the 185 VERINA tasks that compile in our pinned environment while holding the specification and evaluated proof fixed byte-for-byte. VERINA supplies reference proofs for 46 tasks, all
SpinGraph analysis pending — check back after processing.
Ask AI about this story
Opens with the SpinGraph .md URL and structured context — one click, prompt included.
More from arXiv Artificial Intelligence
View all →- WAKMan: Workload Aware KVCache Manager
- Executable Archaeology of Programs That Model Programming: Reanimating the Heuristic Compiler (1961) and KBEmacs (1984)
- OA-RAG: Ontology-based Agentic RAG for Faithful LLM Reasoning
- Plenty of Room in the Middle: Revealing Opportunities on a GPU Cluster via Fine-Grained Monitoring
- Ontology-guided multi-agent reasoning for explainable differential diagnosis
- When Retrieval Is Not Enough: Obsolete Facts in Agent Memory
Markdown (.md) · JSON-LD schema (.json) · Machine-readable for AI & GEO