Skip to content
GitLab
Menu
Projects
Groups
Snippets
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
Why3
why3
Commits
04e1e828
Commit
04e1e828
authored
Apr 17, 2015
by
Mário Pereira
Browse files
Proof in progress (Schorr-Waite)
parent
95d1e085
Changes
3
Expand all
Hide whitespace changes
Inline
Side-by-side
examples/in_progress/schorr_waite.mlw
View file @
04e1e828
...
...
@@ -202,11 +202,17 @@ module SchorrWaite
* and something alike line 57 from Leino's paper *)
invariant { forall n : loc. L.mem n !stackNodes -> !m[n] }
(* stack has no duplicates ---> line 55 from Leino's paper *)
invariant { distinct !stackNodes }
invariant { distinct !stackNodes }
(* something like Leino's line 68; I believe this is useful to prove
* that in the pop case the left child of p is the initial one *)
invariant { forall n : loc. L.mem n !stackNodes ->
if !c[n] then !left[n] = (at !left 'Init)[n] else !right[n] = (at !right 'Init)[n] }
(* lines 80-81 from Leino's paper *)
invariant { !stackNodes <> Nil -> if !c[!p] then (at !right 'Init)[!p] = !t
else (at !left 'Init)[!p] = !t }
(* termination proved using lexicographic order over a triple *)
variant { S.cardinal !unmarked_nodes, S.cardinal !c_false_nodes, length !stackNodes }
if !t = null || !m[!t] then begin
(*assert { S.mem !p graph };*)
if !c[!p] then begin (* pop *)
let q = !t in
t := !p;
...
...
examples/in_progress/schorr_waite/why3session.xml
View file @
04e1e828
This diff is collapsed.
Click to expand it.
examples/in_progress/schorr_waite/why3shapes.gz
View file @
04e1e828
No preview for this file type
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment