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
115
Issues
115
List
Boards
Labels
Service Desk
Milestones
Merge Requests
16
Merge Requests
16
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
8b0abb3a
Commit
8b0abb3a
authored
Oct 26, 2011
by
MARCHE Claude
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
cleaning
parent
fd7e592c
Changes
3
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
64 additions
and
6 deletions
+64
-6
examples/bts/bts12244.ml
examples/bts/bts12244.ml
+0
-0
examples/programs/hamming_sequence.mlw
examples/programs/hamming_sequence.mlw
+58
-0
tests/test-claude.mlw
tests/test-claude.mlw
+6
-6
No files found.
examples/bts12244.ml
→
examples/bts
/bts
12244.ml
View file @
8b0abb3a
File moved
examples/programs/hamming_sequence.mlw
0 → 100644
View file @
8b0abb3a
(*
Hamming sequence is the infinite sequence of integers
1,2,3,4,5,6,8,9,10,12,... divisible by no primes other than 2,3 and 5.
This program computes the n first numbers in this sequence
See Gries, The Science of Programming, page 243
*)
module HammingSequence
use import int.Int
use import int.MinMax
function hamming (n:int) : int
use import module array.Array
use import module ref.Ref
let hamming (n:int) : array int =
{ n >= 1 }
let t = make n 0 in
let x2 = ref 2 in let j2 = ref 0 in
let x3 = ref 3 in let j3 = ref 0 in
let x5 = ref 5 in let j5 = ref 0 in
for i=0 to n-1 do
invariant {
!x2 = 2*t[!j2] /\
!x3 = 3*t[!j3] /\
!x5 = 5*t[!j5] /\
!x2 > t[i] /\
!x3 > t[i] /\
!x5 > t[i]
}
let next = min !x2 (min !x3 !x5) in
t[i] <- next;
while !x2 <= next do j2 := !j2+1; x2 := 2*t[!j2] done;
while !x3 <= next do j3 := !j3+1; x3 := 3*t[!j3] done;
while !x5 <= next do j5 := !j5+1; x5 := 5*t[!j5] done
done;
t
{ forall k:int. 0 <= k < n -> result[k] = hamming k }
end
(*
Local Variables:
compile-command: "why3ide hamming_sequence.mlw"
End:
*)
tests/test-claude.mlw
View file @
8b0abb3a
...
...
@@ -2,17 +2,17 @@
module M
use import int.Int
use import module ref.Ref
val x : ref int
axiom
A : !x = 0
goal
A : !x = 0
axiom
B : (old !x) = 0
goal
B : (old !x) = 0
let f (n:int) : unit =
{ }
x := n
{ !x = 1 /\ (old !x) = 2 }
function f (n:int) : int = n + ! x
goal C : f(3) = 4
end
\ No newline at end of file
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