Datasets:
phanerozoic
/
Why3

Dataset card Data Studio Files
xet
Community
fact
stringlengths
5
124
type
stringclasses
3 values
library
stringclasses
5 values
imports
listlengths
0
177
filename
stringclasses
414 values
symbolic_name
stringlengths
1
57
docstring
stringclasses
1 value
create(x: 'a) : t 'a
function
examples
[ "export", "set.Fset", "map.Map", "map.Map", "map.Const", "ref.Ref", "Graph", "set.Fset", "export", "ref.Ref", "Online_graph", "set.Fset" ]
examples/topological_sorting.mlw
create
defined_sort(m: t int) : Fset.fset vertex
function
examples
[ "export", "set.Fset", "map.Map", "map.Map", "map.Const", "ref.Ref", "Graph", "set.Fset", "export", "ref.Ref", "Online_graph", "set.Fset" ]
examples/topological_sorting.mlw
defined_sort
inv(g:t) = sort g.graph g.values.contents
predicate
examples
[ "export", "set.Fset", "map.Map", "map.Map", "map.Const", "ref.Ref", "Graph", "set.Fset", "export", "ref.Ref", "Online_graph", "set.Fset" ]
examples/topological_sorting.mlw
inv
x(i: int) : int
function
examples
[ "int.Int", "int.EuclideanDivision", "int.Iter", "seq.Seq", "seq.Distinct", "ref.Refint", "pigeon.Pigeonhole" ]
examples/tortoise_and_hare.mlw
x
le = (<),
predicate
examples
[ "int.Int", "list.List", "list.Length", "list.SortedInt", "int.Int", "list.List", "list.Length", "list.RevAppend" ]
examples/tower_of_hanoi.mlw
le
eval_expr(e:expr) : int
function
examples
[ "int.Int", "int.Int", "list.List", "list.List", "list.Append", "Expr", "StackMachine" ]
examples/toy_compiler.mlw
eval_expr
compile(e: expr) : code
function
examples
[ "int.Int", "int.Int", "list.List", "list.List", "list.Append", "Expr", "StackMachine" ]
examples/toy_compiler.mlw
compile
sizek_nonneg : forall k: cont 'a. sizek k >= 0
lemma
examples
[ "int.Int", "int.MinMax", "bintree.Tree", "bintree.Height", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "ref.Ref", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "int.Int", "int.MinMax", "int.Co...
examples/tree_height.mlw
sizek_nonneg
helper1 : forall t: tree 'a. 4 * size t >= 0
lemma
examples
[ "int.Int", "int.MinMax", "bintree.Tree", "bintree.Height", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "ref.Ref", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "int.Int", "int.MinMax", "int.Co...
examples/tree_height.mlw
helper1
sizew_nonneg : forall w: what 'a. sizew w >= 0
lemma
examples
[ "int.Int", "int.MinMax", "bintree.Tree", "bintree.Height", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "ref.Ref", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "int.Int", "int.MinMax", "int.Co...
examples/tree_height.mlw
sizew_nonneg
sizes_nonneg : forall s: stack 'a. sizes s >= 0
lemma
examples
[ "int.Int", "int.MinMax", "bintree.Tree", "bintree.Height", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "ref.Ref", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "int.Int", "int.MinMax", "int.Co...
examples/tree_height.mlw
sizes_nonneg
evalw(w: what 'a) : int
function
examples
[ "int.Int", "int.MinMax", "bintree.Tree", "bintree.Height", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "ref.Ref", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "int.Int", "int.MinMax", "int.Co...
examples/tree_height.mlw
evalw
sizek(k: cont 'a) : int
function
examples
[ "int.Int", "int.MinMax", "bintree.Tree", "bintree.Height", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "ref.Ref", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "int.Int", "int.MinMax", "int.Co...
examples/tree_height.mlw
sizek
sizew(w: what 'a) : int
function
examples
[ "int.Int", "int.MinMax", "bintree.Tree", "bintree.Height", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "ref.Ref", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "int.Int", "int.MinMax", "int.Co...
examples/tree_height.mlw
sizew
heights(s: stack 'a) : int
function
examples
[ "int.Int", "int.MinMax", "bintree.Tree", "bintree.Height", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "ref.Ref", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "int.Int", "int.MinMax", "int.Co...
examples/tree_height.mlw
heights
sizes(s: stack 'a) : int
function
examples
[ "int.Int", "int.MinMax", "bintree.Tree", "bintree.Height", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "ref.Ref", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "int.Int", "int.MinMax", "int.Co...
examples/tree_height.mlw
sizes
leaves(t: tree 'a) : int
function
examples
[ "int.Int", "int.MinMax", "bintree.Tree", "bintree.Height", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "ref.Ref", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "int.Int", "int.MinMax", "int.Co...
examples/tree_height.mlw
leaves
is_id(k: cont 'a) = match k with Id -> true | _ -> false end
predicate
examples
[ "int.Int", "int.MinMax", "bintree.Tree", "bintree.Height", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "ref.Ref", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "int.Int", "int.MinMax", "int.Co...
examples/tree_height.mlw
is_id
is_result(w: what 'a) = match w with Result _ -> true | _ -> false end
predicate
examples
[ "int.Int", "int.MinMax", "bintree.Tree", "bintree.Height", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "ref.Ref", "int.Int", "int.MinMax", "list.List", "bintree.Tree", "bintree.Size", "bintree.Height", "int.Int", "int.MinMax", "int.Co...
examples/tree_height.mlw
is_result
shuffle_nil_nil_nil : shuffle Nil Nil (Nil: list 'a)
lemma
examples
[ "export", "option.Option", "export", "export", "export", "export", "list.Nth", "GilbreathCardTrickPure", "stack.Stack" ]
examples/unraveling_a_card_trick.mlw
shuffle_nil_nil_nil
shuffle_sym : forall a b c: list 'a. shuffle a b c -> shuffle b a c
lemma
examples
[ "export", "option.Option", "export", "export", "export", "export", "list.Nth", "GilbreathCardTrickPure", "stack.Stack" ]
examples/unraveling_a_card_trick.mlw
shuffle_sym
shuffle_length : forall a b c: list 'a. shuffle a b c -> length a + length b = length c
lemma
examples
[ "export", "option.Option", "export", "export", "export", "export", "list.Nth", "GilbreathCardTrickPure", "stack.Stack" ]
examples/unraveling_a_card_trick.mlw
shuffle_length
suit_ordered(l: list int) = forall i j: int. 0 <= i < n -> 0 <= j < m -> nth (i * m + j) l = Some j
predicate
examples
[ "export", "option.Option", "export", "export", "export", "export", "list.Nth", "GilbreathCardTrickPure", "stack.Stack" ]
examples/unraveling_a_card_trick.mlw
suit_ordered
suit_sorted(l: list int) = (forall i v: int. nth i l = Some v -> 0 <= v < m) /\
predicate
examples
[ "export", "option.Option", "export", "export", "export", "export", "list.Nth", "GilbreathCardTrickPure", "stack.Stack" ]
examples/unraveling_a_card_trick.mlw
suit_sorted
Ineq1 : forall n x y:int. 0 <= n -> 0 <= x < n -> 0 <= y < n -> 0 <= x*n+y < n*n
lemma
examples
[ "int.Int", "int.Int", "export", "int.Int", "ref.Ref", "int.Int", "ref.Ref", "UnionFind_sig", "Graph_sig" ]
examples/vacid_0_build_maze.mlw
Ineq1
same_reprs(u1 u2 : uf_pure) = forall x r:int. repr u1 x r <-> repr u2 x r
predicate
examples
[ "int.Int", "int.Int", "export", "int.Int", "ref.Ref", "int.Int", "ref.Ref", "UnionFind_sig", "Graph_sig" ]
examples/vacid_0_build_maze.mlw
same_reprs
memt_color : forall l r : tree, k k' : key, v v' : value, c c' : color.
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
memt_color
lt_leaf : forall x: key. lt_tree x Leaf
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
lt_leaf
gt_leaf : forall x: key. gt_tree x Leaf
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
gt_leaf
lt_tree_node : forall x y: key, v: value, l r: tree, c: color.
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
lt_tree_node
gt_tree_node : forall x y: key, v: value, l r: tree, c: color.
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
gt_tree_node
lt_node_lt : forall x y: key, v: value, l r: tree, c: color.
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
lt_node_lt
gt_node_gt : forall x y: key, v: value, l r: tree, c: color.
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
gt_node_gt
lt_left : forall x y: key, v: value, l r: tree, c : color.
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
lt_left
lt_right : forall x y: key, v: value, l r: tree, c: color.
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
lt_right
gt_left : forall x y: key, v: value, l r: tree, c: color.
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
gt_left
gt_right : forall x y: key, v: value, l r: tree, c: color.
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
gt_right
lt_tree_not_in : forall x: key, t: tree. lt_tree x t -> forall v: value. not (memt t x v)
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
lt_tree_not_in
lt_tree_trans : forall x y: key. x < y -> forall t: tree. lt_tree x t -> lt_tree y t
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
lt_tree_trans
gt_tree_not_in : forall x: key, t: tree. gt_tree x t -> forall v: value. not (memt t x v)
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
gt_tree_not_in
gt_tree_trans : forall x y: key. y < x -> forall t: tree. gt_tree x t -> gt_tree y t
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
gt_tree_trans
bst_Leaf : bst Leaf
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
bst_Leaf
bst_left : forall k: key, v: value, l r: tree, c: color. bst (Node c l k v r) -> bst l
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
bst_left
bst_right : forall k: key, v: value, l r: tree, c: color. bst (Node c l k v r) -> bst r
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
bst_right
bst_color : forall c c': color, k: key, v: value, l r: tree.
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
bst_color
rotate_left : forall kx ky: key, vx vy: value, a b c: tree, c1 c2 c3 c4: color.
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
rotate_left
rotate_right : forall kx ky: key, vx vy: value, a b c: tree, c1 c2 c3 c4: color.
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
rotate_right
rbtree_Leaf : rbtree 0 Leaf
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
rbtree_Leaf
rbtree_Node1 : forall k:key, v:value. rbtree 0 (Node Red Leaf k v Leaf)
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
rbtree_Node1
rbtree_left : forall x: key, v: value, l r: tree, c: color.
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
rbtree_left
rbtree_right : forall x: key, v: value, l r: tree, c: color.
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
rbtree_right
rbtree_almost_rbtree : forall n: int, t: tree. rbtree n t -> almost_rbtree n t
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
rbtree_almost_rbtree
rbtree_almost_rbtree_ex : forall s: tree.
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
rbtree_almost_rbtree_ex
almost_rbtree_rbtree_black : forall x: key, v: value, l r: tree, n: int.
lemma
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
almost_rbtree_rbtree_black
default(r : rbt) : value
function
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
default
bst(t : tree) = match t with
predicate
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
bst
is_not_red(t : tree) = match t with
predicate
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
is_not_red
inv(r : rbt) = let (_, t) = r in bst t /\ exists n : int. rbtree n t
predicate
examples
[ "int.Int", "ref.Ref", "RedBlackTree" ]
examples/vacid_0_red_black_trees.mlw
inv
permutation : forall a: sparse_array 'a.
lemma
examples
[ "int.Int", "array.Array", "map.MapInjection", "SparseArray" ]
examples/vacid_0_sparse_array.mlw
permutation
length(a: sparse_array 'a) : int
function
examples
[ "int.Int", "array.Array", "map.MapInjection", "SparseArray" ]
examples/vacid_0_sparse_array.mlw
length
gcd_sub : forall a b: int. gcd a b = gcd a (b - a)
lemma
examples
[ "int.Int", "number.Gcd", "ref.Ref", "int.Int", "number.Gcd", "ref.Ref" ]
examples/verifythis_2015_parallel_gcd.mlw
gcd_sub
gcd_sub : forall a b: int. gcd a b = gcd a (b - a)
lemma
examples
[ "int.Int", "number.Gcd", "ref.Ref", "int.Int", "number.Gcd", "ref.Ref" ]
examples/verifythis_2015_parallel_gcd.mlw
gcd_sub
state_index(s: state) : int
function
examples
[ "int.Int", "number.Gcd", "ref.Ref", "int.Int", "number.Gcd", "ref.Ref" ]
examples/verifythis_2015_parallel_gcd.mlw
state_index
is_relaxed_prefix(pat a: array char) = let n = length pat in
predicate
examples
[ "int.Int", "ref.Ref", "array.Array" ]
examples/verifythis_2015_relaxed_prefix.mlw
is_relaxed_prefix
footprint(t:treel) : set loc
function
examples
[ "map.Map", "int.Int", "set.Set", "map.Map", "bintree.Tree", "bintree.Size", "Memory", "case.", "map.Map", "bintree.Tree", "ref.Ref", "Memory", "TreeShape", "of", "int.Int", "map.Map", "map.Const", "bintree.Tree", "bintree.Size", "option.Option", "ref.Ref", "Memory", "Tree...
examples/verifythis_2016_tree_traversal.mlw
footprint
next_phase(ph:phase) : phase
function
examples
[ "map.Map", "int.Int", "set.Set", "map.Map", "bintree.Tree", "bintree.Size", "Memory", "case.", "map.Map", "bintree.Tree", "ref.Ref", "Memory", "TreeShape", "of", "int.Int", "map.Map", "map.Const", "bintree.Tree", "bintree.Size", "option.Option", "ref.Ref", "Memory", "Tree...
examples/verifythis_2016_tree_traversal.mlw
next_phase
stack_size(st:stack) : int
function
examples
[ "map.Map", "int.Int", "set.Set", "map.Map", "bintree.Tree", "bintree.Size", "Memory", "case.", "map.Map", "bintree.Tree", "ref.Ref", "Memory", "TreeShape", "of", "int.Int", "map.Map", "map.Const", "bintree.Tree", "bintree.Size", "option.Option", "ref.Ref", "Memory", "Tree...
examples/verifythis_2016_tree_traversal.mlw
stack_size
unchanged(memo1 memo2:pmem) = forall k x. memo1[k][x] = memo2[k][x]
predicate
examples
[ "map.Map", "int.Int", "set.Set", "map.Map", "bintree.Tree", "bintree.Size", "Memory", "case.", "map.Map", "bintree.Tree", "ref.Ref", "Memory", "TreeShape", "of", "int.Int", "map.Map", "map.Const", "bintree.Tree", "bintree.Size", "option.Option", "ref.Ref", "Memory", "Tree...
examples/verifythis_2016_tree_traversal.mlw
unchanged
aux_pos : forall a m i. 0 <= i < length a -> a[i] <= m -> aux a.elts m i >= 0
lemma
examples
[ "map.Map", "array.Array", "array.IntArraySorted", "array.ArrayPermut", "array.ArraySwap", "int.Int", "ref.Refint", "int.Sum", "number.Parity" ]
examples/verifythis_2017_odd_even_sort_rearranging.mlw
aux_pos
array_max(a:array int) : int
function
examples
[ "map.Map", "array.Array", "array.IntArraySorted", "array.ArrayPermut", "array.ArraySwap", "int.Int", "ref.Refint", "int.Sum", "number.Parity" ]
examples/verifythis_2017_odd_even_sort_rearranging.mlw
array_max
empty(h: int) : buf 'a
function
examples
[ "export", "export", "list.Append", "list.Length", "Spec", "list.Append", "list.Length", "Spec", "list.Append", "list.Length", "queue.Queue" ]
examples/verifythis_2017_tree_buffer.mlw
empty
get(b: buf 'a) : list 'a
function
examples
[ "export", "export", "list.Append", "list.Length", "Spec", "list.Append", "list.Length", "Spec", "list.Append", "list.Length", "queue.Queue" ]
examples/verifythis_2017_tree_buffer.mlw
get
ticket(s:thread_state) : int
function
examples
[ "int.Int", "int.ComputerDivision", "import", "array.Array", "ref.Ref" ]
examples/verifythis_2018_array_based_queuing_lock_1.mlw
ticket
released(s:thread_state) = match s with
predicate
examples
[ "int.Int", "int.ComputerDivision", "import", "array.Array", "ref.Ref" ]
examples/verifythis_2018_array_based_queuing_lock_1.mlw
released
hd_push : forall l,x:tick. hd l = None \/ hd (l ++ (cons x empty)) = hd l
lemma
examples
[ "array.Array", "int.Int", "ref.Refint", "int.EuclideanDivision", "option.Option", "import", "seq.Mem", "seq.FreeMonoid", "array.NumOfEq", "queue.Queue", "array.Array" ]
examples/verifythis_2018_array_based_queuing_lock_2.mlw
hd_push
mod_diff : forall a b c:int. c > 0 -> mod a c = mod b c -> mod (a-b) c = 0
lemma
examples
[ "array.Array", "int.Int", "ref.Refint", "int.EuclideanDivision", "option.Option", "import", "seq.Mem", "seq.FreeMonoid", "array.NumOfEq", "queue.Queue", "array.Array" ]
examples/verifythis_2018_array_based_queuing_lock_2.mlw
mod_diff
last(l: seq tick) : option tick
function
examples
[ "array.Array", "int.Int", "ref.Refint", "int.EuclideanDivision", "option.Option", "import", "seq.Mem", "seq.FreeMonoid", "array.NumOfEq", "queue.Queue", "array.Array" ]
examples/verifythis_2018_array_based_queuing_lock_2.mlw
last
hd(l: seq tick) : option tick
function
examples
[ "array.Array", "int.Int", "ref.Refint", "int.EuclideanDivision", "option.Option", "import", "seq.Mem", "seq.FreeMonoid", "array.NumOfEq", "queue.Queue", "array.Array" ]
examples/verifythis_2018_array_based_queuing_lock_2.mlw
hd
lt(tick1 tick2: tick) = tick1.v < tick2.v
predicate
examples
[ "array.Array", "int.Int", "ref.Refint", "int.EuclideanDivision", "option.Option", "import", "seq.Mem", "seq.FreeMonoid", "array.NumOfEq", "queue.Queue", "array.Array" ]
examples/verifythis_2018_array_based_queuing_lock_2.mlw
lt
sorted(s: seq tick) = forall i j. 0 <= i < j < length s -> lt s[i] s[j]
predicate
examples
[ "array.Array", "int.Int", "ref.Refint", "int.EuclideanDivision", "option.Option", "import", "seq.Mem", "seq.FreeMonoid", "array.NumOfEq", "queue.Queue", "array.Array" ]
examples/verifythis_2018_array_based_queuing_lock_2.mlw
sorted
consecutive(l: seq tick) = forall i. 0 < i < length l -> l[i].v = l[i-1].v + 1
predicate
examples
[ "array.Array", "int.Int", "ref.Refint", "int.EuclideanDivision", "option.Option", "import", "seq.Mem", "seq.FreeMonoid", "array.NumOfEq", "queue.Queue", "array.Array" ]
examples/verifythis_2018_array_based_queuing_lock_2.mlw
consecutive
has_ticket(pc:pc) = match pc with
predicate
examples
[ "array.Array", "int.Int", "ref.Refint", "int.EuclideanDivision", "option.Option", "import", "seq.Mem", "seq.FreeMonoid", "array.NumOfEq", "queue.Queue", "array.Array" ]
examples/verifythis_2018_array_based_queuing_lock_2.mlw
has_ticket
has_lock(pc:pc) = match pc with
predicate
examples
[ "array.Array", "int.Int", "ref.Refint", "int.EuclideanDivision", "option.Option", "import", "seq.Mem", "seq.FreeMonoid", "array.NumOfEq", "queue.Queue", "array.Array" ]
examples/verifythis_2018_array_based_queuing_lock_2.mlw
has_lock
valid_contr : forall c i. valid c -> 0 <= i < length c -> not (tworedneighbors c i) -> c[i] = Black
lemma
examples
[ "int.Int", "set.Fset", "seq.Seq", "seq.FreeMonoid", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_1.mlw
valid_contr
colo_0 : forall c: coloring. length c = 0 ->
lemma
examples
[ "int.Int", "set.Fset", "seq.Seq", "seq.FreeMonoid", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_1.mlw
colo_0
colo_1 : forall c: coloring. length c = 1 ->
lemma
examples
[ "int.Int", "set.Fset", "seq.Seq", "seq.FreeMonoid", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_1.mlw
colo_1
colo_2 : forall c: coloring. length c = 2 ->
lemma
examples
[ "int.Int", "set.Fset", "seq.Seq", "seq.FreeMonoid", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_1.mlw
colo_2
colo_3 : forall c: coloring. length c = 3 ->
lemma
examples
[ "int.Int", "set.Fset", "seq.Seq", "seq.FreeMonoid", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_1.mlw
colo_3
addleft_fb : forall c nr. 0 <= nr -> first_black_tile (addleft nr c) = nr
lemma
examples
[ "int.Int", "set.Fset", "seq.Seq", "seq.FreeMonoid", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_1.mlw
addleft_fb
mapaddleft_fb : forall s c nr. 0 <= nr -> mem c (mapaddleft s nr) -> first_black_tile c = nr
lemma
examples
[ "int.Int", "set.Fset", "seq.Seq", "seq.FreeMonoid", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_1.mlw
mapaddleft_fb
ext : forall c1 c2: coloring. Seq.(==) c1 c2 -> c1 = c2
lemma
examples
[ "int.Int", "set.Fset", "seq.Seq", "seq.FreeMonoid", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_1.mlw
ext
app_eq : forall c1 c2 c3 c4: coloring. c1 = c2 -> c3 = c4 -> c1 ++ c3 = c2 ++ c4
lemma
examples
[ "int.Int", "set.Fset", "seq.Seq", "seq.FreeMonoid", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_1.mlw
app_eq
black(_n:int) : color
function
examples
[ "int.Int", "set.Fset", "seq.Seq", "seq.FreeMonoid", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_1.mlw
black
red(_n:int) : color
function
examples
[ "int.Int", "set.Fset", "seq.Seq", "seq.FreeMonoid", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_1.mlw
red
colorings0 : fset coloring
function
examples
[ "int.Int", "set.Fset", "seq.Seq", "seq.FreeMonoid", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_1.mlw
colorings0
colorings1 : fset coloring
function
examples
[ "int.Int", "set.Fset", "seq.Seq", "seq.FreeMonoid", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_1.mlw
colorings1
colorings2 : fset coloring
function
examples
[ "int.Int", "set.Fset", "seq.Seq", "seq.FreeMonoid", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_1.mlw
colorings2
colorings3 : fset coloring
function
examples
[ "int.Int", "set.Fset", "seq.Seq", "seq.FreeMonoid", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_1.mlw
colorings3
first_black_tile(c:coloring) : int
function
examples
[ "int.Int", "set.Fset", "seq.Seq", "seq.FreeMonoid", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_1.mlw
first_black_tile
valid(c:coloring) = forall i. 0 <= i < length c -> c[i] = Red -> tworedneighbors c i
predicate
examples
[ "int.Int", "set.Fset", "seq.Seq", "seq.FreeMonoid", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_1.mlw
valid