llm-kb
← Back to research
Paper

Diversify2Verify pipeline shows implementation structure affects automated verifiability

A new paper introduces Diversify2Verify, a staged LLM-based pipeline for Why3 that generates diverse recursive and imperative array/list implementations from the same task-level semantics and tests whether implementation structure affects automated verifiability. The pipeline infers representation-specific contracts, generates and tests implementations, and attempts verification with bounded verifier-guided annotation repair. This work matters to practitioners because it suggests that choosing the right program structure can significantly ease automated verification.

0 engagement·1 source·Fri, Jul 10, 2026, 12:44 PM
The paper 'Diversifying to Verify: When Task-Equivalent Programs Differ in Verifiability' (arXiv, 2026-07-10) presents Diversify2Verify, a pipeline that uses LLMs to generate multiple functionally equivalent programs with different implementation structures (e.g., recursive vs. imperative, array vs. list) and then attempts to verify them using the Why3 verification platform. The pipeline includes steps for inferring representation-specific contracts, generating and testing implementations, and performing bounded verifier-guided annotation repair. The key finding is that implementation structure can significantly impact the ease of automated verification, even when programs satisfy the same task-level semantics. This has practical implications for developers using automated verification tools, suggesting that selecting an appropriate program structure can reduce the annotation burden.

Entities

arXiv(tool)Diversify2Verify(tool)Why3(tool)

Related

PaperThu, Jul 9, 2026, 11:01 PM

The Patchwork Problem in LLM-Generated Code

A new arXiv paper identifies a structural failure mode in LLM-generated code: individual patches compile and pass tests but break globally due to missing configuration keys, nonexistent imports, or omitted guards. Standard CI toolchains fail to catch these issues, posing a growing risk as LLM coding tools gain adoption.

0 engagement·1 source·arxiv
arXiv
ProductSun, Jul 12, 2026, 10:22 AM

Structurally enforced Clean Architecture for LLM-driven development

A framework that makes Clean Architecture's dependency rule structurally unbreakable, similar to OS kernel isolation. It ensures that code layers cannot violate inward-only dependencies at compile time, which is particularly useful for LLM-generated code where conventional review may be unreliable. Targets developers using LLMs to generate or modify codebases.

3 engagement·1 source·reddit
Tool ReleaseFri, Jul 10, 2026, 09:07 AM

OpenProver: Open-source LLM-driven theorem proving with Lean 4 verification

OpenProver is an open-source system for LLM-driven automated theorem proving (ATP) that integrates Lean 4 formal verification. It uses a Planner-Worker-Verifier architecture to decompose mathematical problems into parallel workers, with a whiteboard scratchpad and repository for intermediate findings. The system is fully open-source and offers reproducible evaluation through automatic formal verification of generated proofs.

0 engagement·1 source·arxiv
arXiv
Tool ReleaseThu, Jul 9, 2026, 09:18 AM

LVRP: Open-source local vulnerability research pipeline uses 14B code LLM for exhaustive source-to-sink analysis

A new open-source tool called LVRP (Local Vulnerability Research Pipeline) uses a 14B code-specialized LLM to exhaustively analyze source code for vulnerabilities. It combines code graph and LLM hybrid architecture to enumerate and validate all source-to-sink paths, scaling from small scripts to large codebases like the Linux Kernel and VSCode.

45 engagement·1 source·github
PaperFri, Jul 10, 2026, 02:22 PM

New pipeline recovers source code from stripped binaries using anchor-based retrieval and LLM reasoning

Researchers propose a method to recover source code from stripped binary functions by combining reverse engineering with anchor-based retrieval and LLM reasoning. The pipeline extracts anchors (strings, constants, external calls) via Ghidra, searches a source code database, and uses an LLM to re-rank candidates. This approach aims to identify exact source functions rather than generating approximate decompiled pseudocode.

0 engagement·1 source·arxiv
arXiv