Researchers Wieger Wesselink, Kees Huizing and Huub van de Wetering submitted a paper on 12 November 2026 describing a ten-step workflow for using large language models (LLMs) to assist formal verification in Dafny. The authors report applying it to 37 algorithms from graph theory and labelled transition systems, including the Hopfcroft-Tarjan triconnectivity test.[1]

Formal verification checks a program against a specification, but developing the specification, invariants and mathematical proofs can require substantial expertise. According to the abstract, the proposed workflow combines algorithm formalization and contract development with empirical validation of invariants, proof construction, profiling and resource-driven proof optimization. Contracts describe properties that code is expected to satisfy; invariants are properties maintained through relevant stages of an algorithm.[1]

The authors say they used Anthropic's Claude Opus 5 and Opus 5.5 models alongside automated testing and verification feedback. They report retaining human oversight for correctness-critical decisions and strategic interventions, and say many machine-checked verifications took hours to a few days of interactive development. These are the authors' reported results; the abstract does not provide the individual specifications or evidence needed to assess each verification.[1]

Sources

  1. LLM-Assisted Verification in DafnyarXiv · 12 Nov 2026

Check or correct this page

Verification record

The digest below shows whether the text you are reading matches the published source. It does not show that the reporting is correct. The build computes it from this page's Markdown source and lists it in the site manifest.

027e9197284d5143529567833d21ccd9bbf586e5a5d4c5d125bf46399d68a971