Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

SMTEncoding: prevent hash inconsistencies due to filepaths #3652

Merged
merged 4 commits into from
Jan 6, 2025
Merged

SMTEncoding: prevent hash inconsistencies due to filepaths #3652

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
549b083
SMTEncoding: prevent hash inconsistencies due to filepaths
mtzguido Jan 5, 2025
fca43c5
snap
mtzguido Jan 5, 2025
8a0a075
BinomialQueue: fix flaky proof
mtzguido Jan 5, 2025
ee0649a
examples/Makefile: prevent race due to inter-directory dep
mtzguido Jan 6, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions examples/Makefile
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,6 @@
rel.__all: dm4free.__verify
rel.__accept: dm4free.__verify
rel.__verify: dm4free.__verify
# ^ rel uses modules from dm4free, make sure to check them in proper
# order.

Expand Down
4 changes: 3 additions & 1 deletion examples/data_structures/BinomialQueue.fst
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -339,6 +339,7 @@ let smash_repr (d:pos) (t1 t2:tree) (l1 l2:ms)
t2 `repr_t` l2)
(ensures smash d t1 t2 `repr_t` (ms_append l1 l2)) = ()

#push-options "--z3rlimit 25"
let rec carry_repr (d:pos) (q:forest) (t:tree) (lq lt:ms)
: Lemma
(requires
Expand All @@ -357,6 +358,7 @@ let rec carry_repr (d:pos) (q:forest) (t:tree) (lq lt:ms)
carry_repr (d + 1) tl (smash d hd t)
(keys tl)
(ms_append (keys_of_tree hd) (keys_of_tree t))
#pop-options

#push-options "--z3rlimit 50 --fuel 1 --ifuel 1"
let rec join_repr (d:pos) (p q:forest) (c:tree)
Expand Down Expand Up @@ -645,4 +647,4 @@ let delete_max_some_repr p pl k q ql =
compact_preserves_keys r;
assert (permutation pl (ms_append (ms_singleton k) ql));
find_max_is_max 1 None p
#pop-options
#pop-options
Loading
Loading