Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
why3
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
121
Issues
121
List
Boards
Labels
Service Desk
Milestones
Merge Requests
14
Merge Requests
14
Operations
Operations
Incidents
Packages & Registries
Packages & Registries
Container Registry
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
Why3
why3
Commits
1eb95673
Commit
1eb95673
authored
Apr 02, 2014
by
Jean-Christophe Filliâtre
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
completed proof of mergesort_queue
parent
5e8c5073
Changes
2
Expand all
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
1357 additions
and
214 deletions
+1357
-214
examples/mergesort_queue.mlw
examples/mergesort_queue.mlw
+23
-18
examples/mergesort_queue/why3session.xml
examples/mergesort_queue/why3session.xml
+1334
-196
No files found.
examples/mergesort_queue.mlw
View file @
1eb95673
(** {1 Sorting a queue using mergesort}
Author: Jean-Christophe Filliâtre (CNRS) *)
module MergesortQueue
use import int.Int
use import list.Mem
use import list.Length
use import list.Append
use import list.Permut
...
...
@@ -9,19 +14,18 @@ module MergesortQueue
type elt
predicate le elt elt
axiom total_preorder1:
forall x y: elt. le x y \/ le y x
axiom total_preorder2:
forall x y z: elt. le x y -> le y z -> le x z
clone import list.Sorted with type t = elt, predicate le = le
clone relations.TotalPreOrder with type t = elt, predicate rel = le
clone export list.Sorted with type t = elt, predicate le = le
let merge (q1: t elt) (q2: t elt) (q: t elt)
requires { q.elts = Nil (* /\ sorted q1.elts /\ sorted q2.elts *) }
ensures { permut q.elts (old q1.elts ++ old q2.elts) }
requires { q.elts = Nil /\ sorted q1.elts /\ sorted q2.elts }
ensures { sorted q.elts }
ensures { permut q.elts (old q1.elts ++ old q2.elts) }
= 'L:
while length q1 > 0 || length q2 > 0 do
invariant { sorted q1.elts /\ sorted q2.elts /\ sorted q.elts }
invariant { forall x y: elt. mem x q.elts -> mem y q1.elts -> le x y }
invariant { forall x y: elt. mem x q.elts -> mem y q2.elts -> le x y }
invariant { permut (q.elts ++ q1.elts ++ q2.elts)
(at q1.elts 'L ++ at q2.elts 'L) }
variant { length q1 + length q2 }
...
...
@@ -38,26 +42,27 @@ module MergesortQueue
push (safe_pop q2) q
done
(*
let rec mergesort (q: t elt)
requires { }
ensures { (* sorted q.elts /\ *) permut q.elts (old q.elts) }
let rec mergesort (q: t elt) : unit
ensures { sorted q.elts /\ permut q.elts (old q.elts) }
variant { length q }
= 'L:
if length q > 1 then begin
let q1 = create () : t elt in
let q2 = create () : t elt in
while not (is_empty q) do
invariant { permut (q1.elts ++ q2.elts ++ q.elts) (at q.elts 'L) }
variant { length q.elts }
let x = pop q in push x q1;
if not (is_empty q) then let x = pop q in push x q2
invariant { length q1 = length q2 \/
length q = 0 /\ length q1 = length q2 +1 }
variant { length q }
let x = safe_pop q in push x q1;
if not (is_empty q) then let x = safe_pop q in push x q2
done;
assert { q.elts = Nil };
assert { permut (q1.elts ++ q2.elts) (at q.elts 'L) };
mergesort q1;
mergesort q2;
merge q1 q2 q
end
*)
end
else
assert { q.elts = Nil \/ exists x: elt. q.elts = Cons x Nil }
end
examples/mergesort_queue/why3session.xml
View file @
1eb95673
This diff is collapsed.
Click to expand it.
Write
Preview
Markdown
is supported
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