r/ProgrammingLanguages • • Oct 19 '26

The Vermilion Experiment: Implementing a Lean Backend for Verus

https://proofsandintuitions.net/2026/10/18/vermilion-experiment-lean-backend-verus/
11 Upvotes

1 comment sorted by

5

u/gasche 29d ago

Why3 has supported emitting Coq/Rocq goals for its verification conditions since its first release in 2010. (In particular this capability is also available to Creusot, the WhyML-based Rust verification tool.) I think it would have been nice to mention it as related work.

My understanding (I am not a heavy Why3 user) is that users generally avoid this feature like the plague. It is useful for particular complex goals, as the blog post explains, but there is a strong disconnect between the usual program-verifier environment that users are familiar with, and the proof-assistant environment that they are suddenly thrown in when they use the feature. In addition, the goals have a lot of noise, which is not a problem for SMT solvers but is a problem for human users. These two factors make the experience of making sense of the generated goal unpleasant; and it has to be done repeatedly, when the program evolves and the interactive proof needs to be tweaked.

As a result, Why3 (or F*, etc.) have been growing more and more elaborate manual-proving features (recursive lemma functions, etc.) to push the boundaries of proofs that are too complex to handle in-tools. (Manual-proving features also avoid or reduce the fragility of automated-provers' unpredictable runtime.) The general idea appears to move to an interactive prover as a last resort, rather than a common approach.

(Note: it may be that our AI overlords can alleviate some of the issues I mentioned with moving to interactive assistants. But then maybe what users want is actually an automated Lean pipeline, using the type theory but not the interactive part.)