Ten-Step LLM-Assisted Workflow for Dafny Verification
The paper presents a systematic ten-step workflow for LLM-assisted formal verification of scientific algorithms in Dafny, covering formalization, contracts, invariant validation, proof construction, bottleneck profiling, and proof optimization. It combines LLM-driven development using Claude Opus 5 and Opus 5.5 with automated testing and verification feedback while retaining human oversight for correctness-critical decisions. The approach was evaluated on 37 complex algorithms from graph theory and labelled transition systems, including verification of the Hopcroft-Tarjan triconnectivity test. Many machine-checked verifications were reportedly completed within hours to a few days of interactive development.
It offers a concrete, structured workflow for using LLMs in formal verification, with evidence from complex algorithm proofs and implications for changing the verifier's role.
Comments & Questions (0)
No comments yet
Be the first to comment!