file_name stringlengths 5 52 | name stringlengths 4 95 | original_source_type stringlengths 0 23k | source_type stringlengths 9 23k | source_definition stringlengths 9 57.9k | source dict | source_range dict | file_context stringlengths 0 721k | dependencies dict | opens_and_abbrevs listlengths 2 94 | vconfig dict | interleaved bool 1
class | verbose_type stringlengths 1 7.42k | effect stringclasses 118
values | effect_flags listlengths 0 2 | mutual_with listlengths 0 11 | ideal_premises listlengths 0 236 | proof_features listlengths 0 1 | is_simple_lemma bool 2
classes | is_div bool 2
classes | is_proof bool 2
classes | is_simply_typed bool 2
classes | is_type bool 2
classes | partial_definition stringlengths 5 3.99k | completed_definiton stringlengths 1 1.63M | isa_cross_project_example bool 1
class |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
DoublyLinkedListIface.fst | DoublyLinkedListIface.node_val | val node_val (n:node 'a) :
HST.StackInline 'a
(requires (fun h0 -> node_valid h0 n))
(ensures (fun h0 v h1 -> h0 == h1 /\ v == g_node_val h0 n)) | val node_val (n:node 'a) :
HST.StackInline 'a
(requires (fun h0 -> node_valid h0 n))
(ensures (fun h0 v h1 -> h0 == h1 /\ v == g_node_val h0 n)) | let node_val n =
(!*n).DLL.p | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 13,
"end_line": 73,
"start_col": 0,
"start_line": 72
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "D... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: DoublyLinkedListIface.node 'a -> FStar.HyperStack.ST.StackInline 'a | FStar.HyperStack.ST.StackInline | [] | [] | [
"DoublyLinkedListIface.node",
"DoublyLinkedList.__proj__Mknode__item__p",
"DoublyLinkedList.node",
"LowStar.BufferOps.op_Bang_Star",
"LowStar.Buffer.trivial_preorder"
] | [] | false | true | false | false | false | let node_val n =
| (!*n).DLL.p | false |
Steel.HigherReference.fst | Steel.HigherReference.share_atomic_raw | val share_atomic_raw (#a #uses: _) (#p: perm) (r: ref a {perm_ok p}) (v0: erased a)
: SteelGhostT unit
uses
(pts_to_raw r p v0)
(fun _ -> (pts_to_raw r (half_perm p) v0) `star` (pts_to_raw r (half_perm p) v0)) | val share_atomic_raw (#a #uses: _) (#p: perm) (r: ref a {perm_ok p}) (v0: erased a)
: SteelGhostT unit
uses
(pts_to_raw r p v0)
(fun _ -> (pts_to_raw r (half_perm p) v0) `star` (pts_to_raw r (half_perm p) v0)) | let share_atomic_raw #a #uses (#p:perm) (r:ref a{perm_ok p}) (v0:erased a)
: SteelGhostT unit uses
(pts_to_raw r p v0)
(fun _ -> pts_to_raw r (half_perm p) v0 `star` pts_to_raw r (half_perm p) v0)
= share_atomic_raw_gen r v0 (half_perm p) (half_perm p) | {
"file_name": "lib/steel/Steel.HigherReference.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 55,
"end_line": 247,
"start_col": 0,
"start_line": 243
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.PCMReference.fsti.checked",
"Steel.PCMFrac.fst.checked",
"Steel.Memory.fsti.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Pervasives.Native.fst.checked"... | [
{
"abbrev": true,
"full_module": "Steel.Memory",
"short_module": "Mem"
},
{
"abbrev": true,
"full_module": "Steel.PCMReference",
"short_module": "RP"
},
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: Steel.HigherReference.ref a {Steel.HigherReference.perm_ok p} -> v0: FStar.Ghost.erased a
-> Steel.Effect.Atomic.SteelGhostT Prims.unit | Steel.Effect.Atomic.SteelGhostT | [] | [] | [
"Steel.Memory.inames",
"Steel.FractionalPermission.perm",
"Steel.HigherReference.ref",
"Steel.HigherReference.perm_ok",
"FStar.Ghost.erased",
"Steel.HigherReference.share_atomic_raw_gen",
"Steel.FractionalPermission.half_perm",
"Prims.unit",
"Steel.HigherReference.pts_to_raw",
"Steel.Effect.Common... | [] | false | true | false | false | false | let share_atomic_raw #a #uses (#p: perm) (r: ref a {perm_ok p}) (v0: erased a)
: SteelGhostT unit
uses
(pts_to_raw r p v0)
(fun _ -> (pts_to_raw r (half_perm p) v0) `star` (pts_to_raw r (half_perm p) v0)) =
| share_atomic_raw_gen r v0 (half_perm p) (half_perm p) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface.dll_new | val dll_new (u:unit) :
HST.StackInline (dll 'a)
(requires (fun h0 -> True))
(ensures (fun h0 d h1 ->
B.modifies B.loc_none h0 h1 /\
B.fresh_loc (fp_dll h1 d) h0 h1 /\
dll_valid h1 d /\
as_list h1 d == [])) | val dll_new (u:unit) :
HST.StackInline (dll 'a)
(requires (fun h0 -> True))
(ensures (fun h0 d h1 ->
B.modifies B.loc_none h0 h1 /\
B.fresh_loc (fp_dll h1 d) h0 h1 /\
dll_valid h1 d /\
as_list h1 d == [])) | let dll_new () =
B.alloca DLL.empty_list 1ul | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 112,
"start_col": 0,
"start_line": 111
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "D... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | u137: Prims.unit -> FStar.HyperStack.ST.StackInline (DoublyLinkedListIface.dll 'a) | FStar.HyperStack.ST.StackInline | [] | [] | [
"Prims.unit",
"LowStar.Buffer.alloca",
"DoublyLinkedList.dll",
"DoublyLinkedList.empty_list",
"FStar.UInt32.__uint_to_t",
"LowStar.Monotonic.Buffer.mbuffer",
"LowStar.Buffer.trivial_preorder",
"Prims.l_and",
"Prims.eq2",
"Prims.nat",
"LowStar.Monotonic.Buffer.length",
"FStar.UInt32.v",
"Prim... | [] | false | true | false | false | false | let dll_new () =
| B.alloca DLL.empty_list 1ul | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface.node_update | val node_update (n:node 'a) (v:'a) :
HST.StackInline (unit)
(requires (fun h0 -> node_valid h0 n))
(ensures (fun h0 () h1 ->
B.modifies (fp_node n) h0 h1 /\
node_valid h1 n /\
v == g_node_val h1 n /\
unchanged_node_connections h0 h1 n)) | val node_update (n:node 'a) (v:'a) :
HST.StackInline (unit)
(requires (fun h0 -> node_valid h0 n))
(ensures (fun h0 () h1 ->
B.modifies (fp_node n) h0 h1 /\
node_valid h1 n /\
v == g_node_val h1 n /\
unchanged_node_connections h0 h1 n)) | let node_update n v =
n *= { !*n with DLL.p = v } | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 89,
"start_col": 0,
"start_line": 88
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "D... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: DoublyLinkedListIface.node 'a -> v: 'a -> FStar.HyperStack.ST.StackInline Prims.unit | FStar.HyperStack.ST.StackInline | [] | [] | [
"DoublyLinkedListIface.node",
"LowStar.BufferOps.op_Star_Equals",
"DoublyLinkedList.node",
"LowStar.Buffer.trivial_preorder",
"Prims.unit",
"DoublyLinkedList.Mknode",
"DoublyLinkedList.__proj__Mknode__item__flink",
"DoublyLinkedList.__proj__Mknode__item__blink",
"LowStar.BufferOps.op_Bang_Star"
] | [] | false | true | false | false | false | let node_update n v =
| n *= { !*n with DLL.p = v } | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface.lemma_node_in_valid_dll_is_valid | val lemma_node_in_valid_dll_is_valid (h:HS.mem) (d:dll 'a) (n:node 'a) :
Lemma
(requires (dll_valid h d /\ n `L.memP` as_list h d))
(ensures (node_valid h n)) | val lemma_node_in_valid_dll_is_valid (h:HS.mem) (d:dll 'a) (n:node 'a) :
Lemma
(requires (dll_valid h d /\ n `L.memP` as_list h d))
(ensures (node_valid h n)) | let lemma_node_in_valid_dll_is_valid h d n =
let pos = L.index_of (as_list h d) n in
DLL.extract_nodelist_contained h (as_list h d) pos | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 134,
"start_col": 0,
"start_line": 132
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h: FStar.Monotonic.HyperStack.mem ->
d: DoublyLinkedListIface.dll 'a ->
n: DoublyLinkedListIface.node 'a
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedListIface.dll_valid h d /\
FStar.List.Tot.Base.memP n (DoublyLinkedListIface.as_list h d))
(ensures DoublyLinkedListIface.no... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedListIface.dll",
"DoublyLinkedListIface.node",
"DoublyLinkedList.extract_nodelist_contained",
"DoublyLinkedListIface.as_list",
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.List.Tot.Base.length",
"Prims.eq2",
"FStar.List.Tot.... | [] | true | false | true | false | false | let lemma_node_in_valid_dll_is_valid h d n =
| let pos = L.index_of (as_list h d) n in
DLL.extract_nodelist_contained h (as_list h d) pos | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface.dll_tail | val dll_tail (d:dll 'a) :
HST.StackInline (node 'a)
(requires (fun h0 -> dll_valid h0 d /\ L.length (as_list h0 d) > 0))
(ensures (fun h0 n h1 ->
h0 == h1 /\
dll_valid h1 d /\
node_valid h1 n /\
as_list h0 d == as_list h1 d /\
n == snd (L.unsnoc (as_list h0 d)))) | val dll_tail (d:dll 'a) :
HST.StackInline (node 'a)
(requires (fun h0 -> dll_valid h0 d /\ L.length (as_list h0 d) > 0))
(ensures (fun h0 n h1 ->
h0 == h1 /\
dll_valid h1 d /\
node_valid h1 n /\
as_list h0 d == as_list h1 d /\
n == snd (L.unsnoc (as_list h0 d)))) | let dll_tail d =
let h0 = HST.get () in
L.lemma_unsnoc_is_last (as_list h0 d);
(!*d).DLL.ltail | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 123,
"start_col": 0,
"start_line": 120
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "D... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | d: DoublyLinkedListIface.dll 'a -> FStar.HyperStack.ST.StackInline (DoublyLinkedListIface.node 'a) | FStar.HyperStack.ST.StackInline | [] | [] | [
"DoublyLinkedListIface.dll",
"DoublyLinkedList.__proj__Mkdll__item__ltail",
"DoublyLinkedListIface.node",
"DoublyLinkedList.dll",
"LowStar.BufferOps.op_Bang_Star",
"LowStar.Buffer.trivial_preorder",
"Prims.unit",
"FStar.List.Tot.Properties.lemma_unsnoc_is_last",
"DoublyLinkedListIface.as_list",
"F... | [] | false | true | false | false | false | let dll_tail d =
| let h0 = HST.get () in
L.lemma_unsnoc_is_last (as_list h0 d);
(!*d).DLL.ltail | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface.dll_head | val dll_head (d:dll 'a) :
HST.StackInline (node 'a)
(requires (fun h0 -> dll_valid h0 d /\ L.length (as_list h0 d) > 0))
(ensures (fun h0 n h1 ->
B.modifies B.loc_none h0 h1 /\
dll_valid h1 d /\
node_valid h1 n /\
as_list h0 d == as_list h1 d /\
n == L.hd (as_list ... | val dll_head (d:dll 'a) :
HST.StackInline (node 'a)
(requires (fun h0 -> dll_valid h0 d /\ L.length (as_list h0 d) > 0))
(ensures (fun h0 n h1 ->
B.modifies B.loc_none h0 h1 /\
dll_valid h1 d /\
node_valid h1 n /\
as_list h0 d == as_list h1 d /\
n == L.hd (as_list ... | let dll_head d =
(!*d).DLL.lhead | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 118,
"start_col": 0,
"start_line": 117
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "D... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | d: DoublyLinkedListIface.dll 'a -> FStar.HyperStack.ST.StackInline (DoublyLinkedListIface.node 'a) | FStar.HyperStack.ST.StackInline | [] | [] | [
"DoublyLinkedListIface.dll",
"DoublyLinkedList.__proj__Mkdll__item__lhead",
"DoublyLinkedListIface.node",
"DoublyLinkedList.dll",
"LowStar.BufferOps.op_Bang_Star",
"LowStar.Buffer.trivial_preorder"
] | [] | false | true | false | false | false | let dll_head d =
| (!*d).DLL.lhead | false |
Steel.HigherReference.fst | Steel.HigherReference.share | val share (#a:Type) (#uses:_) (#p:perm) (#v:erased a) (r:ref a)
: SteelGhostT unit uses
(pts_to r p v)
(fun _ -> pts_to r (half_perm p) v `star` pts_to r (half_perm p) v) | val share (#a:Type) (#uses:_) (#p:perm) (#v:erased a) (r:ref a)
: SteelGhostT unit uses
(pts_to r p v)
(fun _ -> pts_to r (half_perm p) v `star` pts_to r (half_perm p) v) | let share (#a:Type) #uses (#p:perm) (#v:erased a) (r:ref a)
: SteelGhostT unit uses
(pts_to r p v)
(fun _ -> pts_to r (half_perm p) v `star` pts_to r (half_perm p) v)
= share_gen r (half_perm p) (half_perm p) | {
"file_name": "lib/steel/Steel.HigherReference.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 41,
"end_line": 270,
"start_col": 0,
"start_line": 266
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.PCMReference.fsti.checked",
"Steel.PCMFrac.fst.checked",
"Steel.Memory.fsti.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Pervasives.Native.fst.checked"... | [
{
"abbrev": true,
"full_module": "Steel.Memory",
"short_module": "Mem"
},
{
"abbrev": true,
"full_module": "Steel.PCMReference",
"short_module": "RP"
},
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: Steel.HigherReference.ref a -> Steel.Effect.Atomic.SteelGhostT Prims.unit | Steel.Effect.Atomic.SteelGhostT | [] | [] | [
"Steel.Memory.inames",
"Steel.FractionalPermission.perm",
"FStar.Ghost.erased",
"Steel.HigherReference.ref",
"Steel.HigherReference.share_gen",
"Steel.FractionalPermission.half_perm",
"Prims.unit",
"Steel.HigherReference.pts_to",
"FStar.Ghost.reveal",
"Steel.Effect.Common.star",
"Steel.Effect.Co... | [] | false | true | false | false | false | let share (#a: Type) #uses (#p: perm) (#v: erased a) (r: ref a)
: SteelGhostT unit
uses
(pts_to r p v)
(fun _ -> (pts_to r (half_perm p) v) `star` (pts_to r (half_perm p) v)) =
| share_gen r (half_perm p) (half_perm p) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface.is_empty | val is_empty (d:dll 'a) :
HST.StackInline (bool)
(requires (fun h0 -> dll_valid h0 d))
(ensures (fun h0 y h1 ->
(h0 == h1) /\
(y <==> as_list h0 d == []))) | val is_empty (d:dll 'a) :
HST.StackInline (bool)
(requires (fun h0 -> dll_valid h0 d))
(ensures (fun h0 y h1 ->
(h0 == h1) /\
(y <==> as_list h0 d == []))) | let is_empty d =
B.is_null (!*d).DLL.lhead | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 115,
"start_col": 0,
"start_line": 114
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "D... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | d: DoublyLinkedListIface.dll 'a -> FStar.HyperStack.ST.StackInline Prims.bool | FStar.HyperStack.ST.StackInline | [] | [] | [
"DoublyLinkedListIface.dll",
"LowStar.Monotonic.Buffer.is_null",
"DoublyLinkedList.node",
"LowStar.Buffer.trivial_preorder",
"Prims.bool",
"LowStar.Monotonic.Buffer.mbuffer",
"DoublyLinkedList.__proj__Mkdll__item__lhead",
"DoublyLinkedList.dll",
"LowStar.BufferOps.op_Bang_Star"
] | [] | false | true | false | false | false | let is_empty d =
| B.is_null (!*d).DLL.lhead | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._pred_nl_disjoint | val _pred_nl_disjoint : h: FStar.Monotonic.HyperStack.mem -> ns: Prims.list (DoublyLinkedListIface.node 'a) -> Type0 | let rec _pred_nl_disjoint (h:HS.mem) (ns:list (node 'a)) =
DLL.nodelist_fp0 ns `B.loc_disjoint` B.loc_region_only false (HS.get_tip h) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 77,
"end_line": 265,
"start_col": 0,
"start_line": 264
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | h: FStar.Monotonic.HyperStack.mem -> ns: Prims.list (DoublyLinkedListIface.node 'a) -> Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"Prims.list",
"DoublyLinkedListIface.node",
"LowStar.Monotonic.Buffer.loc_disjoint",
"DoublyLinkedList.nodelist_fp0",
"LowStar.Monotonic.Buffer.loc_region_only",
"FStar.Monotonic.HyperStack.get_tip"
] | [
"recursion"
] | false | false | false | true | true | let rec _pred_nl_disjoint (h: HS.mem) (ns: list (node 'a)) =
| (DLL.nodelist_fp0 ns) `B.loc_disjoint` (B.loc_region_only false (HS.get_tip h)) | false | |
Steel.HigherReference.fst | Steel.HigherReference.ghost_write | val ghost_write (#a:Type) (#u:_) (#v:erased a) (r:ghost_ref a) (x:erased a)
: SteelGhostT unit u
(ghost_pts_to r full_perm v)
(fun _ -> ghost_pts_to r full_perm x) | val ghost_write (#a:Type) (#u:_) (#v:erased a) (r:ghost_ref a) (x:erased a)
: SteelGhostT unit u
(ghost_pts_to r full_perm v)
(fun _ -> ghost_pts_to r full_perm x) | let ghost_write r x =
ghost_write_aux (reveal r) (reveal x);
rewrite_slprop
(pts_to (reveal r) full_perm (hide (reveal x)))
(ghost_pts_to r full_perm x)
(fun _ -> ()) | {
"file_name": "lib/steel/Steel.HigherReference.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 17,
"end_line": 494,
"start_col": 0,
"start_line": 489
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.PCMReference.fsti.checked",
"Steel.PCMFrac.fst.checked",
"Steel.Memory.fsti.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Pervasives.Native.fst.checked"... | [
{
"abbrev": true,
"full_module": "Steel.Memory",
"short_module": "Mem"
},
{
"abbrev": true,
"full_module": "Steel.PCMReference",
"short_module": "RP"
},
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: Steel.HigherReference.ghost_ref a -> x: FStar.Ghost.erased a
-> Steel.Effect.Atomic.SteelGhostT Prims.unit | Steel.Effect.Atomic.SteelGhostT | [] | [] | [
"Steel.Memory.inames",
"FStar.Ghost.erased",
"Steel.HigherReference.ghost_ref",
"Steel.Effect.Atomic.rewrite_slprop",
"Steel.HigherReference.pts_to",
"FStar.Ghost.reveal",
"Steel.HigherReference.ref",
"Steel.FractionalPermission.full_perm",
"Steel.HigherReference.ghost_pts_to",
"Steel.Memory.mem",... | [] | false | true | false | false | false | let ghost_write r x =
| ghost_write_aux (reveal r) (reveal x);
rewrite_slprop (pts_to (reveal r) full_perm (hide (reveal x)))
(ghost_pts_to r full_perm x)
(fun _ -> ()) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface.unchanged_node_vals | val unchanged_node_vals (h0 h1: HS.mem) (ns: list (node 'a)) : GTot prop | val unchanged_node_vals (h0 h1: HS.mem) (ns: list (node 'a)) : GTot prop | let rec unchanged_node_vals (h0 h1:HS.mem) (ns:list (node 'a)) : GTot prop =
match ns with
| [] -> True
| n :: ns' -> unchanged_node_val h0 h1 n /\ unchanged_node_vals h0 h1 ns' | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 75,
"end_line": 101,
"start_col": 0,
"start_line": 98
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
ns: Prims.list (DoublyLinkedListIface.node 'a)
-> Prims.GTot Prims.prop | Prims.GTot | [
"sometrivial"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"Prims.list",
"DoublyLinkedListIface.node",
"Prims.l_True",
"Prims.l_and",
"DoublyLinkedListIface.unchanged_node_val",
"DoublyLinkedListIface.unchanged_node_vals",
"Prims.prop"
] | [
"recursion"
] | false | false | false | false | true | let rec unchanged_node_vals (h0 h1: HS.mem) (ns: list (node 'a)) : GTot prop =
| match ns with
| [] -> True
| n :: ns' -> unchanged_node_val h0 h1 n /\ unchanged_node_vals h0 h1 ns' | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_nodelist_conn_in_unmodified_mem | val _lemma_nodelist_conn_in_unmodified_mem (h0 h1:HS.mem) (s:B.loc) (nl:list (node 'a)) :
Lemma
(requires (B.modifies s h0 h1 /\
B.loc_disjoint s (DLL.nodelist_fp0 nl) /\
DLL.nodelist_contained0 h0 nl /\
(DLL.nodelist_conn h0 nl)))
(ensures (DLL.nodelist_conn h1 nl)... | val _lemma_nodelist_conn_in_unmodified_mem (h0 h1:HS.mem) (s:B.loc) (nl:list (node 'a)) :
Lemma
(requires (B.modifies s h0 h1 /\
B.loc_disjoint s (DLL.nodelist_fp0 nl) /\
DLL.nodelist_contained0 h0 nl /\
(DLL.nodelist_conn h0 nl)))
(ensures (DLL.nodelist_conn h1 nl)... | let rec _lemma_nodelist_conn_in_unmodified_mem h0 h1 s nl =
match nl with
| [] -> ()
| n1 :: rest -> match rest with
| [] -> ()
| n2 :: ns ->
_lemma_nodelist_conn_in_unmodified_mem h0 h1 s rest | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 57,
"end_line": 163,
"start_col": 0,
"start_line": 157
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
s: LowStar.Monotonic.Buffer.loc ->
nl: Prims.list (DoublyLinkedListIface.node 'a)
-> FStar.Pervasives.Lemma
(requires
LowStar.Monotonic.Buffer.modifies s h0 h1 /\
LowStar.Monotonic.Buffer.loc_disjoint s ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"LowStar.Monotonic.Buffer.loc",
"Prims.list",
"DoublyLinkedListIface.node",
"DoublyLinkedListIface._lemma_nodelist_conn_in_unmodified_mem",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec _lemma_nodelist_conn_in_unmodified_mem h0 h1 s nl =
| match nl with
| [] -> ()
| n1 :: rest ->
match rest with
| [] -> ()
| n2 :: ns -> _lemma_nodelist_conn_in_unmodified_mem h0 h1 s rest | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._auto_dll_valid_and_unchanged_through_push | val _auto_dll_valid_and_unchanged_through_push (h0 h1:HS.mem) (d:dll 'a) :
Lemma
(requires (dll_valid h0 d /\ HS.fresh_frame h0 h1))
(ensures (dll_valid h1 d /\ d@h0 == d@h1))
[SMTPat (dll_valid h0 d);
SMTPat (HS.fresh_frame h0 h1)] | val _auto_dll_valid_and_unchanged_through_push (h0 h1:HS.mem) (d:dll 'a) :
Lemma
(requires (dll_valid h0 d /\ HS.fresh_frame h0 h1))
(ensures (dll_valid h1 d /\ d@h0 == d@h1))
[SMTPat (dll_valid h0 d);
SMTPat (HS.fresh_frame h0 h1)] | let _auto_dll_valid_and_unchanged_through_push h0 h1 d =
B.fresh_frame_modifies h0 h1;
_lemma_nodelist_contained_in_unmodified_mem h0 h1 B.loc_none (as_list h1 d);
_lemma_nodelist_conn_in_unmodified_mem h0 h1 B.loc_none (as_list h1 d) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 72,
"end_line": 187,
"start_col": 0,
"start_line": 184
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
d: DoublyLinkedListIface.dll 'a
-> FStar.Pervasives.Lemma
(requires DoublyLinkedListIface.dll_valid h0 d /\ FStar.Monotonic.HyperStack.fresh_frame h0 h1
)
(ensures DoublyLinkedListIface.dll_valid h1 d /\ d @ h0 ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedListIface.dll",
"DoublyLinkedListIface._lemma_nodelist_conn_in_unmodified_mem",
"LowStar.Monotonic.Buffer.loc_none",
"DoublyLinkedListIface.as_list",
"Prims.unit",
"DoublyLinkedListIface._lemma_nodelist_contained_in_unmodified_mem",
"LowStar.Monotonic.Buf... | [] | true | false | true | false | false | let _auto_dll_valid_and_unchanged_through_push h0 h1 d =
| B.fresh_frame_modifies h0 h1;
_lemma_nodelist_contained_in_unmodified_mem h0 h1 B.loc_none (as_list h1 d);
_lemma_nodelist_conn_in_unmodified_mem h0 h1 B.loc_none (as_list h1 d) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_nodelist_disjoint_in_push | val _lemma_nodelist_disjoint_in_push (h0 h1:HS.mem) (nl:list (node 'a)) :
Lemma
(requires (HS.fresh_frame h0 h1 /\
DLL.nodelist_contained0 h0 nl))
(ensures (DLL.nodelist_fp0 nl `B.loc_disjoint` (B.loc_region_only false (HS.get_tip h1)))) | val _lemma_nodelist_disjoint_in_push (h0 h1:HS.mem) (nl:list (node 'a)) :
Lemma
(requires (HS.fresh_frame h0 h1 /\
DLL.nodelist_contained0 h0 nl))
(ensures (DLL.nodelist_fp0 nl `B.loc_disjoint` (B.loc_region_only false (HS.get_tip h1)))) | let rec _lemma_nodelist_disjoint_in_push h0 h1 nl =
match nl with
| [] -> ()
| n :: ns ->
_lemma_nodelist_disjoint_in_push h0 h1 ns | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 45,
"end_line": 175,
"start_col": 0,
"start_line": 171
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
nl: Prims.list (DoublyLinkedListIface.node 'a)
-> FStar.Pervasives.Lemma
(requires
FStar.Monotonic.HyperStack.fresh_frame h0 h1 /\ DoublyLinkedList.nodelist_contained0 h0 nl)
(ensures
LowStar.Monotonic... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"Prims.list",
"DoublyLinkedListIface.node",
"DoublyLinkedListIface._lemma_nodelist_disjoint_in_push",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec _lemma_nodelist_disjoint_in_push h0 h1 nl =
| match nl with
| [] -> ()
| n :: ns -> _lemma_nodelist_disjoint_in_push h0 h1 ns | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._auto_dll_modified_with_push_pop | val _auto_dll_modified_with_push_pop (h0 h1:HS.mem) (d:dll 'a) (h2 h3:HS.mem) :
Lemma
(requires (dll_valid h0 d /\
HS.fresh_frame h0 h1 /\
B.modifies (B.loc_union (fp_dll h0 d) (fp_dll h3 d)) h1 h2 /\
B.loc_disjoint (fp_dll h0 d) (B.loc_region_only false (HS.get_tip h2... | val _auto_dll_modified_with_push_pop (h0 h1:HS.mem) (d:dll 'a) (h2 h3:HS.mem) :
Lemma
(requires (dll_valid h0 d /\
HS.fresh_frame h0 h1 /\
B.modifies (B.loc_union (fp_dll h0 d) (fp_dll h3 d)) h1 h2 /\
B.loc_disjoint (fp_dll h0 d) (B.loc_region_only false (HS.get_tip h2... | let _auto_dll_modified_with_push_pop h0 h1 d h2 h3 =
let loc = B.loc_region_only false (HS.get_tip h2) in
B.popped_modifies h2 h3;
_lemma_nodelist_contained_in_unmodified_mem h2 h3 loc (as_list h3 d);
_lemma_nodelist_conn_in_unmodified_mem h2 h3 loc (as_list h3 d) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 65,
"end_line": 223,
"start_col": 0,
"start_line": 219
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
d: DoublyLinkedListIface.dll 'a ->
h2: FStar.Monotonic.HyperStack.mem ->
h3: FStar.Monotonic.HyperStack.mem
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedListIface.dll_valid h0 d /\ FStar.Monotonic.HyperSt... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedListIface.dll",
"DoublyLinkedListIface._lemma_nodelist_conn_in_unmodified_mem",
"DoublyLinkedListIface.as_list",
"Prims.unit",
"DoublyLinkedListIface._lemma_nodelist_contained_in_unmodified_mem",
"LowStar.Monotonic.Buffer.popped_modifies",
"LowStar.Monoto... | [] | true | false | true | false | false | let _auto_dll_modified_with_push_pop h0 h1 d h2 h3 =
| let loc = B.loc_region_only false (HS.get_tip h2) in
B.popped_modifies h2 h3;
_lemma_nodelist_contained_in_unmodified_mem h2 h3 loc (as_list h3 d);
_lemma_nodelist_conn_in_unmodified_mem h2 h3 loc (as_list h3 d) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_nodelist_contained_in_unmodified_mem | val _lemma_nodelist_contained_in_unmodified_mem (h0 h1:HS.mem) (s:B.loc) (nl:list (node 'a)) :
Lemma
(requires (B.modifies s h0 h1 /\
B.loc_disjoint s (DLL.nodelist_fp0 nl) /\
(DLL.nodelist_contained0 h0 nl)))
(ensures (DLL.nodelist_contained0 h1 nl)) | val _lemma_nodelist_contained_in_unmodified_mem (h0 h1:HS.mem) (s:B.loc) (nl:list (node 'a)) :
Lemma
(requires (B.modifies s h0 h1 /\
B.loc_disjoint s (DLL.nodelist_fp0 nl) /\
(DLL.nodelist_contained0 h0 nl)))
(ensures (DLL.nodelist_contained0 h1 nl)) | let rec _lemma_nodelist_contained_in_unmodified_mem h0 h1 s nl =
match nl with
| [] -> ()
| n :: ns ->
_lemma_nodelist_contained_in_unmodified_mem h0 h1 s ns | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 147,
"start_col": 0,
"start_line": 143
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
s: LowStar.Monotonic.Buffer.loc ->
nl: Prims.list (DoublyLinkedListIface.node 'a)
-> FStar.Pervasives.Lemma
(requires
LowStar.Monotonic.Buffer.modifies s h0 h1 /\
LowStar.Monotonic.Buffer.loc_disjoint s ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"LowStar.Monotonic.Buffer.loc",
"Prims.list",
"DoublyLinkedListIface.node",
"DoublyLinkedListIface._lemma_nodelist_contained_in_unmodified_mem",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec _lemma_nodelist_contained_in_unmodified_mem h0 h1 s nl =
| match nl with
| [] -> ()
| n :: ns -> _lemma_nodelist_contained_in_unmodified_mem h0 h1 s ns | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_dll_valid_and_unchanged_through_pop | val _lemma_dll_valid_and_unchanged_through_pop (h0 h1:HS.mem) (d:dll 'a) :
Lemma
(requires (dll_valid h0 d /\ HS.popped h0 h1 /\
B.loc_disjoint (fp_dll h0 d) (B.loc_region_only false (HS.get_tip h0))))
(ensures (dll_valid h1 d /\ d@h0 == d@h1)) | val _lemma_dll_valid_and_unchanged_through_pop (h0 h1:HS.mem) (d:dll 'a) :
Lemma
(requires (dll_valid h0 d /\ HS.popped h0 h1 /\
B.loc_disjoint (fp_dll h0 d) (B.loc_region_only false (HS.get_tip h0))))
(ensures (dll_valid h1 d /\ d@h0 == d@h1)) | let _lemma_dll_valid_and_unchanged_through_pop h0 h1 d =
B.popped_modifies h0 h1;
assert (B.loc_region_only false (HS.get_tip h0) `B.loc_includes`
B.loc_region_only false (HS.get_tip h0)); // OBSERVE
let loc = B.loc_region_only false (HS.get_tip h0) in
_lemma_nodelist_contained_in_unmodified_mem h0 ... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 65,
"end_line": 201,
"start_col": 0,
"start_line": 195
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
d: DoublyLinkedListIface.dll 'a
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedListIface.dll_valid h0 d /\ FStar.Monotonic.HyperStack.popped h0 h1 /\
LowStar.Monotonic.Buffer.loc_disjoint (DoublyLinkedListI... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedListIface.dll",
"DoublyLinkedListIface._lemma_nodelist_conn_in_unmodified_mem",
"DoublyLinkedListIface.as_list",
"Prims.unit",
"DoublyLinkedListIface._lemma_nodelist_contained_in_unmodified_mem",
"LowStar.Monotonic.Buffer.loc",
"LowStar.Monotonic.Buffer.l... | [] | true | false | true | false | false | let _lemma_dll_valid_and_unchanged_through_pop h0 h1 d =
| B.popped_modifies h0 h1;
assert ((B.loc_region_only false (HS.get_tip h0))
`B.loc_includes`
(B.loc_region_only false (HS.get_tip h0)));
let loc = B.loc_region_only false (HS.get_tip h0) in
_lemma_nodelist_contained_in_unmodified_mem h0 h1 loc (as_list h1 d);
_lemma_nodelist_conn_in_unmodified_mem h0 h1 loc (as_... | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_unchanged_node_vals_transitive | val _lemma_unchanged_node_vals_transitive (h0 h1 h2: HS.mem) (ns: list (node 'a))
: Lemma (requires ((unchanged_node_vals h0 h1 ns) /\ (unchanged_node_vals h1 h2 ns)))
(ensures ((unchanged_node_vals h0 h2 ns))) | val _lemma_unchanged_node_vals_transitive (h0 h1 h2: HS.mem) (ns: list (node 'a))
: Lemma (requires ((unchanged_node_vals h0 h1 ns) /\ (unchanged_node_vals h1 h2 ns)))
(ensures ((unchanged_node_vals h0 h2 ns))) | let rec _lemma_unchanged_node_vals_transitive (h0 h1 h2:HS.mem) (ns:list (node 'a)) :
Lemma
(requires (
(unchanged_node_vals h0 h1 ns) /\
(unchanged_node_vals h1 h2 ns)))
(ensures (
(unchanged_node_vals h0 h2 ns))) =
match ns with
| [] -> ()
| _ :: ns' -> _lemma_unchanged_node_va... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 66,
"end_line": 261,
"start_col": 0,
"start_line": 252
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
h2: FStar.Monotonic.HyperStack.mem ->
ns: Prims.list (DoublyLinkedListIface.node 'a)
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedListIface.unchanged_node_vals h0 h1 ns /\
DoublyLinkedListIface.unchan... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"Prims.list",
"DoublyLinkedListIface.node",
"DoublyLinkedListIface._lemma_unchanged_node_vals_transitive",
"Prims.unit",
"Prims.l_and",
"DoublyLinkedListIface.unchanged_node_vals",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [
"recursion"
] | false | false | true | false | false | let rec _lemma_unchanged_node_vals_transitive (h0 h1 h2: HS.mem) (ns: list (node 'a))
: Lemma (requires ((unchanged_node_vals h0 h1 ns) /\ (unchanged_node_vals h1 h2 ns)))
(ensures ((unchanged_node_vals h0 h2 ns))) =
| match ns with
| [] -> ()
| _ :: ns' -> _lemma_unchanged_node_vals_transitive h0 h1 h2 ns' | false |
Steel.HigherReference.fst | Steel.HigherReference.higher_ref_pts_to_injective_eq | val higher_ref_pts_to_injective_eq
(#a: Type)
(#opened:inames)
(#p0 #p1:perm)
(#v0 #v1: erased a)
(r: ref a)
: SteelGhost unit opened
(pts_to r p0 v0 `star` pts_to r p1 v1)
(fun _ -> pts_to r p0 v0 `star` pts_to r p1 v0)
(requires fun _ -> True)
(e... | val higher_ref_pts_to_injective_eq
(#a: Type)
(#opened:inames)
(#p0 #p1:perm)
(#v0 #v1: erased a)
(r: ref a)
: SteelGhost unit opened
(pts_to r p0 v0 `star` pts_to r p1 v1)
(fun _ -> pts_to r p0 v0 `star` pts_to r p1 v0)
(requires fun _ -> True)
(e... | let higher_ref_pts_to_injective_eq #a #opened #p0 #p1 #v0 #v1 r =
extract_info_raw (pts_to r p0 v0 `star` pts_to r p1 v1) (v0 == v1)
(fun m -> pts_to_ref_injective r p0 p1 v0 v1 m);
rewrite_slprop (pts_to r p1 v1) (pts_to r p1 v0) (fun _ -> ()) | {
"file_name": "lib/steel/Steel.HigherReference.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 64,
"end_line": 111,
"start_col": 0,
"start_line": 108
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.PCMReference.fsti.checked",
"Steel.PCMFrac.fst.checked",
"Steel.Memory.fsti.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Pervasives.Native.fst.checked"... | [
{
"abbrev": true,
"full_module": "Steel.Memory",
"short_module": "Mem"
},
{
"abbrev": true,
"full_module": "Steel.PCMReference",
"short_module": "RP"
},
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: Steel.HigherReference.ref a -> Steel.Effect.Atomic.SteelGhost Prims.unit | Steel.Effect.Atomic.SteelGhost | [] | [] | [
"Steel.Memory.inames",
"Steel.FractionalPermission.perm",
"FStar.Ghost.erased",
"Steel.HigherReference.ref",
"Steel.Effect.Atomic.rewrite_slprop",
"Steel.HigherReference.pts_to",
"FStar.Ghost.reveal",
"Steel.Memory.mem",
"Prims.unit",
"Steel.Effect.Atomic.extract_info_raw",
"Steel.Effect.Common.... | [] | false | true | false | false | false | let higher_ref_pts_to_injective_eq #a #opened #p0 #p1 #v0 #v1 r =
| extract_info_raw ((pts_to r p0 v0) `star` (pts_to r p1 v1))
(v0 == v1)
(fun m -> pts_to_ref_injective r p0 p1 v0 v1 m);
rewrite_slprop (pts_to r p1 v1) (pts_to r p1 v0) (fun _ -> ()) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._auto_dll_assign_valid_stays_valid | val _auto_dll_assign_valid_stays_valid (h0 h1:HS.mem) (d:dll 'a) (d2:DLL.dll 'a) :
Lemma
(requires (DLL.dll_valid h0 d2 /\
B.modifies (B.loc_buffer d) h0 h1 /\
B.loc_buffer d `B.loc_disjoint` DLL.dll_fp0 d2 /\
B.live h0 d /\
d@h1 == d2))
(ensures (dl... | val _auto_dll_assign_valid_stays_valid (h0 h1:HS.mem) (d:dll 'a) (d2:DLL.dll 'a) :
Lemma
(requires (DLL.dll_valid h0 d2 /\
B.modifies (B.loc_buffer d) h0 h1 /\
B.loc_buffer d `B.loc_disjoint` DLL.dll_fp0 d2 /\
B.live h0 d /\
d@h1 == d2))
(ensures (dl... | let _auto_dll_assign_valid_stays_valid h0 h1 d d2 =
_lemma_nodelist_conn_in_unmodified_mem h0 h1 (B.loc_buffer d) d2.DLL.nodes;
_lemma_nodelist_contained_in_unmodified_mem h0 h1 (B.loc_buffer d) d2.DLL.nodes | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 81,
"end_line": 249,
"start_col": 0,
"start_line": 247
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
d: DoublyLinkedListIface.dll 'a ->
d2: DoublyLinkedList.dll 'a
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.dll_valid h0 d2 /\
LowStar.Monotonic.Buffer.modifies (LowStar.Monotonic.Buffer.loc_buff... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedListIface.dll",
"DoublyLinkedList.dll",
"DoublyLinkedListIface._lemma_nodelist_contained_in_unmodified_mem",
"LowStar.Monotonic.Buffer.loc_buffer",
"LowStar.Buffer.trivial_preorder",
"FStar.Ghost.reveal",
"DoublyLinkedList.nodelist",
"DoublyLinkedList._... | [] | true | false | true | false | false | let _auto_dll_assign_valid_stays_valid h0 h1 d d2 =
| _lemma_nodelist_conn_in_unmodified_mem h0 h1 (B.loc_buffer d) d2.DLL.nodes;
_lemma_nodelist_contained_in_unmodified_mem h0 h1 (B.loc_buffer d) d2.DLL.nodes | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._auto_dll_fp_disjoint_from_push | val _auto_dll_fp_disjoint_from_push (h0 h1:HS.mem) (d:dll 'a) :
Lemma
(requires (dll_valid h0 d /\ HS.fresh_frame h0 h1))
(ensures (B.loc_disjoint (fp_dll h0 d) (B.loc_region_only false (HS.get_tip h1))))
[SMTPat (dll_valid h0 d);
SMTPat (HS.fresh_frame h0 h1)] | val _auto_dll_fp_disjoint_from_push (h0 h1:HS.mem) (d:dll 'a) :
Lemma
(requires (dll_valid h0 d /\ HS.fresh_frame h0 h1))
(ensures (B.loc_disjoint (fp_dll h0 d) (B.loc_region_only false (HS.get_tip h1))))
[SMTPat (dll_valid h0 d);
SMTPat (HS.fresh_frame h0 h1)] | let _auto_dll_fp_disjoint_from_push h0 h1 d =
_lemma_nodelist_disjoint_in_push h0 h1 (d@h0).DLL.nodes | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 57,
"end_line": 233,
"start_col": 0,
"start_line": 232
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
d: DoublyLinkedListIface.dll 'a
-> FStar.Pervasives.Lemma
(requires DoublyLinkedListIface.dll_valid h0 d /\ FStar.Monotonic.HyperStack.fresh_frame h0 h1
)
(ensures
LowStar.Monotonic.Buffer.loc_disjoint (... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedListIface.dll",
"DoublyLinkedListIface._lemma_nodelist_disjoint_in_push",
"FStar.Ghost.reveal",
"DoublyLinkedList.nodelist",
"DoublyLinkedList.__proj__Mkdll__item__nodes",
"DoublyLinkedListIface.op_At",
"DoublyLinkedList.dll",
"Prims.unit"
] | [] | true | false | true | false | false | let _auto_dll_fp_disjoint_from_push h0 h1 d =
| _lemma_nodelist_disjoint_in_push h0 h1 (d @ h0).DLL.nodes | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._auto_unchanged_node_vals_through_push_pop | val _auto_unchanged_node_vals_through_push_pop (h0 h1:HS.mem) (ns:list (node 'a)) (h2 h3:HS.mem) :
Lemma
(requires (unchanged_node_vals h1 h2 ns /\
HS.fresh_frame h0 h1 /\ HS.popped h2 h3 /\
_pred_nl_disjoint h1 ns /\
HS.get_tip h1 == HS.get_tip h2))
(ensures (
... | val _auto_unchanged_node_vals_through_push_pop (h0 h1:HS.mem) (ns:list (node 'a)) (h2 h3:HS.mem) :
Lemma
(requires (unchanged_node_vals h1 h2 ns /\
HS.fresh_frame h0 h1 /\ HS.popped h2 h3 /\
_pred_nl_disjoint h1 ns /\
HS.get_tip h1 == HS.get_tip h2))
(ensures (
... | let rec _auto_unchanged_node_vals_through_push_pop h0 h1 ns h2 h3 =
match ns with
| [] -> ()
| n :: ns' ->
_auto_unchanged_node_vals_through_push_pop h0 h1 ns' h2 h3;
// assert (unchanged_node_vals h0 h1 ns);
// assert (unchanged_node_vals h2 h3 ns);
B.popped_modifies h2 h3 | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 288,
"start_col": 0,
"start_line": 281
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
ns: Prims.list (DoublyLinkedListIface.node 'a) ->
h2: FStar.Monotonic.HyperStack.mem ->
h3: FStar.Monotonic.HyperStack.mem
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedListIface.unchanged_node_vals h1 h2 ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"Prims.list",
"DoublyLinkedListIface.node",
"LowStar.Monotonic.Buffer.popped_modifies",
"Prims.unit",
"DoublyLinkedListIface._auto_unchanged_node_vals_through_push_pop"
] | [
"recursion"
] | false | false | true | false | false | let rec _auto_unchanged_node_vals_through_push_pop h0 h1 ns h2 h3 =
| match ns with
| [] -> ()
| n :: ns' ->
_auto_unchanged_node_vals_through_push_pop h0 h1 ns' h2 h3;
B.popped_modifies h2 h3 | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._auto_unchanged_node_vals_DLL | val _auto_unchanged_node_vals_DLL (h0 h1: HS.mem) (ns: list (node 'a))
: Lemma (requires (DLL.unchanged_node_vals h0 h1 ns))
(ensures (unchanged_node_vals h0 h1 ns))
[SMTPat (unchanged_node_vals h0 h1 ns)] | val _auto_unchanged_node_vals_DLL (h0 h1: HS.mem) (ns: list (node 'a))
: Lemma (requires (DLL.unchanged_node_vals h0 h1 ns))
(ensures (unchanged_node_vals h0 h1 ns))
[SMTPat (unchanged_node_vals h0 h1 ns)] | let rec _auto_unchanged_node_vals_DLL (h0 h1:HS.mem) (ns:list (node 'a)) :
Lemma
(requires (DLL.unchanged_node_vals h0 h1 ns))
(ensures (unchanged_node_vals h0 h1 ns))
[SMTPat (unchanged_node_vals h0 h1 ns)] =
match ns with
| [] -> ()
| _ :: ns' -> _auto_unchanged_node_vals_DLL h0 h1 ns' | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 55,
"end_line": 317,
"start_col": 0,
"start_line": 310
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
ns: Prims.list (DoublyLinkedListIface.node 'a)
-> FStar.Pervasives.Lemma (requires DoublyLinkedList.unchanged_node_vals h0 h1 ns)
(ensures DoublyLinkedListIface.unchanged_node_vals h0 h1 ns)
[SMTPat (DoublyLinkedListI... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"Prims.list",
"DoublyLinkedListIface.node",
"DoublyLinkedListIface._auto_unchanged_node_vals_DLL",
"Prims.unit",
"DoublyLinkedList.unchanged_node_vals",
"Prims.squash",
"DoublyLinkedListIface.unchanged_node_vals",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar... | [
"recursion"
] | false | false | true | false | false | let rec _auto_unchanged_node_vals_DLL (h0 h1: HS.mem) (ns: list (node 'a))
: Lemma (requires (DLL.unchanged_node_vals h0 h1 ns))
(ensures (unchanged_node_vals h0 h1 ns))
[SMTPat (unchanged_node_vals h0 h1 ns)] =
| match ns with
| [] -> ()
| _ :: ns' -> _auto_unchanged_node_vals_DLL h0 h1 ns' | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._auto_pred_nl_disjoint_push | val _auto_pred_nl_disjoint_push (h0 h1:HS.mem) (d:dll 'a) :
Lemma
(requires (dll_valid h0 d /\ HS.fresh_frame h0 h1))
(ensures (_pred_nl_disjoint h1 (as_list h1 d)))
[SMTPat (dll_valid h0 d);
SMTPat (HS.fresh_frame h0 h1)] | val _auto_pred_nl_disjoint_push (h0 h1:HS.mem) (d:dll 'a) :
Lemma
(requires (dll_valid h0 d /\ HS.fresh_frame h0 h1))
(ensures (_pred_nl_disjoint h1 (as_list h1 d)))
[SMTPat (dll_valid h0 d);
SMTPat (HS.fresh_frame h0 h1)] | let _auto_pred_nl_disjoint_push h0 h1 d =
let loc = B.loc_region_only false (HS.get_tip h1) in
let rec aux (ns:list (node 'a)) :
Lemma
(requires (DLL.nodelist_contained h0 ns /\ HS.fresh_frame h0 h1))
(ensures (_pred_nl_disjoint h1 ns)) =
match ns with
| [] -> ()
| n :: ns' -> aux ns'
... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 307,
"start_col": 0,
"start_line": 297
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
d: DoublyLinkedListIface.dll 'a
-> FStar.Pervasives.Lemma
(requires DoublyLinkedListIface.dll_valid h0 d /\ FStar.Monotonic.HyperStack.fresh_frame h0 h1
)
(ensures DoublyLinkedListIface._pred_nl_disjoint h1 (Dou... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedListIface.dll",
"DoublyLinkedListIface.as_list",
"Prims.list",
"DoublyLinkedListIface.node",
"Prims.unit",
"Prims.l_and",
"DoublyLinkedList.nodelist_contained",
"FStar.Monotonic.HyperStack.fresh_frame",
"Prims.squash",
"DoublyLinkedListIface._pred_n... | [] | false | false | true | false | false | let _auto_pred_nl_disjoint_push h0 h1 d =
| let loc = B.loc_region_only false (HS.get_tip h1) in
let rec aux (ns: list (node 'a))
: Lemma (requires (DLL.nodelist_contained h0 ns /\ HS.fresh_frame h0 h1))
(ensures (_pred_nl_disjoint h1 ns)) =
match ns with
| [] -> ()
| n :: ns' -> aux ns'
in
aux (as_list h0 d) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_unchanged_node_vals_stays_valid0 | val _lemma_unchanged_node_vals_stays_valid0 (h0 h1:HS.mem) (d:dll 'a) :
Lemma
(requires (B.modifies (B.loc_buffer d) h0 h1 /\
B.loc_buffer d `B.loc_disjoint` DLL.dll_fp0 (d@h0) /\
B.live h0 d))
(ensures (unchanged_node_vals h0 h1 (as_list h0 d))) | val _lemma_unchanged_node_vals_stays_valid0 (h0 h1:HS.mem) (d:dll 'a) :
Lemma
(requires (B.modifies (B.loc_buffer d) h0 h1 /\
B.loc_buffer d `B.loc_disjoint` DLL.dll_fp0 (d@h0) /\
B.live h0 d))
(ensures (unchanged_node_vals h0 h1 (as_list h0 d))) | let _lemma_unchanged_node_vals_stays_valid0 h0 h1 d =
_lemma_unchanged_node_vals_when_disjoint h0 h1 (B.loc_buffer d) (as_list h0 d) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 80,
"end_line": 360,
"start_col": 0,
"start_line": 359
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
d: DoublyLinkedListIface.dll 'a
-> FStar.Pervasives.Lemma
(requires
LowStar.Monotonic.Buffer.modifies (LowStar.Monotonic.Buffer.loc_buffer d) h0 h1 /\
LowStar.Monotonic.Buffer.loc_disjoint (LowStar.Monotonic... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedListIface.dll",
"DoublyLinkedListIface._lemma_unchanged_node_vals_when_disjoint",
"LowStar.Monotonic.Buffer.loc_buffer",
"DoublyLinkedList.dll",
"LowStar.Buffer.trivial_preorder",
"DoublyLinkedListIface.as_list",
"Prims.unit"
] | [] | true | false | true | false | false | let _lemma_unchanged_node_vals_stays_valid0 h0 h1 d =
| _lemma_unchanged_node_vals_when_disjoint h0 h1 (B.loc_buffer d) (as_list h0 d) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_node_in_list_or_null_is_included | val _lemma_node_in_list_or_null_is_included
(n: B.pointer_or_null (DLL.node 'a))
(nl: list (node 'a))
: Lemma (requires (n =!= B.null ==> n `L.memP` nl))
(ensures ((DLL.nodelist_fp0 nl) `B.loc_includes` (B.loc_buffer n))) | val _lemma_node_in_list_or_null_is_included
(n: B.pointer_or_null (DLL.node 'a))
(nl: list (node 'a))
: Lemma (requires (n =!= B.null ==> n `L.memP` nl))
(ensures ((DLL.nodelist_fp0 nl) `B.loc_includes` (B.loc_buffer n))) | let _lemma_node_in_list_or_null_is_included (n:B.pointer_or_null (DLL.node 'a)) (nl:list (node 'a)) :
Lemma
(requires (n =!= B.null ==> n `L.memP` nl))
(ensures (DLL.nodelist_fp0 nl `B.loc_includes` B.loc_buffer n)) =
FStar.Classical.arrow_to_impl
#(n =!= B.null) #(DLL.nodelist_fp0 nl `B.loc_includes` B.l... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 381,
"start_col": 0,
"start_line": 375
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
n: LowStar.Buffer.pointer_or_null (DoublyLinkedList.node 'a) ->
nl: Prims.list (DoublyLinkedListIface.node 'a)
-> FStar.Pervasives.Lemma (requires ~(n == LowStar.Buffer.null) ==> FStar.List.Tot.Base.memP n nl)
(ensures
LowStar.Monotonic.Buffer.loc_includes (DoublyLinkedList.nodelist_fp0 nl)
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowStar.Buffer.pointer_or_null",
"DoublyLinkedList.node",
"Prims.list",
"DoublyLinkedListIface.node",
"FStar.Classical.arrow_to_impl",
"Prims.l_not",
"Prims.eq2",
"LowStar.Buffer.buffer",
"LowStar.Buffer.null",
"LowStar.Monotonic.Buffer.loc_includes",
"DoublyLinkedList.nodelist_fp0",
"LowStar... | [] | false | false | true | false | false | let _lemma_node_in_list_or_null_is_included
(n: B.pointer_or_null (DLL.node 'a))
(nl: list (node 'a))
: Lemma (requires (n =!= B.null ==> n `L.memP` nl))
(ensures ((DLL.nodelist_fp0 nl) `B.loc_includes` (B.loc_buffer n))) =
| FStar.Classical.arrow_to_impl #(n =!= B.null)
#((DLL.nodelist_fp0 nl) `B.loc_includes` (B.loc_buffer n))
(fun _ -> _lemma_node_in_list_is_included n nl) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._auto_unchanged_node_vals_stays_valid | val _auto_unchanged_node_vals_stays_valid (h0 h1:HS.mem) (d:dll 'a) (d2:DLL.dll 'a) :
Lemma
(requires (DLL.dll_valid h0 d2 /\
B.modifies (B.loc_buffer d) h0 h1 /\
B.loc_buffer d `B.loc_disjoint` DLL.dll_fp0 d2 /\
B.live h0 d /\
d@h1 == d2))
(ensures ... | val _auto_unchanged_node_vals_stays_valid (h0 h1:HS.mem) (d:dll 'a) (d2:DLL.dll 'a) :
Lemma
(requires (DLL.dll_valid h0 d2 /\
B.modifies (B.loc_buffer d) h0 h1 /\
B.loc_buffer d `B.loc_disjoint` DLL.dll_fp0 d2 /\
B.live h0 d /\
d@h1 == d2))
(ensures ... | let _auto_unchanged_node_vals_stays_valid h0 h1 d d2 =
let rec aux nl : Lemma
(requires (
B.modifies (B.loc_buffer d) h0 h1 /\
DLL.nodelist_fp0 nl `B.loc_disjoint` B.loc_buffer d))
(ensures (unchanged_node_vals h0 h1 nl)) =
match nl with
| [] -> ()
| n :: ns -> aux ns in
aux (as_li... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 340,
"start_col": 0,
"start_line": 331
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
d: DoublyLinkedListIface.dll 'a ->
d2: DoublyLinkedList.dll 'a
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.dll_valid h0 d2 /\
LowStar.Monotonic.Buffer.modifies (LowStar.Monotonic.Buffer.loc_buff... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedListIface.dll",
"DoublyLinkedList.dll",
"DoublyLinkedListIface.as_list",
"Prims.list",
"DoublyLinkedListIface.node",
"Prims.unit",
"Prims.l_and",
"LowStar.Monotonic.Buffer.modifies",
"LowStar.Monotonic.Buffer.loc_buffer",
"LowStar.Buffer.trivial_pre... | [] | false | false | true | false | false | let _auto_unchanged_node_vals_stays_valid h0 h1 d d2 =
| let rec aux nl
: Lemma
(requires
(B.modifies (B.loc_buffer d) h0 h1 /\
(DLL.nodelist_fp0 nl) `B.loc_disjoint` (B.loc_buffer d)))
(ensures (unchanged_node_vals h0 h1 nl)) =
match nl with
| [] -> ()
| n :: ns -> aux ns
in
aux (as_list h1 d) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_append_contains | val _lemma_append_contains (h0: HS.mem) (l1 l2: list (node 'a))
: Lemma
(ensures
((DLL.nodelist_contained h0 (l1 `L.append` l2)) <==>
(DLL.nodelist_contained h0 l1 /\ DLL.nodelist_contained h0 l2))) | val _lemma_append_contains (h0: HS.mem) (l1 l2: list (node 'a))
: Lemma
(ensures
((DLL.nodelist_contained h0 (l1 `L.append` l2)) <==>
(DLL.nodelist_contained h0 l1 /\ DLL.nodelist_contained h0 l2))) | let rec _lemma_append_contains (h0:HS.mem) (l1 l2:list (node 'a)) :
Lemma
(ensures (
(DLL.nodelist_contained h0 (l1 `L.append` l2)) <==>
(DLL.nodelist_contained h0 l1 /\ DLL.nodelist_contained h0 l2))) =
match l1 with
| [] -> ()
| h :: t -> _lemma_append_contains h0 t l2 | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 462,
"start_col": 0,
"start_line": 455
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
l1: Prims.list (DoublyLinkedListIface.node 'a) ->
l2: Prims.list (DoublyLinkedListIface.node 'a)
-> FStar.Pervasives.Lemma
(ensures
DoublyLinkedList.nodelist_contained h0 (l1 @ l2) <==>
DoublyLinkedList.nodelist_contained h0 l1 /\ DoublyLinkedList.nod... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"Prims.list",
"DoublyLinkedListIface.node",
"DoublyLinkedListIface._lemma_append_contains",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_iff",
"DoublyLinkedList.nodelist_contained",
"FStar.List.Tot.Base.append",
"Prims.l_and",
"Prims.Nil",
"FStar.P... | [
"recursion"
] | false | false | true | false | false | let rec _lemma_append_contains (h0: HS.mem) (l1 l2: list (node 'a))
: Lemma
(ensures
((DLL.nodelist_contained h0 (l1 `L.append` l2)) <==>
(DLL.nodelist_contained h0 l1 /\ DLL.nodelist_contained h0 l2))) =
| match l1 with
| [] -> ()
| h :: t -> _lemma_append_contains h0 t l2 | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_append_g_node_vals | val _lemma_append_g_node_vals (h0: HS.mem) (l1 l2: list (node 'a))
: Lemma
(ensures
((g_node_vals h0 (l1 `L.append` l2) == (g_node_vals h0 l1) `L.append` (g_node_vals h0 l2)))) | val _lemma_append_g_node_vals (h0: HS.mem) (l1 l2: list (node 'a))
: Lemma
(ensures
((g_node_vals h0 (l1 `L.append` l2) == (g_node_vals h0 l1) `L.append` (g_node_vals h0 l2)))) | let rec _lemma_append_g_node_vals (h0:HS.mem) (l1 l2:list (node 'a)) :
Lemma
(ensures (
(g_node_vals h0 (l1 `L.append` l2) == g_node_vals h0 l1 `L.append` g_node_vals h0 l2))) =
match l1 with
| [] -> ()
| h :: t -> _lemma_append_g_node_vals h0 t l2 | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 47,
"end_line": 471,
"start_col": 0,
"start_line": 465
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
l1: Prims.list (DoublyLinkedListIface.node 'a) ->
l2: Prims.list (DoublyLinkedListIface.node 'a)
-> FStar.Pervasives.Lemma
(ensures
DoublyLinkedListIface.g_node_vals h0 (l1 @ l2) ==
DoublyLinkedListIface.g_node_vals h0 l1 @ DoublyLinkedListIface.g_nod... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"Prims.list",
"DoublyLinkedListIface.node",
"DoublyLinkedListIface._lemma_append_g_node_vals",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"DoublyLinkedListIface.g_node_vals",
"FStar.List.Tot.Base.append",
"Prims.Nil",
"FStar.Pervasives.pattern"... | [
"recursion"
] | false | false | true | false | false | let rec _lemma_append_g_node_vals (h0: HS.mem) (l1 l2: list (node 'a))
: Lemma
(ensures
((g_node_vals h0 (l1 `L.append` l2) == (g_node_vals h0 l1) `L.append` (g_node_vals h0 l2)))) =
| match l1 with
| [] -> ()
| h :: t -> _lemma_append_g_node_vals h0 t l2 | false |
Steel.HigherReference.fst | Steel.HigherReference.intro_pts_to | val intro_pts_to (p: perm) (#a #uses: _) (#v: erased a) (r: ref a)
: SteelGhost unit
uses
(pts_to_raw r p v)
(fun _ -> pts_to r p v)
(requires fun _ -> perm_ok p)
(ensures fun _ _ _ -> True) | val intro_pts_to (p: perm) (#a #uses: _) (#v: erased a) (r: ref a)
: SteelGhost unit
uses
(pts_to_raw r p v)
(fun _ -> pts_to r p v)
(requires fun _ -> perm_ok p)
(ensures fun _ _ _ -> True) | let intro_pts_to (p:perm) #a #uses (#v:erased a) (r:ref a)
: SteelGhost unit uses
(pts_to_raw r p v)
(fun _ -> pts_to r p v)
(requires fun _ -> perm_ok p)
(ensures fun _ _ _ -> True)
= intro_pure (perm_ok p);
rewrite_slprop (pts_to' r p v) (pts_to ... | {
"file_name": "lib/steel/Steel.HigherReference.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 63,
"end_line": 123,
"start_col": 0,
"start_line": 116
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.PCMReference.fsti.checked",
"Steel.PCMFrac.fst.checked",
"Steel.Memory.fsti.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Pervasives.Native.fst.checked"... | [
{
"abbrev": true,
"full_module": "Steel.Memory",
"short_module": "Mem"
},
{
"abbrev": true,
"full_module": "Steel.PCMReference",
"short_module": "RP"
},
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: Steel.FractionalPermission.perm -> r: Steel.HigherReference.ref a
-> Steel.Effect.Atomic.SteelGhost Prims.unit | Steel.Effect.Atomic.SteelGhost | [] | [] | [
"Steel.FractionalPermission.perm",
"Steel.Memory.inames",
"FStar.Ghost.erased",
"Steel.HigherReference.ref",
"Steel.Effect.Atomic.rewrite_slprop",
"Steel.HigherReference.pts_to'",
"Steel.HigherReference.pts_to",
"FStar.Ghost.reveal",
"Steel.Memory.mem",
"Prims.unit",
"Steel.Effect.Atomic.intro_p... | [] | false | true | false | false | false | let intro_pts_to (p: perm) #a #uses (#v: erased a) (r: ref a)
: SteelGhost unit
uses
(pts_to_raw r p v)
(fun _ -> pts_to r p v)
(requires fun _ -> perm_ok p)
(ensures fun _ _ _ -> True) =
| intro_pure (perm_ok p);
rewrite_slprop (pts_to' r p v) (pts_to r p v) (fun _ -> ()) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_unchanged_node_vals_maintains_changes | val _lemma_unchanged_node_vals_maintains_changes (h0 h1: HS.mem) (l: list (node 'a))
: Lemma (requires (DLL.nodelist_contained h0 l /\ unchanged_node_vals h0 h1 l))
(ensures (g_node_vals h1 l == g_node_vals h0 l)) | val _lemma_unchanged_node_vals_maintains_changes (h0 h1: HS.mem) (l: list (node 'a))
: Lemma (requires (DLL.nodelist_contained h0 l /\ unchanged_node_vals h0 h1 l))
(ensures (g_node_vals h1 l == g_node_vals h0 l)) | let rec _lemma_unchanged_node_vals_maintains_changes (h0 h1:HS.mem) (l:list (node 'a)) :
Lemma
(requires (DLL.nodelist_contained h0 l /\ unchanged_node_vals h0 h1 l))
(ensures (g_node_vals h1 l == g_node_vals h0 l)) =
match l with
| [] -> ()
| h :: t ->
_lemma_unchanged_node_vals_maintains_changes h... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 56,
"end_line": 452,
"start_col": 0,
"start_line": 445
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
l: Prims.list (DoublyLinkedListIface.node 'a)
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.nodelist_contained h0 l /\
DoublyLinkedListIface.unchanged_node_vals h0 h1 l)
(ensures DoublyLinkedLis... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"Prims.list",
"DoublyLinkedListIface.node",
"DoublyLinkedListIface._lemma_unchanged_node_vals_maintains_changes",
"Prims.unit",
"Prims.l_and",
"DoublyLinkedList.nodelist_contained",
"DoublyLinkedListIface.unchanged_node_vals",
"Prims.squash",
"Prims.eq2",
"Doubl... | [
"recursion"
] | false | false | true | false | false | let rec _lemma_unchanged_node_vals_maintains_changes (h0 h1: HS.mem) (l: list (node 'a))
: Lemma (requires (DLL.nodelist_contained h0 l /\ unchanged_node_vals h0 h1 l))
(ensures (g_node_vals h1 l == g_node_vals h0 l)) =
| match l with
| [] -> ()
| h :: t -> _lemma_unchanged_node_vals_maintains_changes h0 h1 t | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_node_in_list_is_included | val _lemma_node_in_list_is_included (n: node 'a) (nl: list (node 'a))
: Lemma (requires (n `L.memP` nl))
(ensures ((DLL.nodelist_fp0 nl) `B.loc_includes` (fp_node n))) | val _lemma_node_in_list_is_included (n: node 'a) (nl: list (node 'a))
: Lemma (requires (n `L.memP` nl))
(ensures ((DLL.nodelist_fp0 nl) `B.loc_includes` (fp_node n))) | let rec _lemma_node_in_list_is_included (n:node 'a) (nl:list (node 'a)) :
Lemma
(requires (n `L.memP` nl))
(ensures (DLL.nodelist_fp0 nl `B.loc_includes` fp_node n)) =
match nl with
| [_] -> ()
| n' :: ns ->
FStar.Classical.or_elim #_ #_ #(fun () -> DLL.nodelist_fp0 nl `B.loc_includes` fp_node n)
... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 70,
"end_line": 372,
"start_col": 0,
"start_line": 363
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: DoublyLinkedListIface.node 'a -> nl: Prims.list (DoublyLinkedListIface.node 'a)
-> FStar.Pervasives.Lemma (requires FStar.List.Tot.Base.memP n nl)
(ensures
LowStar.Monotonic.Buffer.loc_includes (DoublyLinkedList.nodelist_fp0 nl)
(DoublyLinkedListIface.fp_node n)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedListIface.node",
"Prims.list",
"FStar.Classical.or_elim",
"Prims.eq2",
"Prims.l_not",
"Prims.unit",
"LowStar.Monotonic.Buffer.loc_includes",
"DoublyLinkedList.nodelist_fp0",
"DoublyLinkedListIface.fp_node",
"Prims.l_False",
"DoublyLinkedListIface._lemma_node_in_list_is_included",
... | [
"recursion"
] | false | false | true | false | false | let rec _lemma_node_in_list_is_included (n: node 'a) (nl: list (node 'a))
: Lemma (requires (n `L.memP` nl))
(ensures ((DLL.nodelist_fp0 nl) `B.loc_includes` (fp_node n))) =
| match nl with
| [_] -> ()
| n' :: ns ->
FStar.Classical.or_elim #_
#_
#(fun () -> (DLL.nodelist_fp0 nl) `B.loc_includes` (fp_node n))
(fun
(_:
(_:
unit
{ match _ with
| _ -> n == n'
| _ -> False }))
->
())
(fun... | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_unchanged_node_vals_append | val _lemma_unchanged_node_vals_append (h0 h1: HS.mem) (l1 l2: list (node 'a))
: Lemma
(ensures
((unchanged_node_vals h0 h1 (l1 `L.append` l2) <==>
(unchanged_node_vals h0 h1 l1 /\ unchanged_node_vals h0 h1 l2)))) | val _lemma_unchanged_node_vals_append (h0 h1: HS.mem) (l1 l2: list (node 'a))
: Lemma
(ensures
((unchanged_node_vals h0 h1 (l1 `L.append` l2) <==>
(unchanged_node_vals h0 h1 l1 /\ unchanged_node_vals h0 h1 l2)))) | let rec _lemma_unchanged_node_vals_append (h0 h1:HS.mem) (l1 l2:list (node 'a)) :
Lemma
(ensures (
(unchanged_node_vals h0 h1 (l1 `L.append` l2) <==>
(unchanged_node_vals h0 h1 l1 /\ unchanged_node_vals h0 h1 l2)))) =
match l1 with
| [] -> ()
| h :: t -> _lemma_unchanged_node_vals_append h0... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 481,
"start_col": 0,
"start_line": 474
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
l1: Prims.list (DoublyLinkedListIface.node 'a) ->
l2: Prims.list (DoublyLinkedListIface.node 'a)
-> FStar.Pervasives.Lemma
(ensures
DoublyLinkedListIface.unchanged_node_vals h0 h1 (l1 @ l2) <==>
DoublyLinkedLi... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"Prims.list",
"DoublyLinkedListIface.node",
"DoublyLinkedListIface._lemma_unchanged_node_vals_append",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_iff",
"DoublyLinkedListIface.unchanged_node_vals",
"FStar.List.Tot.Base.append",
"Prims.l_and",
"Prims... | [
"recursion"
] | false | false | true | false | false | let rec _lemma_unchanged_node_vals_append (h0 h1: HS.mem) (l1 l2: list (node 'a))
: Lemma
(ensures
((unchanged_node_vals h0 h1 (l1 `L.append` l2) <==>
(unchanged_node_vals h0 h1 l1 /\ unchanged_node_vals h0 h1 l2)))) =
| match l1 with
| [] -> ()
| h :: t -> _lemma_unchanged_node_vals_append h0 h1 t l2 | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_length_g_node_vals | val _lemma_length_g_node_vals (h0: HS.mem) (l: list (node 'a))
: Lemma (L.length (g_node_vals h0 l) = L.length l) | val _lemma_length_g_node_vals (h0: HS.mem) (l: list (node 'a))
: Lemma (L.length (g_node_vals h0 l) = L.length l) | let rec _lemma_length_g_node_vals (h0:HS.mem) (l:list (node 'a)) :
Lemma
(L.length (g_node_vals h0 l) = L.length l) =
match l with
| [] -> ()
| h :: t ->
_lemma_length_g_node_vals h0 t | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 514,
"start_col": 0,
"start_line": 508
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | h0: FStar.Monotonic.HyperStack.mem -> l: Prims.list (DoublyLinkedListIface.node 'a)
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.length (DoublyLinkedListIface.g_node_vals h0 l) =
FStar.List.Tot.Base.length l) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"Prims.list",
"DoublyLinkedListIface.node",
"DoublyLinkedListIface._lemma_length_g_node_vals",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.b2t",
"Prims.op_Equality",
"Prims.nat",
"FStar.List.Tot.Base.length",
"DoublyLinkedListIface.g_node_vals",
"Pr... | [
"recursion"
] | false | false | true | false | false | let rec _lemma_length_g_node_vals (h0: HS.mem) (l: list (node 'a))
: Lemma (L.length (g_node_vals h0 l) = L.length l) =
| match l with
| [] -> ()
| h :: t -> _lemma_length_g_node_vals h0 t | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_extract_unchanged_node_val | val _lemma_extract_unchanged_node_val (h0 h1: HS.mem) (n: node 'a) (l: list (node 'a))
: Lemma (requires (unchanged_node_vals h0 h1 l /\ n `L.memP` l))
(ensures (unchanged_node_val h0 h1 n)) | val _lemma_extract_unchanged_node_val (h0 h1: HS.mem) (n: node 'a) (l: list (node 'a))
: Lemma (requires (unchanged_node_vals h0 h1 l /\ n `L.memP` l))
(ensures (unchanged_node_val h0 h1 n)) | let rec _lemma_extract_unchanged_node_val (h0 h1:HS.mem) (n:node 'a) (l:list (node 'a)) :
Lemma
(requires (unchanged_node_vals h0 h1 l /\ n `L.memP` l))
(ensures (unchanged_node_val h0 h1 n)) =
let h :: t = l in
FStar.Classical.or_elim #_ #_ #(fun () -> unchanged_node_val h0 h1 n)
(fun (_:unit{n == h}... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 74,
"end_line": 491,
"start_col": 0,
"start_line": 484
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
n: DoublyLinkedListIface.node 'a ->
l: Prims.list (DoublyLinkedListIface.node 'a)
-> FStar.Pervasives.Lemma
(requires DoublyLinkedListIface.unchanged_node_vals h0 h1 l /\ FStar.List.Tot.Base.memP n l)
(ensures Dou... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedListIface.node",
"Prims.list",
"FStar.Classical.or_elim",
"Prims.eq2",
"Prims.l_not",
"Prims.unit",
"DoublyLinkedListIface.unchanged_node_val",
"Prims.l_False",
"DoublyLinkedListIface._lemma_extract_unchanged_node_val",
"Prims.l_and",
"DoublyLinke... | [
"recursion"
] | false | false | true | false | false | let rec _lemma_extract_unchanged_node_val (h0 h1: HS.mem) (n: node 'a) (l: list (node 'a))
: Lemma (requires (unchanged_node_vals h0 h1 l /\ n `L.memP` l))
(ensures (unchanged_node_val h0 h1 n)) =
| let h :: t = l in
FStar.Classical.or_elim #_
#_
#(fun () -> unchanged_node_val h0 h1 n)
(fun
(_:
(_:
unit
{ match _ with
| _ -> n == h
| _ -> False }))
->
())
(fun
(_:
(_:
unit
{ match _ with
... | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_split_using_splitAt | val _lemma_split_using_splitAt (l: list 'a) (x: 'a)
: Lemma (requires (x `L.memP` l))
(ensures (l `L.split_using` x == L.splitAt (l `L.index_of` x) l)) | val _lemma_split_using_splitAt (l: list 'a) (x: 'a)
: Lemma (requires (x `L.memP` l))
(ensures (l `L.split_using` x == L.splitAt (l `L.index_of` x) l)) | let rec _lemma_split_using_splitAt (l:list 'a) (x:'a) :
Lemma
(requires (x `L.memP` l))
(ensures
(l `L.split_using` x == L.splitAt (l `L.index_of` x) l)) =
match l with
| [_] -> ()
| h :: t ->
FStar.Classical.arrow_to_impl
#(x `L.memP` t)
#(l `L.split_using` x == L.splitAt (l `L.index... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 47,
"end_line": 505,
"start_col": 0,
"start_line": 494
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l: Prims.list 'a -> x: 'a
-> FStar.Pervasives.Lemma (requires FStar.List.Tot.Base.memP x l)
(ensures
FStar.List.Tot.Properties.split_using l x ==
FStar.List.Tot.Base.splitAt (FStar.List.Tot.Properties.index_of l x) l) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"FStar.Classical.arrow_to_impl",
"FStar.List.Tot.Base.memP",
"Prims.eq2",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Properties.split_using",
"FStar.List.Tot.Base.splitAt",
"FStar.List.Tot.Properties.index_of",
"Prims.squash",
"DoublyLinkedListIface._lemma_split_using_splitAt"... | [
"recursion"
] | false | false | true | false | false | let rec _lemma_split_using_splitAt (l: list 'a) (x: 'a)
: Lemma (requires (x `L.memP` l))
(ensures (l `L.split_using` x == L.splitAt (l `L.index_of` x) l)) =
| match l with
| [_] -> ()
| h :: t ->
FStar.Classical.arrow_to_impl #(x `L.memP` t)
#(l `L.split_using` x == L.splitAt (l `L.index_of` x) l)
(fun _ -> _lemma_split_using_splitAt t x) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_insertion_maintains_unchanged_node_vals | val _lemma_insertion_maintains_unchanged_node_vals
(h0 h1: HS.mem)
(l1 l2: list (node 'a))
(x0 x1: node 'a)
: Lemma
(requires
((x0 `L.memP` l1) /\
((l2 == DLL._l_insert_before x0 l1 x1) \/ (l2 == DLL._l_insert_after x0 l1 x1)) /\
(unchanged_node_vals h0 h1 l2))) (... | val _lemma_insertion_maintains_unchanged_node_vals
(h0 h1: HS.mem)
(l1 l2: list (node 'a))
(x0 x1: node 'a)
: Lemma
(requires
((x0 `L.memP` l1) /\
((l2 == DLL._l_insert_before x0 l1 x1) \/ (l2 == DLL._l_insert_after x0 l1 x1)) /\
(unchanged_node_vals h0 h1 l2))) (... | let rec _lemma_insertion_maintains_unchanged_node_vals (h0 h1:HS.mem) (l1 l2:list (node 'a)) (x0 x1:node 'a) :
Lemma
(requires ((x0 `L.memP` l1) /\
((l2 == DLL._l_insert_before x0 l1 x1) \/
(l2 == DLL._l_insert_after x0 l1 x1)) /\
(unchanged_node_vals h0 h1 l2)))
... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 82,
"end_line": 441,
"start_col": 0,
"start_line": 429
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
l1: Prims.list (DoublyLinkedListIface.node 'a) ->
l2: Prims.list (DoublyLinkedListIface.node 'a) ->
x0: DoublyLinkedListIface.node 'a ->
x1: DoublyLinkedListIface.node 'a
-> FStar.Pervasives.Lemma
(requires
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"Prims.list",
"DoublyLinkedListIface.node",
"FStar.Classical.arrow_to_impl",
"Prims.l_not",
"Prims.eq2",
"DoublyLinkedListIface.unchanged_node_vals",
"Prims.squash",
"DoublyLinkedListIface._lemma_insertion_maintains_unchanged_node_vals",
"FStar.List.Tot.Base.tl",
... | [
"recursion"
] | false | false | true | false | false | let rec _lemma_insertion_maintains_unchanged_node_vals
(h0 h1: HS.mem)
(l1 l2: list (node 'a))
(x0 x1: node 'a)
: Lemma
(requires
((x0 `L.memP` l1) /\
((l2 == DLL._l_insert_before x0 l1 x1) \/ (l2 == DLL._l_insert_after x0 l1 x1)) /\
(unchanged_node_vals h0 h1 l2)... | match l1 with
| [_] -> ()
| x0' :: l1' ->
FStar.Classical.arrow_to_impl #(x0 =!= x0')
#(unchanged_node_vals h0 h1 l1)
(fun _ -> _lemma_insertion_maintains_unchanged_node_vals h0 h1 l1' (L.tl l2) x0 x1) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface.next_node | val next_node (d:dll 'a) (n:node 'a) :
HST.StackInline (node 'a)
(requires (fun h0 ->
dll_valid h0 d /\
n `L.memP` as_list h0 d /\
L.index_of (as_list h0 d) n < L.length (as_list h0 d) - 1))
(ensures (fun h0 n' h1 ->
h0 == h1 /\
dll_valid h1 d /\
node_vali... | val next_node (d:dll 'a) (n:node 'a) :
HST.StackInline (node 'a)
(requires (fun h0 ->
dll_valid h0 d /\
n `L.memP` as_list h0 d /\
L.index_of (as_list h0 d) n < L.length (as_list h0 d) - 1))
(ensures (fun h0 n' h1 ->
h0 == h1 /\
dll_valid h1 d /\
node_vali... | let next_node d n =
let h0 = HST.get () in
lemma_node_in_valid_dll_is_valid h0 d n;
DLL.extract_nodelist_conn h0 (as_list h0 d) (L.index_of (as_list h0 d) n);
(!*n).DLL.flink | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 552,
"start_col": 0,
"start_line": 548
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "D... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | d: DoublyLinkedListIface.dll 'a -> n: DoublyLinkedListIface.node 'a
-> FStar.HyperStack.ST.StackInline (DoublyLinkedListIface.node 'a) | FStar.HyperStack.ST.StackInline | [] | [] | [
"DoublyLinkedListIface.dll",
"DoublyLinkedListIface.node",
"DoublyLinkedList.__proj__Mknode__item__flink",
"DoublyLinkedList.node",
"LowStar.BufferOps.op_Bang_Star",
"LowStar.Buffer.trivial_preorder",
"Prims.unit",
"DoublyLinkedList.extract_nodelist_conn",
"DoublyLinkedListIface.as_list",
"FStar.L... | [] | false | true | false | false | false | let next_node d n =
| let h0 = HST.get () in
lemma_node_in_valid_dll_is_valid h0 d n;
DLL.extract_nodelist_conn h0 (as_list h0 d) (L.index_of (as_list h0 d) n);
(!*n).DLL.flink | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_insertion_maintains_memP | val _lemma_insertion_maintains_memP (l1 l2: list 'a) (x0 x1 x: 'a)
: Lemma
(requires
((x0 `L.memP` l1) /\
((l2 == DLL._l_insert_before x0 l1 x1) \/ (l2 == DLL._l_insert_after x0 l1 x1)) /\
(x `L.memP` l1 \/ x == x1))) (ensures (x `L.memP` l2)) | val _lemma_insertion_maintains_memP (l1 l2: list 'a) (x0 x1 x: 'a)
: Lemma
(requires
((x0 `L.memP` l1) /\
((l2 == DLL._l_insert_before x0 l1 x1) \/ (l2 == DLL._l_insert_after x0 l1 x1)) /\
(x `L.memP` l1 \/ x == x1))) (ensures (x `L.memP` l2)) | let rec _lemma_insertion_maintains_memP (l1 l2:list 'a) (x0 x1 x:'a) :
Lemma
(requires ((x0 `L.memP` l1) /\
((l2 == DLL._l_insert_before x0 l1 x1) \/
(l2 == DLL._l_insert_after x0 l1 x1)) /\
(x `L.memP` l1 \/ x == x1)))
(ensures (x `L.memP` l2)) =
match l1 with
... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 63,
"end_line": 426,
"start_col": 0,
"start_line": 413
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l1: Prims.list 'a -> l2: Prims.list 'a -> x0: 'a -> x1: 'a -> x: 'a
-> FStar.Pervasives.Lemma
(requires
FStar.List.Tot.Base.memP x0 l1 /\
(l2 == DoublyLinkedList._l_insert_before x0 l1 x1 \/
l2 == DoublyLinkedList._l_insert_after x0 l1 x1) /\
(FStar.List.Tot.Base.memP x l1 \/ x... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"FStar.Classical.or_elim",
"Prims.l_or",
"Prims.eq2",
"Prims.l_and",
"Prims.l_not",
"Prims.unit",
"FStar.List.Tot.Base.memP",
"Prims.l_False",
"DoublyLinkedListIface._lemma_insertion_maintains_memP",
"FStar.List.Tot.Base.tl",
"DoublyLinkedList._l_insert_before",
"DoublyLinkedLi... | [
"recursion"
] | false | false | true | false | false | let rec _lemma_insertion_maintains_memP (l1 l2: list 'a) (x0 x1 x: 'a)
: Lemma
(requires
((x0 `L.memP` l1) /\
((l2 == DLL._l_insert_before x0 l1 x1) \/ (l2 == DLL._l_insert_after x0 l1 x1)) /\
(x `L.memP` l1 \/ x == x1))) (ensures (x `L.memP` l2)) =
| match l1 with
| [_] -> ()
| x0' :: l1' ->
FStar.Classical.or_elim #_
#_
#(fun () -> x `L.memP` l2)
(fun
(_:
(_:
unit
{ match _ with
| _ -> x0' == x0 \/ x0' == x
| _ -> False }))
->
())
(fun
(_:
... | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_prev_node_in_list | val _lemma_prev_node_in_list (h: HS.mem) (n: node 'a) (d: dll 'a)
: Lemma (requires (dll_valid h d /\ n `L.memP` (as_list h d)))
(ensures
(let n' = (n @ h).DLL.blink in
n' =!= B.null ==> n' `L.memP` (as_list h d))) | val _lemma_prev_node_in_list (h: HS.mem) (n: node 'a) (d: dll 'a)
: Lemma (requires (dll_valid h d /\ n `L.memP` (as_list h d)))
(ensures
(let n' = (n @ h).DLL.blink in
n' =!= B.null ==> n' `L.memP` (as_list h d))) | let _lemma_prev_node_in_list (h:HS.mem) (n:node 'a) (d:dll 'a) :
Lemma
(requires (dll_valid h d /\ n `L.memP` as_list h d))
(ensures (let n' = (n@h).DLL.blink in
n' =!= B.null ==> n' `L.memP` as_list h d)) =
let n' = (n@h).DLL.blink in
let l = as_list h d in
FStar.Classical.arrow_to_impl
... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 55,
"end_line": 395,
"start_col": 0,
"start_line": 384
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h: FStar.Monotonic.HyperStack.mem ->
n: DoublyLinkedListIface.node 'a ->
d: DoublyLinkedListIface.dll 'a
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedListIface.dll_valid h d /\
FStar.List.Tot.Base.memP n (DoublyLinkedListIface.as_list h d))
(ensures
(let n' = Mknode... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedListIface.node",
"DoublyLinkedListIface.dll",
"FStar.Classical.arrow_to_impl",
"Prims.l_not",
"Prims.eq2",
"LowStar.Buffer.buffer",
"DoublyLinkedList.node",
"LowStar.Buffer.null",
"Prims.l_and",
"FStar.List.Tot.Base.memP",
"Prims.squash",
"Doubl... | [] | false | false | true | false | false | let _lemma_prev_node_in_list (h: HS.mem) (n: node 'a) (d: dll 'a)
: Lemma (requires (dll_valid h d /\ n `L.memP` (as_list h d)))
(ensures
(let n' = (n @ h).DLL.blink in
n' =!= B.null ==> n' `L.memP` (as_list h d))) =
| let n' = (n @ h).DLL.blink in
let l = as_list h d in
FStar.Classical.arrow_to_impl #(n' =!= B.null)
#(n' =!= B.null /\ n' `L.memP` l)
(fun _ ->
lemma_node_in_valid_dll_is_valid h d n;
DLL.extract_nodelist_conn h l (L.index_of l n - 1)) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface.has_prev | val has_prev (d:dll 'a) (n:node 'a) :
HST.StackInline bool
(requires (fun h0 ->
dll_valid h0 d /\
node_valid h0 n /\
n `L.memP` as_list h0 d))
(ensures (fun h0 y h1 ->
(h0 == h1) /\
(y <==> L.index_of (as_list h0 d) n > 0))) | val has_prev (d:dll 'a) (n:node 'a) :
HST.StackInline bool
(requires (fun h0 ->
dll_valid h0 d /\
node_valid h0 n /\
n `L.memP` as_list h0 d))
(ensures (fun h0 y h1 ->
(h0 == h1) /\
(y <==> L.index_of (as_list h0 d) n > 0))) | let has_prev d n =
let h0 = HST.get () in
DLL.lemma_dll_links_contained h0 (d@h0) (as_list h0 d `L.index_of` n);
L.lemma_unsnoc_is_last (as_list h0 d);
let y = not (B.is_null (!*n).DLL.blink) in
FStar.Classical.or_elim #_ #_ #(fun () ->
y <==> as_list h0 d `L.index_of` n > 0)
(fun (_:unit{y}) -> ())... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 546,
"start_col": 0,
"start_line": 533
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "D... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | d: DoublyLinkedListIface.dll 'a -> n: DoublyLinkedListIface.node 'a
-> FStar.HyperStack.ST.StackInline Prims.bool | FStar.HyperStack.ST.StackInline | [] | [] | [
"DoublyLinkedListIface.dll",
"DoublyLinkedListIface.node",
"Prims.unit",
"FStar.Classical.or_elim",
"Prims.b2t",
"Prims.op_Negation",
"Prims.l_iff",
"Prims.op_GreaterThan",
"FStar.List.Tot.Properties.index_of",
"DoublyLinkedListIface.as_list",
"DoublyLinkedList._lemma_all_nodes_are_unique",
"D... | [] | false | true | false | false | false | let has_prev d n =
| let h0 = HST.get () in
DLL.lemma_dll_links_contained h0 (d @ h0) ((as_list h0 d) `L.index_of` n);
L.lemma_unsnoc_is_last (as_list h0 d);
let y = not (B.is_null (!*n).DLL.blink) in
FStar.Classical.or_elim #_
#_
#(fun () -> y <==> (as_list h0 d) `L.index_of` n > 0)
(fun
(_:
(_:
unit
... | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface._lemma_next_node_in_list | val _lemma_next_node_in_list (h: HS.mem) (n: node 'a) (d: dll 'a)
: Lemma (requires (dll_valid h d /\ n `L.memP` (as_list h d)))
(ensures
(let n' = (n @ h).DLL.flink in
n' =!= B.null ==> n' `L.memP` (as_list h d))) | val _lemma_next_node_in_list (h: HS.mem) (n: node 'a) (d: dll 'a)
: Lemma (requires (dll_valid h d /\ n `L.memP` (as_list h d)))
(ensures
(let n' = (n @ h).DLL.flink in
n' =!= B.null ==> n' `L.memP` (as_list h d))) | let _lemma_next_node_in_list (h:HS.mem) (n:node 'a) (d:dll 'a) :
Lemma
(requires (dll_valid h d /\ n `L.memP` as_list h d))
(ensures (let n' = (n@h).DLL.flink in
n' =!= B.null ==> n' `L.memP` as_list h d)) =
let n' = (n@h).DLL.flink in
let l = as_list h d in
FStar.Classical.arrow_to_impl
... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 410,
"start_col": 0,
"start_line": 398
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h: FStar.Monotonic.HyperStack.mem ->
n: DoublyLinkedListIface.node 'a ->
d: DoublyLinkedListIface.dll 'a
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedListIface.dll_valid h d /\
FStar.List.Tot.Base.memP n (DoublyLinkedListIface.as_list h d))
(ensures
(let n' = Mknode... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedListIface.node",
"DoublyLinkedListIface.dll",
"FStar.Classical.arrow_to_impl",
"Prims.l_not",
"Prims.eq2",
"LowStar.Buffer.buffer",
"DoublyLinkedList.node",
"LowStar.Buffer.null",
"Prims.l_and",
"FStar.List.Tot.Base.memP",
"Prims.squash",
"Doubl... | [] | false | false | true | false | false | let _lemma_next_node_in_list (h: HS.mem) (n: node 'a) (d: dll 'a)
: Lemma (requires (dll_valid h d /\ n `L.memP` (as_list h d)))
(ensures
(let n' = (n @ h).DLL.flink in
n' =!= B.null ==> n' `L.memP` (as_list h d))) =
| let n' = (n @ h).DLL.flink in
let l = as_list h d in
FStar.Classical.arrow_to_impl #(n' =!= B.null)
#(n' =!= B.null /\ n' `L.memP` l)
(fun _ ->
lemma_node_in_valid_dll_is_valid h d n;
L.lemma_unsnoc_is_last l;
DLL.extract_nodelist_conn h l (L.index_of l n)) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface.prev_node | val prev_node (d:dll 'a) (n:node 'a) :
HST.StackInline (node 'a)
(requires (fun h0 ->
dll_valid h0 d /\
n `L.memP` as_list h0 d /\
L.index_of (as_list h0 d) n > 0))
(ensures (fun h0 n' h1 ->
h0 == h1 /\
dll_valid h1 d /\
node_valid h1 n /\
as_list... | val prev_node (d:dll 'a) (n:node 'a) :
HST.StackInline (node 'a)
(requires (fun h0 ->
dll_valid h0 d /\
n `L.memP` as_list h0 d /\
L.index_of (as_list h0 d) n > 0))
(ensures (fun h0 n' h1 ->
h0 == h1 /\
dll_valid h1 d /\
node_valid h1 n /\
as_list... | let prev_node d n =
let h0 = HST.get () in
lemma_node_in_valid_dll_is_valid h0 d n;
DLL.extract_nodelist_conn h0 (as_list h0 d) (L.index_of (as_list h0 d) n - 1);
(!*n).DLL.blink | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 558,
"start_col": 0,
"start_line": 554
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "D... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | d: DoublyLinkedListIface.dll 'a -> n: DoublyLinkedListIface.node 'a
-> FStar.HyperStack.ST.StackInline (DoublyLinkedListIface.node 'a) | FStar.HyperStack.ST.StackInline | [] | [] | [
"DoublyLinkedListIface.dll",
"DoublyLinkedListIface.node",
"DoublyLinkedList.__proj__Mknode__item__blink",
"DoublyLinkedList.node",
"LowStar.BufferOps.op_Bang_Star",
"LowStar.Buffer.trivial_preorder",
"Prims.unit",
"DoublyLinkedList.extract_nodelist_conn",
"DoublyLinkedListIface.as_list",
"Prims.o... | [] | false | true | false | false | false | let prev_node d n =
| let h0 = HST.get () in
lemma_node_in_valid_dll_is_valid h0 d n;
DLL.extract_nodelist_conn h0 (as_list h0 d) (L.index_of (as_list h0 d) n - 1);
(!*n).DLL.blink | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface.has_next | val has_next (d:dll 'a) (n:node 'a) :
HST.StackInline bool
(requires (fun h0 ->
dll_valid h0 d /\
node_valid h0 n /\
n `L.memP` as_list h0 d))
(ensures (fun h0 y h1 ->
(h0 == h1) /\
(y <==> L.index_of (as_list h0 d) n < L.length (as_list h0 d) - 1))) | val has_next (d:dll 'a) (n:node 'a) :
HST.StackInline bool
(requires (fun h0 ->
dll_valid h0 d /\
node_valid h0 n /\
n `L.memP` as_list h0 d))
(ensures (fun h0 y h1 ->
(h0 == h1) /\
(y <==> L.index_of (as_list h0 d) n < L.length (as_list h0 d) - 1))) | let has_next d n =
let h0 = HST.get () in
DLL.lemma_dll_links_contained h0 (d@h0) (as_list h0 d `L.index_of` n);
L.lemma_unsnoc_is_last (as_list h0 d);
let y = not (B.is_null (!*n).DLL.flink) in
FStar.Classical.or_elim #_ #_ #(fun () ->
y <==> as_list h0 d `L.index_of` n < L.length (as_list h0 d) - 1)
... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 531,
"start_col": 0,
"start_line": 518
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "D... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | d: DoublyLinkedListIface.dll 'a -> n: DoublyLinkedListIface.node 'a
-> FStar.HyperStack.ST.StackInline Prims.bool | FStar.HyperStack.ST.StackInline | [] | [] | [
"DoublyLinkedListIface.dll",
"DoublyLinkedListIface.node",
"Prims.unit",
"FStar.Classical.or_elim",
"Prims.b2t",
"Prims.op_Negation",
"Prims.l_iff",
"Prims.op_LessThan",
"FStar.List.Tot.Properties.index_of",
"DoublyLinkedListIface.as_list",
"Prims.op_Subtraction",
"FStar.List.Tot.Base.length",... | [] | false | true | false | false | false | let has_next d n =
| let h0 = HST.get () in
DLL.lemma_dll_links_contained h0 (d @ h0) ((as_list h0 d) `L.index_of` n);
L.lemma_unsnoc_is_last (as_list h0 d);
let y = not (B.is_null (!*n).DLL.flink) in
FStar.Classical.or_elim #_
#_
#(fun () -> y <==> (as_list h0 d) `L.index_of` n < L.length (as_list h0 d) - 1)
(fun
(_:
(... | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface.auto_dll_remains_valid_upon_staying_unchanged | val auto_dll_remains_valid_upon_staying_unchanged (h0 h1:HS.mem) (l:B.loc) (d:dll 'a) :
Lemma
(requires (dll_valid h0 d /\
B.modifies l h0 h1 /\
B.loc_disjoint (fp_dll h0 d) l))
(ensures (dll_valid h1 d))
[SMTPat (dll_valid h1 d); SMTPat (B.modifies l h0 h1)] | val auto_dll_remains_valid_upon_staying_unchanged (h0 h1:HS.mem) (l:B.loc) (d:dll 'a) :
Lemma
(requires (dll_valid h0 d /\
B.modifies l h0 h1 /\
B.loc_disjoint (fp_dll h0 d) l))
(ensures (dll_valid h1 d))
[SMTPat (dll_valid h1 d); SMTPat (B.modifies l h0 h1)] | let auto_dll_remains_valid_upon_staying_unchanged h0 h1 l d =
_lemma_nodelist_contained_in_unmodified_mem h0 h1 l (as_list h1 d);
_lemma_nodelist_conn_in_unmodified_mem h0 h1 l (as_list h1 d) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 63,
"end_line": 890,
"start_col": 0,
"start_line": 888
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "D... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
l: LowStar.Monotonic.Buffer.loc ->
d: DoublyLinkedListIface.dll 'a
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedListIface.dll_valid h0 d /\ LowStar.Monotonic.Buffer.modifies l h0 h1 /\
LowStar.Monoton... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"LowStar.Monotonic.Buffer.loc",
"DoublyLinkedListIface.dll",
"DoublyLinkedListIface._lemma_nodelist_conn_in_unmodified_mem",
"DoublyLinkedListIface.as_list",
"Prims.unit",
"DoublyLinkedListIface._lemma_nodelist_contained_in_unmodified_mem"
] | [] | true | false | true | false | false | let auto_dll_remains_valid_upon_staying_unchanged h0 h1 l d =
| _lemma_nodelist_contained_in_unmodified_mem h0 h1 l (as_list h1 d);
_lemma_nodelist_conn_in_unmodified_mem h0 h1 l (as_list h1 d) | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.domain | val domain (#a: eqtype) (#b: Type u#b) (m: map a b)
: FSet.set a | val domain (#a: eqtype) (#b: Type u#b) (m: map a b)
: FSet.set a | let domain (#a: eqtype) (#b: Type u#b) (m: map a b) : FSet.set a =
let (| keys, _ |) = m in
keys | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 6,
"end_line": 50,
"start_col": 0,
"start_line": 48
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | m: FStar.FiniteMap.Base.map a b -> FStar.FiniteSet.Base.set a | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"FStar.FiniteMap.Base.map",
"FStar.FiniteSet.Base.set",
"FStar.FiniteMap.Base.setfun_t"
] | [] | false | false | false | false | false | let domain (#a: eqtype) (#b: Type u#b) (m: map a b) : FSet.set a =
| let (| keys , _ |) = m in
keys | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.cardinality | val cardinality (#a: eqtype) (#b: Type u#b) (m: map a b)
: GTot nat | val cardinality (#a: eqtype) (#b: Type u#b) (m: map a b)
: GTot nat | let cardinality (#a: eqtype) (#b: Type u#b) (m: map a b) : GTot nat =
FSet.cardinality (domain m) | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 77,
"start_col": 0,
"start_line": 76
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | m: FStar.FiniteMap.Base.map a b -> Prims.GTot Prims.nat | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.eqtype",
"FStar.FiniteMap.Base.map",
"FStar.FiniteSet.Base.cardinality",
"FStar.FiniteMap.Base.domain",
"Prims.nat"
] | [] | false | false | false | false | false | let cardinality (#a: eqtype) (#b: Type u#b) (m: map a b) : GTot nat =
| FSet.cardinality (domain m) | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.values | val values (#a: eqtype) (#b: Type u#b) (m: map a b)
: GTot (b -> prop) | val values (#a: eqtype) (#b: Type u#b) (m: map a b)
: GTot (b -> prop) | let values (#a: eqtype) (#b: Type u#b) (m: map a b) : GTot (b -> prop) =
fun value -> exists key. ((elements m) key == Some value) | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 59,
"end_line": 84,
"start_col": 0,
"start_line": 83
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | m: FStar.FiniteMap.Base.map a b -> Prims.GTot (_: b -> Prims.prop) | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.eqtype",
"FStar.FiniteMap.Base.map",
"Prims.l_Exists",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"FStar.FiniteMap.Base.elements",
"FStar.Pervasives.Native.Some",
"Prims.prop"
] | [] | false | false | false | false | false | let values (#a: eqtype) (#b: Type u#b) (m: map a b) : GTot (b -> prop) =
| fun value -> exists key. ((elements m) key == Some value) | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.items | val items (#a: eqtype) (#b: Type u#b) (m: map a b)
: GTot ((a * b) -> prop) | val items (#a: eqtype) (#b: Type u#b) (m: map a b)
: GTot ((a * b) -> prop) | let items (#a: eqtype) (#b: Type u#b) (m: map a b) : GTot ((a * b) -> prop) =
fun item -> ((elements m) (fst item) == Some (snd item)) | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 91,
"start_col": 0,
"start_line": 90
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | m: FStar.FiniteMap.Base.map a b -> Prims.GTot (_: (a * b) -> Prims.prop) | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.eqtype",
"FStar.FiniteMap.Base.map",
"FStar.Pervasives.Native.tuple2",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"FStar.FiniteMap.Base.elements",
"FStar.Pervasives.Native.fst",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Native.snd",
"Prims.prop"
] | [] | false | false | false | false | false | let items (#a: eqtype) (#b: Type u#b) (m: map a b) : GTot ((a * b) -> prop) =
| fun item -> ((elements m) (fst item) == Some (snd item)) | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.glue | val glue (#a: eqtype) (#b: Type u#b) (keys: FSet.set a) (f: setfun_t a b keys)
: map a b | val glue (#a: eqtype) (#b: Type u#b) (keys: FSet.set a) (f: setfun_t a b keys)
: map a b | let glue (#a: eqtype) (#b: Type u#b) (keys: FSet.set a) (f: setfun_t a b keys) : map a b =
(| keys, f |) | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 15,
"end_line": 105,
"start_col": 0,
"start_line": 104
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | keys: FStar.FiniteSet.Base.set a -> f: FStar.FiniteMap.Base.setfun_t a b keys
-> FStar.FiniteMap.Base.map a b | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"FStar.FiniteSet.Base.set",
"FStar.FiniteMap.Base.setfun_t",
"Prims.Mkdtuple2",
"FStar.FiniteMap.Base.map"
] | [] | false | false | false | false | false | let glue (#a: eqtype) (#b: Type u#b) (keys: FSet.set a) (f: setfun_t a b keys) : map a b =
| (| keys, f |) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface.auto_dll_as_payload_list_staying_unchanged | val auto_dll_as_payload_list_staying_unchanged (h0 h1:HS.mem) (l:B.loc) (d:dll 'a) :
Lemma
(requires (dll_valid h0 d /\
B.modifies l h0 h1 /\
B.loc_disjoint (fp_dll h0 d) l))
(ensures (as_payload_list h1 d == as_payload_list h0 d))
[SMTPat (as_payload_list h1 d); SMTPat (B.mo... | val auto_dll_as_payload_list_staying_unchanged (h0 h1:HS.mem) (l:B.loc) (d:dll 'a) :
Lemma
(requires (dll_valid h0 d /\
B.modifies l h0 h1 /\
B.loc_disjoint (fp_dll h0 d) l))
(ensures (as_payload_list h1 d == as_payload_list h0 d))
[SMTPat (as_payload_list h1 d); SMTPat (B.mo... | let auto_dll_as_payload_list_staying_unchanged h0 h1 loc d =
let rec aux loc nl : Lemma
(requires (
B.modifies loc h0 h1 /\
DLL.nodelist_contained h0 nl /\
B.loc_disjoint (DLL.nodelist_fp0 nl) loc))
(ensures (g_node_vals h0 nl == g_node_vals h1 nl)) =
match nl with
| ... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 924,
"start_col": 0,
"start_line": 914
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "D... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
l: LowStar.Monotonic.Buffer.loc ->
d: DoublyLinkedListIface.dll 'a
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedListIface.dll_valid h0 d /\ LowStar.Monotonic.Buffer.modifies l h0 h1 /\
LowStar.Monoton... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"LowStar.Monotonic.Buffer.loc",
"DoublyLinkedListIface.dll",
"DoublyLinkedListIface.as_list",
"Prims.list",
"DoublyLinkedListIface.node",
"Prims.unit",
"Prims.l_and",
"LowStar.Monotonic.Buffer.modifies",
"DoublyLinkedList.nodelist_contained",
"LowStar.Monotonic.... | [] | false | false | true | false | false | let auto_dll_as_payload_list_staying_unchanged h0 h1 loc d =
| let rec aux loc nl
: Lemma
(requires
(B.modifies loc h0 h1 /\ DLL.nodelist_contained h0 nl /\
B.loc_disjoint (DLL.nodelist_fp0 nl) loc))
(ensures (g_node_vals h0 nl == g_node_vals h1 nl)) =
match nl with
| [] -> ()
| hd :: tl -> aux loc tl
in
aux loc (as_list h1 d) | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.disjoint | val disjoint (#a: eqtype) (#b: Type u#b) (m1: map a b) (m2: map a b)
: prop | val disjoint (#a: eqtype) (#b: Type u#b) (m1: map a b) (m2: map a b)
: prop | let disjoint (#a: eqtype) (#b: Type u#b) (m1: map a b) (m2: map a b) : prop =
FSet.disjoint (domain m1) (domain m2) /\ True | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 47,
"end_line": 146,
"start_col": 0,
"start_line": 145
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | m1: FStar.FiniteMap.Base.map a b -> m2: FStar.FiniteMap.Base.map a b -> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"FStar.FiniteMap.Base.map",
"Prims.l_and",
"FStar.FiniteSet.Base.disjoint",
"FStar.FiniteMap.Base.domain",
"Prims.l_True",
"Prims.prop"
] | [] | false | false | false | false | true | let disjoint (#a: eqtype) (#b: Type u#b) (m1 m2: map a b) : prop =
| FSet.disjoint (domain m1) (domain m2) /\ True | false |
SteelFramingTestSuite.fst | SteelFramingTestSuite.test_if6 | val test_if6 (b: bool) : SteelT ref emp (fun r -> ptr r) | val test_if6 (b: bool) : SteelT ref emp (fun r -> ptr r) | let test_if6 (b:bool) : SteelT ref emp (fun r -> ptr r)
= let r = if b then alloc 0 else alloc 1 in
let x = read r in
write r 0;
r | {
"file_name": "share/steel/tests/SteelFramingTestSuite.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 5,
"end_line": 131,
"start_col": 0,
"start_line": 127
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.Memory.fsti.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "SteelFramingTestSuite.fst"
} | [
{
"abbrev": false,
"full_module": "Steel.Effect.Atomic",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Effect",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Memory",
"short_module": null
},
{
"abbrev": false,
"full_module... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | b: Prims.bool -> Steel.Effect.SteelT SteelFramingTestSuite.ref | Steel.Effect.SteelT | [] | [] | [
"Prims.bool",
"SteelFramingTestSuite.ref",
"Prims.unit",
"SteelFramingTestSuite.write",
"Prims.int",
"SteelFramingTestSuite.read",
"SteelFramingTestSuite.alloc",
"Steel.Effect.Common.emp",
"SteelFramingTestSuite.ptr",
"Steel.Effect.Common.vprop"
] | [] | false | true | false | false | false | let test_if6 (b: bool) : SteelT ref emp (fun r -> ptr r) =
| let r = if b then alloc 0 else alloc 1 in
let x = read r in
write r 0;
r | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.equal | val equal (#a: eqtype) (#b: Type u#b) (m1: map a b) (m2: map a b)
: prop | val equal (#a: eqtype) (#b: Type u#b) (m1: map a b) (m2: map a b)
: prop | let equal (#a: eqtype) (#b: Type u#b) (m1: map a b) (m2: map a b) : prop =
feq (elements m1) (elements m2) /\ True | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 139,
"start_col": 0,
"start_line": 138
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | m1: FStar.FiniteMap.Base.map a b -> m2: FStar.FiniteMap.Base.map a b -> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"FStar.FiniteMap.Base.map",
"Prims.l_and",
"FStar.FunctionalExtensionality.feq",
"FStar.Pervasives.Native.option",
"FStar.FiniteMap.Base.elements",
"Prims.l_True",
"Prims.prop"
] | [] | false | false | false | false | true | let equal (#a: eqtype) (#b: Type u#b) (m1 m2: map a b) : prop =
| feq (elements m1) (elements m2) /\ True | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface.auto_node_in_list_is_valid | val auto_node_in_list_is_valid (h0:HS.mem) (n:node 'a) (d:dll 'a) :
Lemma
(requires (dll_valid h0 d /\
n `L.memP` as_list h0 d))
(ensures (node_valid h0 n))
[SMTPat (node_valid h0 n);
SMTPat (dll_valid h0 d)] | val auto_node_in_list_is_valid (h0:HS.mem) (n:node 'a) (d:dll 'a) :
Lemma
(requires (dll_valid h0 d /\
n `L.memP` as_list h0 d))
(ensures (node_valid h0 n))
[SMTPat (node_valid h0 n);
SMTPat (dll_valid h0 d)] | let auto_node_in_list_is_valid h0 n d =
DLL.extract_nodelist_contained h0 (as_list h0 d) (as_list h0 d `L.index_of` n) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 80,
"end_line": 939,
"start_col": 0,
"start_line": 938
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "D... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
n: DoublyLinkedListIface.node 'a ->
d: DoublyLinkedListIface.dll 'a
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedListIface.dll_valid h0 d /\
FStar.List.Tot.Base.memP n (DoublyLinkedListIface.as_list h0 d))
(ensures DoublyLinkedListIface... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedListIface.node",
"DoublyLinkedListIface.dll",
"DoublyLinkedList.extract_nodelist_contained",
"DoublyLinkedListIface.as_list",
"FStar.List.Tot.Properties.index_of",
"Prims.unit"
] | [] | true | false | true | false | false | let auto_node_in_list_is_valid h0 n d =
| DLL.extract_nodelist_contained h0 (as_list h0 d) ((as_list h0 d) `L.index_of` n) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface.auto_node_in_list_is_included | val auto_node_in_list_is_included (h0:HS.mem) (n:node 'a) (d:dll 'a) :
Lemma
(requires (dll_valid h0 d /\
n `L.memP` as_list h0 d))
(ensures (B.loc_includes (fp_dll h0 d) (fp_node n)))
[SMTPat (B.loc_includes (fp_dll h0 d) (fp_node n))] | val auto_node_in_list_is_included (h0:HS.mem) (n:node 'a) (d:dll 'a) :
Lemma
(requires (dll_valid h0 d /\
n `L.memP` as_list h0 d))
(ensures (B.loc_includes (fp_dll h0 d) (fp_node n)))
[SMTPat (B.loc_includes (fp_dll h0 d) (fp_node n))] | let auto_node_in_list_is_included h0 n d =
_lemma_node_in_list_is_included n (as_list h0 d) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 936,
"start_col": 0,
"start_line": 935
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "D... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
n: DoublyLinkedListIface.node 'a ->
d: DoublyLinkedListIface.dll 'a
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedListIface.dll_valid h0 d /\
FStar.List.Tot.Base.memP n (DoublyLinkedListIface.as_list h0 d))
(ensures
LowStar.Monot... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedListIface.node",
"DoublyLinkedListIface.dll",
"DoublyLinkedListIface._lemma_node_in_list_is_included",
"DoublyLinkedListIface.as_list",
"Prims.unit"
] | [] | true | false | true | false | false | let auto_node_in_list_is_included h0 n d =
| _lemma_node_in_list_is_included n (as_list h0 d) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface.auto_unchanged_node_connections_list_unchanged | val auto_unchanged_node_connections_list_unchanged (h0 h1:HS.mem) (d:dll 'a) (n:node 'a) :
Lemma
(requires (dll_valid h0 d /\
n `L.memP` as_list h0 d /\
B.modifies (fp_node n) h0 h1 /\
unchanged_node_connections h0 h1 n))
(ensures (as_list h1 d == as_list h0 d))
... | val auto_unchanged_node_connections_list_unchanged (h0 h1:HS.mem) (d:dll 'a) (n:node 'a) :
Lemma
(requires (dll_valid h0 d /\
n `L.memP` as_list h0 d /\
B.modifies (fp_node n) h0 h1 /\
unchanged_node_connections h0 h1 n))
(ensures (as_list h1 d == as_list h0 d))
... | let auto_unchanged_node_connections_list_unchanged h0 h1 d n =
assert (B.loc_disjoint (B.loc_buffer d) (DLL.dll_fp0 (d@h0)));
DLL.extract_nodelist_fp0 (as_list h0 d) (as_list h0 d `L.index_of` n);
assert (B.loc_disjoint (B.loc_buffer d) (B.loc_buffer n)) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 59,
"end_line": 951,
"start_col": 0,
"start_line": 948
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "D... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
d: DoublyLinkedListIface.dll 'a ->
n: DoublyLinkedListIface.node 'a
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedListIface.dll_valid h0 d /\
FStar.List.Tot.Base.memP n (DoublyLinkedListIface.as_list h... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedListIface.dll",
"DoublyLinkedListIface.node",
"Prims._assert",
"LowStar.Monotonic.Buffer.loc_disjoint",
"LowStar.Monotonic.Buffer.loc_buffer",
"DoublyLinkedList.dll",
"LowStar.Buffer.trivial_preorder",
"DoublyLinkedList.node",
"Prims.unit",
"DoublyL... | [] | true | false | true | false | false | let auto_unchanged_node_connections_list_unchanged h0 h1 d n =
| assert (B.loc_disjoint (B.loc_buffer d) (DLL.dll_fp0 (d @ h0)));
DLL.extract_nodelist_fp0 (as_list h0 d) ((as_list h0 d) `L.index_of` n);
assert (B.loc_disjoint (B.loc_buffer d) (B.loc_buffer n)) | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.elements | val elements (#a: eqtype) (#b: Type u#b) (m: map a b)
: setfun_t a b (domain m) | val elements (#a: eqtype) (#b: Type u#b) (m: map a b)
: setfun_t a b (domain m) | let elements (#a: eqtype) (#b: Type u#b) (m: map a b) : (setfun_t a b (domain m)) =
let (| _, f |) = m in
f | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 55,
"start_col": 0,
"start_line": 53
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | m: FStar.FiniteMap.Base.map a b -> FStar.FiniteMap.Base.setfun_t a b (FStar.FiniteMap.Base.domain m) | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"FStar.FiniteMap.Base.map",
"FStar.FiniteSet.Base.set",
"FStar.FiniteMap.Base.setfun_t",
"FStar.FiniteMap.Base.domain"
] | [] | false | false | false | false | false | let elements (#a: eqtype) (#b: Type u#b) (m: map a b) : (setfun_t a b (domain m)) =
| let (| _ , f |) = m in
f | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.map_as_list | val map_as_list (#a: eqtype) (#b: Type u#b) (m: map a b)
: GTot (items: list (a * b){item_list_doesnt_repeat_keys items /\ (forall key. key_in_item_list key items <==> mem key m)}) | val map_as_list (#a: eqtype) (#b: Type u#b) (m: map a b)
: GTot (items: list (a * b){item_list_doesnt_repeat_keys items /\ (forall key. key_in_item_list key items <==> mem key m)}) | let map_as_list (#a: eqtype) (#b: Type u#b) (m: map a b)
: GTot (items: list (a * b){item_list_doesnt_repeat_keys items /\ (forall key. key_in_item_list key items <==> mem key m)}) =
key_list_to_item_list m (FSet.set_as_list (domain m)) | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 55,
"end_line": 70,
"start_col": 0,
"start_line": 68
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | m: FStar.FiniteMap.Base.map a b
-> Prims.GTot
(items:
Prims.list (a * b)
{ FStar.FiniteMap.Base.item_list_doesnt_repeat_keys items /\
(forall (key: a).
FStar.FiniteMap.Base.key_in_item_list key items <==> FStar.FiniteMap.Base.mem key m) }
) | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.eqtype",
"FStar.FiniteMap.Base.map",
"FStar.FiniteMap.Base.key_list_to_item_list",
"FStar.FiniteSet.Base.set_as_list",
"FStar.FiniteMap.Base.domain",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"Prims.l_and",
"Prims.b2t",
"FStar.FiniteMap.Base.item_list_doesnt_repeat_keys",
"Prims.l_F... | [] | false | false | false | false | false | let map_as_list (#a: eqtype) (#b: Type u#b) (m: map a b)
: GTot
(items:
list (a * b)
{ item_list_doesnt_repeat_keys items /\
(forall key. key_in_item_list key items <==> mem key m) }) =
| key_list_to_item_list m (FSet.set_as_list (domain m)) | false |
Hacl.Impl.K256.PointAdd.fst | Hacl.Impl.K256.PointAdd.point_add_no_alloc | val point_add_no_alloc (out p q:point) (tmp:lbuffer uint64 (9ul *! nlimb)) : Stack unit
(requires fun h ->
live h out /\ live h p /\ live h q /\ live h tmp /\
eq_or_disjoint out p /\ eq_or_disjoint out q /\ eq_or_disjoint p q /\
disjoint p tmp /\ disjoint q tmp /\ disjoint out tmp /\
point_inv h p /\ ... | val point_add_no_alloc (out p q:point) (tmp:lbuffer uint64 (9ul *! nlimb)) : Stack unit
(requires fun h ->
live h out /\ live h p /\ live h q /\ live h tmp /\
eq_or_disjoint out p /\ eq_or_disjoint out q /\ eq_or_disjoint p q /\
disjoint p tmp /\ disjoint q tmp /\ disjoint out tmp /\
point_inv h p /\ ... | let point_add_no_alloc out p q tmp =
let x1, y1, z1 = getx p, gety p, getz p in
let x2, y2, z2 = getx q, gety q, getz q in
let x3, y3, z3 = getx out, gety out, getz out in
let xx = sub tmp 0ul nlimb in
let yy = sub tmp nlimb nlimb in
let zz = sub tmp (2ul *! nlimb) nlimb in
let xy_pairs = sub tmp (3ul *... | {
"file_name": "code/k256/Hacl.Impl.K256.PointAdd.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 48,
"end_line": 226,
"start_col": 0,
"start_line": 174
} | module Hacl.Impl.K256.PointAdd
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module S = Spec.K256
module BL = Hacl.Spec.K256.Field52.Lemmas
open Hacl.K256.Field
open Hacl.Impl.K256.Point
#set-options "--z3rlimit 100 --fuel 0 --ifuel... | {
"checked_file": "/",
"dependencies": [
"Spec.K256.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.K256.Field52.Lemmas.fsti.checked",
"Hacl.K256.Field.fsti.checked",
"Hacl.Impl.K256.Point.fsti.checked",
"FStar.UInt32.fsti.checked... | [
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Point",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.K256.Field",
"short_module": null
},
{
"abbrev": true,
"full_module": "Hacl.Spec.K256.Field52.Lemmas",
"short_module": "BL"
},
{
"abbrev": tru... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
out: Hacl.Impl.K256.Point.point ->
p: Hacl.Impl.K256.Point.point ->
q: Hacl.Impl.K256.Point.point ->
tmp: Lib.Buffer.lbuffer Lib.IntTypes.uint64 (9ul *! Hacl.K256.Field.nlimb)
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.K256.Point.point",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint64",
"Lib.IntTypes.op_Star_Bang",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"FStar.UInt32.__uint_to_t",
"Hacl.K256.Field.nlimb",
"Hacl.K256.Field.felem",
"Hacl.Impl.K256.PointAdd.ab_plus_cd",
"Prims.unit",
"Hacl.Impl.K256.Poin... | [] | false | true | false | false | false | let point_add_no_alloc out p q tmp =
| let x1, y1, z1 = getx p, gety p, getz p in
let x2, y2, z2 = getx q, gety q, getz q in
let x3, y3, z3 = getx out, gety out, getz out in
let xx = sub tmp 0ul nlimb in
let yy = sub tmp nlimb nlimb in
let zz = sub tmp (2ul *! nlimb) nlimb in
let xy_pairs = sub tmp (3ul *! nlimb) nlimb in
let yz_pairs = sub tmp (4ul *! nlim... | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.emptymap | val emptymap (#a: eqtype) (#b: Type u#b)
: map a b | val emptymap (#a: eqtype) (#b: Type u#b)
: map a b | let emptymap (#a: eqtype) (#b: Type u#b) : (map a b) =
(| FSet.emptyset, on_domain a (fun key -> None) |) | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 98,
"start_col": 0,
"start_line": 97
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | FStar.FiniteMap.Base.map a b | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"Prims.Mkdtuple2",
"FStar.FiniteSet.Base.set",
"FStar.FiniteMap.Base.setfun_t",
"FStar.FiniteSet.Base.emptyset",
"FStar.FunctionalExtensionality.on_domain",
"FStar.Pervasives.Native.option",
"FStar.Pervasives.Native.None",
"FStar.FiniteMap.Base.map"
] | [] | false | false | false | false | false | let emptymap (#a: eqtype) (#b: Type u#b) : (map a b) =
| (| FSet.emptyset, on_domain a (fun key -> None) |) | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.key_list_to_item_list | val key_list_to_item_list
(#a: eqtype)
(#b: Type u#b)
(m: map a b)
(keys:
list a
{ FSet.list_nonrepeating keys /\
(forall key. FLT.mem key keys ==> FSet.mem key (domain m)) })
: GTot
(items:
list (a * b)
{ item_list_doesnt_repeat_ke... | val key_list_to_item_list
(#a: eqtype)
(#b: Type u#b)
(m: map a b)
(keys:
list a
{ FSet.list_nonrepeating keys /\
(forall key. FLT.mem key keys ==> FSet.mem key (domain m)) })
: GTot
(items:
list (a * b)
{ item_list_doesnt_repeat_ke... | let rec key_list_to_item_list
(#a: eqtype)
(#b: Type u#b)
(m: map a b)
(keys: list a{FSet.list_nonrepeating keys /\ (forall key. FLT.mem key keys ==> FSet.mem key (domain m))})
: GTot (items: list (a * b){item_list_doesnt_repeat_keys items /\ (forall key. FLT.mem key keys <==> key_in_item_list key items)})
... | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 104,
"end_line": 66,
"start_col": 0,
"start_line": 57
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
m: FStar.FiniteMap.Base.map a b ->
keys:
Prims.list a
{ FStar.FiniteSet.Base.list_nonrepeating keys /\
(forall (key: a).
FStar.List.Tot.Base.mem key keys ==>
FStar.FiniteSet.Base.mem key (FStar.FiniteMap.Base.domain m)) }
-> Prims.GTot
(items:
Pri... | Prims.GTot | [
"sometrivial",
""
] | [] | [
"Prims.eqtype",
"FStar.FiniteMap.Base.map",
"Prims.list",
"Prims.l_and",
"Prims.b2t",
"FStar.FiniteSet.Base.list_nonrepeating",
"Prims.l_Forall",
"Prims.l_imp",
"FStar.List.Tot.Base.mem",
"FStar.FiniteSet.Base.mem",
"FStar.FiniteMap.Base.domain",
"Prims.Nil",
"FStar.Pervasives.Native.tuple2"... | [
"recursion"
] | false | false | false | false | false | let rec key_list_to_item_list
(#a: eqtype)
(#b: Type u#b)
(m: map a b)
(keys:
list a
{ FSet.list_nonrepeating keys /\
(forall key. FLT.mem key keys ==> FSet.mem key (domain m)) })
: GTot
(items:
list (a * b)
{ item_list_doesnt_repea... | match keys with
| [] -> []
| key :: remaining_keys ->
(key, Some?.v ((elements m) key)) :: key_list_to_item_list m remaining_keys | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.merge | val merge (#a: eqtype) (#b: Type u#b) (m1: map a b) (m2: map a b)
: map a b | val merge (#a: eqtype) (#b: Type u#b) (m1: map a b) (m2: map a b)
: map a b | let merge (#a: eqtype) (#b: Type u#b) (m1: map a b) (m2: map a b) : map a b =
let keys' = FSet.union (domain m1) (domain m2) in
let f' = on_domain a (fun key -> if FSet.mem key (domain m2) then (elements m2) key else (elements m1) key) in
(| keys', f' |) | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 123,
"start_col": 0,
"start_line": 120
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | m1: FStar.FiniteMap.Base.map a b -> m2: FStar.FiniteMap.Base.map a b -> FStar.FiniteMap.Base.map a b | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"FStar.FiniteMap.Base.map",
"Prims.Mkdtuple2",
"FStar.FiniteSet.Base.set",
"FStar.FiniteMap.Base.setfun_t",
"FStar.Pervasives.Native.option",
"FStar.FunctionalExtensionality.on_domain",
"FStar.FiniteSet.Base.mem",
"FStar.FiniteMap.Base.domain",
"FStar.FiniteMap.Base.elements",
"P... | [] | false | false | false | false | false | let merge (#a: eqtype) (#b: Type u#b) (m1 m2: map a b) : map a b =
| let keys' = FSet.union (domain m1) (domain m2) in
let f' =
on_domain a (fun key -> if FSet.mem key (domain m2) then (elements m2) key else (elements m1) key)
in
(| keys', f' |) | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.choose | val choose (#a: eqtype) (#b: Type u#b) (m: map a b{exists key. mem key m})
: GTot (key: a{mem key m}) | val choose (#a: eqtype) (#b: Type u#b) (m: map a b{exists key. mem key m})
: GTot (key: a{mem key m}) | let choose (#a: eqtype) (#b: Type u#b) (m: map a b{exists key. mem key m}) : GTot (key: a{mem key m}) =
FSet.choose (domain m) | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 153,
"start_col": 0,
"start_line": 152
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | m: FStar.FiniteMap.Base.map a b {exists (key: a). FStar.FiniteMap.Base.mem key m}
-> Prims.GTot (key: a{FStar.FiniteMap.Base.mem key m}) | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.eqtype",
"FStar.FiniteMap.Base.map",
"Prims.l_Exists",
"Prims.b2t",
"FStar.FiniteMap.Base.mem",
"FStar.FiniteSet.Base.choose",
"FStar.FiniteMap.Base.domain"
] | [] | false | false | false | false | false | let choose (#a: eqtype) (#b: Type u#b) (m: map a b {exists key. mem key m})
: GTot (key: a{mem key m}) =
| FSet.choose (domain m) | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.subtract | val subtract (#a: eqtype) (#b: Type u#b) (m: map a b) (s: FSet.set a)
: map a b | val subtract (#a: eqtype) (#b: Type u#b) (m: map a b) (s: FSet.set a)
: map a b | let subtract (#a: eqtype) (#b: Type u#b) (m: map a b) (s: FSet.set a) : map a b =
let keys' = FSet.difference (domain m) s in
let f' = on_domain a (fun key -> if FSet.mem key keys' then (elements m) key else None) in
(| keys', f' |) | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 132,
"start_col": 0,
"start_line": 129
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | m: FStar.FiniteMap.Base.map a b -> s: FStar.FiniteSet.Base.set a -> FStar.FiniteMap.Base.map a b | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"FStar.FiniteMap.Base.map",
"FStar.FiniteSet.Base.set",
"Prims.Mkdtuple2",
"FStar.FiniteMap.Base.setfun_t",
"FStar.Pervasives.Native.option",
"FStar.FunctionalExtensionality.on_domain",
"FStar.FiniteSet.Base.mem",
"FStar.FiniteMap.Base.elements",
"Prims.bool",
"FStar.Pervasives.N... | [] | false | false | false | false | false | let subtract (#a: eqtype) (#b: Type u#b) (m: map a b) (s: FSet.set a) : map a b =
| let keys' = FSet.difference (domain m) s in
let f' = on_domain a (fun key -> if FSet.mem key keys' then (elements m) key else None) in
(| keys', f' |) | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.empty_or_domain_occupied_lemma | val empty_or_domain_occupied_lemma: Prims.unit -> Lemma (empty_or_domain_occupied_fact u#b) | val empty_or_domain_occupied_lemma: Prims.unit -> Lemma (empty_or_domain_occupied_fact u#b) | let empty_or_domain_occupied_lemma ()
: Lemma (empty_or_domain_occupied_fact u#b)
= introduce forall (a: eqtype) (b:Type u#b) (m: map a b). m == emptymap \/ (exists k. mem k m)
with (
if FSet.cardinality (domain m) = 0 then
introduce m == emptymap \/ (exists k. mem k m)
with Left (
ass... | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 180,
"start_col": 0,
"start_line": 167
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.Pervasives.Lemma (ensures FStar.FiniteMap.Base.empty_or_domain_occupied_fact) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.unit",
"FStar.Classical.Sugar.forall_intro",
"Prims.eqtype",
"Prims.l_Forall",
"FStar.FiniteMap.Base.map",
"Prims.l_or",
"Prims.eq2",
"FStar.FiniteMap.Base.emptymap",
"Prims.l_Exists",
"Prims.b2t",
"FStar.FiniteMap.Base.mem",
"Prims.op_Equality",
"Prims.int",
"FStar.FiniteSet.Base.c... | [] | false | false | true | false | false | let empty_or_domain_occupied_lemma () : Lemma (empty_or_domain_occupied_fact u#b) =
| introduce forall (a: eqtype) (b: Type u#b) (m: map a b) . m == emptymap \/ (exists k. mem k m)
with (if FSet.cardinality (domain m) = 0
then
introduce m == emptymap \/ (exists k. mem k m)
with Left (assert (cardinality m = 0);
cardinality_zero_iff_empty_lemma ())
else
introduce m == emptymap \/ (e... | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.insert | val insert (#a: eqtype) (#b: Type u#b) (k: a) (v: b) (m: map a b)
: map a b | val insert (#a: eqtype) (#b: Type u#b) (k: a) (v: b) (m: map a b)
: map a b | let insert (#a: eqtype) (#b: Type u#b) (k: a) (v: b) (m: map a b) : map a b =
let keys' = FSet.insert k (domain m) in
let f' = on_domain a (fun key -> if key = k then Some v else (elements m) key) in
(| keys', f' |) | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 114,
"start_col": 0,
"start_line": 111
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | k: a -> v: b -> m: FStar.FiniteMap.Base.map a b -> FStar.FiniteMap.Base.map a b | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"FStar.FiniteMap.Base.map",
"Prims.Mkdtuple2",
"FStar.FiniteSet.Base.set",
"FStar.FiniteMap.Base.setfun_t",
"FStar.Pervasives.Native.option",
"FStar.FunctionalExtensionality.on_domain",
"Prims.op_Equality",
"FStar.Pervasives.Native.Some",
"Prims.bool",
"FStar.FiniteMap.Base.eleme... | [] | false | false | false | false | false | let insert (#a: eqtype) (#b: Type u#b) (k: a) (v: b) (m: map a b) : map a b =
| let keys' = FSet.insert k (domain m) in
let f' = on_domain a (fun key -> if key = k then Some v else (elements m) key) in
(| keys', f' |) | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface.auto_unchanged_node_connections_dll_valid | val auto_unchanged_node_connections_dll_valid (h0 h1:HS.mem) (d:dll 'a) (n:node 'a) :
Lemma
(requires (dll_valid h0 d /\
n `L.memP` as_list h0 d /\
B.modifies (fp_node n) h0 h1 /\
unchanged_node_connections h0 h1 n))
(ensures (dll_valid h1 d))
[SMTPat (dll_vali... | val auto_unchanged_node_connections_dll_valid (h0 h1:HS.mem) (d:dll 'a) (n:node 'a) :
Lemma
(requires (dll_valid h0 d /\
n `L.memP` as_list h0 d /\
B.modifies (fp_node n) h0 h1 /\
unchanged_node_connections h0 h1 n))
(ensures (dll_valid h1 d))
[SMTPat (dll_vali... | let auto_unchanged_node_connections_dll_valid h0 h1 d (n:node 'a) =
DLL.extract_nodelist_fp0 (as_list h0 d) (as_list h0 d `L.index_of` n);
assert (d@h0 == d@h1);
assert (as_list h0 d == as_list h1 d);
let rec aux1 #nl' (nl:list (node 'a)) :
Lemma
(requires (
(B.modifies (B.loc_buffer n) h0 h... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 1025,
"start_col": 0,
"start_line": 955
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "D... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
d: DoublyLinkedListIface.dll 'a ->
n: DoublyLinkedListIface.node 'a
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedListIface.dll_valid h0 d /\
FStar.List.Tot.Base.memP n (DoublyLinkedListIface.as_list h... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedListIface.dll",
"DoublyLinkedListIface.node",
"FStar.Classical.arrow_to_impl",
"Prims.l_not",
"Prims.eq2",
"LowStar.Buffer.buffer",
"DoublyLinkedList.node",
"Prims.l_or",
"Prims.int",
"LowStar.Monotonic.Buffer.length",
"LowStar.Buffer.trivial_preo... | [] | false | false | true | false | false | let auto_unchanged_node_connections_dll_valid h0 h1 d (n: node 'a) =
| DLL.extract_nodelist_fp0 (as_list h0 d) ((as_list h0 d) `L.index_of` n);
assert (d @ h0 == d @ h1);
assert (as_list h0 d == as_list h1 d);
let rec aux1 #nl' (nl: list (node 'a))
: Lemma
(requires
((B.modifies (B.loc_buffer n) h0 h1) /\ (DLL.nodelist_contained h0 nl) /\
(DLL.nodelist_aa_r nl)... | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.map_equal_lemma | val map_equal_lemma: Prims.unit -> Lemma (map_equal_fact u#b) | val map_equal_lemma: Prims.unit -> Lemma (map_equal_fact u#b) | let map_equal_lemma ()
: Lemma (map_equal_fact u#b) //Surprising; needed to split this goal into two
= assert (map_equal_fact u#b)
by (T.norm [delta_only [`%map_equal_fact]];
let _ = T.forall_intro () in
let _ = T.forall_intro () in
let _ = T.forall_intro () in
let _ = T.for... | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 16,
"end_line": 282,
"start_col": 0,
"start_line": 272
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.Pervasives.Lemma (ensures FStar.FiniteMap.Base.map_equal_fact) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.unit",
"FStar.Tactics.Effect.assert_by_tactic",
"FStar.FiniteMap.Base.map_equal_fact",
"FStar.Tactics.V2.Derived.smt",
"FStar.Tactics.V2.Logic.split",
"FStar.Tactics.NamedView.binding",
"FStar.Tactics.V2.Logic.forall_intro",
"FStar.Stubs.Tactics.V2.Builtins.norm",
"Prims.Cons",
"FStar.Perva... | [] | false | false | true | false | false | let map_equal_lemma () : Lemma (map_equal_fact u#b) =
| FStar.Tactics.Effect.assert_by_tactic (map_equal_fact u#b)
(fun _ ->
();
(T.norm [delta_only [`%map_equal_fact]];
let _ = T.forall_intro () in
let _ = T.forall_intro () in
let _ = T.forall_intro () in
let _ = T.forall_intro () in
T.split ();
T.smt ();
... | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.all_finite_map_facts_lemma | val all_finite_map_facts_lemma (_:unit)
: Lemma (all_finite_map_facts u#b) | val all_finite_map_facts_lemma (_:unit)
: Lemma (all_finite_map_facts u#b) | let all_finite_map_facts_lemma (_:unit)
: Lemma (all_finite_map_facts u#b)
= cardinality_zero_iff_empty_lemma u#b ();
empty_or_domain_occupied_lemma u#b ();
empty_or_values_occupied_lemma u#b ();
empty_or_items_occupied_lemma u#b ();
map_cardinality_matches_domain_lemma u#b ();
values_contains_l... | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 25,
"end_line": 321,
"start_col": 0,
"start_line": 300
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.Pervasives.Lemma (ensures FStar.FiniteMap.Base.all_finite_map_facts) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.unit",
"FStar.FiniteMap.Base.disjoint_lemma",
"FStar.FiniteMap.Base.map_extensionality_lemma",
"FStar.FiniteMap.Base.map_equal_lemma",
"FStar.FiniteMap.Base.subtract_element_lemma",
"FStar.FiniteMap.Base.subtract_domain_lemma",
"FStar.FiniteMap.Base.merge_element_lemma",
"FStar.FiniteMap.Base.m... | [] | true | false | true | false | false | let all_finite_map_facts_lemma (_: unit) : Lemma (all_finite_map_facts u#b) =
| cardinality_zero_iff_empty_lemma u#b ();
empty_or_domain_occupied_lemma u#b ();
empty_or_values_occupied_lemma u#b ();
empty_or_items_occupied_lemma u#b ();
map_cardinality_matches_domain_lemma u#b ();
values_contains_lemma u#b ();
items_contains_lemma u#b ();
empty_domain_empty_lemma u#b ();
glue_domain_lemma u#b ();
... | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.empty_or_items_occupied_lemma | val empty_or_items_occupied_lemma: Prims.unit -> Lemma (empty_or_items_occupied_fact u#b) | val empty_or_items_occupied_lemma: Prims.unit -> Lemma (empty_or_items_occupied_fact u#b) | let empty_or_items_occupied_lemma ()
: Lemma (empty_or_items_occupied_fact u#b) =
introduce forall (a: eqtype) (b: Type u#b) (m: map a b). m == emptymap \/ (exists item. (items m) item)
with
if FSet.cardinality (domain m) = 0 then
introduce m == emptymap \/ (exists v. (values m) v)
with Left (
... | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 7,
"end_line": 217,
"start_col": 0,
"start_line": 201
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.Pervasives.Lemma (ensures FStar.FiniteMap.Base.empty_or_items_occupied_fact) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.unit",
"FStar.Classical.Sugar.forall_intro",
"Prims.eqtype",
"Prims.l_Forall",
"FStar.FiniteMap.Base.map",
"Prims.l_or",
"Prims.eq2",
"FStar.FiniteMap.Base.emptymap",
"Prims.l_Exists",
"FStar.Pervasives.Native.tuple2",
"FStar.FiniteMap.Base.items",
"Prims.op_Equality",
"Prims.int",
... | [] | false | false | true | false | false | let empty_or_items_occupied_lemma () : Lemma (empty_or_items_occupied_fact u#b) =
| introduce forall (a: eqtype) (b: Type u#b) (m: map a b) . m == emptymap \/
(exists item. (items m) item)
with if FSet.cardinality (domain m) = 0
then
introduce m == emptymap \/ (exists v. (values m) v)
with Left (assert (cardinality m = 0);
cardinality_zero_iff_empty_lemma u#b ())
else
introduce m == emptymap... | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.empty_or_values_occupied_lemma | val empty_or_values_occupied_lemma: Prims.unit -> Lemma (empty_or_values_occupied_fact u#b) | val empty_or_values_occupied_lemma: Prims.unit -> Lemma (empty_or_values_occupied_fact u#b) | let empty_or_values_occupied_lemma ()
: Lemma (empty_or_values_occupied_fact u#b) =
introduce forall (a: eqtype) (b:Type u#b) (m: map a b). m == emptymap \/ (exists v. (values m) v)
with
if FSet.cardinality (domain m) = 0 then
introduce m == emptymap \/ (exists v. (values m) v)
with Left (
a... | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 7,
"end_line": 199,
"start_col": 0,
"start_line": 183
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.Pervasives.Lemma (ensures FStar.FiniteMap.Base.empty_or_values_occupied_fact) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.unit",
"FStar.Classical.Sugar.forall_intro",
"Prims.eqtype",
"Prims.l_Forall",
"FStar.FiniteMap.Base.map",
"Prims.l_or",
"Prims.eq2",
"FStar.FiniteMap.Base.emptymap",
"Prims.l_Exists",
"FStar.FiniteMap.Base.values",
"Prims.op_Equality",
"Prims.int",
"FStar.FiniteSet.Base.cardinality",... | [] | false | false | true | false | false | let empty_or_values_occupied_lemma () : Lemma (empty_or_values_occupied_fact u#b) =
| introduce forall (a: eqtype) (b: Type u#b) (m: map a b) . m == emptymap \/ (exists v. (values m) v)
with if FSet.cardinality (domain m) = 0
then
introduce m == emptymap \/ (exists v. (values m) v)
with Left (assert (cardinality m = 0);
cardinality_zero_iff_empty_lemma u#b ())
else
introduce m == emptymap \/ (... | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.cardinality_zero_iff_empty_lemma | val cardinality_zero_iff_empty_lemma: Prims.unit -> Lemma (cardinality_zero_iff_empty_fact u#b) | val cardinality_zero_iff_empty_lemma: Prims.unit -> Lemma (cardinality_zero_iff_empty_fact u#b) | let cardinality_zero_iff_empty_lemma ()
: Lemma (cardinality_zero_iff_empty_fact u#b) =
introduce forall (a: eqtype) (b:Type u#b) (m: map a b). cardinality m = 0 <==> m == emptymap
with (
introduce cardinality m = 0 ==> m == emptymap
with _. assert (feq (elements m) (elements emptymap))
) | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 164,
"start_col": 0,
"start_line": 158
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit
-> FStar.Pervasives.Lemma (ensures FStar.FiniteMap.Base.cardinality_zero_iff_empty_fact) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.unit",
"FStar.Classical.Sugar.forall_intro",
"Prims.eqtype",
"Prims.l_Forall",
"FStar.FiniteMap.Base.map",
"Prims.l_iff",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"FStar.FiniteMap.Base.cardinality",
"Prims.eq2",
"FStar.FiniteMap.Base.emptymap",
"FStar.Classical.Sugar.implies_int... | [] | false | false | true | false | false | let cardinality_zero_iff_empty_lemma () : Lemma (cardinality_zero_iff_empty_fact u#b) =
| introduce forall (a: eqtype) (b: Type u#b) (m: map a b) . cardinality m = 0 <==> m == emptymap
with (introduce cardinality m = 0 ==> m == emptymap
with _. assert (feq (elements m) (elements emptymap))) | false |
Vale.AES.Types_helpers.fsti | Vale.AES.Types_helpers.pow2_24 | val pow2_24 : Prims.int | let pow2_24 = 0x1000000 | {
"file_name": "vale/code/crypto/aes/Vale.AES.Types_helpers.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 30,
"end_line": 12,
"start_col": 7,
"start_line": 12
} | module Vale.AES.Types_helpers
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open FStar.Mul
open FStar.Seq
open Vale.Lib.Seqs | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.Types.fsti.checked",
"pr... | [
{
"abbrev": false,
"full_module": "Vale.Lib.Seqs",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arc... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.int | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | false | let pow2_24 =
| 0x1000000 | false | |
Vale.AES.Types_helpers.fsti | Vale.AES.Types_helpers.nat24 | val nat24 : Type0 | let nat24 = natN pow2_24 | {
"file_name": "vale/code/crypto/aes/Vale.AES.Types_helpers.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 24,
"end_line": 13,
"start_col": 0,
"start_line": 13
} | module Vale.AES.Types_helpers
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open FStar.Mul
open FStar.Seq
open Vale.Lib.Seqs | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.Types.fsti.checked",
"pr... | [
{
"abbrev": false,
"full_module": "Vale.Lib.Seqs",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arc... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Words_s.natN",
"Vale.AES.Types_helpers.pow2_24"
] | [] | false | false | false | true | true | let nat24 =
| natN pow2_24 | false | |
DoublyLinkedListIface.fst | DoublyLinkedListIface.dll_insert_at_head | val dll_insert_at_head (#t:Type0) (d:dll t) (n:node t) :
HST.Stack unit
(requires (fun h0 -> dll_valid h0 d /\ node_valid h0 n /\ (fp_node n `B.loc_disjoint` fp_dll h0 d)))
(ensures (fun h0 () h1 ->
B.modifies (fp_dll h1 d) h0 h1 /\
fp_dll h1 d `loc_equiv` B.loc_union (fp_dll h0 d) (fp_node ... | val dll_insert_at_head (#t:Type0) (d:dll t) (n:node t) :
HST.Stack unit
(requires (fun h0 -> dll_valid h0 d /\ node_valid h0 n /\ (fp_node n `B.loc_disjoint` fp_dll h0 d)))
(ensures (fun h0 () h1 ->
B.modifies (fp_dll h1 d) h0 h1 /\
fp_dll h1 d `loc_equiv` B.loc_union (fp_dll h0 d) (fp_node ... | let dll_insert_at_head #t d n =
let h00 = HST.get () in
HST.push_frame ();
let h0 = HST.get () in
let y = DLL.dll_insert_at_head (!*d) n in
let h' = HST.get () in
d *= y;
let h1 = HST.get () in
_lemma_unchanged_node_vals_transitive h0 h' h1 (as_list h1 d);
HST.pop_frame ();
let h11 = HST.get () in
... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 69,
"end_line": 579,
"start_col": 0,
"start_line": 568
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "D... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 2,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | d: DoublyLinkedListIface.dll t -> n: DoublyLinkedListIface.node t
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"DoublyLinkedListIface.dll",
"DoublyLinkedListIface.node",
"DoublyLinkedListIface._lemma_unchanged_node_vals_maintains_changes",
"DoublyLinkedListIface.as_list",
"Prims.unit",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get",
"FStar.HyperStack.ST.pop_frame",
"DoublyLinkedListIface._lemma_... | [] | false | true | false | false | false | let dll_insert_at_head #t d n =
| let h00 = HST.get () in
HST.push_frame ();
let h0 = HST.get () in
let y = DLL.dll_insert_at_head (!*d) n in
let h' = HST.get () in
d *= y;
let h1 = HST.get () in
_lemma_unchanged_node_vals_transitive h0 h' h1 (as_list h1 d);
HST.pop_frame ();
let h11 = HST.get () in
_lemma_unchanged_node_vals_maintains_changes h00 h11 ... | false |
Vale.Lib.Lists.fst | Vale.Lib.Lists.singleton_list_seq | val singleton_list_seq (#a:Type) (x:a) : Lemma
(seq_of_list [x] == create 1 x) | val singleton_list_seq (#a:Type) (x:a) : Lemma
(seq_of_list [x] == create 1 x) | let singleton_list_seq #a x =
lemma_seq_of_list_index [x] 0;
assert (equal (seq_of_list [x]) (create 1 x)) | {
"file_name": "vale/code/lib/collections/Vale.Lib.Lists.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 47,
"end_line": 10,
"start_col": 0,
"start_line": 8
} | module Vale.Lib.Lists
open FStar.Mul
#reset-options "--initial_fuel 2 --max_fuel 2"
let singleton_list_rev #a x = ()
let list_cons_is_append #a h t = () | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.Lib.Lists.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 2,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: a -> FStar.Pervasives.Lemma (ensures FStar.Seq.Base.seq_of_list [x] == FStar.Seq.Base.create 1 x) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims._assert",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.seq_of_list",
"Prims.Cons",
"Prims.Nil",
"FStar.Seq.Base.create",
"Prims.unit",
"FStar.Seq.Properties.lemma_seq_of_list_index"
] | [] | true | false | true | false | false | let singleton_list_seq #a x =
| lemma_seq_of_list_index [x] 0;
assert (equal (seq_of_list [x]) (create 1 x)) | false |
Vale.Lib.Lists.fst | Vale.Lib.Lists.lemma_from_list_be | val lemma_from_list_be (l:list bool) : Lemma
(ensures (
let s = seq_of_list l in
from_list_be l == from_vec #(List.length l) s
)) | val lemma_from_list_be (l:list bool) : Lemma
(ensures (
let s = seq_of_list l in
from_list_be l == from_vec #(List.length l) s
)) | let lemma_from_list_be l =
List.rev_involutive l;
lemma_from_list_le (List.rev l) | {
"file_name": "vale/code/lib/collections/Vale.Lib.Lists.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 33,
"end_line": 66,
"start_col": 0,
"start_line": 64
} | module Vale.Lib.Lists
open FStar.Mul
#reset-options "--initial_fuel 2 --max_fuel 2"
let singleton_list_rev #a x = ()
let list_cons_is_append #a h t = ()
let singleton_list_seq #a x =
lemma_seq_of_list_index [x] 0;
assert (equal (seq_of_list [x]) (create 1 x))
#reset-options
let rec list_append_length #a x y =
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.Lib.Lists.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l: Prims.list Prims.bool
-> FStar.Pervasives.Lemma
(ensures
(let s = FStar.Seq.Base.seq_of_list l in
Vale.Lib.Lists.from_list_be l == FStar.UInt.from_vec s)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Prims.bool",
"Vale.Lib.Lists.lemma_from_list_le",
"FStar.List.Tot.Base.rev",
"Prims.unit",
"FStar.List.Tot.Properties.rev_involutive"
] | [] | true | false | true | false | false | let lemma_from_list_be l =
| List.rev_involutive l;
lemma_from_list_le (List.rev l) | false |
Vale.Lib.Lists.fst | Vale.Lib.Lists.list_append_length | val list_append_length (#a:Type) (x y:list a) : Lemma
(List.length (x @ y) == List.length x + List.length y) | val list_append_length (#a:Type) (x y:list a) : Lemma
(List.length (x @ y) == List.length x + List.length y) | let rec list_append_length #a x y =
match x with
| [] -> ()
| _::t -> list_append_length t y | {
"file_name": "vale/code/lib/collections/Vale.Lib.Lists.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 34,
"end_line": 16,
"start_col": 0,
"start_line": 13
} | module Vale.Lib.Lists
open FStar.Mul
#reset-options "--initial_fuel 2 --max_fuel 2"
let singleton_list_rev #a x = ()
let list_cons_is_append #a h t = ()
let singleton_list_seq #a x =
lemma_seq_of_list_index [x] 0;
assert (equal (seq_of_list [x]) (create 1 x))
#reset-options | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.Lib.Lists.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.list a -> y: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.length (x @ y) ==
FStar.List.Tot.Base.length x + FStar.List.Tot.Base.length y) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Vale.Lib.Lists.list_append_length",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec list_append_length #a x y =
| match x with
| [] -> ()
| _ :: t -> list_append_length t y | false |
Vale.Lib.Lists.fst | Vale.Lib.Lists.append_list_seq | val append_list_seq (#a:Type) (x y:list a) : Lemma
(seq_of_list (x @ y) == append (seq_of_list x) (seq_of_list y)) | val append_list_seq (#a:Type) (x y:list a) : Lemma
(seq_of_list (x @ y) == append (seq_of_list x) (seq_of_list y)) | let append_list_seq #a x y =
list_append_length x y;
let n = List.length (x @ y) in
let index_of_x_y (i:nat{i < n}) : a = index (seq_of_list (x @ y)) i in
let index_of_append_x_y (i:nat{i < n}) : a = index (append (seq_of_list x) (seq_of_list y)) i in
let f (i:nat{i < n}) : Lemma (index_of_x_y i == index_of_a... | {
"file_name": "vale/code/lib/collections/Vale.Lib.Lists.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 79,
"end_line": 39,
"start_col": 0,
"start_line": 23
} | module Vale.Lib.Lists
open FStar.Mul
#reset-options "--initial_fuel 2 --max_fuel 2"
let singleton_list_rev #a x = ()
let list_cons_is_append #a h t = ()
let singleton_list_seq #a x =
lemma_seq_of_list_index [x] 0;
assert (equal (seq_of_list [x]) (create 1 x))
#reset-options
let rec list_append_length #a x y =
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.Lib.Lists.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.list a -> y: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
FStar.Seq.Base.seq_of_list (x @ y) ==
FStar.Seq.Base.append (FStar.Seq.Base.seq_of_list x) (FStar.Seq.Base.seq_of_list y)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Prims._assert",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.seq_of_list",
"FStar.List.Tot.Base.op_At",
"FStar.Seq.Base.append",
"Prims.unit",
"FStar.Classical.forall_intro",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.eq2",
"Prims.l_True",
"Prims.squash",
"Prims.Nil"... | [] | false | false | true | false | false | let append_list_seq #a x y =
| list_append_length x y;
let n = List.length (x @ y) in
let index_of_x_y (i: nat{i < n}) : a = index (seq_of_list (x @ y)) i in
let index_of_append_x_y (i: nat{i < n}) : a = index (append (seq_of_list x) (seq_of_list y)) i in
let f (i: nat{i < n}) : Lemma (index_of_x_y i == index_of_append_x_y i) =
list_append_index x... | false |
Steel.ST.HigherArray.fst | Steel.ST.HigherArray.share | val share
(#opened: _)
(#elt: Type)
(#x: Seq.seq elt)
(a: array elt)
(p p1 p2: P.perm)
: STGhost unit opened
(pts_to a p x)
(fun _ -> pts_to a p1 x `star` pts_to a p2 x)
(p == p1 `P.sum_perm` p2)
(fun _ -> True) | val share
(#opened: _)
(#elt: Type)
(#x: Seq.seq elt)
(a: array elt)
(p p1 p2: P.perm)
: STGhost unit opened
(pts_to a p x)
(fun _ -> pts_to a p1 x `star` pts_to a p2 x)
(p == p1 `P.sum_perm` p2)
(fun _ -> True) | let share
#_ #_ #x a p p1 p2
= elim_pts_to a p x;
mk_carrier_share (US.v (ptr_of a).base_len) (ptr_of a).offset x p1 p2;
R.split (ptr_of a).base _
(mk_carrier (US.v (ptr_of a).base_len) (ptr_of a).offset x p1)
(mk_carrier (US.v (ptr_of a).base_len) (ptr_of a).offset x p2);
intro_pts_to a p1 x;
intro_p... | {
"file_name": "lib/steel/Steel.ST.HigherArray.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 21,
"end_line": 349,
"start_col": 0,
"start_line": 341
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.PCMReference.fsti.checked",
"Steel.ST.Loops.fsti.checked",
"Steel.PCMMap.fst.checked",
"Steel.PCMFrac.fst.checked",
"Steel.Memory.fsti.checked",
"prims.fst.checked",
"FStar.SizeT.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Rea... | [
{
"abbrev": true,
"full_module": "Steel.PCMMap",
"short_module": "PM"
},
{
"abbrev": true,
"full_module": "FStar.Map",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "Steel.ST.PCMReference",
"short_module": "R"
},
{
"abbrev": true,
"full_module": "Ste... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Steel.ST.HigherArray.array elt ->
p: Steel.FractionalPermission.perm ->
p1: Steel.FractionalPermission.perm ->
p2: Steel.FractionalPermission.perm
-> Steel.ST.Effect.Ghost.STGhost Prims.unit | Steel.ST.Effect.Ghost.STGhost | [] | [] | [
"Steel.Memory.inames",
"FStar.Seq.Base.seq",
"Steel.ST.HigherArray.array",
"Steel.FractionalPermission.perm",
"Steel.ST.HigherArray.intro_pts_to",
"Steel.ST.HigherArray.mk_carrier",
"FStar.SizeT.v",
"FStar.Ghost.reveal",
"FStar.SizeT.t",
"Steel.ST.HigherArray.__proj__Mkptr__item__base_len",
"Ste... | [] | false | true | false | false | false | let share #_ #_ #x a p p1 p2 =
| elim_pts_to a p x;
mk_carrier_share (US.v (ptr_of a).base_len) (ptr_of a).offset x p1 p2;
R.split (ptr_of a).base
_
(mk_carrier (US.v (ptr_of a).base_len) (ptr_of a).offset x p1)
(mk_carrier (US.v (ptr_of a).base_len) (ptr_of a).offset x p2);
intro_pts_to a p1 x;
intro_pts_to a p2 x | false |
Vale.Lib.Lists.fst | Vale.Lib.Lists.list_append_index | val list_append_index (#a:Type) (x y:list a) (i:nat) : Lemma
(requires i < List.length (x @ y))
(ensures (
let nx = List.length x in
(i >= nx ==> i - nx < List.length y) /\
List.index (x @ y) i == (if i < nx then List.index x i else List.index y (i - nx))
)) | val list_append_index (#a:Type) (x y:list a) (i:nat) : Lemma
(requires i < List.length (x @ y))
(ensures (
let nx = List.length x in
(i >= nx ==> i - nx < List.length y) /\
List.index (x @ y) i == (if i < nx then List.index x i else List.index y (i - nx))
)) | let rec list_append_index #a x y i =
match x with
| [] -> ()
| h::t -> (if i > 0 then list_append_index t y (i - 1)) | {
"file_name": "vale/code/lib/collections/Vale.Lib.Lists.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 57,
"end_line": 21,
"start_col": 0,
"start_line": 18
} | module Vale.Lib.Lists
open FStar.Mul
#reset-options "--initial_fuel 2 --max_fuel 2"
let singleton_list_rev #a x = ()
let list_cons_is_append #a h t = ()
let singleton_list_seq #a x =
lemma_seq_of_list_index [x] 0;
assert (equal (seq_of_list [x]) (create 1 x))
#reset-options
let rec list_append_length #a x y =
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.Lib.Lists.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.list a -> y: Prims.list a -> i: Prims.nat
-> FStar.Pervasives.Lemma (requires i < FStar.List.Tot.Base.length (x @ y))
(ensures
(let nx = FStar.List.Tot.Base.length x in
(i >= nx ==> i - nx < FStar.List.Tot.Base.length y) /\
FStar.List.Tot.Base.index (x @ y) i ==
((... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Prims.nat",
"Prims.op_GreaterThan",
"Vale.Lib.Lists.list_append_index",
"Prims.op_Subtraction",
"Prims.bool",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec list_append_index #a x y i =
| match x with
| [] -> ()
| h :: t -> (if i > 0 then list_append_index t y (i - 1)) | false |
Vale.AES.Types_helpers.fsti | Vale.AES.Types_helpers.lemma_ishl_64 | val lemma_ishl_64 (x: nat64) (k: nat) : Lemma (ensures ishl #pow2_64 x k == x * pow2 k % pow2_64) | val lemma_ishl_64 (x: nat64) (k: nat) : Lemma (ensures ishl #pow2_64 x k == x * pow2 k % pow2_64) | let lemma_ishl_64 (x:nat64) (k:nat) : Lemma
(ensures ishl #pow2_64 x k == x * pow2 k % pow2_64)
=
Vale.Def.TypesNative_s.reveal_ishl 64 x k;
FStar.UInt.shift_left_value_lemma #64 x k;
() | {
"file_name": "vale/code/crypto/aes/Vale.AES.Types_helpers.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 40,
"start_col": 0,
"start_line": 35
} | module Vale.AES.Types_helpers
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open FStar.Mul
open FStar.Seq
open Vale.Lib.Seqs
unfold let pow2_24 = 0x1000000
let nat24 = natN pow2_24
val lemma_slices_le_quad32_to_bytes (q:quad32) : Lemma
(ensure... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.Types.fsti.checked",
"pr... | [
{
"abbrev": false,
"full_module": "Vale.Lib.Seqs",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arc... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Vale.Def.Types_s.nat64 -> k: Prims.nat
-> FStar.Pervasives.Lemma
(ensures Vale.Def.Types_s.ishl x k == x * Prims.pow2 k % Vale.Def.Words_s.pow2_64) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Def.Types_s.nat64",
"Prims.nat",
"Prims.unit",
"FStar.UInt.shift_left_value_lemma",
"Vale.Def.TypesNative_s.reveal_ishl",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"Prims.int",
"Vale.Def.Types_s.ishl",
"Vale.Def.Words_s.pow2_64",
"Prims.op_Modulus",
"FStar.Mul.op_Star",
"Prims.pow... | [] | true | false | true | false | false | let lemma_ishl_64 (x: nat64) (k: nat) : Lemma (ensures ishl #pow2_64 x k == x * pow2 k % pow2_64) =
| Vale.Def.TypesNative_s.reveal_ishl 64 x k;
FStar.UInt.shift_left_value_lemma #64 x k;
() | false |
Vale.Lib.Lists.fst | Vale.Lib.Lists.lemma_from_list_le | val lemma_from_list_le (l:list bool) : Lemma
(ensures (
let rl = List.rev l in
let s = seq_of_list rl in
from_list_le l == from_vec #(List.length rl) s
)) | val lemma_from_list_le (l:list bool) : Lemma
(ensures (
let rl = List.rev l in
let s = seq_of_list rl in
from_list_le l == from_vec #(List.length rl) s
)) | let rec lemma_from_list_le l =
match l with
| [] -> ()
| h::t ->
(
lemma_from_list_le t;
let rl = List.rev l in
let rt = List.rev t in
let sl = seq_of_list rl in
let st = seq_of_list rt in
let sh = create 1 h in
let n = length st in
rev_length l;
rev_lengt... | {
"file_name": "vale/code/lib/collections/Vale.Lib.Lists.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 5,
"end_line": 62,
"start_col": 0,
"start_line": 42
} | module Vale.Lib.Lists
open FStar.Mul
#reset-options "--initial_fuel 2 --max_fuel 2"
let singleton_list_rev #a x = ()
let list_cons_is_append #a h t = ()
let singleton_list_seq #a x =
lemma_seq_of_list_index [x] 0;
assert (equal (seq_of_list [x]) (create 1 x))
#reset-options
let rec list_append_length #a x y =
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.fst.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Vale.Lib.Lists.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot.Properties",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "List"
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l: Prims.list Prims.bool
-> FStar.Pervasives.Lemma
(ensures
(let rl = FStar.List.Tot.Base.rev l in
let s = FStar.Seq.Base.seq_of_list rl in
Vale.Lib.Lists.from_list_le l == FStar.UInt.from_vec s)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Prims.bool",
"Prims._assert",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.slice",
"Prims.unit",
"Vale.Lib.Lists.singleton_list_seq",
"Vale.Lib.Lists.append_list_seq",
"Prims.Cons",
"Prims.Nil",
"Vale.Lib.Lists.list_cons_is_append",
"Vale.Lib.Lists.singleton_list_rev",
"FStar.List.... | [
"recursion"
] | false | false | true | false | false | let rec lemma_from_list_le l =
| match l with
| [] -> ()
| h :: t ->
(lemma_from_list_le t;
let rl = List.rev l in
let rt = List.rev t in
let sl = seq_of_list rl in
let st = seq_of_list rt in
let sh = create 1 h in
let n = length st in
rev_length l;
rev_length t;
rev_append [h] t;
singleton_list_rev h;
lis... | false |
FStar.FiniteMap.Base.fst | FStar.FiniteMap.Base.map_extensionality_lemma | val map_extensionality_lemma: Prims.unit -> Lemma (map_extensionality_fact u#b) | val map_extensionality_lemma: Prims.unit -> Lemma (map_extensionality_fact u#b) | let map_extensionality_lemma ()
: Lemma (map_extensionality_fact u#b) =
introduce forall (a: eqtype) (b:Type u#b) (m1: map a b) (m2: map a b). equal m1 m2 ==> m1 == m2
with (
introduce equal m1 m2 ==> m1 == m2
with _. (
assert (FSet.equal (domain m1) (domain m2));
assert (feq (elements m1) (elem... | {
"file_name": "ulib/FStar.FiniteMap.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 294,
"start_col": 0,
"start_line": 285
} | (*
Copyright 2008-2021 John Li, Jay Lorch, Rustan Leino, Alex Summers,
Dan Rosen, Nikhil Swamy, Microsoft Research, and contributors to
the Dafny Project
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a c... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.FunctionalExtensionality.fsti.checked",
"FSt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "FStar.FiniteSet.Ambient",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.FiniteSet.Base",
"short_module": "FSet"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.Pervasives.Lemma (ensures FStar.FiniteMap.Base.map_extensionality_fact) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.unit",
"FStar.Classical.Sugar.forall_intro",
"Prims.eqtype",
"Prims.l_Forall",
"FStar.FiniteMap.Base.map",
"Prims.l_imp",
"FStar.FiniteMap.Base.equal",
"Prims.eq2",
"FStar.Classical.Sugar.implies_intro",
"Prims.squash",
"Prims._assert",
"FStar.FunctionalExtensionality.feq",
"FStar.Per... | [] | false | false | true | false | false | let map_extensionality_lemma () : Lemma (map_extensionality_fact u#b) =
| introduce forall (a: eqtype) (b: Type u#b) (m1: map a b) (m2: map a b) . equal m1 m2 ==> m1 == m2
with (introduce equal m1 m2 ==> m1 == m2
with _. (assert (FSet.equal (domain m1) (domain m2));
assert (feq (elements m1) (elements m2)))) | false |
Vale.AES.Types_helpers.fsti | Vale.AES.Types_helpers.lemma_ishr_32 | val lemma_ishr_32 (x: nat32) (k: nat) : Lemma (ensures ishr #pow2_32 x k == x / pow2 k) | val lemma_ishr_32 (x: nat32) (k: nat) : Lemma (ensures ishr #pow2_32 x k == x / pow2 k) | let lemma_ishr_32 (x:nat32) (k:nat) : Lemma
(ensures ishr #pow2_32 x k == x / pow2 k)
=
Vale.Def.TypesNative_s.reveal_ishr 32 x k;
FStar.UInt.shift_right_value_lemma #32 x k;
() | {
"file_name": "vale/code/crypto/aes/Vale.AES.Types_helpers.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 54,
"start_col": 0,
"start_line": 49
} | module Vale.AES.Types_helpers
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open FStar.Mul
open FStar.Seq
open Vale.Lib.Seqs
unfold let pow2_24 = 0x1000000
let nat24 = natN pow2_24
val lemma_slices_le_quad32_to_bytes (q:quad32) : Lemma
(ensure... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.Types.fsti.checked",
"pr... | [
{
"abbrev": false,
"full_module": "Vale.Lib.Seqs",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arc... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Vale.Def.Types_s.nat32 -> k: Prims.nat
-> FStar.Pervasives.Lemma (ensures Vale.Def.Types_s.ishr x k == x / Prims.pow2 k) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Def.Types_s.nat32",
"Prims.nat",
"Prims.unit",
"FStar.UInt.shift_right_value_lemma",
"Vale.Def.TypesNative_s.reveal_ishr",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"Prims.int",
"Vale.Def.Types_s.ishr",
"Vale.Def.Words_s.pow2_32",
"Prims.op_Division",
"Prims.pow2",
"Prims.Nil",
... | [] | true | false | true | false | false | let lemma_ishr_32 (x: nat32) (k: nat) : Lemma (ensures ishr #pow2_32 x k == x / pow2 k) =
| Vale.Def.TypesNative_s.reveal_ishr 32 x k;
FStar.UInt.shift_right_value_lemma #32 x k;
() | false |
DoublyLinkedListIface.fst | DoublyLinkedListIface.dll_insert_at_tail | val dll_insert_at_tail (#t:Type0) (d:dll t) (n:node t) :
HST.Stack unit
(requires (fun h0 -> dll_valid h0 d /\ node_valid h0 n /\ (fp_node n `B.loc_disjoint` fp_dll h0 d)))
(ensures (fun h0 () h1 ->
B.modifies (fp_dll h1 d) h0 h1 /\
fp_dll h1 d `loc_equiv` B.loc_union (fp_dll h0 d) (fp_node ... | val dll_insert_at_tail (#t:Type0) (d:dll t) (n:node t) :
HST.Stack unit
(requires (fun h0 -> dll_valid h0 d /\ node_valid h0 n /\ (fp_node n `B.loc_disjoint` fp_dll h0 d)))
(ensures (fun h0 () h1 ->
B.modifies (fp_dll h1 d) h0 h1 /\
fp_dll h1 d `loc_equiv` B.loc_union (fp_dll h0 d) (fp_node ... | let dll_insert_at_tail #t d n =
let h00 = HST.get () in
HST.push_frame ();
let h0 = HST.get () in
let y = DLL.dll_insert_at_tail (!*d) n in
let h' = HST.get () in
d *= y;
let h1 = HST.get () in
assert (_pred_nl_disjoint h0 (as_list h1 d)); // OBSERVE
_lemma_unchanged_node_vals_transitive h0 h' h1 (as_... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedListIface.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 603,
"start_col": 0,
"start_line": 585
} | (*
Copyright 2008-2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Pure.fst.checked",
"FStar.HyperStack.ST.fsti.c... | [
{
"abbrev": false,
"full_module": "LowStar.BufferOps",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.List.Pure",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": true,
"full_module": "D... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 2,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | d: DoublyLinkedListIface.dll t -> n: DoublyLinkedListIface.node t
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"DoublyLinkedListIface.dll",
"DoublyLinkedListIface.node",
"DoublyLinkedListIface._lemma_unchanged_node_vals_append",
"DoublyLinkedListIface.as_list",
"Prims.Cons",
"Prims.Nil",
"Prims.unit",
"DoublyLinkedListIface._lemma_append_g_node_vals",
"DoublyLinkedListIface._lemma_extract_unchanged_node_val"... | [] | false | true | false | false | false | let dll_insert_at_tail #t d n =
| let h00 = HST.get () in
HST.push_frame ();
let h0 = HST.get () in
let y = DLL.dll_insert_at_tail (!*d) n in
let h' = HST.get () in
d *= y;
let h1 = HST.get () in
assert (_pred_nl_disjoint h0 (as_list h1 d));
_lemma_unchanged_node_vals_transitive h0 h' h1 (as_list h1 d);
HST.pop_frame ();
let h11 = HST.get () in
_lemma_... | false |
Vale.AES.Types_helpers.fsti | Vale.AES.Types_helpers.lemma_ishr_64 | val lemma_ishr_64 (x: nat64) (k: nat) : Lemma (ensures ishr #pow2_64 x k == x / pow2 k) | val lemma_ishr_64 (x: nat64) (k: nat) : Lemma (ensures ishr #pow2_64 x k == x / pow2 k) | let lemma_ishr_64 (x:nat64) (k:nat) : Lemma
(ensures ishr #pow2_64 x k == x / pow2 k)
=
Vale.Def.TypesNative_s.reveal_ishr 64 x k;
FStar.UInt.shift_right_value_lemma #64 x k;
() | {
"file_name": "vale/code/crypto/aes/Vale.AES.Types_helpers.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 47,
"start_col": 0,
"start_line": 42
} | module Vale.AES.Types_helpers
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open Vale.Arch.Types
open FStar.Mul
open FStar.Seq
open Vale.Lib.Seqs
unfold let pow2_24 = 0x1000000
let nat24 = natN pow2_24
val lemma_slices_le_quad32_to_bytes (q:quad32) : Lemma
(ensure... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.TypesNative_s.fst.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Arch.Types.fsti.checked",
"pr... | [
{
"abbrev": false,
"full_module": "Vale.Lib.Seqs",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arc... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Vale.Def.Types_s.nat64 -> k: Prims.nat
-> FStar.Pervasives.Lemma (ensures Vale.Def.Types_s.ishr x k == x / Prims.pow2 k) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Def.Types_s.nat64",
"Prims.nat",
"Prims.unit",
"FStar.UInt.shift_right_value_lemma",
"Vale.Def.TypesNative_s.reveal_ishr",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"Prims.int",
"Vale.Def.Types_s.ishr",
"Vale.Def.Words_s.pow2_64",
"Prims.op_Division",
"Prims.pow2",
"Prims.Nil",
... | [] | true | false | true | false | false | let lemma_ishr_64 (x: nat64) (k: nat) : Lemma (ensures ishr #pow2_64 x k == x / pow2 k) =
| Vale.Def.TypesNative_s.reveal_ishr 64 x k;
FStar.UInt.shift_right_value_lemma #64 x k;
() | false |
Vale.Wrapper.X64.AES.fsti | Vale.Wrapper.X64.AES.uint8_p | val uint8_p : Type0 | let uint8_p = B.buffer UInt8.t | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.AES.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 30,
"end_line": 17,
"start_col": 0,
"start_line": 17
} | module Vale.Wrapper.X64.AES
open Vale.X64.CPU_Features_s
open FStar.HyperStack.ST
module B = LowStar.Buffer
module HS = FStar.HyperStack
module DV = LowStar.BufferView.Down
module UV = LowStar.BufferView.Up
open FStar.Mul
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open Vale.AES.AES_s
open Vale.Interop.Base
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.Interop.Base.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.AES.AES_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferVie... | [
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"LowStar.Buffer.buffer",
"FStar.UInt8.t"
] | [] | false | false | false | true | true | let uint8_p =
| B.buffer UInt8.t | false | |
Vale.Stdcalls.X64.AesHash.fst | Vale.Stdcalls.X64.AesHash.t128_mod | val t128_mod : Vale.Interop.Base.td | let t128_mod = TD_Buffer TUInt8 TUInt128 default_bq | {
"file_name": "vale/code/arch/x64/interop/Vale.Stdcalls.X64.AesHash.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 51,
"end_line": 38,
"start_col": 0,
"start_line": 38
} | module Vale.Stdcalls.X64.AesHash
open FStar.HyperStack.ST
module B = LowStar.Buffer
module HS = FStar.HyperStack
open FStar.Mul
module DV = LowStar.BufferView.Down
module UV = LowStar.BufferView.Up
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.checked",
"Vale.Int... | [
{
"abbrev": true,
"full_module": "Vale.AES.X64.GF128_Init",
"short_module": "GF"
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_s",
"short_module": "MS"
},
{
"abbrev": true,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Vale.Interop.Base.td | Prims.Tot | [
"total"
] | [] | [
"Vale.Interop.Base.TD_Buffer",
"Vale.Arch.HeapTypes_s.TUInt8",
"Vale.Arch.HeapTypes_s.TUInt128",
"Vale.Interop.Base.default_bq"
] | [] | false | false | false | true | false | let t128_mod =
| TD_Buffer TUInt8 TUInt128 default_bq | false | |
Vale.Stdcalls.X64.AesHash.fst | Vale.Stdcalls.X64.AesHash.uint64 | val uint64 : Prims.eqtype | let uint64 = UInt64.t | {
"file_name": "vale/code/arch/x64/interop/Vale.Stdcalls.X64.AesHash.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 21,
"end_line": 27,
"start_col": 0,
"start_line": 27
} | module Vale.Stdcalls.X64.AesHash
open FStar.HyperStack.ST
module B = LowStar.Buffer
module HS = FStar.HyperStack
open FStar.Mul
module DV = LowStar.BufferView.Down
module UV = LowStar.BufferView.Up
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.checked",
"Vale.Int... | [
{
"abbrev": true,
"full_module": "Vale.AES.X64.GF128_Init",
"short_module": "GF"
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_s",
"short_module": "MS"
},
{
"abbrev": true,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt64.t"
] | [] | false | false | false | true | false | let uint64 =
| UInt64.t | false | |
Vale.Stdcalls.X64.AesHash.fst | Vale.Stdcalls.X64.AesHash.t128_no_mod | val t128_no_mod : Vale.Interop.Base.td | let t128_no_mod = TD_Buffer TUInt8 TUInt128 ({modified=false; strict_disjointness=false; taint=MS.Secret}) | {
"file_name": "vale/code/arch/x64/interop/Vale.Stdcalls.X64.AesHash.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 106,
"end_line": 40,
"start_col": 0,
"start_line": 40
} | module Vale.Stdcalls.X64.AesHash
open FStar.HyperStack.ST
module B = LowStar.Buffer
module HS = FStar.HyperStack
open FStar.Mul
module DV = LowStar.BufferView.Down
module UV = LowStar.BufferView.Up
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.checked",
"Vale.Int... | [
{
"abbrev": true,
"full_module": "Vale.AES.X64.GF128_Init",
"short_module": "GF"
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_s",
"short_module": "MS"
},
{
"abbrev": true,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Vale.Interop.Base.td | Prims.Tot | [
"total"
] | [] | [
"Vale.Interop.Base.TD_Buffer",
"Vale.Arch.HeapTypes_s.TUInt8",
"Vale.Arch.HeapTypes_s.TUInt128",
"Vale.Interop.Base.Mkbuffer_qualifiers",
"Vale.Arch.HeapTypes_s.Secret"
] | [] | false | false | false | true | false | let t128_no_mod =
| TD_Buffer TUInt8 TUInt128 ({ modified = false; strict_disjointness = false; taint = MS.Secret }) | false | |
Vale.Stdcalls.X64.AesHash.fst | Vale.Stdcalls.X64.AesHash.key128_pre | val key128_pre: (Ghost.erased (Seq.seq nat32)) -> VSig.vale_pre dom | val key128_pre: (Ghost.erased (Seq.seq nat32)) -> VSig.vale_pre dom | let key128_pre : (Ghost.erased (Seq.seq nat32)) -> VSig.vale_pre dom =
fun (s:Ghost.erased (Seq.seq nat32))
(c:V.va_code)
(input_b:b128)
(output_b:b128)
(va_s0:V.va_state) ->
GF.va_req_Keyhash_init c va_s0 IA.win AES_128 (Ghost.reveal s)
(as_vale_buffer input_b) (as_vale_buffer output_b) | {
"file_name": "vale/code/arch/x64/interop/Vale.Stdcalls.X64.AesHash.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 58,
"end_line": 57,
"start_col": 0,
"start_line": 50
} | module Vale.Stdcalls.X64.AesHash
open FStar.HyperStack.ST
module B = LowStar.Buffer
module HS = FStar.HyperStack
open FStar.Mul
module DV = LowStar.BufferView.Down
module UV = LowStar.BufferView.Up
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.checked",
"Vale.Int... | [
{
"abbrev": true,
"full_module": "Vale.AES.X64.GF128_Init",
"short_module": "GF"
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_s",
"short_module": "MS"
},
{
"abbrev": true,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.Ghost.erased (FStar.Seq.Base.seq Vale.Def.Words_s.nat32)
-> Vale.AsLowStar.ValeSig.vale_pre Vale.Stdcalls.X64.AesHash.dom | Prims.Tot | [
"total"
] | [] | [
"FStar.Ghost.erased",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat32",
"Vale.X64.Decls.va_code",
"Vale.Stdcalls.X64.AesHash.b128",
"Vale.X64.Decls.va_state",
"Vale.AES.X64.GF128_Init.va_req_Keyhash_init",
"Vale.Interop.Assumptions.win",
"Vale.AES.AES_common_s.AES_128",
"FStar.Ghost.reveal",
"Vale... | [] | false | false | false | true | false | let key128_pre: (Ghost.erased (Seq.seq nat32)) -> VSig.vale_pre dom =
| fun
(s: Ghost.erased (Seq.seq nat32))
(c: V.va_code)
(input_b: b128)
(output_b: b128)
(va_s0: V.va_state)
->
GF.va_req_Keyhash_init c
va_s0
IA.win
AES_128
(Ghost.reveal s)
(as_vale_buffer input_b)
(as_vale_buffer output_b) | false |
Vale.Wrapper.X64.AES.fsti | Vale.Wrapper.X64.AES.key_length | val key_length : a:
Vale.AES.AES_common_s.algorithm
{a = Vale.AES.AES_common_s.AES_128 \/ a = Vale.AES.AES_common_s.AES_256}
-> Prims.int | let key_length (a: algorithm { a = AES_128 \/ a = AES_256 }) =
match a with
| AES_128 -> 16
| AES_256 -> 32 | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.AES.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 17,
"end_line": 41,
"start_col": 0,
"start_line": 38
} | module Vale.Wrapper.X64.AES
open Vale.X64.CPU_Features_s
open FStar.HyperStack.ST
module B = LowStar.Buffer
module HS = FStar.HyperStack
module DV = LowStar.BufferView.Down
module UV = LowStar.BufferView.Up
open FStar.Mul
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open Vale.AES.AES_s
open Vale.Interop.Base
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.Interop.Base.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.AES.AES_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferVie... | [
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a:
Vale.AES.AES_common_s.algorithm
{a = Vale.AES.AES_common_s.AES_128 \/ a = Vale.AES.AES_common_s.AES_256}
-> Prims.int | Prims.Tot | [
"total"
] | [] | [
"Vale.AES.AES_common_s.algorithm",
"Prims.l_or",
"Prims.b2t",
"Prims.op_Equality",
"Vale.AES.AES_common_s.AES_128",
"Vale.AES.AES_common_s.AES_256",
"Prims.int"
] | [] | false | false | false | false | false | let key_length (a: algorithm{a = AES_128 \/ a = AES_256}) =
| match a with
| AES_128 -> 16
| AES_256 -> 32 | false | |
Vale.Stdcalls.X64.AesHash.fst | Vale.Stdcalls.X64.AesHash.b128 | val b128 : Type0 | let b128 = buf_t TUInt8 TUInt128 | {
"file_name": "vale/code/arch/x64/interop/Vale.Stdcalls.X64.AesHash.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 36,
"start_col": 0,
"start_line": 36
} | module Vale.Stdcalls.X64.AesHash
open FStar.HyperStack.ST
module B = LowStar.Buffer
module HS = FStar.HyperStack
open FStar.Mul
module DV = LowStar.BufferView.Down
module UV = LowStar.BufferView.Up
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.checked",
"Vale.Int... | [
{
"abbrev": true,
"full_module": "Vale.AES.X64.GF128_Init",
"short_module": "GF"
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_s",
"short_module": "MS"
},
{
"abbrev": true,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.Interop.Base.buf_t",
"Vale.Arch.HeapTypes_s.TUInt8",
"Vale.Arch.HeapTypes_s.TUInt128"
] | [] | false | false | false | true | true | let b128 =
| buf_t TUInt8 TUInt128 | false | |
Vale.Stdcalls.X64.AesHash.fst | Vale.Stdcalls.X64.AesHash.key128_post | val key128_post: (Ghost.erased (Seq.seq nat32)) -> VSig.vale_post dom | val key128_post: (Ghost.erased (Seq.seq nat32)) -> VSig.vale_post dom | let key128_post : (Ghost.erased (Seq.seq nat32)) -> VSig.vale_post dom =
fun (s:Ghost.erased (Seq.seq nat32))
(c:V.va_code)
(input_b:b128)
(output_b:b128)
(va_s0:V.va_state)
(va_s1:V.va_state)
(f:V.va_fuel) ->
GF.va_ens_Keyhash_init c va_s0 IA.win AES_128 (Ghost.reveal s)
(as_val... | {
"file_name": "vale/code/arch/x64/interop/Vale.Stdcalls.X64.AesHash.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 66,
"end_line": 69,
"start_col": 0,
"start_line": 60
} | module Vale.Stdcalls.X64.AesHash
open FStar.HyperStack.ST
module B = LowStar.Buffer
module HS = FStar.HyperStack
open FStar.Mul
module DV = LowStar.BufferView.Down
module UV = LowStar.BufferView.Up
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Vale.Interop.Base.fst.checked",
"Vale.Int... | [
{
"abbrev": true,
"full_module": "Vale.AES.X64.GF128_Init",
"short_module": "GF"
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_s",
"short_module": "MS"
},
{
"abbrev": true,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.Ghost.erased (FStar.Seq.Base.seq Vale.Def.Words_s.nat32)
-> Vale.AsLowStar.ValeSig.vale_post Vale.Stdcalls.X64.AesHash.dom | Prims.Tot | [
"total"
] | [] | [
"FStar.Ghost.erased",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat32",
"Vale.X64.Decls.va_code",
"Vale.Stdcalls.X64.AesHash.b128",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_fuel",
"Vale.AES.X64.GF128_Init.va_ens_Keyhash_init",
"Vale.Interop.Assumptions.win",
"Vale.AES.AES_common_s.AES_128",
"... | [] | false | false | false | true | false | let key128_post: (Ghost.erased (Seq.seq nat32)) -> VSig.vale_post dom =
| fun
(s: Ghost.erased (Seq.seq nat32))
(c: V.va_code)
(input_b: b128)
(output_b: b128)
(va_s0: V.va_state)
(va_s1: V.va_state)
(f: V.va_fuel)
->
GF.va_ens_Keyhash_init c
va_s0
IA.win
AES_128
(Ghost.reveal s)
(as_vale_buffer input_b)
(as_vale_buffer output_b)
va_s1
f | false |
Vale.Wrapper.X64.AES.fsti | Vale.Wrapper.X64.AES.length_aux2 | val length_aux2 (b: uint8_p)
: Lemma (requires B.length b = 240) (ensures DV.length (get_downview b) % 16 = 0) | val length_aux2 (b: uint8_p)
: Lemma (requires B.length b = 240) (ensures DV.length (get_downview b) % 16 = 0) | let length_aux2 (b:uint8_p) : Lemma
(requires B.length b = 240)
(ensures DV.length (get_downview b) % 16 = 0) =
let db = get_downview b in
DV.length_eq db | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.AES.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 19,
"end_line": 29,
"start_col": 0,
"start_line": 25
} | module Vale.Wrapper.X64.AES
open Vale.X64.CPU_Features_s
open FStar.HyperStack.ST
module B = LowStar.Buffer
module HS = FStar.HyperStack
module DV = LowStar.BufferView.Down
module UV = LowStar.BufferView.Up
open FStar.Mul
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open Vale.AES.AES_s
open Vale.Interop.Base
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.Interop.Base.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.AES.AES_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferVie... | [
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | b: Vale.Wrapper.X64.AES.uint8_p
-> FStar.Pervasives.Lemma (requires LowStar.Monotonic.Buffer.length b = 240)
(ensures LowStar.BufferView.Down.length (Vale.Interop.Types.get_downview b) % 16 = 0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Wrapper.X64.AES.uint8_p",
"LowStar.BufferView.Down.length_eq",
"FStar.UInt8.t",
"LowStar.BufferView.Down.buffer",
"Vale.Interop.Types.get_downview",
"Vale.Arch.HeapTypes_s.TUInt8",
"LowStar.Buffer.trivial_preorder",
"Prims.unit",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"LowStar.Mo... | [] | true | false | true | false | false | let length_aux2 (b: uint8_p)
: Lemma (requires B.length b = 240) (ensures DV.length (get_downview b) % 16 = 0) =
| let db = get_downview b in
DV.length_eq db | false |
Vale.Wrapper.X64.AES.fsti | Vale.Wrapper.X64.AES.length_aux | val length_aux (b: uint8_p)
: Lemma (requires B.length b = 176) (ensures DV.length (get_downview b) % 16 = 0) | val length_aux (b: uint8_p)
: Lemma (requires B.length b = 176) (ensures DV.length (get_downview b) % 16 = 0) | let length_aux (b:uint8_p) : Lemma
(requires B.length b = 176)
(ensures DV.length (get_downview b) % 16 = 0) =
let db = get_downview b in
DV.length_eq db | {
"file_name": "vale/code/arch/x64/interop/Vale.Wrapper.X64.AES.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 19,
"end_line": 23,
"start_col": 0,
"start_line": 19
} | module Vale.Wrapper.X64.AES
open Vale.X64.CPU_Features_s
open FStar.HyperStack.ST
module B = LowStar.Buffer
module HS = FStar.HyperStack
module DV = LowStar.BufferView.Down
module UV = LowStar.BufferView.Up
open FStar.Mul
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open Vale.AES.AES_s
open Vale.Interop.Base
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Vale.Interop.Base.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.AES.AES_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferVie... | [
{
"abbrev": false,
"full_module": "Vale.Def.Types_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Interop.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.AES_s",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | b: Vale.Wrapper.X64.AES.uint8_p
-> FStar.Pervasives.Lemma (requires LowStar.Monotonic.Buffer.length b = 176)
(ensures LowStar.BufferView.Down.length (Vale.Interop.Types.get_downview b) % 16 = 0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Wrapper.X64.AES.uint8_p",
"LowStar.BufferView.Down.length_eq",
"FStar.UInt8.t",
"LowStar.BufferView.Down.buffer",
"Vale.Interop.Types.get_downview",
"Vale.Arch.HeapTypes_s.TUInt8",
"LowStar.Buffer.trivial_preorder",
"Prims.unit",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"LowStar.Mo... | [] | true | false | true | false | false | let length_aux (b: uint8_p)
: Lemma (requires B.length b = 176) (ensures DV.length (get_downview b) % 16 = 0) =
| let db = get_downview b in
DV.length_eq db | false |
Pulse.Lib.HashTable.Spec.fst | Pulse.Lib.HashTable.Spec.lookup_spec | val lookup_spec (#k #v: _) (spec: spec_t k v) (key: k) : option v | val lookup_spec (#k #v: _) (spec: spec_t k v) (key: k) : option v | let lookup_spec #k #v (spec:spec_t k v) (key:k) : option v =
spec key | {
"file_name": "share/steel/examples/pulse/lib/Pulse.Lib.HashTable.Spec.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 10,
"end_line": 46,
"start_col": 0,
"start_line": 45
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Pervasives.fst.checked",
"prims.fst.checked",
"FStar.SizeT.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Ghost.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "US"
},
{
"abbrev": false,
"full_module": "Pulse.Lib.HashTable",
"short_module": null
},
{
"abbrev": false,
"full_module": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | spec: Pulse.Lib.HashTable.Spec.spec_t k v -> key: k -> FStar.Pervasives.Native.option v | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"Pulse.Lib.HashTable.Spec.spec_t",
"FStar.Pervasives.Native.option"
] | [] | false | false | false | false | false | let lookup_spec #k #v (spec: spec_t k v) (key: k) : option v =
| spec key | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.