Repository navigation
Conversation
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.
Stacked on #197. The diff starts at
4ad11bcc, which adds reconstruction for module parameters.Why this changes both elaboration and reconstruction
Veil introduces binders while expanding actions, assertions, temporal formulas, and solver queries. A generated binder can capture a user field or parameter when they share a spelling. Lean macro scopes distinguish those binders during elaboration. Proof tactics such as
expose_namescan subsequently remove those scopes, so the counterexample decoder also needs a way to identify which binder produced a solver assignment.Changes
ρcan be supplied by name. Primed transition syntax keeps its existing meaning.#updr. A module may now declare a relation namedx0. The synthesizer chooses a distinct spelling when printing an invariant for the user to paste back into the module.Verification
lake --no-cache build VeilTest Examplespassed locally (1,630 jobs).The regression tests check reconstructed values directly. Both induction modes and a symbolic trace recover
step 3 2when the second argument’s type depends on the first. The induction counterexamples also retain7for a quantified variable sharing the first argument’s name. A separate test reconstructs an SMT proof with two locals spelledxand checks its axioms.