Conversation
Adds --verify-with-lean: after the analysis, export the CFG and the invariants to JSON, and ask a Lean 4 development to prove them sound. The JSON is the whole interface between the two sides. Only the roots of the call graph are checked. A callee's invariants are conditional on its call sites, while the theorem Lean proves quantifies over every initial state, so checking one in isolation would ask a stronger question than Crab answered. A failure is reported as "could not verify", never as a claim about the analysis: it may only mean the proof search was too weak. Where the arithmetic ran out, the assignment it could not rule out is shown in the program's own variables. Enabled by configuring with -DLAKE_EXECUTABLE. Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Adds --verify-with-lean: after the analysis, export the CFG and the invariants to JSON, and ask a Lean 4 development to prove them sound. The JSON is the whole interface between the two sides.
Only the roots of the call graph are checked. A callee's invariants are conditional on its call sites, while the theorem Lean proves quantifies over every initial state, so checking one in isolation would ask a stronger question than Crab answered.
A failure is reported as "could not verify", never as a claim about the analysis: it may only mean the proof search was too weak. Where the arithmetic ran out, the assignment it could not rule out is shown in the program's own variables.
Enabled by configuring with -DLAKE_EXECUTABLE.