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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
DoublyLinkedList.fst | DoublyLinkedList.loc_includes_union_l_nodelist_fp0 | val loc_includes_union_l_nodelist_fp0 (#t: Type) (s1 s2: loc) (nl: nodelist t)
: Lemma (requires (loc_includes s1 (nodelist_fp0 nl) \/ loc_includes s2 (nodelist_fp0 nl)))
(ensures (loc_includes (loc_union s1 s2) (nodelist_fp0 nl)))
[SMTPat (loc_includes (loc_union s1 s2) (nodelist_fp0 nl))] | val loc_includes_union_l_nodelist_fp0 (#t: Type) (s1 s2: loc) (nl: nodelist t)
: Lemma (requires (loc_includes s1 (nodelist_fp0 nl) \/ loc_includes s2 (nodelist_fp0 nl)))
(ensures (loc_includes (loc_union s1 s2) (nodelist_fp0 nl)))
[SMTPat (loc_includes (loc_union s1 s2) (nodelist_fp0 nl))] | let loc_includes_union_l_nodelist_fp0 (#t: Type) (s1 s2:loc) (nl:nodelist t) :
Lemma
(requires (loc_includes s1 (nodelist_fp0 nl) \/ loc_includes s2 (nodelist_fp0 nl)))
(ensures (loc_includes (loc_union s1 s2) (nodelist_fp0 nl)))
[SMTPat (loc_includes (loc_union s1 s2) (nodelist_fp0 nl))] =
loc_includes... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 252,
"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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 |
s1: LowStar.Monotonic.Buffer.loc ->
s2: LowStar.Monotonic.Buffer.loc ->
nl: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires
LowStar.Monotonic.Buffer.loc_includes s1 (DoublyLinkedList.nodelist_fp0 nl) \/
LowStar.Monotonic.Buffer.loc_includes s2 (DoublyLinkedList.nodel... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowStar.Monotonic.Buffer.loc",
"DoublyLinkedList.nodelist",
"LowStar.Monotonic.Buffer.loc_includes_union_l",
"DoublyLinkedList.nodelist_fp0",
"Prims.unit",
"Prims.l_or",
"LowStar.Monotonic.Buffer.loc_includes",
"Prims.squash",
"LowStar.Monotonic.Buffer.loc_union",
"Prims.Cons",
"FStar.Pervasive... | [] | true | false | true | false | false | let loc_includes_union_l_nodelist_fp0 (#t: Type) (s1 s2: loc) (nl: nodelist t)
: Lemma (requires (loc_includes s1 (nodelist_fp0 nl) \/ loc_includes s2 (nodelist_fp0 nl)))
(ensures (loc_includes (loc_union s1 s2) (nodelist_fp0 nl)))
[SMTPat (loc_includes (loc_union s1 s2) (nodelist_fp0 nl))] =
| loc_includes_union_l s1 s2 (nodelist_fp0 nl) | false |
DoublyLinkedList.fst | DoublyLinkedList.fragment_conn | val fragment_conn (#t: Type) (h0: heap) (f: fragment t) : GTot Type0 | val fragment_conn (#t: Type) (h0: heap) (f: fragment t) : GTot Type0 | let rec fragment_conn (#t:Type) (h0:heap) (f:fragment t) : GTot Type0 =
fragment_for_each1 piece_conn h0 f | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 376,
"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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> f: DoublyLinkedList.fragment t -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.fragment",
"DoublyLinkedList.fragment_for_each1",
"DoublyLinkedList.piece_conn"
] | [
"recursion"
] | false | false | false | false | true | let rec fragment_conn (#t: Type) (h0: heap) (f: fragment t) : GTot Type0 =
| fragment_for_each1 piece_conn h0 f | false |
DoublyLinkedList.fst | DoublyLinkedList.fragment_valid | val fragment_valid (#t: Type) (h0: heap) (f: fragment t) : GTot Type0 | val fragment_valid (#t: Type) (h0: heap) (f: fragment t) : GTot Type0 | let fragment_valid (#t:Type) (h0:heap) (f:fragment t) : GTot Type0 =
fragment_ghostly_connections f /\
fragment_contained h0 f /\
fragment_aa f /\
fragment_conn h0 f | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 407,
"start_col": 0,
"start_line": 403
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> f: DoublyLinkedList.fragment t -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.fragment",
"Prims.l_and",
"DoublyLinkedList.fragment_ghostly_connections",
"DoublyLinkedList.fragment_contained",
"DoublyLinkedList.fragment_aa",
"DoublyLinkedList.fragment_conn"
] | [] | false | false | false | false | true | let fragment_valid (#t: Type) (h0: heap) (f: fragment t) : GTot Type0 =
| fragment_ghostly_connections f /\ fragment_contained h0 f /\ fragment_aa f /\ fragment_conn h0 f | false |
DoublyLinkedList.fst | DoublyLinkedList.piece_ghostly_connections | val piece_ghostly_connections (#t: Type) (p: piece t) : GTot Type0 | val piece_ghostly_connections (#t: Type) (p: piece t) : GTot Type0 | let piece_ghostly_connections (#t:Type) (p:piece t) : GTot Type0 =
let nodes = p.pnodes in
match length nodes with
| 0 -> False
| _ -> p.phead == hd nodes /\
p.ptail == last nodes | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 152,
"start_col": 0,
"start_line": 147
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.piece t -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"DoublyLinkedList.piece",
"FStar.List.Tot.Base.length",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"FStar.Ghost.reveal",
"DoublyLinkedList.nodelist",
"Prims.l_False",
"Prims.int",
"Prims.l_and",
"Prims.eq2",
"DoublyLinkedList.__proj__Mkpiece__item__phead",
"FStar.List.Tot.Base.hd",
"... | [] | false | false | false | false | true | let piece_ghostly_connections (#t: Type) (p: piece t) : GTot Type0 =
| let nodes = p.pnodes in
match length nodes with
| 0 -> False
| _ -> p.phead == hd nodes /\ p.ptail == last nodes | false |
DoublyLinkedList.fst | DoublyLinkedList.loc_includes_union_l_piece_fp0 | val loc_includes_union_l_piece_fp0 (#t: Type) (s1 s2: loc) (p: piece t)
: Lemma (requires (loc_includes s1 (piece_fp0 p) \/ loc_includes s2 (piece_fp0 p)))
(ensures (loc_includes (loc_union s1 s2) (piece_fp0 p)))
[SMTPat (loc_includes (loc_union s1 s2) (piece_fp0 p))] | val loc_includes_union_l_piece_fp0 (#t: Type) (s1 s2: loc) (p: piece t)
: Lemma (requires (loc_includes s1 (piece_fp0 p) \/ loc_includes s2 (piece_fp0 p)))
(ensures (loc_includes (loc_union s1 s2) (piece_fp0 p)))
[SMTPat (loc_includes (loc_union s1 s2) (piece_fp0 p))] | let loc_includes_union_l_piece_fp0 (#t: Type) (s1 s2:loc) (p:piece t) :
Lemma
(requires (loc_includes s1 (piece_fp0 p) \/ loc_includes s2 (piece_fp0 p)))
(ensures (loc_includes (loc_union s1 s2) (piece_fp0 p)))
[SMTPat (loc_includes (loc_union s1 s2) (piece_fp0 p))] =
loc_includes_union_l s1 s2 (piece_f... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 42,
"end_line": 266,
"start_col": 0,
"start_line": 261
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | s1: LowStar.Monotonic.Buffer.loc -> s2: LowStar.Monotonic.Buffer.loc -> p: DoublyLinkedList.piece t
-> FStar.Pervasives.Lemma
(requires
LowStar.Monotonic.Buffer.loc_includes s1 (DoublyLinkedList.piece_fp0 p) \/
LowStar.Monotonic.Buffer.loc_includes s2 (DoublyLinkedList.piece_fp0 p))
(ensur... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowStar.Monotonic.Buffer.loc",
"DoublyLinkedList.piece",
"LowStar.Monotonic.Buffer.loc_includes_union_l",
"DoublyLinkedList.piece_fp0",
"Prims.unit",
"Prims.l_or",
"LowStar.Monotonic.Buffer.loc_includes",
"Prims.squash",
"LowStar.Monotonic.Buffer.loc_union",
"Prims.Cons",
"FStar.Pervasives.patt... | [] | true | false | true | false | false | let loc_includes_union_l_piece_fp0 (#t: Type) (s1 s2: loc) (p: piece t)
: Lemma (requires (loc_includes s1 (piece_fp0 p) \/ loc_includes s2 (piece_fp0 p)))
(ensures (loc_includes (loc_union s1 s2) (piece_fp0 p)))
[SMTPat (loc_includes (loc_union s1 s2) (piece_fp0 p))] =
| loc_includes_union_l s1 s2 (piece_fp0 p) | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_aa_r | val nodelist_aa_r (#t: Type) (nl: nodelist t) : GTot Type0 | val nodelist_aa_r (#t: Type) (nl: nodelist t) : GTot Type0 | let rec nodelist_aa_r (#t:Type) (nl:nodelist t) : GTot Type0 =
match nl with
| [] -> True
| n :: ns ->
Mod.loc_disjoint (Mod.loc_buffer n) (nodelist_fp0 ns) /\
nodelist_aa_r ns | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 319,
"start_col": 0,
"start_line": 314
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl: DoublyLinkedList.nodelist t -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"DoublyLinkedList.nodelist",
"Prims.l_True",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"Prims.l_and",
"LowStar.Monotonic.Buffer.loc_disjoint",
"LowStar.Monotonic.Buffer.loc_buffer",
"LowStar.Buffer.trivial_preorder",
"DoublyLinkedList.nodelist_fp0",
"DoublyLinkedList.nodel... | [
"recursion"
] | false | false | false | false | true | let rec nodelist_aa_r (#t: Type) (nl: nodelist t) : GTot Type0 =
| match nl with
| [] -> True
| n :: ns -> Mod.loc_disjoint (Mod.loc_buffer n) (nodelist_fp0 ns) /\ nodelist_aa_r ns | false |
Hacl.HPKE.Curve64_CP32_SHA512.fsti | Hacl.HPKE.Curve64_CP32_SHA512.cs | val cs:S.ciphersuite | val cs:S.ciphersuite | let cs:S.ciphersuite = (DH.DH_Curve25519, Hash.SHA2_256, S.Seal AEAD.CHACHA20_POLY1305, Hash.SHA2_512) | {
"file_name": "code/hpke/Hacl.HPKE.Curve64_CP32_SHA512.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 102,
"end_line": 10,
"start_col": 0,
"start_line": 10
} | module Hacl.HPKE.Curve64_CP32_SHA512
open Hacl.Impl.HPKE
module S = Spec.Agile.HPKE
module DH = Spec.Agile.DH
module AEAD = Spec.Agile.AEAD
module Hash = Spec.Agile.Hash | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.Hash.fsti.checked",
"Spec.Agile.DH.fst.checked",
"Spec.Agile.AEAD.fsti.checked",
"prims.fst.checked",
"Hacl.Impl.HPKE.fsti.checked",
"FStar.Pervasives.Native.fs... | [
{
"abbrev": true,
"full_module": "Spec.Agile.Hash",
"short_module": "Hash"
},
{
"abbrev": true,
"full_module": "Spec.Agile.AEAD",
"short_module": "AEAD"
},
{
"abbrev": true,
"full_module": "Spec.Agile.DH",
"short_module": "DH"
},
{
"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 | Spec.Agile.HPKE.ciphersuite | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.Mktuple4",
"Spec.Agile.DH.algorithm",
"Spec.Agile.HPKE.hash_algorithm",
"Spec.Agile.HPKE.aead",
"Spec.Hash.Definitions.hash_alg",
"Spec.Agile.DH.DH_Curve25519",
"Spec.Hash.Definitions.SHA2_256",
"Spec.Agile.HPKE.Seal",
"Spec.Agile.AEAD.CHACHA20_POLY1305",
"Spec.Hash.Defini... | [] | false | false | false | true | false | let cs:S.ciphersuite =
| (DH.DH_Curve25519, Hash.SHA2_256, S.Seal AEAD.CHACHA20_POLY1305, Hash.SHA2_512) | false |
DoublyLinkedList.fst | DoublyLinkedList.loc_includes_union_l_fragment_fp0 | val loc_includes_union_l_fragment_fp0 (#t: Type) (s1 s2: loc) (f: fragment t)
: Lemma (requires (loc_includes s1 (fragment_fp0 f) \/ loc_includes s2 (fragment_fp0 f)))
(ensures (loc_includes (loc_union s1 s2) (fragment_fp0 f)))
[SMTPat (loc_includes (loc_union s1 s2) (fragment_fp0 f))] | val loc_includes_union_l_fragment_fp0 (#t: Type) (s1 s2: loc) (f: fragment t)
: Lemma (requires (loc_includes s1 (fragment_fp0 f) \/ loc_includes s2 (fragment_fp0 f)))
(ensures (loc_includes (loc_union s1 s2) (fragment_fp0 f)))
[SMTPat (loc_includes (loc_union s1 s2) (fragment_fp0 f))] | let loc_includes_union_l_fragment_fp0 (#t: Type) (s1 s2:loc) (f:fragment t) :
Lemma
(requires (loc_includes s1 (fragment_fp0 f) \/ loc_includes s2 (fragment_fp0 f)))
(ensures (loc_includes (loc_union s1 s2) (fragment_fp0 f)))
[SMTPat (loc_includes (loc_union s1 s2) (fragment_fp0 f))] =
loc_includes_unio... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 45,
"end_line": 273,
"start_col": 0,
"start_line": 268
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 |
s1: LowStar.Monotonic.Buffer.loc ->
s2: LowStar.Monotonic.Buffer.loc ->
f: DoublyLinkedList.fragment t
-> FStar.Pervasives.Lemma
(requires
LowStar.Monotonic.Buffer.loc_includes s1 (DoublyLinkedList.fragment_fp0 f) \/
LowStar.Monotonic.Buffer.loc_includes s2 (DoublyLinkedList.fragmen... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowStar.Monotonic.Buffer.loc",
"DoublyLinkedList.fragment",
"LowStar.Monotonic.Buffer.loc_includes_union_l",
"DoublyLinkedList.fragment_fp0",
"Prims.unit",
"Prims.l_or",
"LowStar.Monotonic.Buffer.loc_includes",
"Prims.squash",
"LowStar.Monotonic.Buffer.loc_union",
"Prims.Cons",
"FStar.Pervasive... | [] | true | false | true | false | false | let loc_includes_union_l_fragment_fp0 (#t: Type) (s1 s2: loc) (f: fragment t)
: Lemma (requires (loc_includes s1 (fragment_fp0 f) \/ loc_includes s2 (fragment_fp0 f)))
(ensures (loc_includes (loc_union s1 s2) (fragment_fp0 f)))
[SMTPat (loc_includes (loc_union s1 s2) (fragment_fp0 f))] =
| loc_includes_union_l s1 s2 (fragment_fp0 f) | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_conn | val nodelist_conn (#t: Type) (h0: heap) (nl: nodelist t) : GTot Type0 (decreases (length nl)) | val nodelist_conn (#t: Type) (h0: heap) (nl: nodelist t) : GTot Type0 (decreases (length nl)) | let rec nodelist_conn (#t:Type) (h0:heap) (nl:nodelist t) : GTot Type0 (decreases (length nl)) =
match nl with
| [] -> True
| n1 :: rest -> match rest with
| [] -> True
| n2 :: ns ->
n1@h0 |>> n2 /\
n1 <<| n2@h0 /\
nodelist_conn h0 rest | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 365,
"start_col": 0,
"start_line": 357
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> nl: DoublyLinkedList.nodelist t -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial",
""
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.nodelist",
"Prims.l_True",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"Prims.l_and",
"DoublyLinkedList.op_Bar_Greater_Greater",
"DoublyLinkedList.op_At",
"DoublyLinkedList.op_Less_Less_Bar",
"DoublyLinkedList.nodelist_conn"
] | [
"recursion"
] | false | false | false | false | true | let rec nodelist_conn (#t: Type) (h0: heap) (nl: nodelist t) : GTot Type0 (decreases (length nl)) =
| match nl with
| [] -> True
| n1 :: rest ->
match rest with
| [] -> True
| n2 :: ns -> n1 @ h0 |>> n2 /\ n1 <<| n2 @ h0 /\ nodelist_conn h0 rest | false |
DoublyLinkedList.fst | DoublyLinkedList.dll_conn | val dll_conn (#t: Type) (h0: heap) (d: dll t) : GTot Type0 | val dll_conn (#t: Type) (h0: heap) (d: dll t) : GTot Type0 | let dll_conn (#t:Type) (h0:heap) (d:dll t) : GTot Type0 =
nodelist_conn h0 d.nodes /\
(d.lhead =!= null ==> (d.lhead@h0).blink == null) /\
(d.ltail =!= null ==> (d.ltail@h0).flink == null) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 370,
"start_col": 0,
"start_line": 367
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> d: DoublyLinkedList.dll t -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.dll",
"Prims.l_and",
"DoublyLinkedList.nodelist_conn",
"FStar.Ghost.reveal",
"DoublyLinkedList.nodelist",
"DoublyLinkedList.__proj__Mkdll__item__nodes",
"Prims.l_imp",
"Prims.l_not",
"Prims.eq2",
"LowStar.Buffer.buffer",
"DoublyLinkedList.node",
"Do... | [] | false | false | false | false | true | let dll_conn (#t: Type) (h0: heap) (d: dll t) : GTot Type0 =
| nodelist_conn h0 d.nodes /\ (d.lhead =!= null ==> (d.lhead @ h0).blink == null) /\
(d.ltail =!= null ==> (d.ltail @ h0).flink == null) | false |
DoublyLinkedList.fst | DoublyLinkedList.fragment_aa_lr | val fragment_aa_lr (#t: Type) (f: fragment t) : GTot Type0 | val fragment_aa_lr (#t: Type) (f: fragment t) : GTot Type0 | let rec fragment_aa_lr (#t:Type) (f:fragment t) : GTot Type0 =
match f with
| Frag0 -> True
| Frag1 p1 -> True
| Frag2 p1 p2 -> Mod.loc_disjoint (piece_fp0 p1) (piece_fp0 p2)
| Frag3 p1 p2 p3 -> ((Mod.loc_disjoint (piece_fp0 p1) (piece_fp0 p2)) /\
(Mod.loc_disjoint (piece_fp0 p2) (piece... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 72,
"end_line": 345,
"start_col": 0,
"start_line": 338
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | f: DoublyLinkedList.fragment t -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"DoublyLinkedList.fragment",
"Prims.l_True",
"DoublyLinkedList.piece",
"LowStar.Monotonic.Buffer.loc_disjoint",
"DoublyLinkedList.piece_fp0",
"Prims.l_and"
] | [
"recursion"
] | false | false | false | false | true | let rec fragment_aa_lr (#t: Type) (f: fragment t) : GTot Type0 =
| match f with
| Frag0 -> True
| Frag1 p1 -> True
| Frag2 p1 p2 -> Mod.loc_disjoint (piece_fp0 p1) (piece_fp0 p2)
| Frag3 p1 p2 p3 ->
((Mod.loc_disjoint (piece_fp0 p1) (piece_fp0 p2)) /\
(Mod.loc_disjoint (piece_fp0 p2) (piece_fp0 p3)) /\
(Mod.loc_disjoint (piece_fp0 p3) (piece_fp0 p1))) | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_aa_l | val nodelist_aa_l (#t: Type) (nl: nodelist t) : GTot Type0 (decreases (length nl)) | val nodelist_aa_l (#t: Type) (nl: nodelist t) : GTot Type0 (decreases (length nl)) | let rec nodelist_aa_l (#t:Type) (nl:nodelist t) : GTot Type0 (decreases (length nl)) =
match nl with
| [] -> True
| _ ->
let ns, n = unsnoc nl in lemma_unsnoc_length nl;
Mod.loc_disjoint (Mod.loc_buffer n) (nodelist_fp0 ns) /\
nodelist_aa_l ns | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 326,
"start_col": 0,
"start_line": 320
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl: DoublyLinkedList.nodelist t -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial",
""
] | [] | [
"DoublyLinkedList.nodelist",
"Prims.l_True",
"Prims.list",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.l_and",
"LowStar.Monotonic.Buffer.loc_disjoint",
"LowStar.Monotonic.Buffer.loc_buffer",
"LowStar.Buffer.trivial_preorder",
"DoublyLinkedList.nodelist_fp0",
"DoublyLinkedList.nodel... | [
"recursion"
] | false | false | false | false | true | let rec nodelist_aa_l (#t: Type) (nl: nodelist t) : GTot Type0 (decreases (length nl)) =
| match nl with
| [] -> True
| _ ->
let ns, n = unsnoc nl in
lemma_unsnoc_length nl;
Mod.loc_disjoint (Mod.loc_buffer n) (nodelist_fp0 ns) /\ nodelist_aa_l ns | false |
DoublyLinkedList.fst | DoublyLinkedList.loc_equiv_union_union_loc | val loc_equiv_union_union_loc (a b c: Mod.loc)
: Lemma (requires (loc_equiv b c))
(ensures (loc_equiv (Mod.loc_union a b) (Mod.loc_union a c)))
[SMTPat (loc_equiv (Mod.loc_union a b) (Mod.loc_union a c))] | val loc_equiv_union_union_loc (a b c: Mod.loc)
: Lemma (requires (loc_equiv b c))
(ensures (loc_equiv (Mod.loc_union a b) (Mod.loc_union a c)))
[SMTPat (loc_equiv (Mod.loc_union a b) (Mod.loc_union a c))] | let loc_equiv_union_union_loc (a b c:Mod.loc) :
Lemma
(requires (loc_equiv b c))
(ensures (loc_equiv
(Mod.loc_union a b)
(Mod.loc_union a c)))
[SMTPat (loc_equiv
(Mod.loc_union a b)
(Mod.loc_union a c))] =
let incl = Mod.loc_includes in
l... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 307,
"start_col": 0,
"start_line": 289
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: LowStar.Monotonic.Buffer.loc ->
b: LowStar.Monotonic.Buffer.loc ->
c: LowStar.Monotonic.Buffer.loc
-> FStar.Pervasives.Lemma (requires DoublyLinkedList.loc_equiv b c)
(ensures
DoublyLinkedList.loc_equiv (LowStar.Monotonic.Buffer.loc_union a b)
(LowStar.Monotonic.Buffer.loc_unio... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowStar.Monotonic.Buffer.loc",
"LowStar.Monotonic.Buffer.loc_includes_union_l",
"Prims.unit",
"LowStar.Monotonic.Buffer.loc_union",
"LowStar.Monotonic.Buffer.loc_includes",
"DoublyLinkedList.loc_equiv",
"Prims.squash",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims... | [] | true | false | true | false | false | let loc_equiv_union_union_loc (a b c: Mod.loc)
: Lemma (requires (loc_equiv b c))
(ensures (loc_equiv (Mod.loc_union a b) (Mod.loc_union a c)))
[SMTPat (loc_equiv (Mod.loc_union a b) (Mod.loc_union a c))] =
| let incl = Mod.loc_includes in
let u = Mod.loc_union in
Mod.loc_includes_union_l a b c;
Mod.loc_includes_union_l a b a;
Mod.loc_includes_union_l a c b;
Mod.loc_includes_union_l a c a | false |
DoublyLinkedList.fst | DoublyLinkedList.unchanged_node_val | val unchanged_node_val : h0: FStar.Monotonic.HyperStack.mem ->
h1: FStar.Monotonic.HyperStack.mem ->
n:
b:
LowStar.Monotonic.Buffer.mbuffer (DoublyLinkedList.node _)
(LowStar.Buffer.trivial_preorder (DoublyLinkedList.node _))
(LowStar.Buffer.trivial_preorder (DoublyLinkedList.node _)... | let unchanged_node_val h0 h1 n =
(h0 `contains` n ==>
((n@h0).p == (n@h1).p /\ h1 `contains` n)) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 45,
"end_line": 413,
"start_col": 0,
"start_line": 411
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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:
b:
LowStar.Monotonic.Buffer.mbuffer (DoublyLinkedList.node _)
(LowStar.Buffer.trivial_preorder (DoublyLinkedList.node _))
(LowStar.Buffer.trivial_preorder (DoublyLinkedList.node _))
{LowStar.M... | Prims.Tot | [
"total"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"LowStar.Monotonic.Buffer.mbuffer",
"DoublyLinkedList.node",
"LowStar.Buffer.trivial_preorder",
"Prims.l_and",
"Prims.eq2",
"Prims.int",
"LowStar.Monotonic.Buffer.length",
"Prims.l_imp",
"DoublyLinkedList.contains",
"DoublyLinkedList.__proj__Mknode__item__p",
... | [] | false | false | false | false | true | let unchanged_node_val h0 h1 n =
| (h0 `contains` n ==> ((n @ h0).p == (n @ h1).p /\ h1 `contains` n)) | false | |
DoublyLinkedList.fst | DoublyLinkedList.unchanged_node_vals | val unchanged_node_vals (h0 h1: HS.mem) (ns: nodelist 'a) : GTot prop | val unchanged_node_vals (h0 h1: HS.mem) (ns: nodelist 'a) : GTot prop | let rec unchanged_node_vals (h0 h1:HS.mem) (ns:nodelist '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/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 75,
"end_line": 418,
"start_col": 0,
"start_line": 415
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.nodelist 'a
-> Prims.GTot Prims.prop | Prims.GTot | [
"sometrivial"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedList.nodelist",
"Prims.l_True",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"Prims.l_and",
"DoublyLinkedList.unchanged_node_val",
"DoublyLinkedList.unchanged_node_vals",
"Prims.prop"
] | [
"recursion"
] | false | false | false | false | true | let rec unchanged_node_vals (h0 h1: HS.mem) (ns: nodelist 'a) : GTot prop =
| match ns with
| [] -> True
| n :: ns' -> unchanged_node_val h0 h1 n /\ unchanged_node_vals h0 h1 ns' | false |
DoublyLinkedList.fst | DoublyLinkedList.extract_nodelist_fp0 | val extract_nodelist_fp0 (#t: Type) (nl: nodelist t) (i: nat{i < length nl})
: Lemma (ensures (Mod.loc_includes (nodelist_fp0 nl) (Mod.loc_buffer nl.[ i ]))) | val extract_nodelist_fp0 (#t: Type) (nl: nodelist t) (i: nat{i < length nl})
: Lemma (ensures (Mod.loc_includes (nodelist_fp0 nl) (Mod.loc_buffer nl.[ i ]))) | let rec extract_nodelist_fp0 (#t:Type) (nl:nodelist t) (i:nat{i < length nl}) :
Lemma
(ensures (Mod.loc_includes
(nodelist_fp0 nl)
(Mod.loc_buffer nl.[i]))) =
match i with
| 0 -> ()
| _ -> extract_nodelist_fp0 (tl nl) (i - 1) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 45,
"end_line": 483,
"start_col": 0,
"start_line": 476
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl: DoublyLinkedList.nodelist t -> i: Prims.nat{i < FStar.List.Tot.Base.length nl}
-> FStar.Pervasives.Lemma
(ensures
LowStar.Monotonic.Buffer.loc_includes (DoublyLinkedList.nodelist_fp0 nl)
(LowStar.Monotonic.Buffer.loc_buffer nl.[ i ])) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.nodelist",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.List.Tot.Base.length",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.int",
"DoublyLinkedList.extract_nodelist_fp0",
"FStar.List.Tot.Base.tl",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.l_True",
... | [
"recursion"
] | false | false | true | false | false | let rec extract_nodelist_fp0 (#t: Type) (nl: nodelist t) (i: nat{i < length nl})
: Lemma (ensures (Mod.loc_includes (nodelist_fp0 nl) (Mod.loc_buffer nl.[ i ]))) =
| match i with
| 0 -> ()
| _ -> extract_nodelist_fp0 (tl nl) (i - 1) | false |
DoublyLinkedList.fst | DoublyLinkedList.extract_nodelist_aa_l | val extract_nodelist_aa_l (#t: Type) (nl: nodelist t) (i: nat{i < length nl})
: Lemma (requires (nodelist_aa_l nl))
(ensures
(let left, n, right = split3 nl i in
Mod.loc_disjoint (Mod.loc_buffer n) (nodelist_fp0 left)))
(decreases (length nl)) | val extract_nodelist_aa_l (#t: Type) (nl: nodelist t) (i: nat{i < length nl})
: Lemma (requires (nodelist_aa_l nl))
(ensures
(let left, n, right = split3 nl i in
Mod.loc_disjoint (Mod.loc_buffer n) (nodelist_fp0 left)))
(decreases (length nl)) | let rec extract_nodelist_aa_l (#t:Type) (nl:nodelist t) (i:nat{i < length nl}) :
Lemma
(requires (nodelist_aa_l nl))
(ensures (
let left, n, right = split3 nl i in
Mod.loc_disjoint (Mod.loc_buffer n) (nodelist_fp0 left)))
(decreases (length nl)) =
if i = length nl - 1 then () else (
... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 509,
"start_col": 0,
"start_line": 495
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl: DoublyLinkedList.nodelist t -> i: Prims.nat{i < FStar.List.Tot.Base.length nl}
-> FStar.Pervasives.Lemma (requires DoublyLinkedList.nodelist_aa_l nl)
(ensures
(let _ = FStar.List.Tot.Base.split3 nl i in
(let FStar.Pervasives.Native.Mktuple3 #_ #_ #_ left n _ = _ in
LowStar.Mono... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"DoublyLinkedList.nodelist",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.List.Tot.Base.length",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Subtraction",
"Prims.bool",
"Prims.list",
"FStar.List.Pure.Properties.lemma_split3_unsnoc",... | [
"recursion"
] | false | false | true | false | false | let rec extract_nodelist_aa_l (#t: Type) (nl: nodelist t) (i: nat{i < length nl})
: Lemma (requires (nodelist_aa_l nl))
(ensures
(let left, n, right = split3 nl i in
Mod.loc_disjoint (Mod.loc_buffer n) (nodelist_fp0 left)))
(decreases (length nl)) =
| if i = length nl - 1
then ()
else
(let a, b = unsnoc nl in
lemma_unsnoc_length nl;
let left, n, right = split3 nl i in
lemma_unsnoc_split3 nl i;
extract_nodelist_aa_l a i;
lemma_split3_unsnoc nl i) | false |
DoublyLinkedList.fst | DoublyLinkedList.extract_nodelist_contained | val extract_nodelist_contained (#t: Type) (h0: heap) (nl: nodelist t) (i: nat{i < length nl})
: Lemma (requires (nodelist_contained h0 nl)) (ensures (h0 `contains` nl.[ i ])) | val extract_nodelist_contained (#t: Type) (h0: heap) (nl: nodelist t) (i: nat{i < length nl})
: Lemma (requires (nodelist_contained h0 nl)) (ensures (h0 `contains` nl.[ i ])) | let rec extract_nodelist_contained (#t:Type) (h0:heap) (nl:nodelist t) (i:nat{i < length nl}) :
Lemma
(requires (nodelist_contained h0 nl))
(ensures (h0 `contains` nl.[i])) =
match i with
| 0 -> ()
| _ -> extract_nodelist_contained h0 (tl nl) (i - 1) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 474,
"start_col": 0,
"start_line": 468
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap ->
nl: DoublyLinkedList.nodelist t ->
i: Prims.nat{i < FStar.List.Tot.Base.length nl}
-> FStar.Pervasives.Lemma (requires DoublyLinkedList.nodelist_contained h0 nl)
(ensures DoublyLinkedList.contains h0 nl.[ i ]) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.nodelist",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.List.Tot.Base.length",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.int",
"DoublyLinkedList.extract_nodelist_contained",
"FStar.List.Tot.Base.tl",
"Prims.op_Subtraction",
... | [
"recursion"
] | false | false | true | false | false | let rec extract_nodelist_contained (#t: Type) (h0: heap) (nl: nodelist t) (i: nat{i < length nl})
: Lemma (requires (nodelist_contained h0 nl)) (ensures (h0 `contains` nl.[ i ])) =
| match i with
| 0 -> ()
| _ -> extract_nodelist_contained h0 (tl nl) (i - 1) | false |
DoublyLinkedList.fst | DoublyLinkedList.extract_nodelist_aa_r | val extract_nodelist_aa_r (#t: Type) (nl: nodelist t) (i: nat{i < length nl})
: Lemma (requires (nodelist_aa_r nl))
(ensures
(let left, n, right = split3 nl i in
Mod.loc_disjoint (Mod.loc_buffer n) (nodelist_fp0 right))) | val extract_nodelist_aa_r (#t: Type) (nl: nodelist t) (i: nat{i < length nl})
: Lemma (requires (nodelist_aa_r nl))
(ensures
(let left, n, right = split3 nl i in
Mod.loc_disjoint (Mod.loc_buffer n) (nodelist_fp0 right))) | let rec extract_nodelist_aa_r (#t:Type) (nl:nodelist t) (i:nat{i < length nl}) :
Lemma
(requires (nodelist_aa_r nl))
(ensures (
let left, n, right = split3 nl i in
Mod.loc_disjoint (Mod.loc_buffer n) (nodelist_fp0 right))) =
match i with
| 0 -> ()
| _ -> extract_nodelist_aa_r (tl nl) (i ... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 493,
"start_col": 0,
"start_line": 485
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl: DoublyLinkedList.nodelist t -> i: Prims.nat{i < FStar.List.Tot.Base.length nl}
-> FStar.Pervasives.Lemma (requires DoublyLinkedList.nodelist_aa_r nl)
(ensures
(let _ = FStar.List.Tot.Base.split3 nl i in
(let FStar.Pervasives.Native.Mktuple3 #_ #_ #_ _ n right = _ in
LowStar.Mon... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.nodelist",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.List.Tot.Base.length",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.int",
"DoublyLinkedList.extract_nodelist_aa_r",
"FStar.List.Tot.Base.tl",
"Prims.op_Subtraction",
"Prims.unit",
"DoublyLinkedLis... | [
"recursion"
] | false | false | true | false | false | let rec extract_nodelist_aa_r (#t: Type) (nl: nodelist t) (i: nat{i < length nl})
: Lemma (requires (nodelist_aa_r nl))
(ensures
(let left, n, right = split3 nl i in
Mod.loc_disjoint (Mod.loc_buffer n) (nodelist_fp0 right))) =
| match i with
| 0 -> ()
| _ -> extract_nodelist_aa_r (tl nl) (i - 1) | false |
DoublyLinkedList.fst | DoublyLinkedList.node_not_in_dll | val node_not_in_dll : h0: DoublyLinkedList.heap ->
n: LowStar.Buffer.pointer (DoublyLinkedList.node t) ->
d: DoublyLinkedList.dll t
-> Prims.GTot Type0 | let node_not_in_dll (#t:Type) (h0:heap) (n:pointer (node t)) (d:dll t) =
let m1 = Mod.loc_buffer n in
let m2 = dll_fp0 d in
Mod.loc_disjoint m1 m2 | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 1367,
"start_col": 0,
"start_line": 1364
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap ->
n: LowStar.Buffer.pointer (DoublyLinkedList.node t) ->
d: DoublyLinkedList.dll t
-> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"DoublyLinkedList.heap",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"DoublyLinkedList.dll",
"LowStar.Monotonic.Buffer.loc_disjoint",
"LowStar.Monotonic.Buffer.loc",
"DoublyLinkedList.dll_fp0",
"LowStar.Monotonic.Buffer.loc_buffer",
"LowStar.Buffer.trivial_preorder"
] | [] | false | false | false | false | true | let node_not_in_dll (#t: Type) (h0: heap) (n: pointer (node t)) (d: dll t) =
| let m1 = Mod.loc_buffer n in
let m2 = dll_fp0 d in
Mod.loc_disjoint m1 m2 | false | |
DoublyLinkedList.fst | DoublyLinkedList.fst_unsnoc_nodelist_conn | val fst_unsnoc_nodelist_conn (#t: Type) (h0: heap) (nl: nodelist t)
: Lemma (requires (nodelist_conn h0 nl /\ length nl > 0))
(ensures (nodelist_conn h0 (fst (unsnoc nl)))) | val fst_unsnoc_nodelist_conn (#t: Type) (h0: heap) (nl: nodelist t)
: Lemma (requires (nodelist_conn h0 nl /\ length nl > 0))
(ensures (nodelist_conn h0 (fst (unsnoc nl)))) | let rec fst_unsnoc_nodelist_conn (#t:Type) (h0:heap) (nl:nodelist t) :
Lemma
(requires (nodelist_conn h0 nl /\ length nl > 0))
(ensures (nodelist_conn h0 (fst (unsnoc nl)))) =
match nl with
| [_] -> ()
| _ -> fst_unsnoc_nodelist_conn h0 (tl nl) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 595,
"start_col": 0,
"start_line": 589
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> nl: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires DoublyLinkedList.nodelist_conn h0 nl /\ FStar.List.Tot.Base.length nl > 0)
(ensures
DoublyLinkedList.nodelist_conn h0
(FStar.Pervasives.Native.fst (FStar.List.Tot.Base.unsnoc nl))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.nodelist",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"DoublyLinkedList.fst_unsnoc_nodelist_conn",
"FStar.List.Tot.Base.tl",
"Prims.unit",
"Prims.l_and",
"DoublyLinkedList.nodelist_conn",
"Prims.b2t",
"Prims.op_GreaterThan",
"F... | [
"recursion"
] | false | false | true | false | false | let rec fst_unsnoc_nodelist_conn (#t: Type) (h0: heap) (nl: nodelist t)
: Lemma (requires (nodelist_conn h0 nl /\ length nl > 0))
(ensures (nodelist_conn h0 (fst (unsnoc nl)))) =
| match nl with
| [_] -> ()
| _ -> fst_unsnoc_nodelist_conn h0 (tl nl) | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_append_aa | val nodelist_append_aa (#t: Type) (nl1 nl2: nodelist t)
: Lemma
(requires
(nodelist_aa nl1 /\ nodelist_aa nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2)))
(ensures (nodelist_aa (append nl1 nl2))) | val nodelist_append_aa (#t: Type) (nl1 nl2: nodelist t)
: Lemma
(requires
(nodelist_aa nl1 /\ nodelist_aa nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2)))
(ensures (nodelist_aa (append nl1 nl2))) | let nodelist_append_aa (#t:Type) (nl1 nl2:nodelist t) :
Lemma
(requires (nodelist_aa nl1 /\ nodelist_aa nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2)))
(ensures (nodelist_aa (append nl1 nl2))) =
nodelist_append_aa_l nl1 nl2; nodelist_append_aa_r nl1 nl2 | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 60,
"end_line": 765,
"start_col": 0,
"start_line": 760
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl1: DoublyLinkedList.nodelist t -> nl2: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.nodelist_aa nl1 /\ DoublyLinkedList.nodelist_aa nl2 /\
LowStar.Monotonic.Buffer.loc_disjoint (DoublyLinkedList.nodelist_fp0 nl1)
(DoublyLinkedList.nodelist_fp0 nl2)... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.nodelist",
"DoublyLinkedList.nodelist_append_aa_r",
"Prims.unit",
"DoublyLinkedList.nodelist_append_aa_l",
"Prims.l_and",
"DoublyLinkedList.nodelist_aa",
"LowStar.Monotonic.Buffer.loc_disjoint",
"DoublyLinkedList.nodelist_fp0",
"Prims.squash",
"FStar.List.Tot.Base.append",
"Low... | [] | true | false | true | false | false | let nodelist_append_aa (#t: Type) (nl1 nl2: nodelist t)
: Lemma
(requires
(nodelist_aa nl1 /\ nodelist_aa nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2)))
(ensures (nodelist_aa (append nl1 nl2))) =
| nodelist_append_aa_l nl1 nl2;
nodelist_append_aa_r nl1 nl2 | false |
DoublyLinkedList.fst | DoublyLinkedList.tot_piece_to_dll | val tot_piece_to_dll
(#t: Type)
(h0: heap)
(p: piece t {piece_valid h0 p /\ (p.phead @ h0).blink == null /\ (p.ptail @ h0).flink == null}
)
: Tot (d: dll t {dll_valid h0 d}) | val tot_piece_to_dll
(#t: Type)
(h0: heap)
(p: piece t {piece_valid h0 p /\ (p.phead @ h0).blink == null /\ (p.ptail @ h0).flink == null}
)
: Tot (d: dll t {dll_valid h0 d}) | let tot_piece_to_dll (#t:Type) (h0:heap) (p:piece t{
piece_valid h0 p /\
(p.phead@h0).blink == null /\
(p.ptail@h0).flink == null}) :
Tot (d:dll t{dll_valid h0 d}) =
{ lhead = p.phead ; ltail = p.ptail ; nodes = p.pnodes } | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 671,
"start_col": 0,
"start_line": 666
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap ->
p:
DoublyLinkedList.piece t
{ DoublyLinkedList.piece_valid h0 p /\
Mknode?.blink (Mkpiece?.phead p @ h0) == LowStar.Buffer.null /\
Mknode?.flink (Mkpiece?.ptail p @ h0) == LowStar.Buffer.null }
-> d: DoublyLinkedList.dll t {DoublyLinkedList.dll_v... | Prims.Tot | [
"total"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.piece",
"Prims.l_and",
"DoublyLinkedList.piece_valid",
"Prims.eq2",
"LowStar.Buffer.buffer",
"DoublyLinkedList.node",
"DoublyLinkedList.__proj__Mknode__item__blink",
"DoublyLinkedList.op_At",
"DoublyLinkedList.__proj__Mkpiece__item__phead",
"LowStar.Buf... | [] | false | false | false | false | false | let tot_piece_to_dll
(#t: Type)
(h0: heap)
(p:
piece t {piece_valid h0 p /\ (p.phead @ h0).blink == null /\ (p.ptail @ h0).flink == null}
)
: Tot (d: dll t {dll_valid h0 d}) =
| { lhead = p.phead; ltail = p.ptail; nodes = p.pnodes } | false |
DoublyLinkedList.fst | DoublyLinkedList.extract_nodelist_conn | val extract_nodelist_conn (#t: Type) (h0: heap) (nl: nodelist t) (i: nat{i < length nl - 1})
: Lemma (requires (nodelist_conn h0 nl))
(ensures ((nl.[ i ] @ h0 |>> nl.[ i + 1 ]) /\ (nl.[ i ] <<| nl.[ i + 1 ] @ h0)))
(decreases (length nl)) | val extract_nodelist_conn (#t: Type) (h0: heap) (nl: nodelist t) (i: nat{i < length nl - 1})
: Lemma (requires (nodelist_conn h0 nl))
(ensures ((nl.[ i ] @ h0 |>> nl.[ i + 1 ]) /\ (nl.[ i ] <<| nl.[ i + 1 ] @ h0)))
(decreases (length nl)) | let rec extract_nodelist_conn (#t:Type) (h0:heap) (nl:nodelist t) (i:nat{i < length nl - 1}) :
Lemma
(requires (nodelist_conn h0 nl))
(ensures (
(nl.[i]@h0 |>> nl.[i+1]) /\
(nl.[i] <<| nl.[i+1]@h0)))
(decreases (length nl)) =
match i with
| 0 -> ()
| _ -> extract_nodelist_conn h0 (tl... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 520,
"start_col": 0,
"start_line": 511
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap ->
nl: DoublyLinkedList.nodelist t ->
i: Prims.nat{i < FStar.List.Tot.Base.length nl - 1}
-> FStar.Pervasives.Lemma (requires DoublyLinkedList.nodelist_conn h0 nl)
(ensures nl.[ i ] @ h0 |>> nl.[ i + 1 ] /\ nl.[ i ] <<| nl.[ i + 1 ] @ h0)
(decreases FStar.List.Tot.Ba... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.nodelist",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.op_Subtraction",
"FStar.List.Tot.Base.length",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.int",
"DoublyLinkedList.extract_nodelist_conn",
"FStar.List.Tot.Base.tl",
"Prim... | [
"recursion"
] | false | false | true | false | false | let rec extract_nodelist_conn (#t: Type) (h0: heap) (nl: nodelist t) (i: nat{i < length nl - 1})
: Lemma (requires (nodelist_conn h0 nl))
(ensures ((nl.[ i ] @ h0 |>> nl.[ i + 1 ]) /\ (nl.[ i ] <<| nl.[ i + 1 ] @ h0)))
(decreases (length nl)) =
| match i with
| 0 -> ()
| _ -> extract_nodelist_conn h0 (tl nl) (i - 1) | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_append_contained | val nodelist_append_contained (#t: Type) (h0: heap) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_contained h0 nl1 /\ nodelist_contained h0 nl2))
(ensures (nodelist_contained h0 (append nl1 nl2))) | val nodelist_append_contained (#t: Type) (h0: heap) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_contained h0 nl1 /\ nodelist_contained h0 nl2))
(ensures (nodelist_contained h0 (append nl1 nl2))) | let rec nodelist_append_contained (#t:Type) (h0:heap) (nl1 nl2:nodelist t) :
Lemma
(requires (nodelist_contained h0 nl1 /\ nodelist_contained h0 nl2))
(ensures (nodelist_contained h0 (append nl1 nl2))) =
match nl1 with
| [] -> ()
| _ :: nl1' -> nodelist_append_contained h0 nl1' nl2 | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 683,
"start_col": 0,
"start_line": 677
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> nl1: DoublyLinkedList.nodelist t -> nl2: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.nodelist_contained h0 nl1 /\ DoublyLinkedList.nodelist_contained h0 nl2)
(ensures DoublyLinkedList.nodelist_contained h0 (nl1 @ nl2)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.nodelist",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"DoublyLinkedList.nodelist_append_contained",
"Prims.unit",
"Prims.l_and",
"DoublyLinkedList.nodelist_contained",
"Prims.squash",
"FStar.List.Tot.Base.append",
"Prims.Nil",
... | [
"recursion"
] | false | false | true | false | false | let rec nodelist_append_contained (#t: Type) (h0: heap) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_contained h0 nl1 /\ nodelist_contained h0 nl2))
(ensures (nodelist_contained h0 (append nl1 nl2))) =
| match nl1 with
| [] -> ()
| _ :: nl1' -> nodelist_append_contained h0 nl1' nl2 | false |
DoublyLinkedList.fst | DoublyLinkedList.fst_unsnoc_nodelist_valid | val fst_unsnoc_nodelist_valid (#t: Type) (h0: heap) (nl: nodelist t)
: Lemma (requires (nodelist_valid h0 nl /\ length nl > 0))
(ensures (nodelist_valid h0 (fst (unsnoc nl)))) | val fst_unsnoc_nodelist_valid (#t: Type) (h0: heap) (nl: nodelist t)
: Lemma (requires (nodelist_valid h0 nl /\ length nl > 0))
(ensures (nodelist_valid h0 (fst (unsnoc nl)))) | let fst_unsnoc_nodelist_valid (#t:Type) (h0:heap) (nl:nodelist t) :
Lemma
(requires (nodelist_valid h0 nl /\ length nl > 0))
(ensures (nodelist_valid h0 (fst (unsnoc nl)))) =
fst_unsnoc_nodelist_contained h0 nl;
fst_unsnoc_nodelist_aa nl;
fst_unsnoc_nodelist_conn h0 nl | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 603,
"start_col": 0,
"start_line": 597
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> nl: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires DoublyLinkedList.nodelist_valid h0 nl /\ FStar.List.Tot.Base.length nl > 0)
(ensures
DoublyLinkedList.nodelist_valid h0
(FStar.Pervasives.Native.fst (FStar.List.Tot.Base.unsnoc nl))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.nodelist",
"DoublyLinkedList.fst_unsnoc_nodelist_conn",
"Prims.unit",
"DoublyLinkedList.fst_unsnoc_nodelist_aa",
"DoublyLinkedList.fst_unsnoc_nodelist_contained",
"Prims.l_and",
"DoublyLinkedList.nodelist_valid",
"Prims.b2t",
"Prims.op_GreaterThan",
"FS... | [] | true | false | true | false | false | let fst_unsnoc_nodelist_valid (#t: Type) (h0: heap) (nl: nodelist t)
: Lemma (requires (nodelist_valid h0 nl /\ length nl > 0))
(ensures (nodelist_valid h0 (fst (unsnoc nl)))) =
| fst_unsnoc_nodelist_contained h0 nl;
fst_unsnoc_nodelist_aa nl;
fst_unsnoc_nodelist_conn h0 nl | false |
DoublyLinkedList.fst | DoublyLinkedList.tot_dll_to_fragment | val tot_dll_to_fragment (#t: Type) (h0: heap) (d: dll t {dll_valid h0 d /\ d.lhead =!= null})
: Tot (f: fragment t {fragment_valid h0 f}) | val tot_dll_to_fragment (#t: Type) (h0: heap) (d: dll t {dll_valid h0 d /\ d.lhead =!= null})
: Tot (f: fragment t {fragment_valid h0 f}) | let tot_dll_to_fragment (#t:Type) (h0:heap) (d:dll t{dll_valid h0 d /\ d.lhead =!= null}) :
Tot (f:fragment t{fragment_valid h0 f}) =
Frag1 (tot_dll_to_piece h0 d) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 664,
"start_col": 0,
"start_line": 662
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap ->
d:
DoublyLinkedList.dll t
{DoublyLinkedList.dll_valid h0 d /\ ~(Mkdll?.lhead d == LowStar.Buffer.null)}
-> f: DoublyLinkedList.fragment t {DoublyLinkedList.fragment_valid h0 f} | Prims.Tot | [
"total"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.dll",
"Prims.l_and",
"DoublyLinkedList.dll_valid",
"Prims.l_not",
"Prims.eq2",
"LowStar.Buffer.buffer",
"DoublyLinkedList.node",
"DoublyLinkedList.__proj__Mkdll__item__lhead",
"LowStar.Buffer.null",
"DoublyLinkedList.Frag1",
"DoublyLinkedList.tot_dll_... | [] | false | false | false | false | false | let tot_dll_to_fragment (#t: Type) (h0: heap) (d: dll t {dll_valid h0 d /\ d.lhead =!= null})
: Tot (f: fragment t {fragment_valid h0 f}) =
| Frag1 (tot_dll_to_piece h0 d) | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_includes_l_fp0 | val nodelist_includes_l_fp0 (#t: Type) (nl: nodelist t) (i j: nat)
: Lemma (requires (i <= j /\ j < length nl))
(ensures
(let a, _ = splitAt i nl in
let b, _ = splitAt j nl in
Mod.loc_includes (nodelist_fp0 b) (nodelist_fp0 a)))
(decreases (j - i)) | val nodelist_includes_l_fp0 (#t: Type) (nl: nodelist t) (i j: nat)
: Lemma (requires (i <= j /\ j < length nl))
(ensures
(let a, _ = splitAt i nl in
let b, _ = splitAt j nl in
Mod.loc_includes (nodelist_fp0 b) (nodelist_fp0 a)))
(decreases (j - i)) | let rec nodelist_includes_l_fp0 (#t:Type) (nl:nodelist t) (i j:nat) :
Lemma
(requires (i <= j /\ j < length nl))
(ensures (
let a, _ = splitAt i nl in
let b, _ = splitAt j nl in
Mod.loc_includes (nodelist_fp0 b) (nodelist_fp0 a)))
(decreases (j - i)) =
if i = j then () else (
le... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 654,
"start_col": 0,
"start_line": 630
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl: DoublyLinkedList.nodelist t -> i: Prims.nat -> j: Prims.nat
-> FStar.Pervasives.Lemma (requires i <= j /\ j < FStar.List.Tot.Base.length nl)
(ensures
(let _ = FStar.List.Tot.Base.splitAt i nl in
(let FStar.Pervasives.Native.Mktuple2 #_ #_ a _ = _ in
let _ = FStar.List.Tot.Base.... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"DoublyLinkedList.nodelist",
"Prims.nat",
"Prims.op_Equality",
"Prims.bool",
"Prims.list",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.int",
"Prims.op_Subtraction",
"DoublyLinkedList.fst_unsnoc_nodelist_fp0",
"Prims.unit",
"FStar.List.Tot.Properties.lemma_unsnoc_append",
"Prims... | [
"recursion"
] | false | false | true | false | false | let rec nodelist_includes_l_fp0 (#t: Type) (nl: nodelist t) (i j: nat)
: Lemma (requires (i <= j /\ j < length nl))
(ensures
(let a, _ = splitAt i nl in
let b, _ = splitAt j nl in
Mod.loc_includes (nodelist_fp0 b) (nodelist_fp0 a)))
(decreases (j - i)) =
| if i = j
then ()
else
(let a, a' = splitAt i nl in
lemma_splitAt nl a a' i;
let b, b' = splitAt j nl in
lemma_splitAt nl b b' j;
if i = j - 1
then
(List.Pure.Properties.splitAt_assoc i 1 nl;
lemma_unsnoc_append a [hd a'];
fst_unsnoc_nodelist_fp0 b)
else
(nodelist_in... | false |
DoublyLinkedList.fst | DoublyLinkedList.snd_unsnoc_nodelist_fp0 | val snd_unsnoc_nodelist_fp0 (#t: Type) (nl: nodelist t)
: Lemma (requires (length nl > 0))
(ensures (Mod.loc_includes (nodelist_fp0 nl) (Mod.loc_buffer (snd (unsnoc nl)))))
[SMTPat (Mod.loc_includes (nodelist_fp0 nl) (Mod.loc_buffer (snd (unsnoc nl))))] | val snd_unsnoc_nodelist_fp0 (#t: Type) (nl: nodelist t)
: Lemma (requires (length nl > 0))
(ensures (Mod.loc_includes (nodelist_fp0 nl) (Mod.loc_buffer (snd (unsnoc nl)))))
[SMTPat (Mod.loc_includes (nodelist_fp0 nl) (Mod.loc_buffer (snd (unsnoc nl))))] | let rec snd_unsnoc_nodelist_fp0 (#t:Type) (nl:nodelist t) :
Lemma
(requires (length nl > 0))
(ensures (Mod.loc_includes (nodelist_fp0 nl) (Mod.loc_buffer (snd (unsnoc nl)))))
[SMTPat (Mod.loc_includes (nodelist_fp0 nl) (Mod.loc_buffer (snd (unsnoc nl))))] =
match nl with
| [_] -> ()
| n :: ns -> snd... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 562,
"start_col": 0,
"start_line": 555
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma (requires FStar.List.Tot.Base.length nl > 0)
(ensures
LowStar.Monotonic.Buffer.loc_includes (DoublyLinkedList.nodelist_fp0 nl)
(LowStar.Monotonic.Buffer.loc_buffer (FStar.Pervasives.Native.snd (FStar.List.Tot.Base.unsnoc
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.nodelist",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"DoublyLinkedList.snd_unsnoc_nodelist_fp0",
"Prims.unit",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.List.Tot.Base.length",
"Prims.squash",
"LowStar.Monotonic.Buffer.loc_includes",
"DoublyLinkedList.... | [
"recursion"
] | false | false | true | false | false | let rec snd_unsnoc_nodelist_fp0 (#t: Type) (nl: nodelist t)
: Lemma (requires (length nl > 0))
(ensures (Mod.loc_includes (nodelist_fp0 nl) (Mod.loc_buffer (snd (unsnoc nl)))))
[SMTPat (Mod.loc_includes (nodelist_fp0 nl) (Mod.loc_buffer (snd (unsnoc nl))))] =
| match nl with
| [_] -> ()
| n :: ns -> snd_unsnoc_nodelist_fp0 ns | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_split_contained | val nodelist_split_contained (#t: Type) (h0: heap) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_contained h0 (append nl1 nl2)))
(ensures (nodelist_contained h0 nl1 /\ nodelist_contained h0 nl2)) | val nodelist_split_contained (#t: Type) (h0: heap) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_contained h0 (append nl1 nl2)))
(ensures (nodelist_contained h0 nl1 /\ nodelist_contained h0 nl2)) | let rec nodelist_split_contained (#t:Type) (h0:heap) (nl1 nl2:nodelist t) :
Lemma
(requires (nodelist_contained h0 (append nl1 nl2)))
(ensures (nodelist_contained h0 nl1 /\ nodelist_contained h0 nl2)) =
match nl1 with
| [] -> ()
| _ :: nl1' -> nodelist_split_contained h0 nl1' nl2 | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 939,
"start_col": 0,
"start_line": 933
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> nl1: DoublyLinkedList.nodelist t -> nl2: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma (requires DoublyLinkedList.nodelist_contained h0 (nl1 @ nl2))
(ensures
DoublyLinkedList.nodelist_contained h0 nl1 /\ DoublyLinkedList.nodelist_contained h0 nl2) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.nodelist",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"DoublyLinkedList.nodelist_split_contained",
"Prims.unit",
"DoublyLinkedList.nodelist_contained",
"FStar.List.Tot.Base.append",
"Prims.squash",
"Prims.l_and",
"Prims.Nil",
"... | [
"recursion"
] | false | false | true | false | false | let rec nodelist_split_contained (#t: Type) (h0: heap) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_contained h0 (append nl1 nl2)))
(ensures (nodelist_contained h0 nl1 /\ nodelist_contained h0 nl2)) =
| match nl1 with
| [] -> ()
| _ :: nl1' -> nodelist_split_contained h0 nl1' nl2 | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_append_fp0 | val nodelist_append_fp0 (#t: Type) (nl1 nl2: nodelist t)
: Lemma
(ensures
(loc_equiv (nodelist_fp0 (append nl1 nl2))
(Mod.loc_union (nodelist_fp0 nl1) (nodelist_fp0 nl2)))) | val nodelist_append_fp0 (#t: Type) (nl1 nl2: nodelist t)
: Lemma
(ensures
(loc_equiv (nodelist_fp0 (append nl1 nl2))
(Mod.loc_union (nodelist_fp0 nl1) (nodelist_fp0 nl2)))) | let rec nodelist_append_fp0 (#t:Type) (nl1 nl2:nodelist t) :
Lemma
(ensures (
loc_equiv
(nodelist_fp0 (append nl1 nl2))
(Mod.loc_union (nodelist_fp0 nl1) (nodelist_fp0 nl2)))) =
match nl1 with
| [] -> ()
| n :: nl1' ->
nodelist_append_fp0 nl1' nl2;
// assert (loc_equiv
... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 6,
"end_line": 717,
"start_col": 0,
"start_line": 685
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl1: DoublyLinkedList.nodelist t -> nl2: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(ensures
DoublyLinkedList.loc_equiv (DoublyLinkedList.nodelist_fp0 (nl1 @ nl2))
(LowStar.Monotonic.Buffer.loc_union (DoublyLinkedList.nodelist_fp0 nl1)
(DoublyLinkedList.nodelist_fp0 nl2))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.nodelist",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"Prims.unit",
"DoublyLinkedList.loc_equiv_trans",
"LowStar.Monotonic.Buffer.loc_union",
"DoublyLinkedList.nodelist_fp0",
"LowStar.Monotonic.Buffer.loc_buffer",
"LowStar.Buffer.trivial_preorder",
"FStar.... | [
"recursion"
] | false | false | true | false | false | let rec nodelist_append_fp0 (#t: Type) (nl1 nl2: nodelist t)
: Lemma
(ensures
(loc_equiv (nodelist_fp0 (append nl1 nl2))
(Mod.loc_union (nodelist_fp0 nl1) (nodelist_fp0 nl2)))) =
| match nl1 with
| [] -> ()
| n :: nl1' ->
nodelist_append_fp0 nl1' nl2;
loc_equiv_trans (Mod.loc_union (nodelist_fp0 nl1) (nodelist_fp0 nl2))
(Mod.loc_union (Mod.loc_buffer n) (Mod.loc_union (nodelist_fp0 nl1') (nodelist_fp0 nl2)))
(Mod.loc_union (Mod.loc_buffer n) (nodelist_fp0 (append nl1' nl2)));
() | false |
DoublyLinkedList.fst | DoublyLinkedList.loc_includes_union_r_inv | val loc_includes_union_r_inv (a b c: Mod.loc)
: Lemma (requires (Mod.loc_includes a (Mod.loc_union b c)))
(ensures (Mod.loc_includes a b /\ Mod.loc_includes a c)) | val loc_includes_union_r_inv (a b c: Mod.loc)
: Lemma (requires (Mod.loc_includes a (Mod.loc_union b c)))
(ensures (Mod.loc_includes a b /\ Mod.loc_includes a c)) | let loc_includes_union_r_inv (a b c:Mod.loc) :
Lemma
(requires (Mod.loc_includes a (Mod.loc_union b c)))
(ensures (Mod.loc_includes a b /\ Mod.loc_includes a c)) =
Mod.loc_includes_union_l b c b;
Mod.loc_includes_trans a (Mod.loc_union b c) b;
Mod.loc_includes_union_l b c c;
Mod.loc_includes_trans a (... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 48,
"end_line": 800,
"start_col": 0,
"start_line": 793
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: LowStar.Monotonic.Buffer.loc ->
b: LowStar.Monotonic.Buffer.loc ->
c: LowStar.Monotonic.Buffer.loc
-> FStar.Pervasives.Lemma
(requires LowStar.Monotonic.Buffer.loc_includes a (LowStar.Monotonic.Buffer.loc_union b c))
(ensures
LowStar.Monotonic.Buffer.loc_includes a b /\ LowStar.Mon... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowStar.Monotonic.Buffer.loc",
"LowStar.Monotonic.Buffer.loc_includes_trans",
"LowStar.Monotonic.Buffer.loc_union",
"Prims.unit",
"LowStar.Monotonic.Buffer.loc_includes_union_l",
"LowStar.Monotonic.Buffer.loc_includes",
"Prims.squash",
"Prims.l_and",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let loc_includes_union_r_inv (a b c: Mod.loc)
: Lemma (requires (Mod.loc_includes a (Mod.loc_union b c)))
(ensures (Mod.loc_includes a b /\ Mod.loc_includes a c)) =
| Mod.loc_includes_union_l b c b;
Mod.loc_includes_trans a (Mod.loc_union b c) b;
Mod.loc_includes_union_l b c c;
Mod.loc_includes_trans a (Mod.loc_union b c) c | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_split_aa_r | val nodelist_split_aa_r (#t: Type) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_aa_r (append nl1 nl2)))
(ensures (nodelist_aa_r nl1 /\ nodelist_aa_r nl2)) | val nodelist_split_aa_r (#t: Type) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_aa_r (append nl1 nl2)))
(ensures (nodelist_aa_r nl1 /\ nodelist_aa_r nl2)) | let rec nodelist_split_aa_r (#t:Type) (nl1 nl2:nodelist t) :
Lemma
(requires (nodelist_aa_r (append nl1 nl2)))
(ensures (nodelist_aa_r nl1 /\ nodelist_aa_r nl2)) =
match nl1 with
| [] -> ()
| _ ->
nodelist_split_aa_r (tl nl1) nl2;
nodelist_append_fp0 (tl nl1) nl2 | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 1032,
"start_col": 0,
"start_line": 1024
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl1: DoublyLinkedList.nodelist t -> nl2: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma (requires DoublyLinkedList.nodelist_aa_r (nl1 @ nl2))
(ensures DoublyLinkedList.nodelist_aa_r nl1 /\ DoublyLinkedList.nodelist_aa_r nl2) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.nodelist",
"Prims.list",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"DoublyLinkedList.nodelist_append_fp0",
"FStar.List.Tot.Base.tl",
"Prims.unit",
"DoublyLinkedList.nodelist_split_aa_r",
"DoublyLinkedList.nodelist_aa_r",
"FStar.List.Tot.Base.append",
"Prims.squash",
... | [
"recursion"
] | false | false | true | false | false | let rec nodelist_split_aa_r (#t: Type) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_aa_r (append nl1 nl2)))
(ensures (nodelist_aa_r nl1 /\ nodelist_aa_r nl2)) =
| match nl1 with
| [] -> ()
| _ ->
nodelist_split_aa_r (tl nl1) nl2;
nodelist_append_fp0 (tl nl1) nl2 | false |
DoublyLinkedList.fst | DoublyLinkedList.tot_dll_to_piece | val tot_dll_to_piece (#t: Type) (h0: heap) (d: nonempty_dll t {dll_valid h0 d})
: Tot (p: piece t {piece_valid h0 p}) | val tot_dll_to_piece (#t: Type) (h0: heap) (d: nonempty_dll t {dll_valid h0 d})
: Tot (p: piece t {piece_valid h0 p}) | let tot_dll_to_piece (#t:Type) (h0:heap) (d:nonempty_dll t{dll_valid h0 d}) :
Tot (p:piece t{piece_valid h0 p}) =
{ phead = d.lhead ; ptail = d.ltail ; pnodes = d.nodes } | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 660,
"start_col": 0,
"start_line": 658
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> d: DoublyLinkedList.nonempty_dll t {DoublyLinkedList.dll_valid h0 d}
-> p: DoublyLinkedList.piece t {DoublyLinkedList.piece_valid h0 p} | Prims.Tot | [
"total"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.nonempty_dll",
"DoublyLinkedList.dll_valid",
"DoublyLinkedList.Mkpiece",
"DoublyLinkedList.__proj__Mkdll__item__lhead",
"DoublyLinkedList.__proj__Mkdll__item__ltail",
"DoublyLinkedList.__proj__Mkdll__item__nodes",
"DoublyLinkedList.piece",
"DoublyLinkedList... | [] | false | false | false | false | false | let tot_dll_to_piece (#t: Type) (h0: heap) (d: nonempty_dll t {dll_valid h0 d})
: Tot (p: piece t {piece_valid h0 p}) =
| { phead = d.lhead; ptail = d.ltail; pnodes = d.nodes } | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_append_aa_r | val nodelist_append_aa_r (#t: Type) (nl1 nl2: nodelist t)
: Lemma
(requires
(nodelist_aa_r nl1 /\ nodelist_aa_r nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2)))
(ensures (nodelist_aa_r (append nl1 nl2))) | val nodelist_append_aa_r (#t: Type) (nl1 nl2: nodelist t)
: Lemma
(requires
(nodelist_aa_r nl1 /\ nodelist_aa_r nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2)))
(ensures (nodelist_aa_r (append nl1 nl2))) | let rec nodelist_append_aa_r (#t:Type) (nl1 nl2:nodelist t) :
Lemma
(requires (nodelist_aa_r nl1 /\ nodelist_aa_r nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2)))
(ensures (nodelist_aa_r (append nl1 nl2))) =
match nl1 with
| [] -> ()
| _ ->
nodelist_append_fp0 (tl nl1) ... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 758,
"start_col": 0,
"start_line": 749
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl1: DoublyLinkedList.nodelist t -> nl2: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.nodelist_aa_r nl1 /\ DoublyLinkedList.nodelist_aa_r nl2 /\
LowStar.Monotonic.Buffer.loc_disjoint (DoublyLinkedList.nodelist_fp0 nl1)
(DoublyLinkedList.nodelist_fp0 ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.nodelist",
"Prims.list",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"DoublyLinkedList.nodelist_append_aa_r",
"FStar.List.Tot.Base.tl",
"Prims.unit",
"DoublyLinkedList.nodelist_append_fp0",
"Prims.l_and",
"DoublyLinkedList.nodelist_aa_r",
"LowStar.Monotonic.Buffer.loc_di... | [
"recursion"
] | false | false | true | false | false | let rec nodelist_append_aa_r (#t: Type) (nl1 nl2: nodelist t)
: Lemma
(requires
(nodelist_aa_r nl1 /\ nodelist_aa_r nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2)))
(ensures (nodelist_aa_r (append nl1 nl2))) =
| match nl1 with
| [] -> ()
| _ ->
nodelist_append_fp0 (tl nl1) nl2;
nodelist_append_aa_r (tl nl1) nl2 | false |
DoublyLinkedList.fst | DoublyLinkedList.fst_unsnoc_nodelist_fp0 | val fst_unsnoc_nodelist_fp0 (#t: Type) (nl: nodelist t)
: Lemma (requires (length nl > 0))
(ensures (Mod.loc_includes (nodelist_fp0 nl) (nodelist_fp0 (fst (unsnoc nl)))))
[SMTPat (Mod.loc_includes (nodelist_fp0 nl) (nodelist_fp0 (fst (unsnoc nl))))] | val fst_unsnoc_nodelist_fp0 (#t: Type) (nl: nodelist t)
: Lemma (requires (length nl > 0))
(ensures (Mod.loc_includes (nodelist_fp0 nl) (nodelist_fp0 (fst (unsnoc nl)))))
[SMTPat (Mod.loc_includes (nodelist_fp0 nl) (nodelist_fp0 (fst (unsnoc nl))))] | let rec fst_unsnoc_nodelist_fp0 (#t:Type) (nl:nodelist t) :
Lemma
(requires (length nl > 0))
(ensures (Mod.loc_includes (nodelist_fp0 nl) (nodelist_fp0 (fst (unsnoc nl)))))
[SMTPat (Mod.loc_includes (nodelist_fp0 nl) (nodelist_fp0 (fst (unsnoc nl))))] =
match nl with
| [_] -> ()
| n :: ns -> fst_uns... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 553,
"start_col": 0,
"start_line": 546
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma (requires FStar.List.Tot.Base.length nl > 0)
(ensures
LowStar.Monotonic.Buffer.loc_includes (DoublyLinkedList.nodelist_fp0 nl)
(DoublyLinkedList.nodelist_fp0 (FStar.Pervasives.Native.fst (FStar.List.Tot.Base.unsnoc nl
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.nodelist",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"DoublyLinkedList.fst_unsnoc_nodelist_fp0",
"Prims.unit",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.List.Tot.Base.length",
"Prims.squash",
"LowStar.Monotonic.Buffer.loc_includes",
"DoublyLinkedList.... | [
"recursion"
] | false | false | true | false | false | let rec fst_unsnoc_nodelist_fp0 (#t: Type) (nl: nodelist t)
: Lemma (requires (length nl > 0))
(ensures (Mod.loc_includes (nodelist_fp0 nl) (nodelist_fp0 (fst (unsnoc nl)))))
[SMTPat (Mod.loc_includes (nodelist_fp0 nl) (nodelist_fp0 (fst (unsnoc nl))))] =
| match nl with
| [_] -> ()
| n :: ns -> fst_unsnoc_nodelist_fp0 ns | false |
DoublyLinkedList.fst | DoublyLinkedList.fst_unsnoc_nodelist_contained | val fst_unsnoc_nodelist_contained (#t: Type) (h0: heap) (nl: nodelist t)
: Lemma (requires (nodelist_contained h0 nl /\ length nl > 0))
(ensures (nodelist_contained h0 (fst (unsnoc nl)))) | val fst_unsnoc_nodelist_contained (#t: Type) (h0: heap) (nl: nodelist t)
: Lemma (requires (nodelist_contained h0 nl /\ length nl > 0))
(ensures (nodelist_contained h0 (fst (unsnoc nl)))) | let rec fst_unsnoc_nodelist_contained (#t:Type) (h0:heap) (nl:nodelist t) :
Lemma
(requires (nodelist_contained h0 nl /\ length nl > 0))
(ensures (nodelist_contained h0 (fst (unsnoc nl)))) =
match nl with
| [_] -> ()
| _ -> fst_unsnoc_nodelist_contained h0 (tl nl) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 570,
"start_col": 0,
"start_line": 564
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> nl: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires DoublyLinkedList.nodelist_contained h0 nl /\ FStar.List.Tot.Base.length nl > 0)
(ensures
DoublyLinkedList.nodelist_contained h0
(FStar.Pervasives.Native.fst (FStar.List.Tot.Base.unsnoc nl))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.nodelist",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"DoublyLinkedList.fst_unsnoc_nodelist_contained",
"FStar.List.Tot.Base.tl",
"Prims.unit",
"Prims.l_and",
"DoublyLinkedList.nodelist_contained",
"Prims.b2t",
"Prims.op_GreaterT... | [
"recursion"
] | false | false | true | false | false | let rec fst_unsnoc_nodelist_contained (#t: Type) (h0: heap) (nl: nodelist t)
: Lemma (requires (nodelist_contained h0 nl /\ length nl > 0))
(ensures (nodelist_contained h0 (fst (unsnoc nl)))) =
| match nl with
| [_] -> ()
| _ -> fst_unsnoc_nodelist_contained h0 (tl nl) | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_includes_r_fp0 | val nodelist_includes_r_fp0 (#t: Type) (nl: nodelist t) (i j: nat)
: Lemma (requires (i <= j /\ j < length nl))
(ensures
(let _, a = splitAt i nl in
let _, b = splitAt j nl in
Mod.loc_includes (nodelist_fp0 a) (nodelist_fp0 b)))
(decreases (j - i)) | val nodelist_includes_r_fp0 (#t: Type) (nl: nodelist t) (i j: nat)
: Lemma (requires (i <= j /\ j < length nl))
(ensures
(let _, a = splitAt i nl in
let _, b = splitAt j nl in
Mod.loc_includes (nodelist_fp0 a) (nodelist_fp0 b)))
(decreases (j - i)) | let rec nodelist_includes_r_fp0 (#t:Type) (nl:nodelist t) (i j:nat) :
Lemma
(requires (i <= j /\ j < length nl))
(ensures (
let _, a = splitAt i nl in
let _, b = splitAt j nl in
Mod.loc_includes (nodelist_fp0 a) (nodelist_fp0 b)))
(decreases (j - i)) =
if i = j then () else (
... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 628,
"start_col": 0,
"start_line": 607
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl: DoublyLinkedList.nodelist t -> i: Prims.nat -> j: Prims.nat
-> FStar.Pervasives.Lemma (requires i <= j /\ j < FStar.List.Tot.Base.length nl)
(ensures
(let _ = FStar.List.Tot.Base.splitAt i nl in
(let FStar.Pervasives.Native.Mktuple2 #_ #_ _ a = _ in
let _ = FStar.List.Tot.Base.... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"DoublyLinkedList.nodelist",
"Prims.nat",
"Prims.op_Equality",
"Prims.bool",
"Prims.list",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.int",
"Prims.op_Subtraction",
"Prims.unit",
"FStar.List.Pure.Properties.splitAt_assoc",
"LowStar.Monotonic.Buffer.loc_includes_trans",
"DoublyL... | [
"recursion"
] | false | false | true | false | false | let rec nodelist_includes_r_fp0 (#t: Type) (nl: nodelist t) (i j: nat)
: Lemma (requires (i <= j /\ j < length nl))
(ensures
(let _, a = splitAt i nl in
let _, b = splitAt j nl in
Mod.loc_includes (nodelist_fp0 a) (nodelist_fp0 b)))
(decreases (j - i)) =
| if i = j
then ()
else
(let temp, a = splitAt i nl in
lemma_splitAt nl temp a i;
let temp, b = splitAt j nl in
lemma_splitAt nl temp b j;
if i = j - 1
then
(List.Pure.Properties.splitAt_assoc i 1 nl;
())
else
(nodelist_includes_r_fp0 nl i (j - 1);
nodelist_includes_r... | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_append_valid | val nodelist_append_valid (#t: Type) (h0: heap) (nl1 nl2: nodelist t)
: Lemma
(requires
(nodelist_valid h0 nl1 /\ nodelist_valid h0 nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2) /\ length nl1 > 0 /\ length nl2 > 0 /\
(last nl1) @ h0 |>> (hd nl2) /\ (last nl1) <<| (h... | val nodelist_append_valid (#t: Type) (h0: heap) (nl1 nl2: nodelist t)
: Lemma
(requires
(nodelist_valid h0 nl1 /\ nodelist_valid h0 nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2) /\ length nl1 > 0 /\ length nl2 > 0 /\
(last nl1) @ h0 |>> (hd nl2) /\ (last nl1) <<| (h... | let nodelist_append_valid (#t:Type) (h0:heap) (nl1 nl2:nodelist t) :
Lemma
(requires (nodelist_valid h0 nl1 /\ nodelist_valid h0 nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2) /\
length nl1 > 0 /\ length nl2 > 0 /\ // For "= 0", it is trivially held
(las... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 33,
"end_line": 789,
"start_col": 0,
"start_line": 779
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> nl1: DoublyLinkedList.nodelist t -> nl2: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.nodelist_valid h0 nl1 /\ DoublyLinkedList.nodelist_valid h0 nl2 /\
LowStar.Monotonic.Buffer.loc_disjoint (DoublyLinkedList.nodelist_fp0 nl1)
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.nodelist",
"DoublyLinkedList.nodelist_append_conn",
"Prims.unit",
"DoublyLinkedList.nodelist_append_aa",
"DoublyLinkedList.nodelist_append_contained",
"Prims.l_and",
"DoublyLinkedList.nodelist_valid",
"LowStar.Monotonic.Buffer.loc_disjoint",
"DoublyLinked... | [] | true | false | true | false | false | let nodelist_append_valid (#t: Type) (h0: heap) (nl1 nl2: nodelist t)
: Lemma
(requires
(nodelist_valid h0 nl1 /\ nodelist_valid h0 nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2) /\ length nl1 > 0 /\ length nl2 > 0 /\
(last nl1) @ h0 |>> (hd nl2) /\ (last nl1) <<| (h... | nodelist_append_contained h0 nl1 nl2;
nodelist_append_aa nl1 nl2;
nodelist_append_conn h0 nl1 nl2 | false |
DoublyLinkedList.fst | DoublyLinkedList.fragment_defragmentable | val fragment_defragmentable (#t: Type) (h0: heap) (f: fragment t {fragment_valid h0 f}) : GTot Type0 | val fragment_defragmentable (#t: Type) (h0: heap) (f: fragment t {fragment_valid h0 f}) : GTot Type0 | let rec fragment_defragmentable (#t:Type) (h0:heap) (f:fragment t{fragment_valid h0 f}) :
GTot Type0 =
let aux (p1 p2:(p:piece t{piece_valid h0 p})) =
let a, b = last p1.pnodes, hd p2.pnodes in
(a@h0 |>> b) /\(a <<| b@h0) in
match f with
| Frag0 -> True
| Frag1 p1 -> True
| Frag2 p1 p2 -> aux p1 p2
... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 888,
"start_col": 0,
"start_line": 879
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> f: DoublyLinkedList.fragment t {DoublyLinkedList.fragment_valid h0 f}
-> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.fragment",
"DoublyLinkedList.fragment_valid",
"Prims.l_True",
"DoublyLinkedList.piece",
"Prims.l_and",
"DoublyLinkedList.piece_valid",
"Prims.logical",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"DoublyLinkedList.op_Bar_Greater_Greater",
"Doub... | [
"recursion"
] | false | false | false | false | true | let rec fragment_defragmentable (#t: Type) (h0: heap) (f: fragment t {fragment_valid h0 f})
: GTot Type0 =
| let aux (p1 p2: (p: piece t {piece_valid h0 p})) =
let a, b = last p1.pnodes, hd p2.pnodes in
(a @ h0 |>> b) /\ (a <<| b @ h0)
in
match f with
| Frag0 -> True
| Frag1 p1 -> True
| Frag2 p1 p2 -> aux p1 p2
| Frag3 p1 p2 p3 -> aux p1 p2 /\ aux p2 p3 | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_split_aa | val nodelist_split_aa (#t: Type) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_aa (append nl1 nl2)))
(ensures
(nodelist_aa nl1 /\ nodelist_aa nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2))) | val nodelist_split_aa (#t: Type) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_aa (append nl1 nl2)))
(ensures
(nodelist_aa nl1 /\ nodelist_aa nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2))) | let nodelist_split_aa (#t:Type) (nl1 nl2:nodelist t) :
Lemma
(requires (nodelist_aa (append nl1 nl2)))
(ensures (nodelist_aa nl1 /\ nodelist_aa nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2))) =
nodelist_split_fp0 nl1 nl2;
nodelist_split_aa_l nl1 nl2;
nodelist_split_aa_r nl... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 1041,
"start_col": 0,
"start_line": 1034
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl1: DoublyLinkedList.nodelist t -> nl2: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma (requires DoublyLinkedList.nodelist_aa (nl1 @ nl2))
(ensures
DoublyLinkedList.nodelist_aa nl1 /\ DoublyLinkedList.nodelist_aa nl2 /\
LowStar.Monotonic.Buffer.loc_disjoint (DoublyLinkedList.nodelist_fp0... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.nodelist",
"DoublyLinkedList.nodelist_split_aa_r",
"Prims.unit",
"DoublyLinkedList.nodelist_split_aa_l",
"DoublyLinkedList.nodelist_split_fp0",
"DoublyLinkedList.nodelist_aa",
"FStar.List.Tot.Base.append",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.squash",
"Prim... | [] | true | false | true | false | false | let nodelist_split_aa (#t: Type) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_aa (append nl1 nl2)))
(ensures
(nodelist_aa nl1 /\ nodelist_aa nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2))) =
| nodelist_split_fp0 nl1 nl2;
nodelist_split_aa_l nl1 nl2;
nodelist_split_aa_r nl1 nl2 | false |
DoublyLinkedList.fst | DoublyLinkedList.singleton_dll | val singleton_dll (#t: Type) (n: pointer (node t))
: StackInline (dll t)
(requires (fun h0 -> (h0 `contains` n)))
(ensures
(fun h0 d h1 ->
Mod.modifies (Mod.loc_buffer n) h0 h1 /\ dll_valid h1 d /\
unchanged_node_vals h0 h1 d.nodes /\ reveal d.nodes == [n])) | val singleton_dll (#t: Type) (n: pointer (node t))
: StackInline (dll t)
(requires (fun h0 -> (h0 `contains` n)))
(ensures
(fun h0 d h1 ->
Mod.modifies (Mod.loc_buffer n) h0 h1 /\ dll_valid h1 d /\
unchanged_node_vals h0 h1 d.nodes /\ reveal d.nodes == [n])) | let singleton_dll (#t:Type) (n:pointer (node t)) :
StackInline (dll t)
(requires (fun h0 ->
(h0 `contains` n)))
(ensures (fun h0 d h1 ->
Mod.modifies (Mod.loc_buffer n) h0 h1 /\
dll_valid h1 d /\
unchanged_node_vals h0 h1 d.nodes /\
reveal d.nodes == [n])) =
!=|> ... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 1176,
"start_col": 0,
"start_line": 1165
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 (DoublyLinkedList.node t)
-> FStar.HyperStack.ST.StackInline (DoublyLinkedList.dll t) | FStar.HyperStack.ST.StackInline | [] | [] | [
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"DoublyLinkedList.tot_node_to_dll",
"DoublyLinkedList.dll",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get",
"Prims.unit",
"DoublyLinkedList.op_Bang_Less_Bar_Equals",
"DoublyLinkedList.op_Bang_Equals_Bar_Greater",
"DoublyLinkedList.con... | [] | false | true | false | false | false | let singleton_dll (#t: Type) (n: pointer (node t))
: StackInline (dll t)
(requires (fun h0 -> (h0 `contains` n)))
(ensures
(fun h0 d h1 ->
Mod.modifies (Mod.loc_buffer n) h0 h1 /\ dll_valid h1 d /\
unchanged_node_vals h0 h1 d.nodes /\ reveal d.nodes == [n])) =
| !=|>n;
!<|=n;
tot_node_to_dll (ST.get ()) n | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_split_fp0_equiv | val nodelist_split_fp0_equiv (#t: Type) (nl1 nl2: nodelist t)
: Lemma
(ensures
((loc_equiv (nodelist_fp0 (append nl1 nl2))
(Mod.loc_union (nodelist_fp0 nl1) (nodelist_fp0 nl2))))) | val nodelist_split_fp0_equiv (#t: Type) (nl1 nl2: nodelist t)
: Lemma
(ensures
((loc_equiv (nodelist_fp0 (append nl1 nl2))
(Mod.loc_union (nodelist_fp0 nl1) (nodelist_fp0 nl2))))) | let rec nodelist_split_fp0_equiv (#t:Type) (nl1 nl2:nodelist t) :
Lemma
(ensures
((loc_equiv
(nodelist_fp0 (append nl1 nl2))
(Mod.loc_union
(nodelist_fp0 nl1)
(nodelist_fp0 nl2))))) =
match nl1 with
| [] -> ()
| n :: ns ->
nodelist_split_fp0_equiv... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 998,
"start_col": 0,
"start_line": 970
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl1: DoublyLinkedList.nodelist t -> nl2: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(ensures
DoublyLinkedList.loc_equiv (DoublyLinkedList.nodelist_fp0 (nl1 @ nl2))
(LowStar.Monotonic.Buffer.loc_union (DoublyLinkedList.nodelist_fp0 nl1)
(DoublyLinkedList.nodelist_fp0 nl2))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.nodelist",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"Prims._assert",
"DoublyLinkedList.loc_equiv",
"LowStar.Monotonic.Buffer.loc_union",
"LowStar.Monotonic.Buffer.loc_buffer",
"LowStar.Buffer.trivial_preorder",
"DoublyLinkedList.nodelist_fp0",
"Prims.uni... | [
"recursion"
] | false | false | true | false | false | let rec nodelist_split_fp0_equiv (#t: Type) (nl1 nl2: nodelist t)
: Lemma
(ensures
((loc_equiv (nodelist_fp0 (append nl1 nl2))
(Mod.loc_union (nodelist_fp0 nl1) (nodelist_fp0 nl2))))) =
| match nl1 with
| [] -> ()
| n :: ns ->
nodelist_split_fp0_equiv ns nl2;
assert (loc_equiv (nodelist_fp0 (append nl1 nl2))
(Mod.loc_union (Mod.loc_buffer n) (Mod.loc_union (nodelist_fp0 ns) (nodelist_fp0 nl2))));
assert (loc_equiv (Mod.loc_union (Mod.loc_buffer n)
(Mod.loc_union (nodelist_fp0 n... | false |
DoublyLinkedList.fst | DoublyLinkedList.fst_unsnoc_nodelist_aa | val fst_unsnoc_nodelist_aa (#t: Type) (nl: nodelist t)
: Lemma (requires (nodelist_aa nl /\ length nl > 0)) (ensures (nodelist_aa (fst (unsnoc nl)))) | val fst_unsnoc_nodelist_aa (#t: Type) (nl: nodelist t)
: Lemma (requires (nodelist_aa nl /\ length nl > 0)) (ensures (nodelist_aa (fst (unsnoc nl)))) | let rec fst_unsnoc_nodelist_aa (#t:Type) (nl:nodelist t) :
Lemma
(requires (nodelist_aa nl /\ length nl > 0))
(ensures (nodelist_aa (fst (unsnoc nl)))) =
match nl with
| [_] -> ()
| _ ->
fst_unsnoc_nodelist_aa (tl nl);
// assert (nodelist_aa_l (fst (unsnoc nl)));
let n :: ns = fst (unsnoc nl... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 6,
"end_line": 587,
"start_col": 0,
"start_line": 572
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires DoublyLinkedList.nodelist_aa nl /\ FStar.List.Tot.Base.length nl > 0)
(ensures
DoublyLinkedList.nodelist_aa (FStar.Pervasives.Native.fst (FStar.List.Tot.Base.unsnoc nl))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.nodelist",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"Prims.unit",
"LowStar.Monotonic.Buffer.loc_disjoint_includes",
"LowStar.Monotonic.Buffer.loc_buffer",
"LowStar.Buffer.trivial_preorder",
"DoublyLinkedList.nodelist_fp0",
"FStar.List.Tot.Base.tl",
"FSta... | [
"recursion"
] | false | false | true | false | false | let rec fst_unsnoc_nodelist_aa (#t: Type) (nl: nodelist t)
: Lemma (requires (nodelist_aa nl /\ length nl > 0)) (ensures (nodelist_aa (fst (unsnoc nl)))) =
| match nl with
| [_] -> ()
| _ ->
fst_unsnoc_nodelist_aa (tl nl);
let n :: ns = fst (unsnoc nl) in
Mod.loc_disjoint_includes (Mod.loc_buffer n)
(nodelist_fp0 (tl nl))
(Mod.loc_buffer n)
(nodelist_fp0 ns);
() | false |
DoublyLinkedList.fst | DoublyLinkedList.dll_fp0_is_nodelist_fp0 | val dll_fp0_is_nodelist_fp0 (#t: Type) (d: dll t)
: Lemma (requires (dll_ghostly_connections d))
(ensures (loc_equiv (dll_fp0 d) (nodelist_fp0 d.nodes))) | val dll_fp0_is_nodelist_fp0 (#t: Type) (d: dll t)
: Lemma (requires (dll_ghostly_connections d))
(ensures (loc_equiv (dll_fp0 d) (nodelist_fp0 d.nodes))) | let dll_fp0_is_nodelist_fp0 (#t:Type) (d:dll t) : Lemma
(requires (dll_ghostly_connections d))
(ensures
(loc_equiv (dll_fp0 d) (nodelist_fp0 d.nodes))) =
if length d.nodes > 0 then
lemma_unsnoc_is_last d.nodes
else
() | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 6,
"end_line": 1077,
"start_col": 0,
"start_line": 1070
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.dll t
-> FStar.Pervasives.Lemma (requires DoublyLinkedList.dll_ghostly_connections d)
(ensures
DoublyLinkedList.loc_equiv (DoublyLinkedList.dll_fp0 d)
(DoublyLinkedList.nodelist_fp0 (FStar.Ghost.reveal (Mkdll?.nodes d)))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.dll",
"Prims.op_GreaterThan",
"FStar.List.Tot.Base.length",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"FStar.Ghost.reveal",
"DoublyLinkedList.nodelist",
"DoublyLinkedList.__proj__Mkdll__item__nodes",
"FStar.List.Tot.Properties.lemma_unsnoc_is_last",
"Prims.bool",
"Prim... | [] | false | false | true | false | false | let dll_fp0_is_nodelist_fp0 (#t: Type) (d: dll t)
: Lemma (requires (dll_ghostly_connections d))
(ensures (loc_equiv (dll_fp0 d) (nodelist_fp0 d.nodes))) =
| if length d.nodes > 0 then lemma_unsnoc_is_last d.nodes | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_split_aa_l | val nodelist_split_aa_l (#t: Type) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_aa_l (append nl1 nl2)))
(ensures (nodelist_aa_l nl1 /\ nodelist_aa_l nl2))
(decreases (length nl2)) | val nodelist_split_aa_l (#t: Type) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_aa_l (append nl1 nl2)))
(ensures (nodelist_aa_l nl1 /\ nodelist_aa_l nl2))
(decreases (length nl2)) | let rec nodelist_split_aa_l (#t:Type) (nl1 nl2:nodelist t) :
Lemma
(requires (nodelist_aa_l (append nl1 nl2)))
(ensures (nodelist_aa_l nl1 /\ nodelist_aa_l nl2))
(decreases (length nl2)) =
match nl2 with
| [] -> append_l_nil nl1
| _ ->
let nl2', n = unsnoc nl2 in lemma_unsnoc_length nl2;
lem... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 6,
"end_line": 1020,
"start_col": 0,
"start_line": 1000
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl1: DoublyLinkedList.nodelist t -> nl2: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma (requires DoublyLinkedList.nodelist_aa_l (nl1 @ nl2))
(ensures DoublyLinkedList.nodelist_aa_l nl1 /\ DoublyLinkedList.nodelist_aa_l nl2)
(decreases FStar.List.Tot.Base.length nl2) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"DoublyLinkedList.nodelist",
"FStar.List.Tot.Properties.append_l_nil",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"Prims.unit",
"DoublyLinkedList.nodelist_append_fp0",
"DoublyLinkedList.nodelist_split_aa_l",
"FStar.List.Tot.Properties.lemma_unsnoc_append",
"FStar.List.Tot.Pro... | [
"recursion"
] | false | false | true | false | false | let rec nodelist_split_aa_l (#t: Type) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_aa_l (append nl1 nl2)))
(ensures (nodelist_aa_l nl1 /\ nodelist_aa_l nl2))
(decreases (length nl2)) =
| match nl2 with
| [] -> append_l_nil nl1
| _ ->
let nl2', n = unsnoc nl2 in
lemma_unsnoc_length nl2;
lemma_unsnoc_append nl1 nl2;
nodelist_split_aa_l nl1 nl2';
nodelist_append_fp0 nl1 nl2';
() | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_split_fp0 | val nodelist_split_fp0 (#t: Type) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_aa_r (append nl1 nl2)))
(ensures (Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2))) | val nodelist_split_fp0 (#t: Type) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_aa_r (append nl1 nl2)))
(ensures (Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2))) | let rec nodelist_split_fp0 (#t:Type) (nl1 nl2:nodelist t) :
Lemma
(requires (nodelist_aa_r (append nl1 nl2)))
(ensures (Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2))) =
match nl1 with
| [] | [_] -> ()
| _ ->
match nl2 with
| [] -> ()
| _ ->
// assert (length nl1 > 1);
/... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 8,
"end_line": 966,
"start_col": 0,
"start_line": 941
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl1: DoublyLinkedList.nodelist t -> nl2: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma (requires DoublyLinkedList.nodelist_aa_r (nl1 @ nl2))
(ensures
LowStar.Monotonic.Buffer.loc_disjoint (DoublyLinkedList.nodelist_fp0 nl1)
(DoublyLinkedList.nodelist_fp0 nl2)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.nodelist",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"Prims.unit",
"LowStar.Monotonic.Buffer.loc_disjoint_union_r",
"DoublyLinkedList.nodelist_fp0",
"LowStar.Monotonic.Buffer.loc_buffer",
"LowStar.Buffer.trivial_preorder",
"FStar.List.Tot.Base.hd",
"FStar... | [
"recursion"
] | false | false | true | false | false | let rec nodelist_split_fp0 (#t: Type) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_aa_r (append nl1 nl2)))
(ensures (Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2))) =
| match nl1 with
| [] | [_] -> ()
| _ ->
match nl2 with
| [] -> ()
| _ ->
nodelist_split_fp0 (tl nl1) nl2;
append_length nl1 nl2;
nodelist_includes_r_fp0 (tl (append nl1 nl2)) 0 (length nl1 - 1);
lemma_append_splitAt nl1 nl2;
Mod.loc_disjoint_union_r (nodelist_fp0 nl2) (Mod.loc_buffer (hd nl1)) ... | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_remains_aa_l | val nodelist_remains_aa_l (#t: Type) (nl: nodelist t)
: Lemma (requires (nodelist_aa_l nl /\ length nl > 0))
(ensures (nodelist_aa_l (tl nl)))
(decreases (length nl))
[SMTPat (nodelist_aa_l (tl nl))] | val nodelist_remains_aa_l (#t: Type) (nl: nodelist t)
: Lemma (requires (nodelist_aa_l nl /\ length nl > 0))
(ensures (nodelist_aa_l (tl nl)))
(decreases (length nl))
[SMTPat (nodelist_aa_l (tl nl))] | let rec nodelist_remains_aa_l (#t:Type) (nl:nodelist t) :
Lemma
(requires (nodelist_aa_l nl /\ length nl > 0))
(ensures (nodelist_aa_l (tl nl)))
(decreases (length nl))
[SMTPat (nodelist_aa_l (tl nl))] =
match nl with
| [n] -> ()
| _ ->
let ns, n = unsnoc nl in lemma_unsnoc_length nl;
le... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 28,
"end_line": 539,
"start_col": 0,
"start_line": 524
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires DoublyLinkedList.nodelist_aa_l nl /\ FStar.List.Tot.Base.length nl > 0)
(ensures DoublyLinkedList.nodelist_aa_l (FStar.List.Tot.Base.tl nl))
(decreases FStar.List.Tot.Base.length nl)
[SMTPat (DoublyLinkedList.nodelist_aa_l (FS... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"DoublyLinkedList.nodelist",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"DoublyLinkedList.nodelist_remains_aa_l",
"Prims.unit",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Base.unsnoc",
"FStar.List.Tot.Base.tl",
"FStar.List.Tot.Properties.lemma_unsnoc_length",
"Prims.... | [
"recursion"
] | false | false | true | false | false | let rec nodelist_remains_aa_l (#t: Type) (nl: nodelist t)
: Lemma (requires (nodelist_aa_l nl /\ length nl > 0))
(ensures (nodelist_aa_l (tl nl)))
(decreases (length nl))
[SMTPat (nodelist_aa_l (tl nl))] =
| match nl with
| [n] -> ()
| _ ->
let ns, n = unsnoc nl in
lemma_unsnoc_length nl;
let ns', n' = unsnoc (tl nl) in
nodelist_remains_aa_l ns | false |
DoublyLinkedList.fst | DoublyLinkedList.piece_fp0_is_nodelist_fp0 | val piece_fp0_is_nodelist_fp0 (#t: Type) (p: piece t)
: Lemma (requires (piece_ghostly_connections p))
(ensures (loc_equiv (piece_fp0 p) (nodelist_fp0 p.pnodes))) | val piece_fp0_is_nodelist_fp0 (#t: Type) (p: piece t)
: Lemma (requires (piece_ghostly_connections p))
(ensures (loc_equiv (piece_fp0 p) (nodelist_fp0 p.pnodes))) | let piece_fp0_is_nodelist_fp0 (#t:Type) (p:piece t) : Lemma
(requires (piece_ghostly_connections p))
(ensures
(loc_equiv (piece_fp0 p) (nodelist_fp0 p.pnodes))) =
lemma_unsnoc_is_last (reveal p.pnodes) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 1083,
"start_col": 0,
"start_line": 1079
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.piece t
-> FStar.Pervasives.Lemma (requires DoublyLinkedList.piece_ghostly_connections p)
(ensures
DoublyLinkedList.loc_equiv (DoublyLinkedList.piece_fp0 p)
(DoublyLinkedList.nodelist_fp0 (FStar.Ghost.reveal (Mkpiece?.pnodes p)))) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.piece",
"FStar.List.Tot.Properties.lemma_unsnoc_is_last",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"FStar.Ghost.reveal",
"DoublyLinkedList.nodelist",
"DoublyLinkedList.__proj__Mkpiece__item__pnodes",
"Prims.unit",
"DoublyLinkedList.piece_ghostly_connections",
"Prims.squ... | [] | true | false | true | false | false | let piece_fp0_is_nodelist_fp0 (#t: Type) (p: piece t)
: Lemma (requires (piece_ghostly_connections p))
(ensures (loc_equiv (piece_fp0 p) (nodelist_fp0 p.pnodes))) =
| lemma_unsnoc_is_last (reveal p.pnodes) | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_split_valid | val nodelist_split_valid (#t: Type) (h0: heap) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_valid h0 (append nl1 nl2) /\ length nl1 > 0 /\ length nl2 > 0))
(ensures
(nodelist_valid h0 nl1 /\ nodelist_valid h0 nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2) /\ (last nl1) @ ... | val nodelist_split_valid (#t: Type) (h0: heap) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_valid h0 (append nl1 nl2) /\ length nl1 > 0 /\ length nl2 > 0))
(ensures
(nodelist_valid h0 nl1 /\ nodelist_valid h0 nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2) /\ (last nl1) @ ... | let nodelist_split_valid (#t:Type) (h0:heap) (nl1 nl2:nodelist t) :
Lemma
(requires (nodelist_valid h0 (append nl1 nl2) /\
length nl1 > 0 /\ length nl2 > 0)) // For "= 0", it is trivially held
(ensures (nodelist_valid h0 nl1 /\ nodelist_valid h0 nl2 /\
Mod.loc_disjoint (nodelist_f... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 1065,
"start_col": 0,
"start_line": 1055
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> nl1: DoublyLinkedList.nodelist t -> nl2: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.nodelist_valid h0 (nl1 @ nl2) /\ FStar.List.Tot.Base.length nl1 > 0 /\
FStar.List.Tot.Base.length nl2 > 0)
(ensures
DoublyLinkedLis... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.nodelist",
"DoublyLinkedList.nodelist_split_conn",
"Prims.unit",
"DoublyLinkedList.nodelist_split_aa",
"DoublyLinkedList.nodelist_split_contained",
"Prims.l_and",
"DoublyLinkedList.nodelist_valid",
"FStar.List.Tot.Base.append",
"LowStar.Buffer.pointer",
... | [] | true | false | true | false | false | let nodelist_split_valid (#t: Type) (h0: heap) (nl1 nl2: nodelist t)
: Lemma (requires (nodelist_valid h0 (append nl1 nl2) /\ length nl1 > 0 /\ length nl2 > 0))
(ensures
(nodelist_valid h0 nl1 /\ nodelist_valid h0 nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2) /\ (last nl1) @ ... | nodelist_split_contained h0 nl1 nl2;
nodelist_split_aa nl1 nl2;
nodelist_split_conn h0 nl1 nl2 | false |
DoublyLinkedList.fst | DoublyLinkedList.tot_node_to_dll | val tot_node_to_dll (#t: Type) (h0: heap) (n: pointer (node t))
: Pure (dll t)
(requires ((h0 `contains` n) /\ (((n @ h0).flink == null)) /\ ((n @ h0).blink == null)))
(ensures (fun d -> dll_valid h0 d)) | val tot_node_to_dll (#t: Type) (h0: heap) (n: pointer (node t))
: Pure (dll t)
(requires ((h0 `contains` n) /\ (((n @ h0).flink == null)) /\ ((n @ h0).blink == null)))
(ensures (fun d -> dll_valid h0 d)) | let tot_node_to_dll (#t:Type) (h0:heap) (n:pointer (node t)) :
Pure (dll t)
(requires (
(h0 `contains` n) /\
(((n@h0).flink == null)) /\
((n@h0).blink == null)))
(ensures (fun d -> dll_valid h0 d)) =
{ lhead = n ; ltail = n ; nodes = ~. n } | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 42,
"end_line": 1163,
"start_col": 0,
"start_line": 1156
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> n: LowStar.Buffer.pointer (DoublyLinkedList.node t)
-> Prims.Pure (DoublyLinkedList.dll t) | Prims.Pure | [] | [] | [
"DoublyLinkedList.heap",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"DoublyLinkedList.Mkdll",
"DoublyLinkedList.op_Tilde_Dot",
"DoublyLinkedList.dll",
"Prims.l_and",
"DoublyLinkedList.contains",
"LowStar.Buffer.trivial_preorder",
"Prims.eq2",
"LowStar.Buffer.buffer",
"DoublyLinkedList.... | [] | false | false | false | false | false | let tot_node_to_dll (#t: Type) (h0: heap) (n: pointer (node t))
: Pure (dll t)
(requires ((h0 `contains` n) /\ (((n @ h0).flink == null)) /\ ((n @ h0).blink == null)))
(ensures (fun d -> dll_valid h0 d)) =
| { lhead = n; ltail = n; nodes = ~.n } | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_append_aa_l | val nodelist_append_aa_l (#t: Type) (nl1 nl2: nodelist t)
: Lemma
(requires
(nodelist_aa_l nl1 /\ nodelist_aa_l nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2)))
(ensures (nodelist_aa_l (append nl1 nl2)))
(decreases (length nl2)) | val nodelist_append_aa_l (#t: Type) (nl1 nl2: nodelist t)
: Lemma
(requires
(nodelist_aa_l nl1 /\ nodelist_aa_l nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2)))
(ensures (nodelist_aa_l (append nl1 nl2)))
(decreases (length nl2)) | let rec nodelist_append_aa_l (#t:Type) (nl1 nl2:nodelist t) :
Lemma
(requires (nodelist_aa_l nl1 /\ nodelist_aa_l nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2)))
(ensures (nodelist_aa_l (append nl1 nl2)))
(decreases (length nl2)) =
match nl2 with
| [] -> append_l_nil nl1... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 6,
"end_line": 745,
"start_col": 0,
"start_line": 721
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | nl1: DoublyLinkedList.nodelist t -> nl2: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.nodelist_aa_l nl1 /\ DoublyLinkedList.nodelist_aa_l nl2 /\
LowStar.Monotonic.Buffer.loc_disjoint (DoublyLinkedList.nodelist_fp0 nl1)
(DoublyLinkedList.nodelist_fp0 ... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"DoublyLinkedList.nodelist",
"FStar.List.Tot.Properties.append_l_nil",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"Prims.unit",
"FStar.List.Tot.Properties.lemma_unsnoc_append",
"DoublyLinkedList.nodelist_append_aa_l",
"Prims._assert",
"LowStar.Monotonic.Buffer.loc_includes",
... | [
"recursion"
] | false | false | true | false | false | let rec nodelist_append_aa_l (#t: Type) (nl1 nl2: nodelist t)
: Lemma
(requires
(nodelist_aa_l nl1 /\ nodelist_aa_l nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2)))
(ensures (nodelist_aa_l (append nl1 nl2)))
(decreases (length nl2)) =
| match nl2 with
| [] -> append_l_nil nl1
| _ ->
let nl2', n = unsnoc nl2 in
lemma_unsnoc_length nl2;
nodelist_append_fp0 nl1 nl2';
assert (Mod.loc_includes (nodelist_fp0 nl2) (nodelist_fp0 nl2'));
lemma_unsnoc_is_last nl2;
assert (Mod.loc_includes (nodelist_fp0 nl2) (Mod.loc_buffer n));
nodelist_append_aa_... | false |
DoublyLinkedList.fst | DoublyLinkedList._aux_fp_split_by_node | val _aux_fp_split_by_node : d0: DoublyLinkedList.dll 'a ->
d1: DoublyLinkedList.dll 'a ->
n: LowStar.Buffer.pointer (DoublyLinkedList.node 'a)
-> Prims.logical | let _aux_fp_split_by_node (d0 d1:dll 'a) (n:pointer (node 'a)) =
dll_fp0 d0 `loc_equiv` B.loc_union (dll_fp0 d1) (Mod.loc_buffer n) /\
dll_fp0 d1 `B.loc_disjoint` Mod.loc_buffer n | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 1720,
"start_col": 0,
"start_line": 1718
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 |
d0: DoublyLinkedList.dll 'a ->
d1: DoublyLinkedList.dll 'a ->
n: LowStar.Buffer.pointer (DoublyLinkedList.node 'a)
-> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"DoublyLinkedList.dll",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.l_and",
"DoublyLinkedList.loc_equiv",
"DoublyLinkedList.dll_fp0",
"LowStar.Monotonic.Buffer.loc_union",
"LowStar.Monotonic.Buffer.loc_buffer",
"LowStar.Buffer.trivial_preorder",
"LowStar.Monotonic.Buffer.loc_disjoint... | [] | false | false | false | true | true | let _aux_fp_split_by_node (d0 d1: dll 'a) (n: pointer (node 'a)) =
| (dll_fp0 d0) `loc_equiv` (B.loc_union (dll_fp0 d1) (Mod.loc_buffer n)) /\
(dll_fp0 d1) `B.loc_disjoint` (Mod.loc_buffer n) | false | |
DoublyLinkedList.fst | DoublyLinkedList.tot_node_to_piece | val tot_node_to_piece (#t: Type) (h0: heap) (n: pointer (node t))
: Pure (piece t) (requires ((h0 `contains` n))) (ensures (fun p -> piece_valid h0 p)) | val tot_node_to_piece (#t: Type) (h0: heap) (n: pointer (node t))
: Pure (piece t) (requires ((h0 `contains` n))) (ensures (fun p -> piece_valid h0 p)) | let tot_node_to_piece (#t:Type) (h0:heap) (n:pointer (node t)) :
Pure (piece t)
(requires (
(h0 `contains` n)))
(ensures (fun p -> piece_valid h0 p)) =
{ phead = n ; ptail = n ; pnodes = ~. n } | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 43,
"end_line": 1185,
"start_col": 0,
"start_line": 1180
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> n: LowStar.Buffer.pointer (DoublyLinkedList.node t)
-> Prims.Pure (DoublyLinkedList.piece t) | Prims.Pure | [] | [] | [
"DoublyLinkedList.heap",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"DoublyLinkedList.Mkpiece",
"DoublyLinkedList.op_Tilde_Dot",
"DoublyLinkedList.piece",
"DoublyLinkedList.contains",
"LowStar.Buffer.trivial_preorder",
"DoublyLinkedList.piece_valid"
] | [] | false | false | false | false | false | let tot_node_to_piece (#t: Type) (h0: heap) (n: pointer (node t))
: Pure (piece t) (requires ((h0 `contains` n))) (ensures (fun p -> piece_valid h0 p)) =
| { phead = n; ptail = n; pnodes = ~.n } | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_append_conn | val nodelist_append_conn (#t: Type) (h0: heap) (nl1 nl2: nodelist t)
: Lemma
(requires
(nodelist_conn h0 nl1 /\ nodelist_conn h0 nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2) /\ length nl1 > 0 /\ length nl2 > 0 /\
(last nl1) @ h0 |>> (hd nl2) /\ (last nl1) <<| (hd n... | val nodelist_append_conn (#t: Type) (h0: heap) (nl1 nl2: nodelist t)
: Lemma
(requires
(nodelist_conn h0 nl1 /\ nodelist_conn h0 nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2) /\ length nl1 > 0 /\ length nl2 > 0 /\
(last nl1) @ h0 |>> (hd nl2) /\ (last nl1) <<| (hd n... | let rec nodelist_append_conn (#t:Type) (h0:heap) (nl1 nl2:nodelist t) :
Lemma
(requires (nodelist_conn h0 nl1 /\ nodelist_conn h0 nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2) /\
length nl1 > 0 /\ length nl2 > 0 /\ // For "= 0", it is trivially held
(la... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 45,
"end_line": 777,
"start_col": 0,
"start_line": 767
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> nl1: DoublyLinkedList.nodelist t -> nl2: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.nodelist_conn h0 nl1 /\ DoublyLinkedList.nodelist_conn h0 nl2 /\
LowStar.Monotonic.Buffer.loc_disjoint (DoublyLinkedList.nodelist_fp0 nl1)
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.nodelist",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"DoublyLinkedList.nodelist_append_conn",
"FStar.List.Tot.Base.tl",
"Prims.unit",
"Prims.l_and",
"DoublyLinkedList.nodelist_conn",
"LowStar.Monotonic.Buffer.loc_disjoint",
"Dou... | [
"recursion"
] | false | false | true | false | false | let rec nodelist_append_conn (#t: Type) (h0: heap) (nl1 nl2: nodelist t)
: Lemma
(requires
(nodelist_conn h0 nl1 /\ nodelist_conn h0 nl2 /\
Mod.loc_disjoint (nodelist_fp0 nl1) (nodelist_fp0 nl2) /\ length nl1 > 0 /\ length nl2 > 0 /\
(last nl1) @ h0 |>> (hd nl2) /\ (last nl1) <<| (... | match nl1 with
| [_] -> ()
| _ -> nodelist_append_conn h0 (tl nl1) nl2 | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_split_conn | val nodelist_split_conn (#t: Type) (h0: heap) (nl1 nl2: nodelist t)
: Lemma (requires ((nodelist_conn h0 (append nl1 nl2)) /\ length nl1 > 0 /\ length nl2 > 0))
(ensures
(nodelist_conn h0 nl1 /\ nodelist_conn h0 nl2 /\ (last nl1) @ h0 |>> (hd nl2) /\
(last nl1) <<| (hd nl2) @ h0)) | val nodelist_split_conn (#t: Type) (h0: heap) (nl1 nl2: nodelist t)
: Lemma (requires ((nodelist_conn h0 (append nl1 nl2)) /\ length nl1 > 0 /\ length nl2 > 0))
(ensures
(nodelist_conn h0 nl1 /\ nodelist_conn h0 nl2 /\ (last nl1) @ h0 |>> (hd nl2) /\
(last nl1) <<| (hd nl2) @ h0)) | let rec nodelist_split_conn (#t:Type) (h0:heap) (nl1 nl2:nodelist t) :
Lemma
(requires (
(nodelist_conn h0 (append nl1 nl2)) /\
length nl1 > 0 /\ length nl2 > 0)) // For "= 0", it is trivially held
(ensures (nodelist_conn h0 nl1 /\ nodelist_conn h0 nl2 /\
(last nl1)@h0 |>> (hd n... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 1053,
"start_col": 0,
"start_line": 1043
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> nl1: DoublyLinkedList.nodelist t -> nl2: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.nodelist_conn h0 (nl1 @ nl2) /\ FStar.List.Tot.Base.length nl1 > 0 /\
FStar.List.Tot.Base.length nl2 > 0)
(ensures
DoublyLinkedList... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.nodelist",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"DoublyLinkedList.nodelist_split_conn",
"FStar.List.Tot.Base.tl",
"Prims.unit",
"Prims.l_and",
"DoublyLinkedList.nodelist_conn",
"FStar.List.Tot.Base.append",
"Prims.b2t",
"... | [
"recursion"
] | false | false | true | false | false | let rec nodelist_split_conn (#t: Type) (h0: heap) (nl1 nl2: nodelist t)
: Lemma (requires ((nodelist_conn h0 (append nl1 nl2)) /\ length nl1 > 0 /\ length nl2 > 0))
(ensures
(nodelist_conn h0 nl1 /\ nodelist_conn h0 nl2 /\ (last nl1) @ h0 |>> (hd nl2) /\
(last nl1) <<| (hd nl2) @ h0)) =
| match nl1 with
| [_] -> ()
| _ -> nodelist_split_conn h0 (tl nl1) nl2 | false |
DoublyLinkedList.fst | DoublyLinkedList.nodelist_remains_valid | val nodelist_remains_valid (#t: Type) (h0 h1: heap) (loc: Mod.loc) (nl: nodelist t)
: Lemma
(requires
((nodelist_valid h0 nl) /\ (Mod.modifies loc h0 h1) /\
(Mod.loc_disjoint loc (nodelist_fp0 nl)))) (ensures (nodelist_valid h1 nl)) | val nodelist_remains_valid (#t: Type) (h0 h1: heap) (loc: Mod.loc) (nl: nodelist t)
: Lemma
(requires
((nodelist_valid h0 nl) /\ (Mod.modifies loc h0 h1) /\
(Mod.loc_disjoint loc (nodelist_fp0 nl)))) (ensures (nodelist_valid h1 nl)) | let rec nodelist_remains_valid (#t:Type) (h0 h1:heap) (loc:Mod.loc) (nl:nodelist t) :
Lemma
(requires (
(nodelist_valid h0 nl) /\
(Mod.modifies loc h0 h1) /\
(Mod.loc_disjoint loc (nodelist_fp0 nl))))
(ensures (nodelist_valid h1 nl)) =
match nl with
| [] -> ()
| _ -> nodelist_rem... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 1278,
"start_col": 0,
"start_line": 1269
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap ->
h1: DoublyLinkedList.heap ->
loc: LowStar.Monotonic.Buffer.loc ->
nl: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.nodelist_valid h0 nl /\ LowStar.Monotonic.Buffer.modifies loc h0 h1 /\
LowStar.Monotonic.Buffer.loc... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"LowStar.Monotonic.Buffer.loc",
"DoublyLinkedList.nodelist",
"Prims.list",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"DoublyLinkedList.nodelist_remains_valid",
"FStar.List.Tot.Base.tl",
"Prims.unit",
"Prims.l_and",
"DoublyLinkedList.nodelist_valid",
"LowStar.M... | [
"recursion"
] | false | false | true | false | false | let rec nodelist_remains_valid (#t: Type) (h0 h1: heap) (loc: Mod.loc) (nl: nodelist t)
: Lemma
(requires
((nodelist_valid h0 nl) /\ (Mod.modifies loc h0 h1) /\
(Mod.loc_disjoint loc (nodelist_fp0 nl)))) (ensures (nodelist_valid h1 nl)) =
| match nl with
| [] -> ()
| _ -> nodelist_remains_valid h0 h1 loc (tl nl) | false |
DoublyLinkedList.fst | DoublyLinkedList.piece_remains_valid | val piece_remains_valid (#t: Type) (h0 h1: heap) (loc: Mod.loc) (p: piece t)
: Lemma
(requires
((piece_valid h0 p) /\ (Mod.modifies loc h0 h1) /\ (Mod.loc_disjoint loc (piece_fp0 p))))
(ensures (piece_valid h1 p)) | val piece_remains_valid (#t: Type) (h0 h1: heap) (loc: Mod.loc) (p: piece t)
: Lemma
(requires
((piece_valid h0 p) /\ (Mod.modifies loc h0 h1) /\ (Mod.loc_disjoint loc (piece_fp0 p))))
(ensures (piece_valid h1 p)) | let piece_remains_valid (#t:Type) (h0 h1:heap) (loc:Mod.loc) (p:piece t) :
Lemma
(requires (
(piece_valid h0 p) /\
(Mod.modifies loc h0 h1) /\
(Mod.loc_disjoint loc (piece_fp0 p))))
(ensures (piece_valid h1 p)) =
nodelist_remains_valid h0 h1 loc p.pnodes | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 43,
"end_line": 1287,
"start_col": 0,
"start_line": 1280
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap ->
h1: DoublyLinkedList.heap ->
loc: LowStar.Monotonic.Buffer.loc ->
p: DoublyLinkedList.piece t
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.piece_valid h0 p /\ LowStar.Monotonic.Buffer.modifies loc h0 h1 /\
LowStar.Monotonic.Buffer.loc_disjoin... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"LowStar.Monotonic.Buffer.loc",
"DoublyLinkedList.piece",
"DoublyLinkedList.nodelist_remains_valid",
"FStar.Ghost.reveal",
"DoublyLinkedList.nodelist",
"DoublyLinkedList.__proj__Mkpiece__item__pnodes",
"Prims.unit",
"Prims.l_and",
"DoublyLinkedList.piece_valid",
"LowStar... | [] | true | false | true | false | false | let piece_remains_valid (#t: Type) (h0 h1: heap) (loc: Mod.loc) (p: piece t)
: Lemma
(requires
((piece_valid h0 p) /\ (Mod.modifies loc h0 h1) /\ (Mod.loc_disjoint loc (piece_fp0 p))))
(ensures (piece_valid h1 p)) =
| nodelist_remains_valid h0 h1 loc p.pnodes | false |
DoublyLinkedList.fst | DoublyLinkedList.aux_unchanged_payload_nomod | val aux_unchanged_payload_nomod (#t h0 h1: _) (nl: nodelist t)
: Lemma (requires (Mod.modifies Mod.loc_none h0 h1)) (ensures (unchanged_node_vals h0 h1 nl)) | val aux_unchanged_payload_nomod (#t h0 h1: _) (nl: nodelist t)
: Lemma (requires (Mod.modifies Mod.loc_none h0 h1)) (ensures (unchanged_node_vals h0 h1 nl)) | let rec aux_unchanged_payload_nomod #t h0 h1 (nl:nodelist t) :
Lemma
(requires (Mod.modifies Mod.loc_none h0 h1))
(ensures (unchanged_node_vals h0 h1 nl)) =
match nl with
| [] -> ()
| n :: nl' ->
aux_unchanged_payload_nomod h0 h1 nl' | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 1411,
"start_col": 0,
"start_line": 1404
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires LowStar.Monotonic.Buffer.modifies LowStar.Monotonic.Buffer.loc_none h0 h1)
(ensures DoublyLinkedList.unchanged_node_vals h0 h1 nl) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedList.nodelist",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"DoublyLinkedList.aux_unchanged_payload_nomod",
"Prims.unit",
"LowStar.Monotonic.Buffer.modifies",
"LowStar.Monotonic.Buffer.loc_none",
"Prims.squash",
"DoublyLinkedLis... | [
"recursion"
] | false | false | true | false | false | let rec aux_unchanged_payload_nomod #t h0 h1 (nl: nodelist t)
: Lemma (requires (Mod.modifies Mod.loc_none h0 h1)) (ensures (unchanged_node_vals h0 h1 nl)) =
| match nl with
| [] -> ()
| n :: nl' -> aux_unchanged_payload_nomod h0 h1 nl' | false |
DoublyLinkedList.fst | DoublyLinkedList.tot_piece_tail | val tot_piece_tail (#t: Type) (h0: heap) (p: piece t) (n: pointer (node t))
: Pure (piece t)
(requires ((piece_valid h0 p) /\ (n == (((p.phead) @ h0).flink)) /\ (length p.pnodes > 1)))
(ensures (fun q -> (piece_valid h0 q) /\ (reveal q.pnodes) == tl p.pnodes)) | val tot_piece_tail (#t: Type) (h0: heap) (p: piece t) (n: pointer (node t))
: Pure (piece t)
(requires ((piece_valid h0 p) /\ (n == (((p.phead) @ h0).flink)) /\ (length p.pnodes > 1)))
(ensures (fun q -> (piece_valid h0 q) /\ (reveal q.pnodes) == tl p.pnodes)) | let tot_piece_tail (#t:Type) (h0:heap) (p:piece t) (n:pointer (node t)) :
Pure (piece t)
(requires (
(piece_valid h0 p) /\
(n == (((p.phead)@h0).flink)) /\
(length p.pnodes > 1)))
(ensures (fun q ->
(piece_valid h0 q) /\
(reveal q.pnodes) == tl p.pnodes)) =
{ phead ... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 79,
"end_line": 1198,
"start_col": 0,
"start_line": 1189
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap ->
p: DoublyLinkedList.piece t ->
n: LowStar.Buffer.pointer (DoublyLinkedList.node t)
-> Prims.Pure (DoublyLinkedList.piece t) | Prims.Pure | [] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.piece",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"DoublyLinkedList.Mkpiece",
"DoublyLinkedList.__proj__Mkpiece__item__ptail",
"FStar.Ghost.elift1_p",
"Prims.list",
"Prims.b2t",
"Prims.uu___is_Cons",
"FStar.Ghost.tot_to_gtot",
"FStar.List.Tot... | [] | false | false | false | false | false | let tot_piece_tail (#t: Type) (h0: heap) (p: piece t) (n: pointer (node t))
: Pure (piece t)
(requires ((piece_valid h0 p) /\ (n == (((p.phead) @ h0).flink)) /\ (length p.pnodes > 1)))
(ensures (fun q -> (piece_valid h0 q) /\ (reveal q.pnodes) == tl p.pnodes)) =
| { phead = n; ptail = p.ptail; pnodes = elift1_p (tot_to_gtot tl) p.pnodes } | false |
DoublyLinkedList.fst | DoublyLinkedList.aux_unchanged_payload_transitive | val aux_unchanged_payload_transitive (#t h0 h1 h2: _) (nl: nodelist t)
: Lemma (requires (unchanged_node_vals h0 h1 nl /\ unchanged_node_vals h1 h2 nl))
(ensures (unchanged_node_vals h0 h2 nl)) | val aux_unchanged_payload_transitive (#t h0 h1 h2: _) (nl: nodelist t)
: Lemma (requires (unchanged_node_vals h0 h1 nl /\ unchanged_node_vals h1 h2 nl))
(ensures (unchanged_node_vals h0 h2 nl)) | let rec aux_unchanged_payload_transitive #t h0 h1 h2 (nl:nodelist t) :
Lemma
(requires (unchanged_node_vals h0 h1 nl /\
unchanged_node_vals h1 h2 nl))
(ensures (unchanged_node_vals h0 h2 nl)) =
match nl with
| [] -> ()
| _ :: nl' -> aux_unchanged_payload_transitive h0 h1 h2 nl' | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 1420,
"start_col": 0,
"start_line": 1413
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 ->
nl: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.unchanged_node_vals h0 h1 nl /\
DoublyLinkedList.unchanged_node_vals h1 h2 nl)
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedList.nodelist",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"DoublyLinkedList.aux_unchanged_payload_transitive",
"Prims.unit",
"Prims.l_and",
"DoublyLinkedList.unchanged_node_vals",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasiv... | [
"recursion"
] | false | false | true | false | false | let rec aux_unchanged_payload_transitive #t h0 h1 h2 (nl: nodelist t)
: Lemma (requires (unchanged_node_vals h0 h1 nl /\ unchanged_node_vals h1 h2 nl))
(ensures (unchanged_node_vals h0 h2 nl)) =
| match nl with
| [] -> ()
| _ :: nl' -> aux_unchanged_payload_transitive h0 h1 h2 nl' | false |
DoublyLinkedList.fst | DoublyLinkedList.aux_unchanged_payload_append | val aux_unchanged_payload_append (#t h0 h1: _) (nl1 nl2: nodelist t)
: Lemma (requires (unchanged_node_vals h0 h1 nl1 /\ unchanged_node_vals h0 h1 nl2))
(ensures (unchanged_node_vals h0 h1 (nl1 `append` nl2))) | val aux_unchanged_payload_append (#t h0 h1: _) (nl1 nl2: nodelist t)
: Lemma (requires (unchanged_node_vals h0 h1 nl1 /\ unchanged_node_vals h0 h1 nl2))
(ensures (unchanged_node_vals h0 h1 (nl1 `append` nl2))) | let rec aux_unchanged_payload_append #t h0 h1 (nl1 nl2:nodelist t) :
Lemma
(requires (unchanged_node_vals h0 h1 nl1 /\
unchanged_node_vals h0 h1 nl2))
(ensures (unchanged_node_vals h0 h1 (nl1 `append` nl2))) =
match nl1 with
| [] -> ()
| n :: nl' -> aux_unchanged_payload_append h0 h1 nl' ... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 1429,
"start_col": 0,
"start_line": 1422
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 ->
nl1: DoublyLinkedList.nodelist t ->
nl2: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.unchanged_node_vals h0 h1 nl1 /\
DoublyLinkedList.unchanged_node_vals h0 h1 nl2)
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"DoublyLinkedList.nodelist",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"DoublyLinkedList.aux_unchanged_payload_append",
"Prims.unit",
"Prims.l_and",
"DoublyLinkedList.unchanged_node_vals",
"Prims.squash",
"FStar.List.Tot.Base.append",
"P... | [
"recursion"
] | false | false | true | false | false | let rec aux_unchanged_payload_append #t h0 h1 (nl1: nodelist t) (nl2: nodelist t)
: Lemma (requires (unchanged_node_vals h0 h1 nl1 /\ unchanged_node_vals h0 h1 nl2))
(ensures (unchanged_node_vals h0 h1 (nl1 `append` nl2))) =
| match nl1 with
| [] -> ()
| n :: nl' -> aux_unchanged_payload_append h0 h1 nl' nl2 | false |
DoublyLinkedList.fst | DoublyLinkedList.piece_remains_valid_b | val piece_remains_valid_b (#t: Type) (h0 h1: heap) (p: piece t)
: Lemma
(requires
((piece_valid h0 p) /\ (Mod.modifies (Mod.loc_buffer p.phead) h0 h1) /\
(h1 `contains` p.phead) /\ (p.phead @ h0).flink == (p.phead @ h1).flink))
(ensures (piece_valid h1 p) /\ (p.ptail @ h0).flink == (p.... | val piece_remains_valid_b (#t: Type) (h0 h1: heap) (p: piece t)
: Lemma
(requires
((piece_valid h0 p) /\ (Mod.modifies (Mod.loc_buffer p.phead) h0 h1) /\
(h1 `contains` p.phead) /\ (p.phead @ h0).flink == (p.phead @ h1).flink))
(ensures (piece_valid h1 p) /\ (p.ptail @ h0).flink == (p.... | let piece_remains_valid_b (#t:Type) (h0 h1:heap) (p:piece t) :
Lemma
(requires (
(piece_valid h0 p) /\
(Mod.modifies (Mod.loc_buffer p.phead) h0 h1) /\
(h1 `contains` p.phead) /\
(p.phead@h0).flink == (p.phead@h1).flink))
(ensures (piece_valid h1 p) /\ (p.ptail@h0).flink == (p.... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 1311,
"start_col": 0,
"start_line": 1294
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> h1: DoublyLinkedList.heap -> p: DoublyLinkedList.piece t
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.piece_valid h0 p /\
LowStar.Monotonic.Buffer.modifies (LowStar.Monotonic.Buffer.loc_buffer (Mkpiece?.phead p))
h0
h1 /\ DoublyLinkedList.... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.piece",
"Prims.op_GreaterThan",
"FStar.List.Tot.Base.length",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"FStar.Ghost.reveal",
"DoublyLinkedList.nodelist",
"DoublyLinkedList.nodelist_remains_valid",
"LowStar.Monotonic.Buffer.loc_buffer",
"LowSta... | [] | false | false | true | false | false | let piece_remains_valid_b (#t: Type) (h0 h1: heap) (p: piece t)
: Lemma
(requires
((piece_valid h0 p) /\ (Mod.modifies (Mod.loc_buffer p.phead) h0 h1) /\
(h1 `contains` p.phead) /\ (p.phead @ h0).flink == (p.phead @ h1).flink))
(ensures (piece_valid h1 p) /\ (p.ptail @ h0).flink == (p.... | let nodes = p.pnodes in
if length nodes > 1
then
(nodelist_includes_r_fp0 nodes 1 (length nodes - 1);
lemma_unsnoc_is_last nodes;
nodelist_remains_valid h0 h1 (Mod.loc_buffer p.phead) (tl nodes)) | false |
Spec.HMAC_DRBG.fst | Spec.HMAC_DRBG.a_spec | val a_spec : a: Spec.Hash.Definitions.fixed_len_alg -> i: Prims.nat -> Type0 | let a_spec (a:fixed_len_alg) (i:nat) = Lib.Sequence.lseq uint8 (hash_length a) | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 78,
"end_line": 66,
"start_col": 0,
"start_line": 66
} | module Spec.HMAC_DRBG
open Lib.IntTypes
open FStar.Seq
open FStar.Mul
open Spec.Hash.Definitions
open Spec.Agile.HMAC
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 50"
noeq
type state (a:supported_alg) =
| State:
k:lbytes (hash_length a)
-> v:lbytes (hash_length a)
-> reseed_counter:nat
-> state a
... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"... | [
{
"abbrev": false,
"full_module": "Spec.Agile.HMAC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"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 | a: Spec.Hash.Definitions.fixed_len_alg -> i: Prims.nat -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.fixed_len_alg",
"Prims.nat",
"Lib.Sequence.lseq",
"Lib.IntTypes.uint8",
"Spec.Hash.Definitions.hash_length"
] | [] | false | false | false | true | true | let a_spec (a: fixed_len_alg) (i: nat) =
| Lib.Sequence.lseq uint8 (hash_length a) | false | |
DoublyLinkedList.fst | DoublyLinkedList.piece_merge | val piece_merge (#t:Type) (h0:heap)
(p1:piece t{piece_valid h0 p1})
(p2:piece t{piece_valid h0 p2}) :
Pure (piece t)
(requires (let a, b = last p1.pnodes, hd p2.pnodes in
(a@h0 |>> b) /\
(a <<| b@h0) /\
Mod.loc_disjoint (piece_fp0 p1) (piece_fp0 p2)))
(ensu... | val piece_merge (#t:Type) (h0:heap)
(p1:piece t{piece_valid h0 p1})
(p2:piece t{piece_valid h0 p2}) :
Pure (piece t)
(requires (let a, b = last p1.pnodes, hd p2.pnodes in
(a@h0 |>> b) /\
(a <<| b@h0) /\
Mod.loc_disjoint (piece_fp0 p1) (piece_fp0 p2)))
(ensu... | let piece_merge #t h0 p1 p2 =
let p = { phead = p1.phead ; ptail = p2.ptail ; pnodes = p1.pnodes ^@^ p2.pnodes } in
lemma_append_last p1.pnodes p2.pnodes;
nodelist_append_valid h0 p1.pnodes p2.pnodes;
p | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 821,
"start_col": 0,
"start_line": 817
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap ->
p1: DoublyLinkedList.piece t {DoublyLinkedList.piece_valid h0 p1} ->
p2: DoublyLinkedList.piece t {DoublyLinkedList.piece_valid h0 p2}
-> Prims.Pure (DoublyLinkedList.piece t) | Prims.Pure | [] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.piece",
"DoublyLinkedList.piece_valid",
"Prims.unit",
"DoublyLinkedList.nodelist_append_valid",
"FStar.Ghost.reveal",
"DoublyLinkedList.nodelist",
"DoublyLinkedList.__proj__Mkpiece__item__pnodes",
"FStar.List.Tot.Properties.lemma_append_last",
"LowStar.Bu... | [] | false | false | false | false | false | let piece_merge #t h0 p1 p2 =
| let p = { phead = p1.phead; ptail = p2.ptail; pnodes = p1.pnodes ^@^ p2.pnodes } in
lemma_append_last p1.pnodes p2.pnodes;
nodelist_append_valid h0 p1.pnodes p2.pnodes;
p | false |
FStar.Classical.Sugar.fst | FStar.Classical.Sugar.exists_elim | val exists_elim
(#t:Type)
(#p:t -> Type)
(#q:Type)
($s_ex_p: squash (exists (x:t). p x))
(f: (x:t -> squash (p x) -> Tot (squash q)))
: Tot (squash q) | val exists_elim
(#t:Type)
(#p:t -> Type)
(#q:Type)
($s_ex_p: squash (exists (x:t). p x))
(f: (x:t -> squash (p x) -> Tot (squash q)))
: Tot (squash q) | let exists_elim #t #p #q s_ex_p f
= let open FStar.Squash in
bind_squash s_ex_p (fun ex_p ->
bind_squash ex_p (fun (sig_p: (x:t & p x)) ->
let (| x, px |) = sig_p in
f x (return_squash px))) | {
"file_name": "ulib/FStar.Classical.Sugar.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 28,
"end_line": 34,
"start_col": 0,
"start_line": 29
} | (*
Copyright 2021 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": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Classical.Sugar.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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 | $s_ex_p: Prims.squash (exists (x: t). p x) -> f: (x: t -> _: Prims.squash (p x) -> Prims.squash q)
-> Prims.squash q | Prims.Tot | [
"total"
] | [] | [
"Prims.squash",
"Prims.l_Exists",
"FStar.Squash.bind_squash",
"Prims.dtuple2",
"FStar.Squash.return_squash"
] | [] | false | false | true | false | false | let exists_elim #t #p #q s_ex_p f =
| let open FStar.Squash in
bind_squash s_ex_p
(fun ex_p ->
bind_squash ex_p
(fun (sig_p: (x: t & p x)) ->
let (| x , px |) = sig_p in
f x (return_squash px))) | false |
DoublyLinkedList.fst | DoublyLinkedList._l_insert_after | val _l_insert_after (x0: 'a) (l: list 'a {x0 `memP` l}) (x: 'a) : GTot (list 'a) | val _l_insert_after (x0: 'a) (l: list 'a {x0 `memP` l}) (x: 'a) : GTot (list 'a) | let _l_insert_after (x0:'a) (l:list 'a{x0 `memP` l}) (x:'a) : GTot (list 'a) =
let l1, x1 :: l2 = lemma_split_using l x0; split_using l x0 in
assert (x0 == x1);
l1 `append` (x0 :: (x :: l2)) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 1548,
"start_col": 0,
"start_line": 1545
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | x0: 'a -> l: Prims.list 'a {FStar.List.Tot.Base.memP x0 l} -> x: 'a -> Prims.GTot (Prims.list 'a) | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.list",
"FStar.List.Tot.Base.memP",
"FStar.List.Tot.Base.append",
"Prims.Cons",
"Prims.unit",
"Prims._assert",
"Prims.eq2",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Properties.split_using",
"FStar.List.Tot.Properties.lemma_split_using"
] | [] | false | false | false | false | false | let _l_insert_after (x0: 'a) (l: list 'a {x0 `memP` l}) (x: 'a) : GTot (list 'a) =
| let l1, x1 :: l2 =
lemma_split_using l x0;
split_using l x0
in
assert (x0 == x1);
l1 `append` (x0 :: (x :: l2)) | false |
FStar.Classical.Sugar.fst | FStar.Classical.Sugar.forall_intro | val forall_intro
(a:Type)
(p:a -> Type)
(f: (x:a -> Tot (squash (p x))))
: Tot (squash (forall x. p x)) | val forall_intro
(a:Type)
(p:a -> Type)
(f: (x:a -> Tot (squash (p x))))
: Tot (squash (forall x. p x)) | let forall_intro
(a:Type)
(p:a -> Type)
(f: (x:a -> Tot (squash (p x))))
: Tot (squash (forall x. p x))
= let open FStar.Squash in
let f' (x:a)
: GTot (squash (p x))
= f x
in
return_squash (squash_double_arrow (return_squash f')) | {
"file_name": "ulib/FStar.Classical.Sugar.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 89,
"start_col": 0,
"start_line": 79
} | (*
Copyright 2021 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": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Classical.Sugar.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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: Type -> p: (_: a -> Type0) -> f: (x: a -> Prims.squash (p x))
-> Prims.squash (forall (x: a). p x) | Prims.Tot | [
"total"
] | [] | [
"Prims.squash",
"FStar.Squash.return_squash",
"Prims.l_Forall",
"FStar.Squash.squash_double_arrow"
] | [] | false | false | true | false | false | let forall_intro (a: Type) (p: (a -> Type)) (f: (x: a -> Tot (squash (p x))))
: Tot (squash (forall x. p x)) =
| let open FStar.Squash in
let f' (x: a) : GTot (squash (p x)) = f x in
return_squash (squash_double_arrow (return_squash f')) | false |
FStar.Classical.Sugar.fst | FStar.Classical.Sugar.exists_intro | val exists_intro
(a:Type)
(p:a -> Type)
(v:a)
(x: unit -> Tot (squash (p v)))
: Tot (squash (exists x. p x)) | val exists_intro
(a:Type)
(p:a -> Type)
(v:a)
(x: unit -> Tot (squash (p v)))
: Tot (squash (exists x. p x)) | let exists_intro
(a:Type)
(p:a -> Type)
(v:a)
(f: unit -> Tot (squash (p v)))
: Tot (squash (exists x. p x))
= exists_intro_simple a p v (f()) | {
"file_name": "ulib/FStar.Classical.Sugar.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 107,
"start_col": 0,
"start_line": 101
} | (*
Copyright 2021 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": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Classical.Sugar.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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: Type -> p: (_: a -> Type0) -> v: a -> x: (_: Prims.unit -> Prims.squash (p v))
-> Prims.squash (exists (x: a). p x) | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"Prims.squash",
"FStar.Classical.Sugar.exists_intro_simple",
"Prims.l_Exists"
] | [] | false | false | true | false | false | let exists_intro (a: Type) (p: (a -> Type)) (v: a) (f: (unit -> Tot (squash (p v))))
: Tot (squash (exists x. p x)) =
| exists_intro_simple a p v (f ()) | false |
DoublyLinkedList.fst | DoublyLinkedList.piece_merge_fp0 | val piece_merge_fp0
(#t: Type)
(h0: heap)
(p1: piece t {piece_valid h0 p1})
(p2: piece t {piece_valid h0 p2})
: Lemma
(requires
(let a, b = last p1.pnodes, hd p2.pnodes in
(a @ h0 |>> b) /\ (a <<| b @ h0) /\ Mod.loc_disjoint (piece_fp0 p1) (piece_fp0 p2)))
(ensu... | val piece_merge_fp0
(#t: Type)
(h0: heap)
(p1: piece t {piece_valid h0 p1})
(p2: piece t {piece_valid h0 p2})
: Lemma
(requires
(let a, b = last p1.pnodes, hd p2.pnodes in
(a @ h0 |>> b) /\ (a <<| b @ h0) /\ Mod.loc_disjoint (piece_fp0 p1) (piece_fp0 p2)))
(ensu... | let piece_merge_fp0 (#t:Type) (h0:heap)
(p1:piece t{piece_valid h0 p1})
(p2:piece t{piece_valid h0 p2}) :
Lemma
(requires (let a, b = last p1.pnodes, hd p2.pnodes in
(a@h0 |>> b) /\
(a <<| b@h0) /\
Mod.loc_disjoint (piece_fp0 p1) (piece_fp0 p2)))
(ensures (... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 875,
"start_col": 0,
"start_line": 825
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap ->
p1: DoublyLinkedList.piece t {DoublyLinkedList.piece_valid h0 p1} ->
p2: DoublyLinkedList.piece t {DoublyLinkedList.piece_valid h0 p2}
-> FStar.Pervasives.Lemma
(requires
(let _ =
FStar.List.Tot.Base.last (FStar.Ghost.reveal (Mkpiece?.pnodes p1)),
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.piece",
"DoublyLinkedList.piece_valid",
"Prims.list",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"DoublyLinkedList.loc_equiv_trans",
"DoublyLinkedList.piece_fp0",
"DoublyLinkedList.nodelist_fp0",
"LowStar.Monotonic.Buffer.loc_union",
"Prims.unit... | [] | false | false | true | false | false | let piece_merge_fp0
(#t: Type)
(h0: heap)
(p1: piece t {piece_valid h0 p1})
(p2: piece t {piece_valid h0 p2})
: Lemma
(requires
(let a, b = last p1.pnodes, hd p2.pnodes in
(a @ h0 |>> b) /\ (a <<| b @ h0) /\ Mod.loc_disjoint (piece_fp0 p1) (piece_fp0 p2)))
(ensu... | let p = piece_merge h0 p1 p2 in
let n1, n2, n = reveal p1.pnodes, reveal p2.pnodes, reveal p.pnodes in
nodelist_append_fp0 n1 n2;
extract_nodelist_fp0 n2 (length n2 - 1);
lemma_unsnoc_is_last n2;
extract_nodelist_fp0 n (length n - 1);
lemma_unsnoc_is_last n;
loc_includes_union_r_inv (nodelist_fp0 n) (nodelist_fp0 n1) (... | false |
FStar.Classical.Sugar.fst | FStar.Classical.Sugar.or_elim_simple | val or_elim_simple
(p q r: Type)
(x: squash (p \/ q))
(f: (squash p -> Tot (squash r)))
(g: (squash q -> Tot (squash r)))
: Tot (squash r) | val or_elim_simple
(p q r: Type)
(x: squash (p \/ q))
(f: (squash p -> Tot (squash r)))
(g: (squash q -> Tot (squash r)))
: Tot (squash r) | let or_elim_simple
(p:Type)
(q:Type)
(r:Type)
(x:squash (p \/ q))
(f:squash p -> Tot (squash r))
(g:squash q -> Tot (squash r))
: Tot (squash r)
= let open FStar.Squash in
bind_squash x (fun p_or_q ->
bind_squash p_or_q (fun p_cor_q ->
match p_cor_q with
... | {
"file_name": "ulib/FStar.Classical.Sugar.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 51,
"start_col": 0,
"start_line": 36
} | (*
Copyright 2021 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": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Classical.Sugar.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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: Type0 ->
q: Type0 ->
r: Type ->
x: Prims.squash (p \/ q) ->
f: (_: Prims.squash p -> Prims.squash r) ->
g: (_: Prims.squash q -> Prims.squash r)
-> Prims.squash r | Prims.Tot | [
"total"
] | [] | [
"Prims.squash",
"Prims.l_or",
"FStar.Squash.bind_squash",
"Prims.sum",
"FStar.Squash.return_squash"
] | [] | false | false | true | true | false | let or_elim_simple
(p q r: Type)
(x: squash (p \/ q))
(f: (squash p -> Tot (squash r)))
(g: (squash q -> Tot (squash r)))
: Tot (squash r) =
| let open FStar.Squash in
bind_squash x
(fun p_or_q ->
bind_squash p_or_q
(function
| Prims.Left p -> f (return_squash p)
| Prims.Right q -> g (return_squash q))) | false |
DoublyLinkedList.fst | DoublyLinkedList._l_insert_before | val _l_insert_before (x0: 'a) (l: list 'a {x0 `memP` l}) (x: 'a) : GTot (list 'a) | val _l_insert_before (x0: 'a) (l: list 'a {x0 `memP` l}) (x: 'a) : GTot (list 'a) | let _l_insert_before (x0:'a) (l:list 'a{x0 `memP` l}) (x:'a) : GTot (list 'a) =
let l1, l2 = split_using l x0 in
l1 `append` (x :: l2) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 23,
"end_line": 1674,
"start_col": 0,
"start_line": 1672
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | x0: 'a -> l: Prims.list 'a {FStar.List.Tot.Base.memP x0 l} -> x: 'a -> Prims.GTot (Prims.list 'a) | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.list",
"FStar.List.Tot.Base.memP",
"FStar.List.Tot.Base.append",
"Prims.Cons",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Properties.split_using"
] | [] | false | false | false | false | false | let _l_insert_before (x0: 'a) (l: list 'a {x0 `memP` l}) (x: 'a) : GTot (list 'a) =
| let l1, l2 = split_using l x0 in
l1 `append` (x :: l2) | false |
FStar.Classical.Sugar.fst | FStar.Classical.Sugar.implies_intro | val implies_intro
(p:Type)
(q:squash p -> Type)
(f:(squash p -> Tot (squash (q()))))
: Tot (squash (p ==> q())) | val implies_intro
(p:Type)
(q:squash p -> Type)
(f:(squash p -> Tot (squash (q()))))
: Tot (squash (p ==> q())) | let implies_intro
(p:Type)
(q:squash p -> Type)
(f:(squash p -> Tot (squash (q()))))
: Tot (squash (p ==> q()))
= let open FStar.Squash in
let f' (x:p)
: GTot (squash (q ()))
= f (return_squash x)
in
return_squash (squash_double_arrow (return_squash f')) | {
"file_name": "ulib/FStar.Classical.Sugar.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 120,
"start_col": 0,
"start_line": 110
} | (*
Copyright 2021 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": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Classical.Sugar.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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: Type0 -> q: (_: Prims.squash p -> Type0) -> f: (_: Prims.squash p -> Prims.squash (q ()))
-> Prims.squash (p ==> q ()) | Prims.Tot | [
"total"
] | [] | [
"Prims.squash",
"FStar.Squash.return_squash",
"Prims.l_imp",
"FStar.Squash.squash_double_arrow"
] | [] | false | false | true | false | false | let implies_intro (p: Type) (q: (squash p -> Type)) (f: (squash p -> Tot (squash (q ()))))
: Tot (squash (p ==> q ())) =
| let open FStar.Squash in
let f' (x: p) : GTot (squash (q ())) = f (return_squash x) in
return_squash (squash_double_arrow (return_squash f')) | false |
FStar.Classical.Sugar.fst | FStar.Classical.Sugar.or_intro_left | val or_intro_left
(p:Type)
(q:squash (~p) -> Type)
(f:unit -> Tot (squash p))
: Tot (squash (p \/ q())) | val or_intro_left
(p:Type)
(q:squash (~p) -> Type)
(f:unit -> Tot (squash p))
: Tot (squash (p \/ q())) | let or_intro_left
(p:Type)
(q:squash (~p) -> Type)
(f:unit -> Tot (squash p))
: Tot (squash (p \/ q()))
= f() | {
"file_name": "ulib/FStar.Classical.Sugar.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 7,
"end_line": 127,
"start_col": 0,
"start_line": 122
} | (*
Copyright 2021 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": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Classical.Sugar.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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: Type0 -> q: (_: Prims.squash (~p) -> Type0) -> f: (_: Prims.unit -> Prims.squash p)
-> Prims.squash (p \/ q ()) | Prims.Tot | [
"total"
] | [] | [
"Prims.squash",
"Prims.l_not",
"Prims.unit",
"Prims.l_or"
] | [] | false | false | true | false | false | let or_intro_left (p: Type) (q: (squash (~p) -> Type)) (f: (unit -> Tot (squash p)))
: Tot (squash (p \/ q ())) =
| f () | false |
DoublyLinkedList.fst | DoublyLinkedList.lemma_dll_links_contained | val lemma_dll_links_contained (#t: Type) (h0: heap) (d: dll t) (i: nat)
: Lemma (requires ((dll_valid h0 d) /\ (i < length d.nodes)))
(ensures
(let nodes = d.nodes in
(h0 `contains` (nodes.[ i ] @ h0).flink) /\ (h0 `contains` (nodes.[ i ] @ h0).blink))) | val lemma_dll_links_contained (#t: Type) (h0: heap) (d: dll t) (i: nat)
: Lemma (requires ((dll_valid h0 d) /\ (i < length d.nodes)))
(ensures
(let nodes = d.nodes in
(h0 `contains` (nodes.[ i ] @ h0).flink) /\ (h0 `contains` (nodes.[ i ] @ h0).blink))) | let lemma_dll_links_contained (#t:Type) (h0:heap) (d:dll t) (i:nat) :
Lemma
(requires (
(dll_valid h0 d) /\
(i < length d.nodes)))
(ensures (
let nodes = d.nodes in
(h0 `contains` (nodes.[i]@h0).flink) /\
(h0 `contains` (nodes.[i]@h0).blink))) =
let nl = reveal d.node... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 1221,
"start_col": 0,
"start_line": 1204
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> d: DoublyLinkedList.dll t -> i: Prims.nat
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.dll_valid h0 d /\
i < FStar.List.Tot.Base.length (FStar.Ghost.reveal (Mkdll?.nodes d)))
(ensures
(let nodes = Mkdll?.nodes d in
DoublyLinkedList.con... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.dll",
"Prims.nat",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"FStar.List.Tot.Properties.lemma_unsnoc_is_last",
"Prims.unit",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Subtraction",
"FStar.List.Tot.Base.length",
"Prims.bool",... | [] | false | false | true | false | false | let lemma_dll_links_contained (#t: Type) (h0: heap) (d: dll t) (i: nat)
: Lemma (requires ((dll_valid h0 d) /\ (i < length d.nodes)))
(ensures
(let nodes = d.nodes in
(h0 `contains` (nodes.[ i ] @ h0).flink) /\ (h0 `contains` (nodes.[ i ] @ h0).blink))) =
| let nl = reveal d.nodes in
match nl with
| [_] -> ()
| _ ->
(if i = 0 then () else extract_nodelist_conn h0 nl (i - 1));
(if i = length nl - 1 then () else extract_nodelist_conn h0 nl i);
(if i = 0 then () else extract_nodelist_contained h0 nl (i - 1));
(if i = length nl - 1 then () else extract_nodelist_contai... | false |
FStar.Classical.Sugar.fst | FStar.Classical.Sugar.exists_intro_simple | val exists_intro_simple (a: Type) (p: (a -> Type)) (v: a) (f: squash (p v))
: Tot (squash (exists x. p x)) | val exists_intro_simple (a: Type) (p: (a -> Type)) (v: a) (f: squash (p v))
: Tot (squash (exists x. p x)) | let exists_intro_simple
(a:Type)
(p:a -> Type)
(v:a)
(f: squash (p v))
: Tot (squash (exists x. p x))
= let open FStar.Squash in
let p = (| v, f |) in
squash_double_sum (return_squash p) | {
"file_name": "ulib/FStar.Classical.Sugar.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 39,
"end_line": 99,
"start_col": 0,
"start_line": 91
} | (*
Copyright 2021 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": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Classical.Sugar.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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: Type -> p: (_: a -> Type0) -> v: a -> f: Prims.squash (p v) -> Prims.squash (exists (x: a). p x) | Prims.Tot | [
"total"
] | [] | [
"Prims.squash",
"FStar.Squash.squash_double_sum",
"FStar.Squash.return_squash",
"Prims.dtuple2",
"Prims.Mkdtuple2",
"Prims.l_Exists"
] | [] | false | false | true | false | false | let exists_intro_simple (a: Type) (p: (a -> Type)) (v: a) (f: squash (p v))
: Tot (squash (exists x. p x)) =
| let open FStar.Squash in
let p = (| v, f |) in
squash_double_sum (return_squash p) | false |
FStar.Classical.Sugar.fst | FStar.Classical.Sugar.and_elim | val and_elim
(p:Type)
(q:squash p -> Type)
(r:Type)
(_:squash (p /\ q()))
(f:squash p -> squash (q()) -> Tot (squash r))
: Tot (squash r) | val and_elim
(p:Type)
(q:squash p -> Type)
(r:Type)
(_:squash (p /\ q()))
(f:squash p -> squash (q()) -> Tot (squash r))
: Tot (squash r) | let and_elim (p:Type)
(q:squash p -> Type)
(r:Type)
(x:squash (p /\ q()))
(f:squash p -> squash (q()) -> Tot (squash r))
: Tot (squash r)
= let open FStar.Squash in
bind_squash x (fun p_and_q ->
bind_squash p_and_q (fun (Prims.Pair p q) ->
f (return_sq... | {
"file_name": "ulib/FStar.Classical.Sugar.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 43,
"end_line": 77,
"start_col": 0,
"start_line": 68
} | (*
Copyright 2021 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": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Classical.Sugar.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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: Type0 ->
q: (_: Prims.squash p -> Type0) ->
r: Type ->
x: Prims.squash (p /\ q ()) ->
f: (_: Prims.squash p -> _: Prims.squash (q ()) -> Prims.squash r)
-> Prims.squash r | Prims.Tot | [
"total"
] | [] | [
"Prims.squash",
"Prims.l_and",
"FStar.Squash.bind_squash",
"Prims.pair",
"FStar.Squash.return_squash"
] | [] | false | false | true | false | false | let and_elim
(p: Type)
(q: (squash p -> Type))
(r: Type)
(x: squash (p /\ q ()))
(f: (squash p -> squash (q ()) -> Tot (squash r)))
: Tot (squash r) =
| let open FStar.Squash in
bind_squash x
(fun p_and_q ->
bind_squash p_and_q (fun (Prims.Pair p q) -> f (return_squash p) (return_squash q))) | false |
FStar.Classical.Sugar.fst | FStar.Classical.Sugar.or_intro_right | val or_intro_right
(p:Type)
(q:squash (~p) -> Type)
(f:squash (~p) -> Tot (squash (q())))
: Tot (squash (p \/ q())) | val or_intro_right
(p:Type)
(q:squash (~p) -> Type)
(f:squash (~p) -> Tot (squash (q())))
: Tot (squash (p \/ q())) | let or_intro_right
(p:Type)
(q:squash (~p) -> Type)
(f:squash (~p) -> Tot (squash (q())))
: Tot (squash (p \/ q()))
= or_elim_simple p (~p)
(p \/ q())
()
(fun s_p -> or_intro_left p q (fun _ -> s_p))
(fun s_np -> f s_np) | {
"file_name": "ulib/FStar.Classical.Sugar.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 138,
"start_col": 0,
"start_line": 129
} | (*
Copyright 2021 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": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Classical.Sugar.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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: Type0 -> q: (_: Prims.squash (~p) -> Type0) -> f: (_: Prims.squash (~p) -> Prims.squash (q ()))
-> Prims.squash (p \/ q ()) | Prims.Tot | [
"total"
] | [] | [
"Prims.squash",
"Prims.l_not",
"FStar.Classical.Sugar.or_elim_simple",
"Prims.l_or",
"FStar.Classical.Sugar.or_intro_left",
"Prims.unit"
] | [] | false | false | true | false | false | let or_intro_right (p: Type) (q: (squash (~p) -> Type)) (f: (squash (~p) -> Tot (squash (q ()))))
: Tot (squash (p \/ q ())) =
| or_elim_simple p
(~p)
(p \/ q ())
()
(fun s_p -> or_intro_left p q (fun _ -> s_p))
(fun s_np -> f s_np) | false |
DoublyLinkedList.fst | DoublyLinkedList.tot_defragmentable_fragment_to_dll | val tot_defragmentable_fragment_to_dll
(#t: Type)
(h0: heap)
(f:
fragment t
{ fragment_valid h0 f /\ fragment_defragmentable h0 f /\
(fragment_length f > 0 ==>
(let a, b =
match f with
| Frag1 p1 -> p1, p1
... | val tot_defragmentable_fragment_to_dll
(#t: Type)
(h0: heap)
(f:
fragment t
{ fragment_valid h0 f /\ fragment_defragmentable h0 f /\
(fragment_length f > 0 ==>
(let a, b =
match f with
| Frag1 p1 -> p1, p1
... | let tot_defragmentable_fragment_to_dll (#t:Type) (h0:heap) (f:fragment t{
fragment_valid h0 f /\
fragment_defragmentable h0 f /\
(fragment_length f > 0 ==>
(let a, b = match f with
| Frag1 p1 -> p1, p1
| Frag2 p1 p2 -> p1, p2
| Frag3 p1 _ p3 -> p1, p3 in
((a.phead@h0).blink =... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 927,
"start_col": 0,
"start_line": 897
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"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: DoublyLinkedList.heap ->
f:
DoublyLinkedList.fragment t
{ DoublyLinkedList.fragment_valid h0 f /\ DoublyLinkedList.fragment_defragmentable h0 f /\
(DoublyLinkedList.fragment_length f > 0 ==>
(let _ =
(match f with
| DoublyLinkedList.Frag... | Prims.Tot | [
"total"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.fragment",
"Prims.l_and",
"DoublyLinkedList.fragment_valid",
"DoublyLinkedList.fragment_defragmentable",
"Prims.l_imp",
"Prims.b2t",
"Prims.op_GreaterThan",
"DoublyLinkedList.fragment_length",
"DoublyLinkedList.piece",
"Prims.eq2",
"LowStar.Buffer.buf... | [] | false | false | false | false | false | let tot_defragmentable_fragment_to_dll
(#t: Type)
(h0: heap)
(f:
fragment t
{ fragment_valid h0 f /\ fragment_defragmentable h0 f /\
(fragment_length f > 0 ==>
(let a, b =
match f with
| Frag1 p1 -> p1, p1
... | match f with
| Frag0 -> empty_list
| Frag1 p1 -> tot_piece_to_dll h0 p1
| Frag2 p1 p2 ->
piece_merge_fp0 h0 p1 p2;
tot_piece_to_dll h0 (piece_merge h0 p1 p2)
| Frag3 p1 p2 p3 ->
piece_merge_fp0 h0 p1 p2;
let p' = piece_merge h0 p1 p2 in
piece_merge_fp0 h0 p' p3;
tot_piece_to_dll h0 (piece_merge h0 p' p3) | false |
FStar.Classical.Sugar.fst | FStar.Classical.Sugar.or_elim | val or_elim
(p:Type)
(q:squash (~p) -> Type)
(r:Type)
(p_or:squash (p \/ q()))
(left:squash p -> Tot (squash r))
(right:squash (~p) -> squash (q()) -> Tot (squash r))
: Tot (squash r) | val or_elim
(p:Type)
(q:squash (~p) -> Type)
(r:Type)
(p_or:squash (p \/ q()))
(left:squash p -> Tot (squash r))
(right:squash (~p) -> squash (q()) -> Tot (squash r))
: Tot (squash r) | let or_elim
(p:Type)
(q:squash (~p) -> Type)
(r:Type)
(p_or:squash (p \/ q()))
(left:squash p -> Tot (squash r))
(right:squash (~p) -> squash (q()) -> Tot (squash r))
: Tot (squash r)
= or_elim_simple p (~p) r ()
(fun (s:squash p) -> left s)
(f... | {
"file_name": "ulib/FStar.Classical.Sugar.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 59,
"end_line": 66,
"start_col": 0,
"start_line": 53
} | (*
Copyright 2021 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": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Classical.Sugar.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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: Type0 ->
q: (_: Prims.squash (~p) -> Type0) ->
r: Type ->
p_or: Prims.squash (p \/ q ()) ->
left: (_: Prims.squash p -> Prims.squash r) ->
right: (_: Prims.squash (~p) -> _: Prims.squash (q ()) -> Prims.squash r)
-> Prims.squash r | Prims.Tot | [
"total"
] | [] | [
"Prims.squash",
"Prims.l_not",
"Prims.l_or",
"FStar.Classical.Sugar.or_elim_simple"
] | [] | false | false | true | false | false | let or_elim
(p: Type)
(q: (squash (~p) -> Type))
(r: Type)
(p_or: squash (p \/ q ()))
(left: (squash p -> Tot (squash r)))
(right: (squash (~p) -> squash (q ()) -> Tot (squash r)))
: Tot (squash r) =
| or_elim_simple p
(~p)
r
()
(fun (s: squash p) -> left s)
(fun (np: squash (~p)) ->
or_elim_simple p
(q ())
r
p_or
(fun (pf_p: squash p) -> left pf_p)
(fun (pf_q: squash (q ())) -> right np pf_q)) | false |
FStar.Classical.Sugar.fst | FStar.Classical.Sugar.and_intro | val and_intro
(p:Type)
(q:squash p -> Type)
(left:unit -> Tot (squash p))
(right:squash p -> Tot (squash (q())))
: Tot (squash (p /\ q())) | val and_intro
(p:Type)
(q:squash p -> Type)
(left:unit -> Tot (squash p))
(right:squash p -> Tot (squash (q())))
: Tot (squash (p /\ q())) | let and_intro
(p:Type)
(q:squash p -> Type)
(f:unit -> Tot (squash p))
(g:squash p -> Tot (squash (q())))
: Tot (squash (p /\ q()))
= let _ = f() in g() | {
"file_name": "ulib/FStar.Classical.Sugar.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 22,
"end_line": 146,
"start_col": 0,
"start_line": 140
} | (*
Copyright 2021 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": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Classical.Sugar.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Classical",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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: Type0 ->
q: (_: Prims.squash p -> Type0) ->
left: (_: Prims.unit -> Prims.squash p) ->
right: (_: Prims.squash p -> Prims.squash (q ()))
-> Prims.squash (p /\ q ()) | Prims.Tot | [
"total"
] | [] | [
"Prims.squash",
"Prims.unit",
"Prims.l_and"
] | [] | false | false | true | false | false | let and_intro
(p: Type)
(q: (squash p -> Type))
(f: (unit -> Tot (squash p)))
(g: (squash p -> Tot (squash (q ()))))
: Tot (squash (p /\ q ())) =
| let _ = f () in
g () | false |
DoublyLinkedList.fst | DoublyLinkedList.aux_unchanged_payload | val aux_unchanged_payload (#t h0 h1 n0: _) (nl: nodelist t)
: Lemma
(requires
(Mod.modifies (Mod.loc_buffer n0) h0 h1 /\ (n0 @ h0).p == (n0 @ h1).p /\ (nodelist_aa_r nl) /\
(n0 `memP` nl \/ Mod.loc_disjoint (Mod.loc_buffer n0) (nodelist_fp0 nl))))
(ensures (unchanged_node_vals h0 h1 nl... | val aux_unchanged_payload (#t h0 h1 n0: _) (nl: nodelist t)
: Lemma
(requires
(Mod.modifies (Mod.loc_buffer n0) h0 h1 /\ (n0 @ h0).p == (n0 @ h1).p /\ (nodelist_aa_r nl) /\
(n0 `memP` nl \/ Mod.loc_disjoint (Mod.loc_buffer n0) (nodelist_fp0 nl))))
(ensures (unchanged_node_vals h0 h1 nl... | let rec aux_unchanged_payload #t h0 h1 n0 (nl:nodelist t) :
Lemma
(requires (Mod.modifies (Mod.loc_buffer n0) h0 h1 /\
(n0@h0).p == (n0@h1).p /\
(nodelist_aa_r nl) /\
(n0 `memP` nl \/ Mod.loc_disjoint (Mod.loc_buffer n0) (nodelist_fp0 nl))
))
(ensures... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 82,
"end_line": 1402,
"start_col": 0,
"start_line": 1380
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 ->
n0:
b:
LowStar.Monotonic.Buffer.mbuffer (DoublyLinkedList.node t)
(LowStar.Buffer.trivial_preorder (DoublyLinkedList.node t))
(LowStar.Buffer.trivial_preorder (DoublyLinkedList.node t))
{ LowStar... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"LowStar.Monotonic.Buffer.mbuffer",
"DoublyLinkedList.node",
"LowStar.Buffer.trivial_preorder",
"Prims.l_and",
"Prims.eq2",
"Prims.int",
"LowStar.Monotonic.Buffer.length",
"DoublyLinkedList.nodelist",
"LowStar.Buffer.pointer",
"Prims.list",
"FStar.Classical.or... | [
"recursion"
] | false | false | true | false | false | let rec aux_unchanged_payload #t h0 h1 n0 (nl: nodelist t)
: Lemma
(requires
(Mod.modifies (Mod.loc_buffer n0) h0 h1 /\ (n0 @ h0).p == (n0 @ h1).p /\ (nodelist_aa_r nl) /\
(n0 `memP` nl \/ Mod.loc_disjoint (Mod.loc_buffer n0) (nodelist_fp0 nl))))
(ensures (unchanged_node_vals h0 h1 nl)... | match nl with
| [] -> ()
| n :: nl' ->
aux_unchanged_payload h0 h1 n0 nl';
assert (n0 `memP` nl ==> (n == n0 \/ n0 `memP` nl'));
let goal () = unchanged_node_val h0 h1 n in
FStar.Classical.or_elim #_
#_
#goal
(fun
(_:
(_:
unit
{ match _ with
... | false |
DoublyLinkedList.fst | DoublyLinkedList._l_remove_mid | val _l_remove_mid (l: list 'a {length l > 0}) (x: 'a{x `memP` l}) : GTot (list 'a) | val _l_remove_mid (l: list 'a {length l > 0}) (x: 'a{x `memP` l}) : GTot (list 'a) | let _l_remove_mid (l:list 'a{length l > 0}) (x:'a {x `memP` l}) : GTot (list 'a) =
let l1, x0 :: l2 = lemma_split_using l x; split_using l x in
assert (x == x0);
l1 `append` l2 | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 16,
"end_line": 1840,
"start_col": 0,
"start_line": 1837
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 {FStar.List.Tot.Base.length l > 0} -> x: 'a{FStar.List.Tot.Base.memP x l}
-> Prims.GTot (Prims.list 'a) | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.list",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.List.Tot.Base.length",
"FStar.List.Tot.Base.memP",
"FStar.List.Tot.Base.append",
"Prims.unit",
"Prims._assert",
"Prims.eq2",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Properties.split_using",
"FStar.List.Tot.Properties.lemma_spl... | [] | false | false | false | false | false | let _l_remove_mid (l: list 'a {length l > 0}) (x: 'a{x `memP` l}) : GTot (list 'a) =
| let l1, x0 :: l2 =
lemma_split_using l x;
split_using l x
in
assert (x == x0);
l1 `append` l2 | false |
DoublyLinkedList.fst | DoublyLinkedList._lemma_only_head_can_point_left_to_null | val _lemma_only_head_can_point_left_to_null
(#t: Type)
(h0: heap)
(e: pointer (node t))
(l: nodelist t)
: Lemma (requires (e `memP` l /\ (e @ h0).blink == null /\ nodelist_conn h0 l))
(ensures (e == hd l)) | val _lemma_only_head_can_point_left_to_null
(#t: Type)
(h0: heap)
(e: pointer (node t))
(l: nodelist t)
: Lemma (requires (e `memP` l /\ (e @ h0).blink == null /\ nodelist_conn h0 l))
(ensures (e == hd l)) | let rec _lemma_only_head_can_point_left_to_null (#t:Type) (h0:heap) (e:pointer (node t)) (l:nodelist t) :
Lemma
(requires (e `memP` l /\ (e@h0).blink == null /\ nodelist_conn h0 l))
(ensures (e == hd l)) =
match l with
| [_] -> ()
| _ ->
FStar.Classical.or_elim #(e == hd l) #(e =!= hd l) #(fun () ->... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 1767,
"start_col": 0,
"start_line": 1756
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap ->
e: LowStar.Buffer.pointer (DoublyLinkedList.node t) ->
l: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires
FStar.List.Tot.Base.memP e l /\ Mknode?.blink (e @ h0) == LowStar.Buffer.null /\
DoublyLinkedList.nodelist_conn h0 l) (ensures e == ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"DoublyLinkedList.nodelist",
"Prims.list",
"FStar.Classical.or_elim",
"Prims.eq2",
"FStar.List.Tot.Base.hd",
"Prims.l_not",
"Prims.unit",
"Prims.squash",
"DoublyLinkedList.extract_nodelist_conn",
"DoublyLinkedList._l... | [
"recursion"
] | false | false | true | false | false | let rec _lemma_only_head_can_point_left_to_null
(#t: Type)
(h0: heap)
(e: pointer (node t))
(l: nodelist t)
: Lemma (requires (e `memP` l /\ (e @ h0).blink == null /\ nodelist_conn h0 l))
(ensures (e == hd l)) =
| match l with
| [_] -> ()
| _ ->
FStar.Classical.or_elim #(e == hd l)
#(e =!= hd l)
#(fun () -> e == hd l)
(fun _ -> ())
(fun _ ->
_lemma_only_head_can_point_left_to_null h0 e (tl l);
extract_nodelist_conn h0 l 0) | false |
DoublyLinkedList.fst | DoublyLinkedList._lemma_all_nodes_are_unique | val _lemma_all_nodes_are_unique (#t: Type) (h0: heap) (l: nodelist t) (i j: nat)
: Lemma
(requires
((nodelist_conn h0 l) /\ (i < length l) /\ (j < length l) /\ (((hd l) @ h0).blink == null) /\
(index l i == index l j))) (ensures (i = j)) | val _lemma_all_nodes_are_unique (#t: Type) (h0: heap) (l: nodelist t) (i j: nat)
: Lemma
(requires
((nodelist_conn h0 l) /\ (i < length l) /\ (j < length l) /\ (((hd l) @ h0).blink == null) /\
(index l i == index l j))) (ensures (i = j)) | let rec _lemma_all_nodes_are_unique (#t:Type) (h0:heap) (l:nodelist t) (i j:nat) :
Lemma
(requires (
(nodelist_conn h0 l) /\
(i < length l) /\
(j < length l) /\
(((hd l)@h0).blink == null) /\
(index l i == index l j)))
(ensures (i = j)) =
match i, j with
| 0, 0 -> (... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 1793,
"start_col": 0,
"start_line": 1777
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap -> l: DoublyLinkedList.nodelist t -> i: Prims.nat -> j: Prims.nat
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.nodelist_conn h0 l /\ i < FStar.List.Tot.Base.length l /\
j < FStar.List.Tot.Base.length l /\
Mknode?.blink (FStar.List.Tot.Base.hd l @ h0) == ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.nodelist",
"Prims.nat",
"FStar.Pervasives.Native.Mktuple2",
"Prims.int",
"DoublyLinkedList.extract_nodelist_conn",
"Prims.op_Subtraction",
"FStar.Pervasives.Native.tuple2",
"DoublyLinkedList._lemma_all_nodes_are_unique",
"Prims.unit",
"Prims.l_and",
"... | [
"recursion"
] | false | false | true | false | false | let rec _lemma_all_nodes_are_unique (#t: Type) (h0: heap) (l: nodelist t) (i j: nat)
: Lemma
(requires
((nodelist_conn h0 l) /\ (i < length l) /\ (j < length l) /\ (((hd l) @ h0).blink == null) /\
(index l i == index l j))) (ensures (i = j)) =
| match i, j with
| 0, 0 -> ()
| 0, _ -> extract_nodelist_conn h0 l (j - 1)
| _, 0 -> extract_nodelist_conn h0 l (i - 1)
| _ ->
extract_nodelist_conn h0 l (i - 1);
extract_nodelist_conn h0 l (j - 1);
_lemma_all_nodes_are_unique h0 l (i - 1) (j - 1) | false |
DoublyLinkedList.fst | DoublyLinkedList._lemma_only_tail_can_point_right_to_null | val _lemma_only_tail_can_point_right_to_null
(#t: Type)
(h0: heap)
(e: pointer (node t))
(l: nodelist t)
: Lemma (requires (e `memP` l /\ (e @ h0).flink == null /\ nodelist_conn h0 l))
(ensures (e == last l)) | val _lemma_only_tail_can_point_right_to_null
(#t: Type)
(h0: heap)
(e: pointer (node t))
(l: nodelist t)
: Lemma (requires (e `memP` l /\ (e @ h0).flink == null /\ nodelist_conn h0 l))
(ensures (e == last l)) | let rec _lemma_only_tail_can_point_right_to_null (#t:Type) (h0:heap) (e:pointer (node t)) (l:nodelist t) :
Lemma
(requires (e `memP` l /\ (e@h0).flink == null /\ nodelist_conn h0 l))
(ensures (e == last l)) =
match l with
| [_] -> ()
| _ -> _lemma_only_tail_can_point_right_to_null h0 e (tl l) | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 1775,
"start_col": 0,
"start_line": 1769
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.heap ->
e: LowStar.Buffer.pointer (DoublyLinkedList.node t) ->
l: DoublyLinkedList.nodelist t
-> FStar.Pervasives.Lemma
(requires
FStar.List.Tot.Base.memP e l /\ Mknode?.flink (e @ h0) == LowStar.Buffer.null /\
DoublyLinkedList.nodelist_conn h0 l) (ensures e == ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"DoublyLinkedList.nodelist",
"Prims.list",
"DoublyLinkedList._lemma_only_tail_can_point_right_to_null",
"FStar.List.Tot.Base.tl",
"Prims.unit",
"Prims.l_and",
"FStar.List.Tot.Base.memP",
"Prims.eq2",
"LowStar.Buffer.bu... | [
"recursion"
] | false | false | true | false | false | let rec _lemma_only_tail_can_point_right_to_null
(#t: Type)
(h0: heap)
(e: pointer (node t))
(l: nodelist t)
: Lemma (requires (e `memP` l /\ (e @ h0).flink == null /\ nodelist_conn h0 l))
(ensures (e == last l)) =
| match l with
| [_] -> ()
| _ -> _lemma_only_tail_can_point_right_to_null h0 e (tl l) | false |
Spec.HMAC_DRBG.fst | Spec.HMAC_DRBG.generate_loop | val generate_loop:
a:supported_alg
-> k:lbytes (hash_length a)
-> max:nat
-> i:nat{i < max}
-> a_spec a i
-> Pure (a_spec a (i + 1) & Lib.Sequence.lseq uint8 (hash_length a))
(requires True)
(ensures fun _ -> True) | val generate_loop:
a:supported_alg
-> k:lbytes (hash_length a)
-> max:nat
-> i:nat{i < max}
-> a_spec a i
-> Pure (a_spec a (i + 1) & Lib.Sequence.lseq uint8 (hash_length a))
(requires True)
(ensures fun _ -> True) | let generate_loop a k max i vi =
hmac_input_bound a;
let v = hmac a k vi in v, v | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 29,
"end_line": 79,
"start_col": 0,
"start_line": 77
} | module Spec.HMAC_DRBG
open Lib.IntTypes
open FStar.Seq
open FStar.Mul
open Spec.Hash.Definitions
open Spec.Agile.HMAC
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 50"
noeq
type state (a:supported_alg) =
| State:
k:lbytes (hash_length a)
-> v:lbytes (hash_length a)
-> reseed_counter:nat
-> state a
... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"... | [
{
"abbrev": false,
"full_module": "Spec.Agile.HMAC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"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 |
a: Spec.HMAC_DRBG.supported_alg ->
k: Spec.Agile.HMAC.lbytes (Spec.Hash.Definitions.hash_length a) ->
max: Prims.nat ->
i: Prims.nat{i < max} ->
vi: Spec.HMAC_DRBG.a_spec a i
-> Prims.Pure
(Spec.HMAC_DRBG.a_spec a (i + 1) *
Lib.Sequence.lseq Lib.IntTypes.uint8 (Spec.Hash.Definitions.has... | Prims.Pure | [] | [] | [
"Spec.HMAC_DRBG.supported_alg",
"Spec.Agile.HMAC.lbytes",
"Spec.Hash.Definitions.hash_length",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Spec.HMAC_DRBG.a_spec",
"FStar.Pervasives.Native.Mktuple2",
"Prims.op_Addition",
"Lib.Sequence.lseq",
"Lib.IntTypes.uint8",
"Spec.Agile.HMAC.hmac",
"... | [] | false | false | false | false | false | let generate_loop a k max i vi =
| hmac_input_bound a;
let v = hmac a k vi in
v, v | false |
Spec.HMAC_DRBG.fst | Spec.HMAC_DRBG.instantiate | val instantiate: #a:supported_alg
-> entropy_input:bytes
-> nonce:bytes
-> personalization_string:bytes
-> Pure (state a)
(requires
(hash_length a
+ Seq.length entropy_input
+ Seq.length nonce
+ Seq.length personalization_string
+ 1 + block_length a) `less_than_max_input_length` a)
(ensu... | val instantiate: #a:supported_alg
-> entropy_input:bytes
-> nonce:bytes
-> personalization_string:bytes
-> Pure (state a)
(requires
(hash_length a
+ Seq.length entropy_input
+ Seq.length nonce
+ Seq.length personalization_string
+ 1 + block_length a) `less_than_max_input_length` a)
(ensu... | let instantiate #a entropy_input nonce personalization_string =
let seed_material = entropy_input @| nonce @| personalization_string in
let k = Seq.create (hash_length a) (u8 0) in
let v = Seq.create (hash_length a) (u8 1) in
let k, v = update #a seed_material k v in
State k v 1 | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 13,
"end_line": 59,
"start_col": 0,
"start_line": 54
} | module Spec.HMAC_DRBG
open Lib.IntTypes
open FStar.Seq
open FStar.Mul
open Spec.Hash.Definitions
open Spec.Agile.HMAC
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 50"
noeq
type state (a:supported_alg) =
| State:
k:lbytes (hash_length a)
-> v:lbytes (hash_length a)
-> reseed_counter:nat
-> state a
... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"... | [
{
"abbrev": false,
"full_module": "Spec.Agile.HMAC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"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 |
entropy_input: Spec.Hash.Definitions.bytes ->
nonce: Spec.Hash.Definitions.bytes ->
personalization_string: Spec.Hash.Definitions.bytes
-> Prims.Pure (Spec.HMAC_DRBG.state a) | Prims.Pure | [] | [] | [
"Spec.HMAC_DRBG.supported_alg",
"Spec.Hash.Definitions.bytes",
"Spec.Agile.HMAC.lbytes",
"Spec.Hash.Definitions.hash_length",
"Spec.HMAC_DRBG.State",
"Spec.HMAC_DRBG.state",
"FStar.Pervasives.Native.tuple2",
"Spec.HMAC_DRBG.update",
"FStar.Seq.Base.seq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
... | [] | false | false | false | false | false | let instantiate #a entropy_input nonce personalization_string =
| let seed_material = entropy_input @| nonce @| personalization_string in
let k = Seq.create (hash_length a) (u8 0) in
let v = Seq.create (hash_length a) (u8 1) in
let k, v = update #a seed_material k v in
State k v 1 | false |
DoublyLinkedList.fst | DoublyLinkedList.dll_insert_at_head | val dll_insert_at_head (#t: Type) (d: dll t) (n: pointer (node t))
: StackInline (dll t)
(requires (fun h0 -> (dll_valid h0 d) /\ (h0 `contains` n) /\ (node_not_in_dll h0 n d)))
(ensures
(fun h0 y h1 ->
Mod.modifies (Mod.loc_union (Mod.loc_buffer n) (Mod.loc_buffer d.lhead)) h0 h1 /\... | val dll_insert_at_head (#t: Type) (d: dll t) (n: pointer (node t))
: StackInline (dll t)
(requires (fun h0 -> (dll_valid h0 d) /\ (h0 `contains` n) /\ (node_not_in_dll h0 n d)))
(ensures
(fun h0 y h1 ->
Mod.modifies (Mod.loc_union (Mod.loc_buffer n) (Mod.loc_buffer d.lhead)) h0 h1 /\... | let dll_insert_at_head (#t:Type) (d:dll t) (n:pointer (node t)) :
StackInline (dll t)
(requires (fun h0 ->
(dll_valid h0 d) /\
(h0 `contains` n) /\
(node_not_in_dll h0 n d)))
(ensures (fun h0 y h1 ->
Mod.modifies (Mod.loc_union
(Mod.loc_buffer n)
... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 1492,
"start_col": 0,
"start_line": 1435
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.dll t -> n: LowStar.Buffer.pointer (DoublyLinkedList.node t)
-> FStar.HyperStack.ST.StackInline (DoublyLinkedList.dll t) | FStar.HyperStack.ST.StackInline | [] | [] | [
"DoublyLinkedList.dll",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"DoublyLinkedList.singleton_dll",
"Prims.bool",
"DoublyLinkedList.piece",
"Prims.l_and",
"DoublyLinkedList.dll_valid",
"DoublyLinkedList.loc_equiv",
"DoublyLinkedList.dll_fp0",
"DoublyLinkedList.fragment_fp0",
"Prims.eq... | [] | false | true | false | false | false | let dll_insert_at_head (#t: Type) (d: dll t) (n: pointer (node t))
: StackInline (dll t)
(requires (fun h0 -> (dll_valid h0 d) /\ (h0 `contains` n) /\ (node_not_in_dll h0 n d)))
(ensures
(fun h0 y h1 ->
Mod.modifies (Mod.loc_union (Mod.loc_buffer n) (Mod.loc_buffer d.lhead)) h0 h1 /\... | if is_null d.lhead
then (singleton_dll n)
else
(let h = d.lhead in
let h0 = ST.get () in
!<|=n;
n =|> h;
let h0' = ST.get () in
n <|= h;
let h1 = ST.get () in
aux_unchanged_payload h0 h0' n d.nodes;
aux_unchanged_payload h0' h1 h d.nodes;
aux_unchanged_payload_transitive h0 h0' h1 ... | false |
Spec.HMAC_DRBG.fst | Spec.HMAC_DRBG.hmac_input_bound | val hmac_input_bound: a:supported_alg -> Lemma
((hash_length a + pow2 32 + pow2 32
+ 1 + block_length a + block_length a) `less_than_max_input_length` a) | val hmac_input_bound: a:supported_alg -> Lemma
((hash_length a + pow2 32 + pow2 32
+ 1 + block_length a + block_length a) `less_than_max_input_length` a) | let hmac_input_bound = function
| SHA1 ->
let a = SHA1 in
assert_norm ((hash_length a + pow2 32 + pow2 32 +1 + block_length a + block_length a) `less_than_max_input_length` a)
| SHA2_256 ->
let a = SHA2_256 in
assert_norm ((hash_length a + pow2 32 + pow2 32 + 1 + block_length a + block_length a)... | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 122,
"end_line": 32,
"start_col": 0,
"start_line": 20
} | module Spec.HMAC_DRBG
open Lib.IntTypes
open FStar.Seq
open FStar.Mul
open Spec.Hash.Definitions
open Spec.Agile.HMAC
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 50"
noeq
type state (a:supported_alg) =
| State:
k:lbytes (hash_length a)
-> v:lbytes (hash_length a)
-> reseed_counter:nat
-> state a | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"... | [
{
"abbrev": false,
"full_module": "Spec.Agile.HMAC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"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 | a: Spec.HMAC_DRBG.supported_alg
-> FStar.Pervasives.Lemma
(ensures
Spec.Hash.Definitions.less_than_max_input_length (Spec.Hash.Definitions.hash_length a +
Prims.pow2 32 +
Prims.pow2 32 +
1 +
Spec.Hash.Definitions.block_length a +
Spec.Hash.Definitions.block_... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.HMAC_DRBG.supported_alg",
"FStar.Pervasives.assert_norm",
"Prims.b2t",
"Spec.Hash.Definitions.less_than_max_input_length",
"Prims.op_Addition",
"Spec.Hash.Definitions.hash_length",
"Prims.pow2",
"Spec.Hash.Definitions.block_length",
"Spec.Hash.Definitions.hash_alg",
"Spec.Hash.Definitions.SH... | [] | false | false | true | false | false | let hmac_input_bound =
| function
| SHA1 ->
let a = SHA1 in
assert_norm ((hash_length a + pow2 32 + pow2 32 + 1 + block_length a + block_length a)
`less_than_max_input_length`
a)
| SHA2_256 ->
let a = SHA2_256 in
assert_norm ((hash_length a + pow2 32 + pow2 32 + 1 + block_length a + block_length a)
`less_than_max_inpu... | false |
Spec.HMAC_DRBG.fst | Spec.HMAC_DRBG.reseed | val reseed: #a:supported_alg
-> state a
-> entropy_input:bytes
-> additional_input:bytes
-> Pure (state a)
(requires
(hash_length a +
Seq.length entropy_input +
Seq.length additional_input +
1 + block_length a) `less_than_max_input_length` a)
(ensures fun _ -> True) | val reseed: #a:supported_alg
-> state a
-> entropy_input:bytes
-> additional_input:bytes
-> Pure (state a)
(requires
(hash_length a +
Seq.length entropy_input +
Seq.length additional_input +
1 + block_length a) `less_than_max_input_length` a)
(ensures fun _ -> True) | let reseed #a st entropy_input additional_input =
let seed_material = entropy_input @| additional_input in
let k, v = update #a seed_material st.k st.v in
State k v 1 | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 13,
"end_line": 64,
"start_col": 0,
"start_line": 61
} | module Spec.HMAC_DRBG
open Lib.IntTypes
open FStar.Seq
open FStar.Mul
open Spec.Hash.Definitions
open Spec.Agile.HMAC
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 50"
noeq
type state (a:supported_alg) =
| State:
k:lbytes (hash_length a)
-> v:lbytes (hash_length a)
-> reseed_counter:nat
-> state a
... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"... | [
{
"abbrev": false,
"full_module": "Spec.Agile.HMAC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"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 |
st: Spec.HMAC_DRBG.state a ->
entropy_input: Spec.Hash.Definitions.bytes ->
additional_input: Spec.Hash.Definitions.bytes
-> Prims.Pure (Spec.HMAC_DRBG.state a) | Prims.Pure | [] | [] | [
"Spec.HMAC_DRBG.supported_alg",
"Spec.HMAC_DRBG.state",
"Spec.Hash.Definitions.bytes",
"Spec.Agile.HMAC.lbytes",
"Spec.Hash.Definitions.hash_length",
"Spec.HMAC_DRBG.State",
"FStar.Pervasives.Native.tuple2",
"Spec.HMAC_DRBG.update",
"Spec.HMAC_DRBG.__proj__State__item__k",
"Spec.HMAC_DRBG.__proj__... | [] | false | false | false | false | false | let reseed #a st entropy_input additional_input =
| let seed_material = entropy_input @| additional_input in
let k, v = update #a seed_material st.k st.v in
State k v 1 | false |
Spec.HMAC_DRBG.fst | Spec.HMAC_DRBG.update | val update: #a:supported_alg
-> data:bytes
-> k:lbytes (hash_length a)
-> v:lbytes (hash_length a)
-> Pure (lbytes (hash_length a) & lbytes (hash_length a))
(requires (hash_length a + Seq.length data + 1 + block_length a) `less_than_max_input_length` a)
(ensures fun _ -> True) | val update: #a:supported_alg
-> data:bytes
-> k:lbytes (hash_length a)
-> v:lbytes (hash_length a)
-> Pure (lbytes (hash_length a) & lbytes (hash_length a))
(requires (hash_length a + Seq.length data + 1 + block_length a) `less_than_max_input_length` a)
(ensures fun _ -> True) | let update #a data k v =
let zero_data = Seq.cons (u8 0) data in
let k = hmac a k (v @| zero_data) in
let v = hmac a k v in
if Seq.length data = 0 then
k, v
else
let one_data = Seq.cons (u8 1) data in
let k = hmac a k (v @| one_data) in
let v = hmac a k v in
k, v | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 8,
"end_line": 52,
"start_col": 0,
"start_line": 42
} | module Spec.HMAC_DRBG
open Lib.IntTypes
open FStar.Seq
open FStar.Mul
open Spec.Hash.Definitions
open Spec.Agile.HMAC
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 50"
noeq
type state (a:supported_alg) =
| State:
k:lbytes (hash_length a)
-> v:lbytes (hash_length a)
-> reseed_counter:nat
-> state a
... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"... | [
{
"abbrev": false,
"full_module": "Spec.Agile.HMAC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"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 |
data: Spec.Hash.Definitions.bytes ->
k: Spec.Agile.HMAC.lbytes (Spec.Hash.Definitions.hash_length a) ->
v: Spec.Agile.HMAC.lbytes (Spec.Hash.Definitions.hash_length a)
-> Prims.Pure
(Spec.Agile.HMAC.lbytes (Spec.Hash.Definitions.hash_length a) *
Spec.Agile.HMAC.lbytes (Spec.Hash.Definitions.has... | Prims.Pure | [] | [] | [
"Spec.HMAC_DRBG.supported_alg",
"Spec.Hash.Definitions.bytes",
"Spec.Agile.HMAC.lbytes",
"Spec.Hash.Definitions.hash_length",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"Lib.IntTypes.uint8",
"FStar.Pervasives.Native.Mktuple2",
"Prims.bool",
"Spec.Agile.HMAC.hmac",
"FStar.Seq.Ba... | [] | false | false | false | false | false | let update #a data k v =
| let zero_data = Seq.cons (u8 0) data in
let k = hmac a k (v @| zero_data) in
let v = hmac a k v in
if Seq.length data = 0
then k, v
else
let one_data = Seq.cons (u8 1) data in
let k = hmac a k (v @| one_data) in
let v = hmac a k v in
k, v | false |
Hacl.Spec.Bignum.Definitions.fst | Hacl.Spec.Bignum.Definitions.lbignum | val lbignum : t: Hacl.Spec.Bignum.Definitions.limb_t -> len: Lib.IntTypes.size_nat -> Type0 | let lbignum (t:limb_t) len = lseq (limb t) len | {
"file_name": "code/bignum/Hacl.Spec.Bignum.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 21,
"start_col": 0,
"start_line": 21
} | module Hacl.Spec.Bignum.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val blocks: x:size_pos -> m:size_pos -> Tot (r:size_pos{x <= m * r})
let blocks x m = (x - 1) / m + 1
val blocks0: x:size_nat -> m:size_pos -> Tot (r:size_pos{x <= m * r})
let bloc... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Calc.... | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.S... | {
"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 | t: Hacl.Spec.Bignum.Definitions.limb_t -> len: Lib.IntTypes.size_nat -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_nat",
"Lib.Sequence.lseq",
"Hacl.Spec.Bignum.Definitions.limb"
] | [] | false | false | false | true | true | let lbignum (t: limb_t) len =
| lseq (limb t) len | false | |
Spec.HMAC_DRBG.fst | Spec.HMAC_DRBG.generate | val generate: #a:supported_alg
-> state a
-> n:nat
-> additional_input:bytes
-> Pure (option (lbytes n & state a))
(requires
n <= max_output_length /\
(hash_length a + Seq.length additional_input
+ 1 + block_length a) `less_than_max_input_length` a)
(ensures fun _ -> True) | val generate: #a:supported_alg
-> state a
-> n:nat
-> additional_input:bytes
-> Pure (option (lbytes n & state a))
(requires
n <= max_output_length /\
(hash_length a + Seq.length additional_input
+ 1 + block_length a) `less_than_max_input_length` a)
(ensures fun _ -> True) | let generate #a st n additional_input =
if st.reseed_counter > reseed_interval then
None
else
let k, v =
if Seq.length additional_input > 0 then
update additional_input st.k st.v
else st.k, st.v
in
let max = n / hash_length a in
let v, output =
Lib.Sequence.generate_bl... | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 52,
"end_line": 104,
"start_col": 0,
"start_line": 81
} | module Spec.HMAC_DRBG
open Lib.IntTypes
open FStar.Seq
open FStar.Mul
open Spec.Hash.Definitions
open Spec.Agile.HMAC
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 50"
noeq
type state (a:supported_alg) =
| State:
k:lbytes (hash_length a)
-> v:lbytes (hash_length a)
-> reseed_counter:nat
-> state a
... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"... | [
{
"abbrev": false,
"full_module": "Spec.Agile.HMAC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"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 | st: Spec.HMAC_DRBG.state a -> n: Prims.nat -> additional_input: Spec.Hash.Definitions.bytes
-> Prims.Pure (FStar.Pervasives.Native.option (Spec.Agile.HMAC.lbytes n * Spec.HMAC_DRBG.state a)) | Prims.Pure | [] | [] | [
"Spec.HMAC_DRBG.supported_alg",
"Spec.HMAC_DRBG.state",
"Prims.nat",
"Spec.Hash.Definitions.bytes",
"Prims.op_GreaterThan",
"Spec.HMAC_DRBG.__proj__State__item__reseed_counter",
"Spec.HMAC_DRBG.reseed_interval",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.tuple2",
"Spec.Agile.HMAC.lby... | [] | false | false | false | false | false | let generate #a st n additional_input =
| if st.reseed_counter > reseed_interval
then None
else
let k, v =
if Seq.length additional_input > 0 then update additional_input st.k st.v else st.k, st.v
in
let max = n / hash_length a in
let v, output =
Lib.Sequence.generate_blocks (hash_length a) max max (a_spec a) (generate_loop a k max) v
in
le... | false |
Spec.HMAC_DRBG.fst | Spec.HMAC_DRBG.generate' | val generate': #a:supported_alg
-> state a
-> n:nat
-> additional_input:bytes
-> Pure (option (lbytes n & state a))
(requires
n <= max_output_length /\
(hash_length a + Seq.length additional_input
+ 1 + block_length a) `less_than_max_input_length` a)
(ensures fun _ -> True) | val generate': #a:supported_alg
-> state a
-> n:nat
-> additional_input:bytes
-> Pure (option (lbytes n & state a))
(requires
n <= max_output_length /\
(hash_length a + Seq.length additional_input
+ 1 + block_length a) `less_than_max_input_length` a)
(ensures fun _ -> True) | let generate' #a st n additional_input =
hmac_input_bound a;
if st.reseed_counter > reseed_interval then
None
else
let k, v =
if Seq.length additional_input > 0 then
update additional_input st.k st.v
else st.k, st.v
in
// let max = ceil (n / hash_length a) in
let max = (n +... | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 66,
"end_line": 135,
"start_col": 0,
"start_line": 117
} | module Spec.HMAC_DRBG
open Lib.IntTypes
open FStar.Seq
open FStar.Mul
open Spec.Hash.Definitions
open Spec.Agile.HMAC
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 50"
noeq
type state (a:supported_alg) =
| State:
k:lbytes (hash_length a)
-> v:lbytes (hash_length a)
-> reseed_counter:nat
-> state a
... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"... | [
{
"abbrev": false,
"full_module": "Spec.Agile.HMAC",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"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 | st: Spec.HMAC_DRBG.state a -> n: Prims.nat -> additional_input: Spec.Hash.Definitions.bytes
-> Prims.Pure (FStar.Pervasives.Native.option (Spec.Agile.HMAC.lbytes n * Spec.HMAC_DRBG.state a)) | Prims.Pure | [] | [] | [
"Spec.HMAC_DRBG.supported_alg",
"Spec.HMAC_DRBG.state",
"Prims.nat",
"Spec.Hash.Definitions.bytes",
"Prims.op_GreaterThan",
"Spec.HMAC_DRBG.__proj__State__item__reseed_counter",
"Spec.HMAC_DRBG.reseed_interval",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.tuple2",
"Spec.Agile.HMAC.lby... | [] | false | false | false | false | false | let generate' #a st n additional_input =
| hmac_input_bound a;
if st.reseed_counter > reseed_interval
then None
else
let k, v =
if Seq.length additional_input > 0 then update additional_input st.k st.v else st.k, st.v
in
let max = (n + hash_length a - 1) / hash_length a in
let v, output =
Lib.Sequence.generate_blocks (hash_length a) max max (a_s... | false |
DoublyLinkedList.fst | DoublyLinkedList.lemma_dll_links_disjoint | val lemma_dll_links_disjoint (#t: Type) (h0: heap) (d: dll t) (i: nat)
: Lemma (requires ((dll_valid h0 d) /\ (i < length d.nodes)))
(ensures
(let nodes = d.nodes in
let left = (nodes.[ i ] @ h0).blink in
let right = (nodes.[ i ] @ h0).flink in
Mod.loc_disjoint (Mod.loc_b... | val lemma_dll_links_disjoint (#t: Type) (h0: heap) (d: dll t) (i: nat)
: Lemma (requires ((dll_valid h0 d) /\ (i < length d.nodes)))
(ensures
(let nodes = d.nodes in
let left = (nodes.[ i ] @ h0).blink in
let right = (nodes.[ i ] @ h0).flink in
Mod.loc_disjoint (Mod.loc_b... | let lemma_dll_links_disjoint (#t:Type) (h0:heap) (d:dll t) (i:nat) :
Lemma
(requires (
(dll_valid h0 d) /\
(i < length d.nodes)))
(ensures (
let nodes = d.nodes in
let left = (nodes.[i]@h0).blink in
let right = (nodes.[i]@h0).flink in
Mod.loc_disjoint
... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 1262,
"start_col": 0,
"start_line": 1225
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"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: DoublyLinkedList.heap -> d: DoublyLinkedList.dll t -> i: Prims.nat
-> FStar.Pervasives.Lemma
(requires
DoublyLinkedList.dll_valid h0 d /\
i < FStar.List.Tot.Base.length (FStar.Ghost.reveal (Mkdll?.nodes d)))
(ensures
(let nodes = Mkdll?.nodes d in
let left = Mknode?.b... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"DoublyLinkedList.heap",
"DoublyLinkedList.dll",
"Prims.nat",
"LowStar.Buffer.pointer",
"DoublyLinkedList.node",
"Prims.list",
"Prims.op_Equality",
"Prims.int",
"Prims.bool",
"Prims.op_Subtraction",
"FStar.List.Tot.Base.length",
"FStar.List.Tot.Properties.lemma_unsnoc_is_last",
"Prims.unit",... | [] | false | false | true | false | false | let lemma_dll_links_disjoint (#t: Type) (h0: heap) (d: dll t) (i: nat)
: Lemma (requires ((dll_valid h0 d) /\ (i < length d.nodes)))
(ensures
(let nodes = d.nodes in
let left = (nodes.[ i ] @ h0).blink in
let right = (nodes.[ i ] @ h0).flink in
Mod.loc_disjoint (Mod.loc_b... | let nl = reveal d.nodes in
match nl with
| [_] -> ()
| _ ->
lemma_unsnoc_length nl;
let node_split = splitAt i nl in
lemma_splitAt nl (fst node_split) (snd node_split) i;
lemma_splitAt_index_hd i nl;
let l1, x :: l2 = node_split in
(if i = 0 then () else extract_nodelist_conn h0 nl (i - 1));
(if i = lengt... | false |
Hacl.Spec.Bignum.Definitions.fst | Hacl.Spec.Bignum.Definitions.limb_t | val limb_t : Type0 | let limb_t = t:inttype{t = U32 \/ t = U64} | {
"file_name": "code/bignum/Hacl.Spec.Bignum.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 42,
"end_line": 18,
"start_col": 0,
"start_line": 18
} | module Hacl.Spec.Bignum.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val blocks: x:size_pos -> m:size_pos -> Tot (r:size_pos{x <= m * r})
let blocks x m = (x - 1) / m + 1
val blocks0: x:size_nat -> m:size_pos -> Tot (r:size_pos{x <= m * r})
let bloc... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Calc.... | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.S... | {
"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 | Type0 | Prims.Tot | [
"total"
] | [] | [
"Lib.IntTypes.inttype",
"Prims.l_or",
"Prims.b2t",
"Prims.op_Equality",
"Lib.IntTypes.U32",
"Lib.IntTypes.U64"
] | [] | false | false | false | true | true | let limb_t =
| t: inttype{t = U32 \/ t = U64} | false | |
DoublyLinkedList.fst | DoublyLinkedList.dll_remove_head | val dll_remove_head (#t: Type) (d: dll t)
: StackInline (dll t)
(requires (fun h0 -> (dll_valid h0 d) /\ (length d.nodes > 0)))
(ensures
(fun h0 y h1 ->
Mod.modifies (Mod.loc_buffer (d.lhead @ h0).flink) h0 h1 /\
_aux_fp_split_by_node d y d.lhead /\ dll_valid h1 y /\ unch... | val dll_remove_head (#t: Type) (d: dll t)
: StackInline (dll t)
(requires (fun h0 -> (dll_valid h0 d) /\ (length d.nodes > 0)))
(ensures
(fun h0 y h1 ->
Mod.modifies (Mod.loc_buffer (d.lhead @ h0).flink) h0 h1 /\
_aux_fp_split_by_node d y d.lhead /\ dll_valid h1 y /\ unch... | let dll_remove_head (#t:Type) (d:dll t) :
StackInline (dll t)
(requires (fun h0 ->
(dll_valid h0 d) /\
(length d.nodes > 0)))
(ensures (fun h0 y h1 ->
Mod.modifies (Mod.loc_buffer (d.lhead@h0).flink) h0 h1 /\
_aux_fp_split_by_node d y d.lhead /\
dll_valid h1 y /\
... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 1752,
"start_col": 0,
"start_line": 1724
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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: DoublyLinkedList.dll t -> FStar.HyperStack.ST.StackInline (DoublyLinkedList.dll t) | FStar.HyperStack.ST.StackInline | [] | [] | [
"DoublyLinkedList.dll",
"DoublyLinkedList.empty_list",
"Prims.bool",
"DoublyLinkedList.piece",
"Prims.unit",
"DoublyLinkedList.aux_unchanged_payload",
"FStar.Ghost.reveal",
"DoublyLinkedList.nodelist",
"DoublyLinkedList.__proj__Mkdll__item__nodes",
"Prims.l_and",
"DoublyLinkedList.dll_valid",
... | [] | false | true | false | false | false | let dll_remove_head (#t: Type) (d: dll t)
: StackInline (dll t)
(requires (fun h0 -> (dll_valid h0 d) /\ (length d.nodes > 0)))
(ensures
(fun h0 y h1 ->
Mod.modifies (Mod.loc_buffer (d.lhead @ h0).flink) h0 h1 /\
_aux_fp_split_by_node d y d.lhead /\ dll_valid h1 y /\ unch... | let h0 = ST.get () in
let e = d.lhead in
let e2 = (!*e).flink in
if is_null e2
then (empty_list)
else
(!<|=e2;
let h1 = ST.get () in
let f = tot_dll_to_fragment_split h0 d e e2 in
let Frag2 p1 p2 = f in
let f' = Frag1 p2 in
piece_remains_valid_b h0 h1 p2;
let y = tot_defragmentable_fragment_to... | false |
DoublyLinkedList.fst | DoublyLinkedList.dll_append | val dll_append (#t: Type) (d1 d2: dll t)
: StackInline (dll t)
(requires
(fun h0 ->
(dll_valid h0 d1) /\ (dll_valid h0 d2) /\ ((dll_fp0 d1) `Mod.loc_disjoint` (dll_fp0 d2))
))
(ensures
(fun h0 y h1 ->
Mod.modifies (Mod.loc_union (Mod.loc_buffer d1.ltail) (... | val dll_append (#t: Type) (d1 d2: dll t)
: StackInline (dll t)
(requires
(fun h0 ->
(dll_valid h0 d1) /\ (dll_valid h0 d2) /\ ((dll_fp0 d1) `Mod.loc_disjoint` (dll_fp0 d2))
))
(ensures
(fun h0 y h1 ->
Mod.modifies (Mod.loc_union (Mod.loc_buffer d1.ltail) (... | let dll_append (#t:Type) (d1 d2:dll t) :
StackInline (dll t)
(requires (fun h0 ->
(dll_valid h0 d1) /\
(dll_valid h0 d2) /\
(dll_fp0 d1 `Mod.loc_disjoint` dll_fp0 d2)))
(ensures (fun h0 y h1 ->
Mod.modifies (Mod.loc_union
(Mod.loc_buffer d1.ltail... | {
"file_name": "examples/doublylinkedlist/DoublyLinkedList.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 1963,
"start_col": 0,
"start_line": 1910
} | (*
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.ModifiesPat.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.BufferOps.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.c... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "ST"
},
{
"abbrev": true,
"full_modul... | {
"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 | d1: DoublyLinkedList.dll t -> d2: DoublyLinkedList.dll t
-> FStar.HyperStack.ST.StackInline (DoublyLinkedList.dll t) | FStar.HyperStack.ST.StackInline | [] | [] | [
"DoublyLinkedList.dll",
"Prims.unit",
"DoublyLinkedList.aux_unchanged_payload_nomod",
"FStar.Ghost.reveal",
"DoublyLinkedList.nodelist",
"DoublyLinkedList.__proj__Mkdll__item__nodes",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.get",
"Prims.bool",
"FStar.List.Tot.Properties.append_l_nil... | [] | false | true | false | false | false | let dll_append (#t: Type) (d1 d2: dll t)
: StackInline (dll t)
(requires
(fun h0 ->
(dll_valid h0 d1) /\ (dll_valid h0 d2) /\ ((dll_fp0 d1) `Mod.loc_disjoint` (dll_fp0 d2))
))
(ensures
(fun h0 y h1 ->
Mod.modifies (Mod.loc_union (Mod.loc_buffer d1.ltail) (... | let h0 = ST.get () in
if is_null d1.lhead
then
(let y = d2 in
let h1 = ST.get () in
aux_unchanged_payload_nomod h0 h1 y.nodes;
y)
else
(if is_null d2.lhead
then
(let y = d1 in
let h1 = ST.get () in
aux_unchanged_payload_nomod h0 h1 y.nodes;
append_l_nil y.nodes;
... | false |
Hacl.Spec.Bignum.Definitions.fst | Hacl.Spec.Bignum.Definitions.blocks | val blocks: x:size_pos -> m:size_pos -> Tot (r:size_pos{x <= m * r}) | val blocks: x:size_pos -> m:size_pos -> Tot (r:size_pos{x <= m * r}) | let blocks x m = (x - 1) / m + 1 | {
"file_name": "code/bignum/Hacl.Spec.Bignum.Definitions.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 11,
"start_col": 0,
"start_line": 11
} | module Hacl.Spec.Bignum.Definitions
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0" | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Calc.... | [
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.S... | {
"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 | x: Lib.IntTypes.size_pos -> m: Lib.IntTypes.size_pos -> r: Lib.IntTypes.size_pos{x <= m * r} | Prims.Tot | [
"total"
] | [] | [
"Lib.IntTypes.size_pos",
"Prims.op_Addition",
"Prims.op_Division",
"Prims.op_Subtraction",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star"
] | [] | false | false | false | false | false | let blocks x m =
| (x - 1) / m + 1 | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.