Pith. sign in

REVIEW 4 cited by

dafny-annotator: AI-Assisted Verification of Dafny Programs

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 2411.15143 v1 pith:YL4SGOD5 submitted 2024-11-05 cs.SE cs.AIcs.PL

classification cs.SEcs.AIcs.PL
keywords dafnyprogramslarge-scalereducetrainingadoptionannotationsassistants
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Formal verification has the potential to drastically reduce software bugs, but its high additional cost has hindered large-scale adoption. While Dafny presents a promise to significantly reduce the effort to write verified programs, users are often required to provide logical annotations to aid the verifier. Here, we explore using a combination of Large Language Models and search to build dafny-annotator: a tool that adds logical annotations to a Dafny method until the verifier can prove it correct. On a test set from the DafnyBench collection of programs, greedy search guided by LLaMa 3.1 8B successfully annotates only 15.7% of the methods. Since this data-driven approach is hindered by the lack of large-scale training data, we propose a method for open-ended synthesis of new Dafny programs in a flexible pipeline where LLMs formulate high-level ideas, implement them, and incrementally propose changes to existing programs, which Dafny validates. This gives us a synthetic dataset, DafnySynth, which we use to augment DafnyBench for training. Fine-tuning on both datasets boosts LLaMa 8B's success rate to 50.6% -- significantly better than the base model, or training on either dataset alone. Our results suggest a path towards capable AI assistants for languages that don't yet have large-scale human-generated examples. In turn, such assistants might reduce friction for users and ultimately drive adoption.

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. Partial Contracts Suffice: Sound, LLM-Inferred Regression Verification

    cs.SE 2026-07 conditional novelty 7.0 of 10

    Caller-sufficient partial contracts, LLM-inferred and verifier-enforced, soundly prove safety-preserving regression equivalence without full behavioral specs.

  2. Diversifying to Verify: When Task-Equivalent Programs Differ in Verifiability

    cs.SE 2026-07 conditional novelty 6.0 of 10

    Diverse recursive and imperative array/list implementations of the same task, paired with frozen representation-specific contracts and bounded Why3 repair, raise task-level verification to 67.1% versus lower rates for...

  3. Re:Form -- Reducing Human Annotations in Scalable Formal Software Verification with RL in LLMs: A Preliminary Study on Dafny

    cs.CL 2025-07 conditional novelty 6.0 of 10

    A minimal-prior pipeline with automated data curation and verifier-driven RL lets small LLMs generate verifiable Dafny specifications and beat larger proprietary models on a synthetic compositional benchmark.

  4. Can Large Language Models Help Students Prove Software Correctness? An Experimental Study with Dafny

    cs.SE 2025-06 conditional novelty 6.0 of 10

    Students solve Dafny verification exercises significantly better with ChatGPT, but the benefit depends on prompt quality and including full program context.

Pith tools