Pith. sign in

REVIEW 4 cited by

Clover: Closed-Loop Verifiable Code Generation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.17807 v4 pith:GPNSX27K submitted 2023-10-26 cs.AI cs.LGcs.SE

classification cs.AIcs.LGcs.SE
keywords codecloverconsistencydatasetformalgenerationincorrectchecker
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The use of large language models for code generation is a rapidly growing trend in software development. However, without effective methods for ensuring the correctness of generated code, this trend could lead to undesirable outcomes. In this paper, we introduce a new approach for addressing this challenge: the Clover paradigm, short for Closed-Loop Verifiable Code Generation, which uses consistency checking to provide a strong filter for incorrect code. Clover performs consistency checks among code, docstrings, and formal annotations. The checker is implemented using a novel integration of formal verification tools and large language models. We provide a theoretical analysis to support our thesis that Clover should be effective at consistency checking. We also empirically investigate its performance on a hand-designed dataset (CloverBench) featuring annotated Dafny programs at a textbook level of difficulty. Experimental results show that for this dataset: (i) LLMs are reasonably successful at automatically generating formal specifications; and (ii) our consistency checker achieves a promising acceptance rate (up to 87%) for correct instances while maintaining zero tolerance for adversarial incorrect ones (no false positives). Clover also discovered 6 incorrect programs in the existing human-written dataset MBPP-DFY-50.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. TLA+-Bench: An Execution-Grounded Benchmark and Dataset for Natural-Language to TLA Specification Generation

    cs.SE 2026-07 conditional novelty 7.0 of 10

    An exact model-checker oracle for NL-to-TLA+ still yields an elevenfold “correctness envelope” (18.7%–1.7%) once interface supply and vacuity screens are made explicit.

  2. Untrusted Authors, Trusted Answers: A Calculus of Fidelity-Graded Translations

    cs.PL 2026-07 conditional novelty 7.0 of 10 full

    Translation trust is engineered as a graph: directional, fidelity-graded pairs compose by a meet, existential answers self-certify by source replay, and the LLM-built platform has a Lean-checked calculus.

  3. An AI Approach to Verified Production Cryptographic Libraries

    cs.CR 2026-08 conditional novelty 6.0 of 10

    An AI agent, guarded by mechanical integrity gates, synthesized Verus-verified internal specifications and proofs for curve25519-dalek and chacha20 without changing executable code.

  4. GenOS: Compositional Certificates for Semantic Robustness in AI Code Generation

    cs.PL 2026-08 accept novelty 5.0 of 10

    GenOS proves that equivalence-compatible Markov kernels in AI code generation pipelines compose, so equivalent prompts yield equal probabilities for observer-relative events like verified commit.

Pith tools