3 ms·
> A lot of that C is actually test code, so in reality it's about 8000 lines of Coq to prove around 150 lines of C correct. I wonder how much of that proving b
by zozbot234 7y ago
> A lot of that C is actually test code, so in reality it's about 8000 lines of Coq to prove around 150 lines of C correct.
I wonder how much of that proving burden would be subsumed by rewriting those 150 lines of C into idiomatic Rust.
Though the real problem with Coq/Isabelle/Lean/etc. proofs is not the LOC's but the brittleness of their "proof script"-based approach. Sensible ITP systems are based on a declarative approach where the "strategy" used in any given proof step is secondary, while the semantics of the step itself is stated very clearly and explicitly. This makes the proof script robust to changes in other portion of the code, so that even 8k lines of proof becomes more easily manageable.
- p0llard 7y agoThis is a common criticism of tactic based proofs, but the style that's being adopted more and more involves heavy use of proof automation which allows fairly major changes to be made without breaking the proof script.
- zozbot234 7y agoFrom this POV, proof automation just enables bigger proof steps. Of course, sometimes the inputs to the "automation" are enough to disambiguate the logical step on their own (e.g. whenever a lemma is proved in a single "auto" step, though this is far from a novel approach!) but declarative proofs are nonetheless a more consistent solution to this issue.