Astana time
AI QAZAQSTANKZ · AIBeta

Smart portal about artificial intelligence and high technology in Kazakhstan

Research1 min read

From the original source:

arXiv — cs.AI

Read full article at arXiv — cs.AI

How Stable Are LLM-Generated Proofs Under Program Refactoring? A Stress Test for Verifiable Code Generation

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…

arXiv — cs.AIBy: Aravind Mandiga, Guoming LiOctober 28, 2026 (12 hours ago)
Available in 1 languages

AI Summary & Key Takeaways

  • 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…
Research
KZ·AI DD53
Инсайт дня

How Stable Are LLM-Generated Proofs Under Program Refactoring? A Stress Test for Verifiable Code Generation

Share:

Related stories

Claude for Legal now verifies sources automatically, then hands the file to a lawyer

Anthropic is adding pre-built templates to Claude for Legal. These interactive overviews and tables simplify setup for legal teams and speed up routine work like contract reviews, while more than 60 integrations let firms connect their own databases directly. The article Claude…

The Decoder

Nvidia's open Nemotron 3.5 Transcribe combines transcription, translation, and speaker recognition

Nvidia has released Nemotron 3.5 Transcribe, an open speech recognition model that handles transcription, speaker recognition, and translation and takes its instructions as text prompts. It leads several benchmarks and uses only a sixth of the active parameters of its strongest…

The Decoder

Back to list