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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Test.Vectors.Curve25519.fst | Test.Vectors.Curve25519.result6 | val result6:(b: B.buffer UInt8.t {B.length b = 32 /\ B.recallable b}) | val result6:(b: B.buffer UInt8.t {B.length b = 32 /\ B.recallable b}) | let result6: (b: B.buffer UInt8.t { B.length b = 32 /\ B.recallable b }) =
[@inline_let] let l = [ 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x0... | {
"file_name": "providers/test/vectors/Test.Vectors.Curve25519.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 38,
"end_line": 182,
"start_col": 0,
"start_line": 179
} | module Test.Vectors.Curve25519
module B = LowStar.Buffer
#set-options "--max_fuel 0 --max_ifuel 0"
let private_0: (b: B.buffer UInt8.t { B.length b = 32 /\ B.recallable b }) =
[@inline_let] let l = [ 0x77uy; 0x07uy; 0x6duy; 0x0auy; 0x73uy; 0x18uy; 0xa5uy; 0x7duy; 0x3cuy; 0x16uy; 0xc1uy; 0x72uy; 0x51uy; 0xb2uy; 0x6... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_fil... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "Test.Vectors",
"short_module": null
},
{
"abbrev": false,
"full_module": "Test.Vectors",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"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 | b:
LowStar.Buffer.buffer FStar.UInt8.t
{LowStar.Monotonic.Buffer.length b = 32 /\ LowStar.Monotonic.Buffer.recallable b} | Prims.Tot | [
"total"
] | [] | [
"LowStar.Buffer.gcmalloc_of_list",
"FStar.UInt8.t",
"FStar.Monotonic.HyperHeap.root",
"LowStar.Monotonic.Buffer.mbuffer",
"LowStar.Buffer.trivial_preorder",
"Prims.l_and",
"Prims.eq2",
"Prims.nat",
"LowStar.Monotonic.Buffer.length",
"FStar.Pervasives.normalize_term",
"FStar.List.Tot.Base.length"... | [] | false | false | false | false | false | let result6:(b: B.buffer UInt8.t {B.length b = 32 /\ B.recallable b}) =
| [@@ inline_let ]let l =
[
0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy;
0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy;
0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy
]
in
assert_norm (List.... | false |
FStar.Pointer.Derived2.fsti | FStar.Pointer.Derived2.copy_buffer_contents_postcond | val copy_buffer_contents_postcond
(#t: typ)
(a: buffer t)
(idx_a: UInt32.t)
(b: buffer t)
(idx_b len: UInt32.t)
(h h': HS.mem)
: GTot Type0 | val copy_buffer_contents_postcond
(#t: typ)
(a: buffer t)
(idx_a: UInt32.t)
(b: buffer t)
(idx_b len: UInt32.t)
(h h': HS.mem)
: GTot Type0 | let copy_buffer_contents_postcond
(#t: typ)
(a: buffer t) (* source *)
(idx_a: UInt32.t)
(b: buffer t) (* destination *)
(idx_b: UInt32.t)
(len: UInt32.t)
(h: HS.mem)
(h' : HS.mem)
: GTot Type0
= copy_buffer_contents_precond a idx_a b idx_b len h /\
modifies (loc_buffer (gsub_buffer b idx_b len)) h h'... | {
"file_name": "ulib/legacy/FStar.Pointer.Derived2.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 89,
"end_line": 52,
"start_col": 0,
"start_line": 39
} | (*
Copyright 2008-2018 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",
"FStar.UInt32.fsti.checked",
"FStar.Pointer.Derived1.fsti.checked",
"FStar.Pointer.Base.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file"... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HH"
},
{
"abbrev": false,
"full_... | {
"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: FStar.Pointer.Base.buffer t ->
idx_a: FStar.UInt32.t ->
b: FStar.Pointer.Base.buffer t ->
idx_b: FStar.UInt32.t ->
len: FStar.UInt32.t ->
h: FStar.Monotonic.HyperStack.mem ->
h': FStar.Monotonic.HyperStack.mem
-> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"FStar.Pointer.Base.typ",
"FStar.Pointer.Base.buffer",
"FStar.UInt32.t",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"FStar.Pointer.Derived2.copy_buffer_contents_precond",
"FStar.Pointer.Base.modifies",
"FStar.Pointer.Base.loc_buffer",
"FStar.Pointer.Base.gsub_buffer",
"FStar.Pointer.Base.buf... | [] | false | false | false | false | true | let copy_buffer_contents_postcond
(#t: typ)
(a: buffer t)
(idx_a: UInt32.t)
(b: buffer t)
(idx_b len: UInt32.t)
(h h': HS.mem)
: GTot Type0 =
| copy_buffer_contents_precond a idx_a b idx_b len h /\
modifies (loc_buffer (gsub_buffer b idx_b len)) h h' /\ buffer_readable h' (gsub_buffer b idx_b len) /\
buffer_as_seq h' (gsub_buffer b idx_b len) == buffer_as_seq h (gsub_buffer a idx_a len) | false |
FStar.Pointer.Derived2.fsti | FStar.Pointer.Derived2.copy_buffer_contents_precond | val copy_buffer_contents_precond
(#t: typ)
(a: buffer t)
(idx_a: UInt32.t)
(b: buffer t)
(idx_b len: UInt32.t)
(h: HS.mem)
: GTot Type0 | val copy_buffer_contents_precond
(#t: typ)
(a: buffer t)
(idx_a: UInt32.t)
(b: buffer t)
(idx_b len: UInt32.t)
(h: HS.mem)
: GTot Type0 | let copy_buffer_contents_precond
(#t: typ)
(a: buffer t) (* source *)
(idx_a: UInt32.t)
(b: buffer t) (* destination *)
(idx_b: UInt32.t)
(len: UInt32.t)
(h: HS.mem)
: GTot Type0
= UInt32.v idx_a + UInt32.v len <= UInt32.v (buffer_length a) /\
UInt32.v idx_b + UInt32.v len <= UInt32.v (buffer_length b) ... | {
"file_name": "ulib/legacy/FStar.Pointer.Derived2.fsti",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 92,
"end_line": 37,
"start_col": 0,
"start_line": 24
} | (*
Copyright 2008-2018 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",
"FStar.UInt32.fsti.checked",
"FStar.Pointer.Derived1.fsti.checked",
"FStar.Pointer.Base.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.HyperStack.ST.fsti.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file"... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack.ST",
"short_module": "HST"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HH"
},
{
"abbrev": false,
"full_... | {
"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: FStar.Pointer.Base.buffer t ->
idx_a: FStar.UInt32.t ->
b: FStar.Pointer.Base.buffer t ->
idx_b: FStar.UInt32.t ->
len: FStar.UInt32.t ->
h: FStar.Monotonic.HyperStack.mem
-> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"FStar.Pointer.Base.typ",
"FStar.Pointer.Base.buffer",
"FStar.UInt32.t",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"FStar.UInt32.v",
"FStar.Pointer.Base.buffer_length",
"FStar.Pointer.Base.buffer_live",
"FStar.Pointer.Base.gs... | [] | false | false | false | false | true | let copy_buffer_contents_precond
(#t: typ)
(a: buffer t)
(idx_a: UInt32.t)
(b: buffer t)
(idx_b len: UInt32.t)
(h: HS.mem)
: GTot Type0 =
| UInt32.v idx_a + UInt32.v len <= UInt32.v (buffer_length a) /\
UInt32.v idx_b + UInt32.v len <= UInt32.v (buffer_length b) /\
buffer_live h (gsub_buffer b idx_b len) /\ buffer_readable h (gsub_buffer a idx_a len) /\
loc_disjoint (loc_buffer (gsub_buffer a idx_a len)) (loc_buffer (gsub_buffer b idx_b len)) | false |
LowParse.Spec.Combinators.fst | LowParse.Spec.Combinators.serialize_nondep_then_upd_left_chain | val serialize_nondep_then_upd_left_chain
(#k1: parser_kind)
(#t1: Type)
(#p1: parser k1 t1)
(s1: serializer p1 { k1.parser_kind_subkind == Some ParserStrong } )
(#k2: parser_kind)
(#t2: Type)
(#p2: parser k2 t2)
(s2: serializer p2)
(x: t1 * t2)
(y: t1)
(i' : nat)
(s' : bytes)
: Lemma
(requires... | val serialize_nondep_then_upd_left_chain
(#k1: parser_kind)
(#t1: Type)
(#p1: parser k1 t1)
(s1: serializer p1 { k1.parser_kind_subkind == Some ParserStrong } )
(#k2: parser_kind)
(#t2: Type)
(#p2: parser k2 t2)
(s2: serializer p2)
(x: t1 * t2)
(y: t1)
(i' : nat)
(s' : bytes)
: Lemma
(requires... | let serialize_nondep_then_upd_left_chain
(#k1: parser_kind)
(#t1: Type)
(#p1: parser k1 t1)
(s1: serializer p1 { k1.parser_kind_subkind == Some ParserStrong } )
(#k2: parser_kind)
(#t2: Type)
(#p2: parser k2 t2)
(s2: serializer p2)
(x: t1 * t2)
(y: t1)
(i' : nat)
(s' : bytes)
: Lemma
(requires... | {
"file_name": "src/lowparse/LowParse.Spec.Combinators.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 45,
"end_line": 518,
"start_col": 0,
"start_line": 487
} | module LowParse.Spec.Combinators
include LowParse.Spec.Base
module Seq = FStar.Seq
module U8 = FStar.UInt8
module U32 = FStar.UInt32
module T = FStar.Tactics
#reset-options "--using_facts_from '* -FStar.Tactis -FStar.Reflection'"
let and_then #k #t p #k' #t' p' =
let f : bare_parser t' = and_then_bare p p' in
a... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Tactics.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.S... | {
"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:
LowParse.Spec.Base.serializer p1
{ Mkparser_kind'?.parser_kind_subkind k1 ==
FStar.Pervasives.Native.Some LowParse.Spec.Base.ParserStrong } ->
s2: LowParse.Spec.Base.serializer p2 ->
x: (t1 * t2) ->
y: t1 ->
i': Prims.nat ->
s': LowParse.Bytes.bytes
-> FStar.Pervas... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"LowParse.Spec.Base.parser_subkind",
"LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_subkind",
"FStar.Pervasives.Native.Some",
"LowParse.Spec.B... | [] | true | false | true | false | false | let serialize_nondep_then_upd_left_chain
(#k1: parser_kind)
(#t1: Type)
(#p1: parser k1 t1)
(s1: serializer p1 {k1.parser_kind_subkind == Some ParserStrong})
(#k2: parser_kind)
(#t2: Type)
(#p2: parser k2 t2)
(s2: serializer p2)
(x: t1 * t2)
(y: t1)
(i':... | serialize_nondep_then_upd_left s1 s2 x y;
let s = serialize (serialize_nondep_then s1 s2) x in
let s1' = serialize s1 (fst x) in
let l1 = Seq.length s1' in
Seq.lemma_split s l1;
Seq.lemma_append_inj (Seq.slice s 0 l1) (Seq.slice s l1 (Seq.length s)) s1' (serialize s2 (snd x));
seq_upd_seq_right_to_left s 0 s1' i' s';
s... | false |
Test.Vectors.Curve25519.fst | Test.Vectors.Curve25519.result5 | val result5:(b: B.buffer UInt8.t {B.length b = 32 /\ B.recallable b}) | val result5:(b: B.buffer UInt8.t {B.length b = 32 /\ B.recallable b}) | let result5: (b: B.buffer UInt8.t { B.length b = 32 /\ B.recallable b }) =
[@inline_let] let l = [ 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x0... | {
"file_name": "providers/test/vectors/Test.Vectors.Curve25519.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 38,
"end_line": 156,
"start_col": 0,
"start_line": 153
} | module Test.Vectors.Curve25519
module B = LowStar.Buffer
#set-options "--max_fuel 0 --max_ifuel 0"
let private_0: (b: B.buffer UInt8.t { B.length b = 32 /\ B.recallable b }) =
[@inline_let] let l = [ 0x77uy; 0x07uy; 0x6duy; 0x0auy; 0x73uy; 0x18uy; 0xa5uy; 0x7duy; 0x3cuy; 0x16uy; 0xc1uy; 0x72uy; 0x51uy; 0xb2uy; 0x6... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_fil... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "Test.Vectors",
"short_module": null
},
{
"abbrev": false,
"full_module": "Test.Vectors",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"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 | b:
LowStar.Buffer.buffer FStar.UInt8.t
{LowStar.Monotonic.Buffer.length b = 32 /\ LowStar.Monotonic.Buffer.recallable b} | Prims.Tot | [
"total"
] | [] | [
"LowStar.Buffer.gcmalloc_of_list",
"FStar.UInt8.t",
"FStar.Monotonic.HyperHeap.root",
"LowStar.Monotonic.Buffer.mbuffer",
"LowStar.Buffer.trivial_preorder",
"Prims.l_and",
"Prims.eq2",
"Prims.nat",
"LowStar.Monotonic.Buffer.length",
"FStar.Pervasives.normalize_term",
"FStar.List.Tot.Base.length"... | [] | false | false | false | false | false | let result5:(b: B.buffer UInt8.t {B.length b = 32 /\ B.recallable b}) =
| [@@ inline_let ]let l =
[
0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy;
0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy;
0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy
]
in
assert_norm (List.... | false |
LowParse.Spec.Combinators.fst | LowParse.Spec.Combinators.serialize_nondep_then_upd_right_chain | val serialize_nondep_then_upd_right_chain
(#k1: parser_kind)
(#t1: Type)
(#p1: parser k1 t1)
(s1: serializer p1 { k1.parser_kind_subkind == Some ParserStrong } )
(#k2: parser_kind)
(#t2: Type)
(#p2: parser k2 t2)
(s2: serializer p2)
(x: t1 * t2)
(y: t2)
(i' : nat)
(s' : bytes)
: Lemma
(require... | val serialize_nondep_then_upd_right_chain
(#k1: parser_kind)
(#t1: Type)
(#p1: parser k1 t1)
(s1: serializer p1 { k1.parser_kind_subkind == Some ParserStrong } )
(#k2: parser_kind)
(#t2: Type)
(#p2: parser k2 t2)
(s2: serializer p2)
(x: t1 * t2)
(y: t2)
(i' : nat)
(s' : bytes)
: Lemma
(require... | let serialize_nondep_then_upd_right_chain
(#k1: parser_kind)
(#t1: Type)
(#p1: parser k1 t1)
(s1: serializer p1 { k1.parser_kind_subkind == Some ParserStrong } )
(#k2: parser_kind)
(#t2: Type)
(#p2: parser k2 t2)
(s2: serializer p2)
(x: t1 * t2)
(y: t2)
(i' : nat)
(s' : bytes)
: Lemma
(require... | {
"file_name": "src/lowparse/LowParse.Spec.Combinators.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 44,
"end_line": 629,
"start_col": 0,
"start_line": 596
} | module LowParse.Spec.Combinators
include LowParse.Spec.Base
module Seq = FStar.Seq
module U8 = FStar.UInt8
module U32 = FStar.UInt32
module T = FStar.Tactics
#reset-options "--using_facts_from '* -FStar.Tactis -FStar.Reflection'"
let and_then #k #t p #k' #t' p' =
let f : bare_parser t' = and_then_bare p p' in
a... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Base.fsti.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Tactics.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.S... | {
"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:
LowParse.Spec.Base.serializer p1
{ Mkparser_kind'?.parser_kind_subkind k1 ==
FStar.Pervasives.Native.Some LowParse.Spec.Base.ParserStrong } ->
s2: LowParse.Spec.Base.serializer p2 ->
x: (t1 * t2) ->
y: t2 ->
i': Prims.nat ->
s': LowParse.Bytes.bytes
-> FStar.Pervas... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"LowParse.Spec.Base.parser_subkind",
"LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_subkind",
"FStar.Pervasives.Native.Some",
"LowParse.Spec.B... | [] | true | false | true | false | false | let serialize_nondep_then_upd_right_chain
(#k1: parser_kind)
(#t1: Type)
(#p1: parser k1 t1)
(s1: serializer p1 {k1.parser_kind_subkind == Some ParserStrong})
(#k2: parser_kind)
(#t2: Type)
(#p2: parser k2 t2)
(s2: serializer p2)
(x: t1 * t2)
(y: t2)
(i'... | serialize_nondep_then_upd_right s1 s2 x y;
let s = serialize (serialize_nondep_then s1 s2) x in
let s2' = serialize s2 (snd x) in
let l2 = Seq.length s - Seq.length s2' in
Seq.lemma_split s l2;
Seq.lemma_append_inj (Seq.slice s 0 l2) (Seq.slice s l2 (Seq.length s)) (serialize s1 (fst x)) s2';
seq_upd_seq_right_to_left ... | false |
Steel.ST.CancellableSpinLock.fst | Steel.ST.CancellableSpinLock.lock_inv_pred | val lock_inv_pred: r: ref bool -> v: vprop -> bool -> vprop | val lock_inv_pred: r: ref bool -> v: vprop -> bool -> vprop | let lock_inv_pred (r:ref bool) (v:vprop) : bool -> vprop =
fun b -> pts_to r full_perm b `star` (if b then v else emp) | {
"file_name": "lib/steel/Steel.ST.CancellableSpinLock.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 61,
"end_line": 31,
"start_col": 0,
"start_line": 30
} | (*
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": [
"Steel.ST.Util.fsti.checked",
"Steel.ST.SpinLock.fsti.checked",
"Steel.ST.Reference.fsti.checked",
"Steel.ST.Effect.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fst... | [
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": false,
"full_module": "Steel.ST.SpinLock",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.ST.Reference",
"short_module": null
},
{
"abbrev": false,
"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 | r: Steel.ST.Reference.ref Prims.bool -> v: Steel.Effect.Common.vprop -> _: Prims.bool
-> Steel.Effect.Common.vprop | Prims.Tot | [
"total"
] | [] | [
"Steel.ST.Reference.ref",
"Prims.bool",
"Steel.Effect.Common.vprop",
"Steel.Effect.Common.star",
"Steel.ST.Reference.pts_to",
"Steel.FractionalPermission.full_perm",
"Steel.Effect.Common.emp"
] | [] | false | false | false | true | false | let lock_inv_pred (r: ref bool) (v: vprop) : bool -> vprop =
| fun b -> (pts_to r full_perm b) `star` (if b then v else emp) | false |
Test.Vectors.Curve25519.fst | Test.Vectors.Curve25519.vectors | val vectors:(b: B.buffer vector {B.length b = 7 /\ B.recallable b}) | val vectors:(b: B.buffer vector {B.length b = 7 /\ B.recallable b}) | let vectors: (b: B.buffer vector { B.length b = 7 /\ B.recallable b }) =
[@inline_let] let l = [
Vector result0 result0_len public0 public0_len private_0 private_0_len valid0;
Vector result1 result1_len public1 public1_len private_1 private_1_len valid1;
Vector result2 result2_len public2 public2_len pri... | {
"file_name": "providers/test/vectors/Test.Vectors.Curve25519.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 38,
"end_line": 211,
"start_col": 0,
"start_line": 200
} | module Test.Vectors.Curve25519
module B = LowStar.Buffer
#set-options "--max_fuel 0 --max_ifuel 0"
let private_0: (b: B.buffer UInt8.t { B.length b = 32 /\ B.recallable b }) =
[@inline_let] let l = [ 0x77uy; 0x07uy; 0x6duy; 0x0auy; 0x73uy; 0x18uy; 0xa5uy; 0x7duy; 0x3cuy; 0x16uy; 0xc1uy; 0x72uy; 0x51uy; 0xb2uy; 0x6... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_fil... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "Test.Vectors",
"short_module": null
},
{
"abbrev": false,
"full_module": "Test.Vectors",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"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 | b:
LowStar.Buffer.buffer Test.Vectors.Curve25519.vector
{LowStar.Monotonic.Buffer.length b = 7 /\ LowStar.Monotonic.Buffer.recallable b} | Prims.Tot | [
"total"
] | [] | [
"LowStar.Buffer.gcmalloc_of_list",
"Test.Vectors.Curve25519.vector",
"FStar.Monotonic.HyperHeap.root",
"LowStar.Monotonic.Buffer.mbuffer",
"LowStar.Buffer.trivial_preorder",
"Prims.l_and",
"Prims.eq2",
"Prims.nat",
"LowStar.Monotonic.Buffer.length",
"FStar.Pervasives.normalize_term",
"FStar.List... | [] | false | false | false | false | false | let vectors:(b: B.buffer vector {B.length b = 7 /\ B.recallable b}) =
| [@@ inline_let ]let l =
[
Vector result0 result0_len public0 public0_len private_0 private_0_len valid0;
Vector result1 result1_len public1 public1_len private_1 private_1_len valid1;
Vector result2 result2_len public2 public2_len private_2 private_2_len valid2;
Vector result3 result3_len public3 publ... | false |
Steel.ST.CancellableSpinLock.fst | Steel.ST.CancellableSpinLock.can_release | val can_release (#v:vprop) (c:cancellable_lock v) : vprop | val can_release (#v:vprop) (c:cancellable_lock v) : vprop | let can_release #v c = pts_to c.lref full_perm true | {
"file_name": "lib/steel/Steel.ST.CancellableSpinLock.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 51,
"end_line": 49,
"start_col": 0,
"start_line": 49
} | (*
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": [
"Steel.ST.Util.fsti.checked",
"Steel.ST.SpinLock.fsti.checked",
"Steel.ST.Reference.fsti.checked",
"Steel.ST.Effect.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fst... | [
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": false,
"full_module": "Steel.ST.SpinLock",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.ST.Reference",
"short_module": null
},
{
"abbrev": false,
"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 | c: Steel.ST.CancellableSpinLock.cancellable_lock v -> Steel.Effect.Common.vprop | Prims.Tot | [
"total"
] | [] | [
"Steel.Effect.Common.vprop",
"Steel.ST.CancellableSpinLock.cancellable_lock",
"Steel.ST.Reference.pts_to",
"Prims.bool",
"Steel.ST.CancellableSpinLock.__proj__Mkcancellable_lock__item__lref",
"Steel.FractionalPermission.full_perm"
] | [] | false | false | false | false | false | let can_release #v c =
| pts_to c.lref full_perm true | false |
Test.Vectors.Curve25519.fst | Test.Vectors.Curve25519.private_6 | val private_6:(b: B.buffer UInt8.t {B.length b = 32 /\ B.recallable b}) | val private_6:(b: B.buffer UInt8.t {B.length b = 32 /\ B.recallable b}) | let private_6: (b: B.buffer UInt8.t { B.length b = 32 /\ B.recallable b }) =
[@inline_let] let l = [ 0x02uy; 0x04uy; 0x06uy; 0x08uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0... | {
"file_name": "providers/test/vectors/Test.Vectors.Curve25519.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 38,
"end_line": 166,
"start_col": 0,
"start_line": 163
} | module Test.Vectors.Curve25519
module B = LowStar.Buffer
#set-options "--max_fuel 0 --max_ifuel 0"
let private_0: (b: B.buffer UInt8.t { B.length b = 32 /\ B.recallable b }) =
[@inline_let] let l = [ 0x77uy; 0x07uy; 0x6duy; 0x0auy; 0x73uy; 0x18uy; 0xa5uy; 0x7duy; 0x3cuy; 0x16uy; 0xc1uy; 0x72uy; 0x51uy; 0xb2uy; 0x6... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.HyperStack.fst.checked"
],
"interface_file": false,
"source_fil... | [
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": false,
"full_module": "Test.Vectors",
"short_module": null
},
{
"abbrev": false,
"full_module": "Test.Vectors",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"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 | b:
LowStar.Buffer.buffer FStar.UInt8.t
{LowStar.Monotonic.Buffer.length b = 32 /\ LowStar.Monotonic.Buffer.recallable b} | Prims.Tot | [
"total"
] | [] | [
"LowStar.Buffer.gcmalloc_of_list",
"FStar.UInt8.t",
"FStar.Monotonic.HyperHeap.root",
"LowStar.Monotonic.Buffer.mbuffer",
"LowStar.Buffer.trivial_preorder",
"Prims.l_and",
"Prims.eq2",
"Prims.nat",
"LowStar.Monotonic.Buffer.length",
"FStar.Pervasives.normalize_term",
"FStar.List.Tot.Base.length"... | [] | false | false | false | false | false | let private_6:(b: B.buffer UInt8.t {B.length b = 32 /\ B.recallable b}) =
| [@@ inline_let ]let l =
[
0x02uy; 0x04uy; 0x06uy; 0x08uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy;
0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy;
0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy; 0x00uy
]
in
assert_norm (List.... | false |
Steel.ST.Array.fst | Steel.ST.Array.pts_to_range_upd | val pts_to_range_upd
(#elt: Type0)
(#s: Ghost.erased (Seq.seq elt))
(a: array elt)
(i: Ghost.erased nat)
(m: US.t)
(j: Ghost.erased nat)
(x: elt)
: ST (Ghost.erased (Seq.seq elt))
(pts_to_range a i j full_perm s)
(fun s' -> pts_to_range a i j full_perm s')
(i <= US.v m /\ US.v m < j)
(fun ... | val pts_to_range_upd
(#elt: Type0)
(#s: Ghost.erased (Seq.seq elt))
(a: array elt)
(i: Ghost.erased nat)
(m: US.t)
(j: Ghost.erased nat)
(x: elt)
: ST (Ghost.erased (Seq.seq elt))
(pts_to_range a i j full_perm s)
(fun s' -> pts_to_range a i j full_perm s')
(i <= US.v m /\ US.v m < j)
(fun ... | let pts_to_range_upd
#elt #s a i m j x
= length_fits a;
pts_to_range_prop a i j full_perm s;
pts_to_range_split a i (US.v m) j;
let s1 = elim_exists () in
let s2 = elim_exists () in
elim_pure _;
let ga' = pts_to_range_elim' a (US.v m) j full_perm s2 in
let a' = array_slice_impl a m j () in
vpattern_re... | {
"file_name": "lib/steel/Steel.ST.Array.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 11,
"end_line": 723,
"start_col": 0,
"start_line": 705
} | (*
Copyright 2020, 2021, 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law ... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.Reference.fsti.checked",
"Steel.ST.Loops.fsti.checked",
"Steel.ST.HigherArray.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.SizeT.fsti.checked",
"FStar.Seq.fst.che... | [
{
"abbrev": true,
"full_module": "Steel.ST.Reference",
"short_module": "R"
},
{
"abbrev": true,
"full_module": "Steel.ST.HigherArray",
"short_module": "H"
},
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "US"
},
{
"abbrev": false,
"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: Steel.ST.Array.array elt ->
i: FStar.Ghost.erased Prims.nat ->
m: FStar.SizeT.t ->
j: FStar.Ghost.erased Prims.nat ->
x: elt
-> Steel.ST.Effect.ST (FStar.Ghost.erased (FStar.Seq.Base.seq elt)) | Steel.ST.Effect.ST | [] | [] | [
"FStar.Ghost.erased",
"FStar.Seq.Base.seq",
"Steel.ST.Array.array",
"Prims.nat",
"FStar.SizeT.t",
"Steel.ST.Util.return",
"FStar.Ghost.hide",
"FStar.Set.set",
"Steel.Memory.iname",
"FStar.Set.empty",
"Steel.ST.Array.pts_to_range",
"FStar.Ghost.reveal",
"Steel.FractionalPermission.full_perm",... | [] | false | true | false | false | false | let pts_to_range_upd #elt #s a i m j x =
| length_fits a;
pts_to_range_prop a i j full_perm s;
pts_to_range_split a i (US.v m) j;
let s1 = elim_exists () in
let s2 = elim_exists () in
elim_pure _;
let ga' = pts_to_range_elim' a (US.v m) j full_perm s2 in
let a' = array_slice_impl a m j () in
vpattern_rewrite #_ #(array elt) #ga' (fun ga' -> pts_to ga' _ _) a';
... | false |
LowParse.Spec.FLData.fst | LowParse.Spec.FLData.parse_fldata_strong_pred | val parse_fldata_strong_pred
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(sz: nat)
(x: t)
: GTot Type0 | val parse_fldata_strong_pred
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(sz: nat)
(x: t)
: GTot Type0 | let parse_fldata_strong_pred
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(sz: nat)
(x: t)
: GTot Type0
= Seq.length (serialize s x) == sz | {
"file_name": "src/lowparse/LowParse.Spec.FLData.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 34,
"end_line": 112,
"start_col": 0,
"start_line": 104
} | (* Parse data of some explicitly fixed length *)
module LowParse.Spec.FLData
include LowParse.Spec.Combinators
module Seq = FStar.Seq
module Classical = FStar.Classical
inline_for_extraction
val parse_fldata'
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
: Tot (bare_parser t)
let parse_fldata' #k #... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.S... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators",
"short_module": null
},
{
"abbrev": false,
... | {
"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: LowParse.Spec.Base.serializer p -> sz: Prims.nat -> x: t -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"Prims.nat",
"Prims.eq2",
"FStar.Seq.Base.length",
"LowParse.Bytes.byte",
"LowParse.Spec.Base.serialize"
] | [] | false | false | false | false | true | let parse_fldata_strong_pred
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(sz: nat)
(x: t)
: GTot Type0 =
| Seq.length (serialize s x) == sz | false |
Steel.ST.CancellableSpinLock.fst | Steel.ST.CancellableSpinLock.lock_inv | val lock_inv (r: ref bool) (v: vprop) : vprop | val lock_inv (r: ref bool) (v: vprop) : vprop | let lock_inv (r:ref bool) (v:vprop) : vprop = exists_ (lock_inv_pred r v) | {
"file_name": "lib/steel/Steel.ST.CancellableSpinLock.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 73,
"end_line": 34,
"start_col": 0,
"start_line": 34
} | (*
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": [
"Steel.ST.Util.fsti.checked",
"Steel.ST.SpinLock.fsti.checked",
"Steel.ST.Reference.fsti.checked",
"Steel.ST.Effect.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fst... | [
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": false,
"full_module": "Steel.ST.SpinLock",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.ST.Reference",
"short_module": null
},
{
"abbrev": false,
"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 | r: Steel.ST.Reference.ref Prims.bool -> v: Steel.Effect.Common.vprop -> Steel.Effect.Common.vprop | Prims.Tot | [
"total"
] | [] | [
"Steel.ST.Reference.ref",
"Prims.bool",
"Steel.Effect.Common.vprop",
"Steel.ST.Util.exists_",
"Steel.ST.CancellableSpinLock.lock_inv_pred"
] | [] | false | false | false | true | false | let lock_inv (r: ref bool) (v: vprop) : vprop =
| exists_ (lock_inv_pred r v) | false |
LowParse.Spec.FLData.fst | LowParse.Spec.FLData.serialize_fldata_strong' | val serialize_fldata_strong'
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(sz: nat)
: Tot (bare_serializer (parse_fldata_strong_t s sz)) | val serialize_fldata_strong'
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(sz: nat)
: Tot (bare_serializer (parse_fldata_strong_t s sz)) | let serialize_fldata_strong'
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(sz: nat)
: Tot (bare_serializer (parse_fldata_strong_t s sz))
= (fun (x: parse_fldata_strong_t s sz) ->
s x) | {
"file_name": "src/lowparse/LowParse.Spec.FLData.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 6,
"end_line": 159,
"start_col": 0,
"start_line": 151
} | (* Parse data of some explicitly fixed length *)
module LowParse.Spec.FLData
include LowParse.Spec.Combinators
module Seq = FStar.Seq
module Classical = FStar.Classical
inline_for_extraction
val parse_fldata'
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
: Tot (bare_parser t)
let parse_fldata' #k #... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.S... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators",
"short_module": null
},
{
"abbrev": false,
... | {
"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: LowParse.Spec.Base.serializer p -> sz: Prims.nat
-> LowParse.Spec.Base.bare_serializer (LowParse.Spec.FLData.parse_fldata_strong_t s sz) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"Prims.nat",
"LowParse.Spec.FLData.parse_fldata_strong_t",
"LowParse.Bytes.bytes",
"LowParse.Spec.Base.bare_serializer"
] | [] | false | false | false | false | false | let serialize_fldata_strong'
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(sz: nat)
: Tot (bare_serializer (parse_fldata_strong_t s sz)) =
| (fun (x: parse_fldata_strong_t s sz) -> s x) | false |
Spec.P256.Test.fst | Spec.P256.Test.print_result | val print_result (b: bool) : FStar.All.ML unit | val print_result (b: bool) : FStar.All.ML unit | let print_result (b:bool) : FStar.All.ML unit =
if b then IO.print_string "\nSuccess!\n" else IO.print_string "\nFailure!\n" | {
"file_name": "specs/tests/Spec.P256.Test.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 78,
"end_line": 108,
"start_col": 0,
"start_line": 107
} | module Spec.P256.Test
open Lib.IntTypes
open Lib.Sequence
open Lib.Meta
open Spec.P256
open Spec.ECDSA.Test.Vectors
open Spec.Hash.Definitions
module PS = Lib.PrintSequence
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
let test_pk_compressed (a:hash_alg_ecdsa) (inp:vec_SigVer) : FStar.All.ML bool =
let { msg; ... | {
"checked_file": "/",
"dependencies": [
"Spec.P256.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.ECDSA.Test.Vectors.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.PrintSequence.fsti.checked",
"Lib.Meta.fst.checked",
"Lib.IntTypes.fsti.checked",
"... | [
{
"abbrev": true,
"full_module": "Lib.PrintSequence",
"short_module": "PS"
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.ECDSA.Test.Vectors",
"short_module": null
},
{
"abbrev": false,... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | b: Prims.bool -> FStar.All.ML Prims.unit | FStar.All.ML | [
"ml"
] | [] | [
"Prims.bool",
"FStar.IO.print_string",
"Prims.unit"
] | [] | false | true | false | false | false | let print_result (b: bool) : FStar.All.ML unit =
| if b then IO.print_string "\nSuccess!\n" else IO.print_string "\nFailure!\n" | false |
Lib.Meta.fst | Lib.Meta.int_of_hex | val int_of_hex: c:hex_digit -> int | val int_of_hex: c:hex_digit -> int | let int_of_hex = function
| '0' -> 0
| '1' -> 1
| '2' -> 2
| '3' -> 3
| '4' -> 4
| '5' -> 5
| '6' -> 6
| '7' -> 7
| '8' -> 8
| '9' -> 9
| 'a' | 'A' -> 10
| 'b' | 'B' -> 11
| 'c' | 'C' -> 12
| 'd' | 'D' -> 13
| 'e' | 'E' -> 14
| 'f' | 'F' -> 15 | {
"file_name": "lib/Lib.Meta.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 19,
"end_line": 51,
"start_col": 0,
"start_line": 35
} | module Lib.Meta
open Lib.IntTypes
/// Helpers used in tests and tactics (see e.g. Test.LowStarize)
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 50"
val is_hex_digit: Char.char -> bool
let is_hex_digit = function
| '0'
| '1'
| '2'
| '3'
| '4'
| '5'
| '6'
| '7'
| '8'
| '9'
| 'a' | 'A'
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Char.fsti.chec... | [
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
... | {
"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 | c: Lib.Meta.hex_digit -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"Lib.Meta.hex_digit",
"Prims.int"
] | [] | false | false | false | true | false | let int_of_hex =
| function
| '0' -> 0
| '1' -> 1
| '2' -> 2
| '3' -> 3
| '4' -> 4
| '5' -> 5
| '6' -> 6
| '7' -> 7
| '8' -> 8
| '9' -> 9
| 'a' | 'A' -> 10
| 'b' | 'B' -> 11
| 'c' | 'C' -> 12
| 'd' | 'D' -> 13
| 'e' | 'E' -> 14
| 'f' | 'F' -> 15 | false |
Spec.P256.Test.fst | Spec.P256.Test.test | val test: Prims.unit -> FStar.All.ML bool | val test: Prims.unit -> FStar.All.ML bool | let test () : FStar.All.ML bool =
IO.print_string "\n[P-256 ECDSA-verify with SHA2-256]\n";
let res1 = List.for_all (test_sigver (Hash SHA2_256)) sigver_vectors_sha2_256 in
print_result res1;
IO.print_string "\n[P-256 ECDSA-sign with SHA2-256]\n";
let res2 = List.for_all (test_siggen (Hash SHA2_256)) siggen_... | {
"file_name": "specs/tests/Spec.P256.Test.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 60,
"end_line": 143,
"start_col": 0,
"start_line": 111
} | module Spec.P256.Test
open Lib.IntTypes
open Lib.Sequence
open Lib.Meta
open Spec.P256
open Spec.ECDSA.Test.Vectors
open Spec.Hash.Definitions
module PS = Lib.PrintSequence
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
let test_pk_compressed (a:hash_alg_ecdsa) (inp:vec_SigVer) : FStar.All.ML bool =
let { msg; ... | {
"checked_file": "/",
"dependencies": [
"Spec.P256.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.ECDSA.Test.Vectors.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.PrintSequence.fsti.checked",
"Lib.Meta.fst.checked",
"Lib.IntTypes.fsti.checked",
"... | [
{
"abbrev": true,
"full_module": "Lib.PrintSequence",
"short_module": "PS"
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.ECDSA.Test.Vectors",
"short_module": null
},
{
"abbrev": false,... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.All.ML Prims.bool | FStar.All.ML | [
"ml"
] | [] | [
"Prims.unit",
"Prims.bool",
"FStar.IO.print_string",
"Prims.op_AmpAmp",
"Spec.P256.Test.print_result",
"FStar.List.for_all",
"Spec.ECDSA.Test.Vectors.vec_SigVer",
"Spec.P256.Test.test_pk_compressed",
"Spec.P256.Hash",
"Spec.Hash.Definitions.SHA2_256",
"Spec.ECDSA.Test.Vectors.sigver_vectors_sha2... | [] | false | true | false | false | false | let test () : FStar.All.ML bool =
| IO.print_string "\n[P-256 ECDSA-verify with SHA2-256]\n";
let res1 = List.for_all (test_sigver (Hash SHA2_256)) sigver_vectors_sha2_256 in
print_result res1;
IO.print_string "\n[P-256 ECDSA-sign with SHA2-256]\n";
let res2 = List.for_all (test_siggen (Hash SHA2_256)) siggen_vectors_sha2_256 in
print_result res2;
IO.pri... | false |
Lib.Meta.fst | Lib.Meta.from_hex | val from_hex (s: hex_string) : Seq.lseq uint8 (String.strlen s / 2) | val from_hex (s: hex_string) : Seq.lseq uint8 (String.strlen s / 2) | let from_hex (s:hex_string) : Seq.lseq uint8 (String.strlen s / 2) =
Seq.seq_of_list (as_uint8s [] (String.list_of_string s)) | {
"file_name": "lib/Lib.Meta.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 58,
"end_line": 75,
"start_col": 0,
"start_line": 74
} | module Lib.Meta
open Lib.IntTypes
/// Helpers used in tests and tactics (see e.g. Test.LowStarize)
#set-options "--max_fuel 0 --max_ifuel 0 --z3rlimit 50"
val is_hex_digit: Char.char -> bool
let is_hex_digit = function
| '0'
| '1'
| '2'
| '3'
| '4'
| '5'
| '6'
| '7'
| '8'
| '9'
| 'a' | 'A'
... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.String.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.List.Tot.fst.checked",
"FStar.List.fst.checked",
"FStar.Char.fsti.chec... | [
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 2,
"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 | s: Lib.Meta.hex_string -> FStar.Seq.Properties.lseq Lib.IntTypes.uint8 (FStar.String.strlen s / 2) | Prims.Tot | [
"total"
] | [] | [
"Lib.Meta.hex_string",
"FStar.Seq.Base.seq_of_list",
"Lib.IntTypes.uint8",
"Lib.Meta.as_uint8s",
"Prims.Nil",
"FStar.String.list_of_string",
"FStar.Seq.Properties.lseq",
"Prims.op_Division",
"FStar.String.strlen"
] | [] | false | false | false | false | false | let from_hex (s: hex_string) : Seq.lseq uint8 (String.strlen s / 2) =
| Seq.seq_of_list (as_uint8s [] (String.list_of_string s)) | false |
LowParse.Spec.FLData.fst | LowParse.Spec.FLData.parse_fldata' | val parse_fldata'
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
: Tot (bare_parser t) | val parse_fldata'
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
: Tot (bare_parser t) | let parse_fldata' #k #t p sz =
let () = () in // Necessary to pass arity checking
fun (s: bytes) ->
if Seq.length s < sz
then None
else
match parse p (Seq.slice s 0 sz) with
| Some (v, consumed) ->
if (consumed <: nat) = (sz <: nat)
then Some (v, (sz <: consumed_length s))
else None
... | {
"file_name": "src/lowparse/LowParse.Spec.FLData.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 15,
"end_line": 28,
"start_col": 0,
"start_line": 17
} | (* Parse data of some explicitly fixed length *)
module LowParse.Spec.FLData
include LowParse.Spec.Combinators
module Seq = FStar.Seq
module Classical = FStar.Classical
inline_for_extraction
val parse_fldata'
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
: Tot (bare_parser t) | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.S... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators",
"short_module": null
},
{
"abbrev": false,
... | {
"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: LowParse.Spec.Base.parser k t -> sz: Prims.nat -> LowParse.Spec.Base.bare_parser t | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"Prims.nat",
"LowParse.Bytes.bytes",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"LowParse.Bytes.byte",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.tuple2",
"LowParse.Spec.Base.consumed_length",
"Prims.bool",
"LowPar... | [] | false | false | false | false | false | let parse_fldata' #k #t p sz =
| let () = () in
fun (s: bytes) ->
if Seq.length s < sz
then None
else
match parse p (Seq.slice s 0 sz) with
| Some (v, consumed) ->
if (consumed <: nat) = (sz <: nat) then Some (v, (sz <: consumed_length s)) else None
| _ -> None | false |
LowParse.Spec.FLData.fst | LowParse.Spec.FLData.parse_fldata_injective | val parse_fldata_injective (#k: parser_kind) (#t: Type) (p: parser k t) (sz: nat)
: Lemma (ensures (injective (parse_fldata' p sz))) | val parse_fldata_injective (#k: parser_kind) (#t: Type) (p: parser k t) (sz: nat)
: Lemma (ensures (injective (parse_fldata' p sz))) | let parse_fldata_injective
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
: Lemma
(ensures (injective (parse_fldata' p sz)))
= parser_kind_prop_equiv k p;
let f
(b1 b2: bytes)
: Lemma
(requires (injective_precond (parse_fldata' p sz) b1 b2))
(ensures (injective_postcond (parse_fldata' ... | {
"file_name": "src/lowparse/LowParse.Spec.FLData.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 67,
"end_line": 45,
"start_col": 0,
"start_line": 30
} | (* Parse data of some explicitly fixed length *)
module LowParse.Spec.FLData
include LowParse.Spec.Combinators
module Seq = FStar.Seq
module Classical = FStar.Classical
inline_for_extraction
val parse_fldata'
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
: Tot (bare_parser t)
let parse_fldata' #k #... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.S... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators",
"short_module": null
},
{
"abbrev": false,
... | {
"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: LowParse.Spec.Base.parser k t -> sz: Prims.nat
-> FStar.Pervasives.Lemma
(ensures LowParse.Spec.Base.injective (LowParse.Spec.FLData.parse_fldata' p sz)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"Prims.nat",
"FStar.Classical.forall_intro_2",
"LowParse.Bytes.bytes",
"Prims.l_imp",
"LowParse.Spec.Base.injective_precond",
"LowParse.Spec.FLData.parse_fldata'",
"LowParse.Spec.Base.injective_postcond",
"FStar.Classical.move_requires... | [] | false | false | true | false | false | let parse_fldata_injective (#k: parser_kind) (#t: Type) (p: parser k t) (sz: nat)
: Lemma (ensures (injective (parse_fldata' p sz))) =
| parser_kind_prop_equiv k p;
let f (b1 b2: bytes)
: Lemma (requires (injective_precond (parse_fldata' p sz) b1 b2))
(ensures (injective_postcond (parse_fldata' p sz) b1 b2)) =
assert (injective_precond p (Seq.slice b1 0 sz) (Seq.slice b2 0 sz))
in
Classical.forall_intro_2 (fun b -> Classical.move_requires (f... | false |
LowParse.Spec.FLData.fst | LowParse.Spec.FLData.parse_fldata_kind | val parse_fldata_kind (sz: nat) (k: parser_kind) : Tot parser_kind | val parse_fldata_kind (sz: nat) (k: parser_kind) : Tot parser_kind | let parse_fldata_kind
(sz: nat)
(k: parser_kind)
: Tot parser_kind
= strong_parser_kind sz sz (
match k.parser_kind_metadata with
| Some ParserKindMetadataFail -> Some ParserKindMetadataFail
| _ -> None
) | {
"file_name": "src/lowparse/LowParse.Spec.FLData.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 3,
"end_line": 57,
"start_col": 0,
"start_line": 49
} | (* Parse data of some explicitly fixed length *)
module LowParse.Spec.FLData
include LowParse.Spec.Combinators
module Seq = FStar.Seq
module Classical = FStar.Classical
inline_for_extraction
val parse_fldata'
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
: Tot (bare_parser t)
let parse_fldata' #k #... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.S... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators",
"short_module": null
},
{
"abbrev": false,
... | {
"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 | sz: Prims.nat -> k: LowParse.Spec.Base.parser_kind -> LowParse.Spec.Base.parser_kind | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.strong_parser_kind",
"LowParse.Spec.Base.__proj__Mkparser_kind'__item__parser_kind_metadata",
"FStar.Pervasives.Native.Some",
"LowParse.Spec.Base.parser_kind_metadata_some",
"LowParse.Spec.Base.ParserKindMetadataFail",
"FStar.Pervasive... | [] | false | false | false | true | false | let parse_fldata_kind (sz: nat) (k: parser_kind) : Tot parser_kind =
| strong_parser_kind sz
sz
(match k.parser_kind_metadata with
| Some ParserKindMetadataFail -> Some ParserKindMetadataFail
| _ -> None) | false |
LowParse.Spec.FLData.fst | LowParse.Spec.FLData.serialize_fldata_strong | val serialize_fldata_strong
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(sz: nat)
: Tot (serializer (parse_fldata_strong s sz)) | val serialize_fldata_strong
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(sz: nat)
: Tot (serializer (parse_fldata_strong s sz)) | let serialize_fldata_strong
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(sz: nat)
: Tot (serializer (parse_fldata_strong s sz))
= serialize_fldata_strong' s sz | {
"file_name": "src/lowparse/LowParse.Spec.FLData.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 31,
"end_line": 168,
"start_col": 0,
"start_line": 161
} | (* Parse data of some explicitly fixed length *)
module LowParse.Spec.FLData
include LowParse.Spec.Combinators
module Seq = FStar.Seq
module Classical = FStar.Classical
inline_for_extraction
val parse_fldata'
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
: Tot (bare_parser t)
let parse_fldata' #k #... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.S... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators",
"short_module": null
},
{
"abbrev": false,
... | {
"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: LowParse.Spec.Base.serializer p -> sz: Prims.nat
-> LowParse.Spec.Base.serializer (LowParse.Spec.FLData.parse_fldata_strong s sz) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"Prims.nat",
"LowParse.Spec.FLData.serialize_fldata_strong'",
"LowParse.Spec.FLData.parse_fldata_kind",
"LowParse.Spec.FLData.parse_fldata_strong_t",
"LowParse.Spec.FLData.parse_fldata_strong"
] | [] | false | false | false | false | false | let serialize_fldata_strong
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(sz: nat)
: Tot (serializer (parse_fldata_strong s sz)) =
| serialize_fldata_strong' s sz | false |
LowParse.Spec.FLData.fst | LowParse.Spec.FLData.parse_fldata | val parse_fldata
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
: Tot (parser (parse_fldata_kind sz k) t) | val parse_fldata
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
: Tot (parser (parse_fldata_kind sz k) t) | let parse_fldata #b #t p sz =
parse_fldata_injective p sz;
parser_kind_prop_equiv b p;
parser_kind_prop_equiv (parse_fldata_kind sz b) (parse_fldata' p sz);
parse_fldata' p sz | {
"file_name": "src/lowparse/LowParse.Spec.FLData.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 20,
"end_line": 71,
"start_col": 0,
"start_line": 67
} | (* Parse data of some explicitly fixed length *)
module LowParse.Spec.FLData
include LowParse.Spec.Combinators
module Seq = FStar.Seq
module Classical = FStar.Classical
inline_for_extraction
val parse_fldata'
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
: Tot (bare_parser t)
let parse_fldata' #k #... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.S... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators",
"short_module": null
},
{
"abbrev": false,
... | {
"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: LowParse.Spec.Base.parser k t -> sz: Prims.nat
-> LowParse.Spec.Base.parser (LowParse.Spec.FLData.parse_fldata_kind sz k) t | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"Prims.nat",
"LowParse.Spec.FLData.parse_fldata'",
"Prims.unit",
"LowParse.Spec.Base.parser_kind_prop_equiv",
"LowParse.Spec.FLData.parse_fldata_kind",
"LowParse.Spec.FLData.parse_fldata_injective"
] | [] | false | false | false | false | false | let parse_fldata #b #t p sz =
| parse_fldata_injective p sz;
parser_kind_prop_equiv b p;
parser_kind_prop_equiv (parse_fldata_kind sz b) (parse_fldata' p sz);
parse_fldata' p sz | false |
LowParse.Spec.FLData.fst | LowParse.Spec.FLData.parse_fldata_strong | val parse_fldata_strong (#k: parser_kind) (#t: Type) (#p: parser k t) (s: serializer p) (sz: nat)
: Tot (parser (parse_fldata_kind sz k) (parse_fldata_strong_t s sz)) | val parse_fldata_strong (#k: parser_kind) (#t: Type) (#p: parser k t) (s: serializer p) (sz: nat)
: Tot (parser (parse_fldata_kind sz k) (parse_fldata_strong_t s sz)) | let parse_fldata_strong
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(sz: nat)
: Tot (parser (parse_fldata_kind sz k) (parse_fldata_strong_t s sz))
= coerce_parser
(parse_fldata_strong_t s sz)
(parse_strengthen (parse_fldata p sz) (parse_fldata_strong_pred s sz) (parse_fldata_strong_cor... | {
"file_name": "src/lowparse/LowParse.Spec.FLData.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 107,
"end_line": 147,
"start_col": 0,
"start_line": 138
} | (* Parse data of some explicitly fixed length *)
module LowParse.Spec.FLData
include LowParse.Spec.Combinators
module Seq = FStar.Seq
module Classical = FStar.Classical
inline_for_extraction
val parse_fldata'
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
: Tot (bare_parser t)
let parse_fldata' #k #... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.S... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators",
"short_module": null
},
{
"abbrev": false,
... | {
"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: LowParse.Spec.Base.serializer p -> sz: Prims.nat
-> LowParse.Spec.Base.parser (LowParse.Spec.FLData.parse_fldata_kind sz k)
(LowParse.Spec.FLData.parse_fldata_strong_t s sz) | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"Prims.nat",
"LowParse.Spec.Base.coerce_parser",
"LowParse.Spec.FLData.parse_fldata_strong_t",
"LowParse.Spec.FLData.parse_fldata_kind",
"LowParse.Spec.FLData.parse_fldata_strong_pred",
"LowParse.Spec.Com... | [] | false | false | false | false | false | let parse_fldata_strong (#k: parser_kind) (#t: Type) (#p: parser k t) (s: serializer p) (sz: nat)
: Tot (parser (parse_fldata_kind sz k) (parse_fldata_strong_t s sz)) =
| coerce_parser (parse_fldata_strong_t s sz)
(parse_strengthen (parse_fldata p sz)
(parse_fldata_strong_pred s sz)
(parse_fldata_strong_correct s sz)) | false |
LowParse.Spec.FLData.fst | LowParse.Spec.FLData.parse_fldata_consumes_all_correct | val parse_fldata_consumes_all_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
(b: bytes)
: Lemma (requires (k.parser_kind_subkind == Some ParserConsumesAll))
(ensures (parse (parse_fldata p sz) b == parse (parse_fldata_consumes_all p sz) b)) | val parse_fldata_consumes_all_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
(b: bytes)
: Lemma (requires (k.parser_kind_subkind == Some ParserConsumesAll))
(ensures (parse (parse_fldata p sz) b == parse (parse_fldata_consumes_all p sz) b)) | let parse_fldata_consumes_all_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
(b: bytes)
: Lemma
(requires (k.parser_kind_subkind == Some ParserConsumesAll))
(ensures (parse (parse_fldata p sz) b == parse (parse_fldata_consumes_all p sz) b))
= parser_kind_prop_equiv k p | {
"file_name": "src/lowparse/LowParse.Spec.FLData.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 28,
"end_line": 102,
"start_col": 0,
"start_line": 93
} | (* Parse data of some explicitly fixed length *)
module LowParse.Spec.FLData
include LowParse.Spec.Combinators
module Seq = FStar.Seq
module Classical = FStar.Classical
inline_for_extraction
val parse_fldata'
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
: Tot (bare_parser t)
let parse_fldata' #k #... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.S... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators",
"short_module": null
},
{
"abbrev": false,
... | {
"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: LowParse.Spec.Base.parser k t -> sz: Prims.nat -> b: LowParse.Bytes.bytes
-> FStar.Pervasives.Lemma
(requires
Mkparser_kind'?.parser_kind_subkind k ==
FStar.Pervasives.Native.Some LowParse.Spec.Base.ParserConsumesAll)
(ensures
LowParse.Spec.Base.parse (LowParse.Spec.FLData.parse... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"Prims.nat",
"LowParse.Bytes.bytes",
"LowParse.Spec.Base.parser_kind_prop_equiv",
"Prims.unit",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"LowParse.Spec.Base.parser_subkind",
"LowParse.Spec.Base.__proj__Mkparser_kind'__item__parse... | [] | true | false | true | false | false | let parse_fldata_consumes_all_correct
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
(b: bytes)
: Lemma (requires (k.parser_kind_subkind == Some ParserConsumesAll))
(ensures (parse (parse_fldata p sz) b == parse (parse_fldata_consumes_all p sz) b)) =
| parser_kind_prop_equiv k p | false |
LowParse.Spec.FLData.fst | LowParse.Spec.FLData.parse_fldata_strong_correct | val parse_fldata_strong_correct
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(sz: nat)
(xbytes: bytes)
(consumed: consumed_length xbytes)
(x: t)
: Lemma (requires (parse (parse_fldata p sz) xbytes == Some (x, consumed)))
(ensures (parse_fldata... | val parse_fldata_strong_correct
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(sz: nat)
(xbytes: bytes)
(consumed: consumed_length xbytes)
(x: t)
: Lemma (requires (parse (parse_fldata p sz) xbytes == Some (x, consumed)))
(ensures (parse_fldata... | let parse_fldata_strong_correct
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(sz: nat)
(xbytes: bytes)
(consumed: consumed_length xbytes)
(x: t)
: Lemma
(requires (parse (parse_fldata p sz) xbytes == Some (x, consumed)))
(ensures (parse_fldata_strong_pred s sz x))
= serializer_cor... | {
"file_name": "src/lowparse/LowParse.Spec.FLData.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 41,
"end_line": 135,
"start_col": 0,
"start_line": 123
} | (* Parse data of some explicitly fixed length *)
module LowParse.Spec.FLData
include LowParse.Spec.Combinators
module Seq = FStar.Seq
module Classical = FStar.Classical
inline_for_extraction
val parse_fldata'
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
: Tot (bare_parser t)
let parse_fldata' #k #... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.S... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators",
"short_module": null
},
{
"abbrev": false,
... | {
"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: LowParse.Spec.Base.serializer p ->
sz: Prims.nat ->
xbytes: LowParse.Bytes.bytes ->
consumed: LowParse.Spec.Base.consumed_length xbytes ->
x: t
-> FStar.Pervasives.Lemma
(requires
LowParse.Spec.Base.parse (LowParse.Spec.FLData.parse_fldata p sz) xbytes ==
FStar.Pervasives... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"Prims.nat",
"LowParse.Bytes.bytes",
"LowParse.Spec.Base.consumed_length",
"LowParse.Spec.Base.serializer_correct_implies_complete",
"Prims.unit",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"FStar... | [] | true | false | true | false | false | let parse_fldata_strong_correct
(#k: parser_kind)
(#t: Type)
(#p: parser k t)
(s: serializer p)
(sz: nat)
(xbytes: bytes)
(consumed: consumed_length xbytes)
(x: t)
: Lemma (requires (parse (parse_fldata p sz) xbytes == Some (x, consumed)))
(ensures (parse_fldata... | serializer_correct_implies_complete p s | false |
LowParse.Spec.FLData.fst | LowParse.Spec.FLData.parse_fldata_consumes_all | val parse_fldata_consumes_all
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
: Pure (bare_parser t)
(requires (k.parser_kind_subkind == Some ParserConsumesAll))
(ensures (fun _ -> True)) | val parse_fldata_consumes_all
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
: Pure (bare_parser t)
(requires (k.parser_kind_subkind == Some ParserConsumesAll))
(ensures (fun _ -> True)) | let parse_fldata_consumes_all #k #t p sz =
let () = () in // Necessary to pass arity checking
fun (s: bytes) ->
if Seq.length s < sz
then None
else
match parse p (Seq.slice s 0 sz) with
| Some (v, _) ->
Some (v, (sz <: consumed_length s))
| _ -> None | {
"file_name": "src/lowparse/LowParse.Spec.FLData.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 15,
"end_line": 91,
"start_col": 0,
"start_line": 82
} | (* Parse data of some explicitly fixed length *)
module LowParse.Spec.FLData
include LowParse.Spec.Combinators
module Seq = FStar.Seq
module Classical = FStar.Classical
inline_for_extraction
val parse_fldata'
(#k: parser_kind)
(#t: Type)
(p: parser k t)
(sz: nat)
: Tot (bare_parser t)
let parse_fldata' #k #... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "LowParse.S... | [
{
"abbrev": true,
"full_module": "FStar.Classical",
"short_module": "Classical"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.Combinators",
"short_module": null
},
{
"abbrev": false,
... | {
"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: LowParse.Spec.Base.parser k t -> sz: Prims.nat -> Prims.Pure (LowParse.Spec.Base.bare_parser t) | Prims.Pure | [] | [] | [
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"Prims.nat",
"LowParse.Bytes.bytes",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"LowParse.Bytes.byte",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.tuple2",
"LowParse.Spec.Base.consumed_length",
"Prims.bool",
"LowPar... | [] | false | false | false | false | false | let parse_fldata_consumes_all #k #t p sz =
| let () = () in
fun (s: bytes) ->
if Seq.length s < sz
then None
else
match parse p (Seq.slice s 0 sz) with
| Some (v, _) -> Some (v, (sz <: consumed_length s))
| _ -> None | false |
Steel.ST.CancellableSpinLock.fst | Steel.ST.CancellableSpinLock.cancel | val cancel (#v:vprop) (c:cancellable_lock v)
: STT unit (can_release c) (fun _ -> emp) | val cancel (#v:vprop) (c:cancellable_lock v)
: STT unit (can_release c) (fun _ -> emp) | let cancel c = free c.lref | {
"file_name": "lib/steel/Steel.ST.CancellableSpinLock.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 26,
"end_line": 72,
"start_col": 0,
"start_line": 72
} | (*
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": [
"Steel.ST.Util.fsti.checked",
"Steel.ST.SpinLock.fsti.checked",
"Steel.ST.Reference.fsti.checked",
"Steel.ST.Effect.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fst... | [
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": false,
"full_module": "Steel.ST.SpinLock",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.ST.Reference",
"short_module": null
},
{
"abbrev": false,
"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 | c: Steel.ST.CancellableSpinLock.cancellable_lock v -> Steel.ST.Effect.STT Prims.unit | Steel.ST.Effect.STT | [] | [] | [
"Steel.Effect.Common.vprop",
"Steel.ST.CancellableSpinLock.cancellable_lock",
"Steel.ST.Reference.free",
"Prims.bool",
"FStar.Ghost.hide",
"Steel.ST.CancellableSpinLock.__proj__Mkcancellable_lock__item__lref",
"Prims.unit"
] | [] | false | true | false | false | false | let cancel c =
| free c.lref | false |
Spec.P256.Test.fst | Spec.P256.Test.test_sigver | val test_sigver (a: hash_alg_ecdsa) (inp: vec_SigVer) : FStar.All.ML bool | val test_sigver (a: hash_alg_ecdsa) (inp: vec_SigVer) : FStar.All.ML bool | let test_sigver (a:hash_alg_ecdsa) (inp:vec_SigVer) : FStar.All.ML bool =
let { msg; qx; qy; r; s; result } = inp in
let msg_len = String.strlen msg / 2 in
let pk_x_len = String.strlen qx / 2 in
let pk_y_len = String.strlen qy / 2 in
let sig_r_len = String.strlen r / 2 in
let sig_s_len = String.strlen s... | {
"file_name": "specs/tests/Spec.P256.Test.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 27,
"end_line": 63,
"start_col": 0,
"start_line": 41
} | module Spec.P256.Test
open Lib.IntTypes
open Lib.Sequence
open Lib.Meta
open Spec.P256
open Spec.ECDSA.Test.Vectors
open Spec.Hash.Definitions
module PS = Lib.PrintSequence
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
let test_pk_compressed (a:hash_alg_ecdsa) (inp:vec_SigVer) : FStar.All.ML bool =
let { msg; ... | {
"checked_file": "/",
"dependencies": [
"Spec.P256.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.ECDSA.Test.Vectors.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.PrintSequence.fsti.checked",
"Lib.Meta.fst.checked",
"Lib.IntTypes.fsti.checked",
"... | [
{
"abbrev": true,
"full_module": "Lib.PrintSequence",
"short_module": "PS"
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.ECDSA.Test.Vectors",
"short_module": null
},
{
"abbrev": false,... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.P256.hash_alg_ecdsa -> inp: Spec.ECDSA.Test.Vectors.vec_SigVer -> FStar.All.ML Prims.bool | FStar.All.ML | [
"ml"
] | [] | [
"Spec.P256.hash_alg_ecdsa",
"Spec.ECDSA.Test.Vectors.vec_SigVer",
"Lib.Meta.hex_string",
"Prims.bool",
"Prims.op_Negation",
"Prims.op_AmpAmp",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.max_size_t",
"Spec.P256.min_input_length",
"Prims.op_Equality",
"Prims.int",
"Spec.P256.ecdsa_verification_ag... | [] | false | true | false | false | false | let test_sigver (a: hash_alg_ecdsa) (inp: vec_SigVer) : FStar.All.ML bool =
| let { msg = msg ; qx = qx ; qy = qy ; r = r ; s = s ; result = result } = inp in
let msg_len = String.strlen msg / 2 in
let pk_x_len = String.strlen qx / 2 in
let pk_y_len = String.strlen qy / 2 in
let sig_r_len = String.strlen r / 2 in
let sig_s_len = String.strlen s / 2 in
let is_valid = result in
if
not (msg_len <... | false |
Spec.P256.Test.fst | Spec.P256.Test.test_pk_compressed | val test_pk_compressed (a: hash_alg_ecdsa) (inp: vec_SigVer) : FStar.All.ML bool | val test_pk_compressed (a: hash_alg_ecdsa) (inp: vec_SigVer) : FStar.All.ML bool | let test_pk_compressed (a:hash_alg_ecdsa) (inp:vec_SigVer) : FStar.All.ML bool =
let { msg; qx; qy; r; s; result } = inp in
let msg_len = String.strlen msg / 2 in
let pk_x_len = String.strlen qx / 2 in
let pk_y_len = String.strlen qy / 2 in
let sig_r_len = String.strlen r / 2 in
let sig_s_len = String.s... | {
"file_name": "specs/tests/Spec.P256.Test.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 19,
"end_line": 38,
"start_col": 0,
"start_line": 15
} | module Spec.P256.Test
open Lib.IntTypes
open Lib.Sequence
open Lib.Meta
open Spec.P256
open Spec.ECDSA.Test.Vectors
open Spec.Hash.Definitions
module PS = Lib.PrintSequence
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1" | {
"checked_file": "/",
"dependencies": [
"Spec.P256.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.ECDSA.Test.Vectors.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.PrintSequence.fsti.checked",
"Lib.Meta.fst.checked",
"Lib.IntTypes.fsti.checked",
"... | [
{
"abbrev": true,
"full_module": "Lib.PrintSequence",
"short_module": "PS"
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.ECDSA.Test.Vectors",
"short_module": null
},
{
"abbrev": false,... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.P256.hash_alg_ecdsa -> inp: Spec.ECDSA.Test.Vectors.vec_SigVer -> FStar.All.ML Prims.bool | FStar.All.ML | [
"ml"
] | [] | [
"Spec.P256.hash_alg_ecdsa",
"Spec.ECDSA.Test.Vectors.vec_SigVer",
"Lib.Meta.hex_string",
"Prims.bool",
"Prims.op_Negation",
"Prims.op_AmpAmp",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.max_size_t",
"Spec.P256.min_input_length",
"Prims.op_Equality",
"Prims.int",
"Lib.ByteSequence.lbytes",
"Li... | [] | false | true | false | false | false | let test_pk_compressed (a: hash_alg_ecdsa) (inp: vec_SigVer) : FStar.All.ML bool =
| let { msg = msg ; qx = qx ; qy = qy ; r = r ; s = s ; result = result } = inp in
let msg_len = String.strlen msg / 2 in
let pk_x_len = String.strlen qx / 2 in
let pk_y_len = String.strlen qy / 2 in
let sig_r_len = String.strlen r / 2 in
let sig_s_len = String.strlen s / 2 in
let is_valid = result in
if
not (msg_len <... | false |
Spec.P256.Test.fst | Spec.P256.Test.test_siggen | val test_siggen (a: hash_alg_ecdsa) (inp: vec_SigGen) : FStar.All.ML bool | val test_siggen (a: hash_alg_ecdsa) (inp: vec_SigGen) : FStar.All.ML bool | let test_siggen (a:hash_alg_ecdsa) (inp:vec_SigGen) : FStar.All.ML bool =
let { msg'; d; qx'; qy'; k; r'; s' } = inp in
let msg_len = String.strlen msg' / 2 in
let sk_len = String.strlen d / 2 in
let nonce_len = String.strlen k / 2 in
let pk_x_len = String.strlen qx' / 2 in
let pk_y_len = String.strl... | {
"file_name": "specs/tests/Spec.P256.Test.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 31,
"end_line": 104,
"start_col": 0,
"start_line": 66
} | module Spec.P256.Test
open Lib.IntTypes
open Lib.Sequence
open Lib.Meta
open Spec.P256
open Spec.ECDSA.Test.Vectors
open Spec.Hash.Definitions
module PS = Lib.PrintSequence
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
let test_pk_compressed (a:hash_alg_ecdsa) (inp:vec_SigVer) : FStar.All.ML bool =
let { msg; ... | {
"checked_file": "/",
"dependencies": [
"Spec.P256.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.ECDSA.Test.Vectors.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.PrintSequence.fsti.checked",
"Lib.Meta.fst.checked",
"Lib.IntTypes.fsti.checked",
"... | [
{
"abbrev": true,
"full_module": "Lib.PrintSequence",
"short_module": "PS"
},
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.ECDSA.Test.Vectors",
"short_module": null
},
{
"abbrev": false,... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.P256.hash_alg_ecdsa -> inp: Spec.ECDSA.Test.Vectors.vec_SigGen -> FStar.All.ML Prims.bool | FStar.All.ML | [
"ml"
] | [] | [
"Spec.P256.hash_alg_ecdsa",
"Spec.ECDSA.Test.Vectors.vec_SigGen",
"Lib.Meta.hex_string",
"Prims.op_Negation",
"Prims.op_AmpAmp",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.max_size_t",
"Spec.P256.min_input_length",
"Prims.op_Equality",
"Prims.int",
"Prims.bool",
"FStar.Pervasives.Native.uu___is... | [] | false | true | false | false | false | let test_siggen (a: hash_alg_ecdsa) (inp: vec_SigGen) : FStar.All.ML bool =
| let { msg' = msg' ; d = d ; qx' = qx' ; qy' = qy' ; k = k ; r' = r' ; s' = s' } = inp in
let msg_len = String.strlen msg' / 2 in
let sk_len = String.strlen d / 2 in
let nonce_len = String.strlen k / 2 in
let pk_x_len = String.strlen qx' / 2 in
let pk_y_len = String.strlen qy' / 2 in
let sig_r_len = String.strlen r' / 2... | false |
Hacl.Impl.Curve25519.Generic.fst | Hacl.Impl.Curve25519.Generic.ladder0_ | val ladder0_:
#s:field_spec
-> k:scalar
-> q:point s
-> p01_tmp1_swap:lbuffer (limb s) (8ul *! nlimb s +! 1ul)
-> tmp2:felem_wide2 s
-> Stack unit
(requires fun h0 ->
live h0 k /\ live h0 q /\ live h0 p01_tmp1_swap /\ live h0 tmp2 /\
LowStar.Monotonic.Buffer.all_disjoint [loc k; loc q; loc... | val ladder0_:
#s:field_spec
-> k:scalar
-> q:point s
-> p01_tmp1_swap:lbuffer (limb s) (8ul *! nlimb s +! 1ul)
-> tmp2:felem_wide2 s
-> Stack unit
(requires fun h0 ->
live h0 k /\ live h0 q /\ live h0 p01_tmp1_swap /\ live h0 tmp2 /\
LowStar.Monotonic.Buffer.all_disjoint [loc k; loc q; loc... | let ladder0_ #s k q p01_tmp1_swap tmp2 =
let p01_tmp1 = sub p01_tmp1_swap 0ul (8ul *! nlimb s) in
let nq : point s = sub p01_tmp1_swap 0ul (2ul *! nlimb s) in
let nq_p1 : point s = sub p01_tmp1_swap (2ul *! nlimb s) (2ul *! nlimb s) in
let swap:lbuffer uint64 1ul = sub p01_tmp1_swap (8ul *! nlimb s) 1ul in
a... | {
"file_name": "code/curve25519/Hacl.Impl.Curve25519.Generic.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 23,
"end_line": 301,
"start_col": 0,
"start_line": 279
} | module Hacl.Impl.Curve25519.Generic
open FStar.HyperStack
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Hacl.Impl.Curve25519.Fields
include Hacl.Impl.Curve25519.Finv
include Hacl.Impl.Curve25519.AddAndDouble
module ST = FStar.HyperStack.ST
module BSeq = Lib.Byt... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"LowStar.Monotonic.Buffer.fsti.checked",
"Lib.Sequence.fsti.checked",
"Lib.Loops.fsti.checked",
"Lib.LoopCombinators.fst.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Curve25519.Field64.Lemmas",
"short_module": "Lemmas"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Curve25519.AddAndDouble",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "Spec.Curve25519",
"short_module": "S"
},
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 1,
"max_fuel": 0,
"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 |
k: Hacl.Impl.Curve25519.Generic.scalar ->
q: Hacl.Impl.Curve25519.AddAndDouble.point s ->
p01_tmp1_swap:
Lib.Buffer.lbuffer (Hacl.Impl.Curve25519.Fields.Core.limb s)
(8ul *! Hacl.Impl.Curve25519.Fields.Core.nlimb s +! 1ul) ->
tmp2: Hacl.Impl.Curve25519.Fields.Core.felem_wide2 s
-> FStar... | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.Curve25519.Fields.Core.field_spec",
"Hacl.Impl.Curve25519.Generic.scalar",
"Hacl.Impl.Curve25519.AddAndDouble.point",
"Lib.Buffer.lbuffer",
"Hacl.Impl.Curve25519.Fields.Core.limb",
"Lib.IntTypes.op_Plus_Bang",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Lib.IntTypes.op_Star_Bang",
"FStar.U... | [] | false | true | false | false | false | let ladder0_ #s k q p01_tmp1_swap tmp2 =
| let p01_tmp1 = sub p01_tmp1_swap 0ul (8ul *! nlimb s) in
let nq:point s = sub p01_tmp1_swap 0ul (2ul *! nlimb s) in
let nq_p1:point s = sub p01_tmp1_swap (2ul *! nlimb s) (2ul *! nlimb s) in
let swap:lbuffer uint64 1ul = sub p01_tmp1_swap (8ul *! nlimb s) 1ul in
assert (gsub p01_tmp1_swap 0ul (2ul *! nlimb s) == nq);
a... | false |
Steel.MonotonicHigherReference.fst | Steel.MonotonicHigherReference.extract_pure | val extract_pure
(#a #uses #p #f: _)
(r: ref a p)
(v: Ghost.erased a)
(h: Ghost.erased (history a p))
: SteelGhostT (_: unit{history_val h v f})
uses
(pts_to_body r f v h)
(fun _ -> pts_to_body r f v h) | val extract_pure
(#a #uses #p #f: _)
(r: ref a p)
(v: Ghost.erased a)
(h: Ghost.erased (history a p))
: SteelGhostT (_: unit{history_val h v f})
uses
(pts_to_body r f v h)
(fun _ -> pts_to_body r f v h) | let extract_pure #a #uses #p #f
(r:ref a p)
(v:Ghost.erased a)
(h:Ghost.erased (history a p))
: SteelGhostT (_:unit{history_val h v f})
uses
(pts_to_body r f v h)
(fun _ -> pts_to_body r f v h)
= rewrite_slprop
(pts_to_body r ... | {
"file_name": "lib/steel/Steel.MonotonicHigherReference.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 5,
"end_line": 93,
"start_col": 0,
"start_line": 77
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.Preorder.fst.checked",
"Steel.PCMReference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Real.fsti.chec... | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": true,
"full_module": "Steel.PCMReference",
"short_module": "PR"
},
{
"abbrev": true,
"full_module": "Steel.Memory",
"short_module": "M"
},
{
"abbrev": true,
"full_module": "Ste... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
r: Steel.MonotonicHigherReference.ref a p ->
v: FStar.Ghost.erased a ->
h: FStar.Ghost.erased (Steel.Preorder.history a p)
-> Steel.Effect.Atomic.SteelGhostT
(_: Prims.unit{Steel.Preorder.history_val (FStar.Ghost.reveal h) v f}) | Steel.Effect.Atomic.SteelGhostT | [] | [] | [
"Steel.Memory.inames",
"FStar.Preorder.preorder",
"Steel.FractionalPermission.perm",
"Steel.MonotonicHigherReference.ref",
"FStar.Ghost.erased",
"Steel.Preorder.history",
"Steel.Effect.Atomic.rewrite_slprop",
"Steel.PCMReference.pts_to",
"Steel.Preorder.pcm_history",
"FStar.Ghost.reveal",
"Steel... | [] | false | true | false | false | false | let extract_pure #a #uses #p #f (r: ref a p) (v: Ghost.erased a) (h: Ghost.erased (history a p))
: SteelGhostT (_: unit{history_val h v f})
uses
(pts_to_body r f v h)
(fun _ -> pts_to_body r f v h) =
| rewrite_slprop (pts_to_body r f v h)
((PR.pts_to r h) `star` (pure (history_val h v f)))
(fun _ -> ());
elim_pure (history_val h v f);
rewrite_slprop (PR.pts_to r h)
(pts_to_body r f v h)
(fun m ->
emp_unit (M.pts_to r h);
pure_star_interp (M.pts_to r h) (history_val h v f) m) | false |
Hacl.Impl.HPKE.fsti | Hacl.Impl.HPKE.key_dh_secret | val key_dh_secret : cs: Spec.Agile.HPKE.ciphersuite -> Type0 | let key_dh_secret (cs:S.ciphersuite) = lbuffer uint8 (size (S.size_dh_key cs)) | {
"file_name": "code/hpke/Hacl.Impl.HPKE.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 78,
"end_line": 18,
"start_col": 0,
"start_line": 18
} | module Hacl.Impl.HPKE
open FStar.HyperStack
open FStar.HyperStack.All
module B = LowStar.Buffer
open Lib.Buffer
open Lib.IntTypes
module S = Spec.Agile.HPKE
module SAEAD = Spec.Agile.AEAD
#set-options "--z3rlimit 20 --max_fuel 0 --max_ifuel 0"
inline_for_extraction noextract
let key_dh_public (cs:S.ciphersuite) = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.AEAD.fsti.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "Spec.Agile.AEAD",
"short_module": "SAEAD"
},
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"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 | cs: Spec.Agile.HPKE.ciphersuite -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Agile.HPKE.ciphersuite",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Lib.IntTypes.size",
"Spec.Agile.HPKE.size_dh_key"
] | [] | false | false | false | true | true | let key_dh_secret (cs: S.ciphersuite) =
| lbuffer uint8 (size (S.size_dh_key cs)) | false | |
Hacl.Impl.HPKE.fsti | Hacl.Impl.HPKE.key_aead | val key_aead : cs: Spec.Agile.HPKE.ciphersuite -> Type0 | let key_aead (cs:S.ciphersuite) = lbuffer uint8 (size (S.size_aead_key cs)) | {
"file_name": "code/hpke/Hacl.Impl.HPKE.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 75,
"end_line": 22,
"start_col": 0,
"start_line": 22
} | module Hacl.Impl.HPKE
open FStar.HyperStack
open FStar.HyperStack.All
module B = LowStar.Buffer
open Lib.Buffer
open Lib.IntTypes
module S = Spec.Agile.HPKE
module SAEAD = Spec.Agile.AEAD
#set-options "--z3rlimit 20 --max_fuel 0 --max_ifuel 0"
inline_for_extraction noextract
let key_dh_public (cs:S.ciphersuite) = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.AEAD.fsti.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "Spec.Agile.AEAD",
"short_module": "SAEAD"
},
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"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 | cs: Spec.Agile.HPKE.ciphersuite -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Agile.HPKE.ciphersuite",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Lib.IntTypes.size",
"Spec.Agile.HPKE.size_aead_key"
] | [] | false | false | false | true | true | let key_aead (cs: S.ciphersuite) =
| lbuffer uint8 (size (S.size_aead_key cs)) | false | |
Hacl.Spec.Bignum.Montgomery.fsti | Hacl.Spec.Bignum.Montgomery.bn_mont_pre | val bn_mont_pre : n: Hacl.Spec.Bignum.Definitions.lbignum t nLen -> mu: Hacl.Spec.Bignum.Definitions.limb t
-> Prims.logical | let bn_mont_pre (#t:limb_t) (#nLen:size_pos) (n:lbignum t nLen) (mu:limb t) =
(1 + bn_v n * v mu) % pow2 (bits t) == 0 /\
bn_v n % 2 = 1 /\ 1 < bn_v n /\
bn_v n < pow2 (bits t * nLen) | {
"file_name": "code/bignum/Hacl.Spec.Bignum.Montgomery.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 31,
"end_line": 16,
"start_col": 0,
"start_line": 13
} | module Hacl.Spec.Bignum.Montgomery
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
module M = Hacl.Spec.Montgomery.Lemmas
#reset-options "--z3rlimit 50 --fuel 0 --ifuel 0" | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file":... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": f... | {
"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 | n: Hacl.Spec.Bignum.Definitions.lbignum t nLen -> mu: Hacl.Spec.Bignum.Definitions.limb t
-> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_pos",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Hacl.Spec.Bignum.Definitions.limb",
"Prims.l_and",
"Prims.eq2",
"Prims.int",
"Prims.op_Modulus",
"Prims.op_Addition",
"FStar.Mul.op_Star",
"Hacl.Spec.Bignum.Definitions.bn_v",
"Lib.IntTypes... | [] | false | false | false | false | true | let bn_mont_pre (#t: limb_t) (#nLen: size_pos) (n: lbignum t nLen) (mu: limb t) =
| (1 + bn_v n * v mu) % pow2 (bits t) == 0 /\ bn_v n % 2 = 1 /\ 1 < bn_v n /\
bn_v n < pow2 (bits t * nLen) | false | |
Vale.Math.Poly2.Galois.Lemmas.fst | Vale.Math.Poly2.Galois.Lemmas.lemma_mul_one | val lemma_mul_one (#f:G.field) (a:G.felem f) : Lemma (fmul a G.one == a) | val lemma_mul_one (#f:G.field) (a:G.felem f) : Lemma (fmul a G.one == a) | let lemma_mul_one #f a =
let pa = to_poly a in
let m = irred_poly f in
lemma_mul_one pa;
PL.lemma_mod_small pa m;
lemma_eq_to_poly (fmul a G.one) a | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Galois.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 35,
"end_line": 22,
"start_col": 0,
"start_line": 17
} | module Vale.Math.Poly2.Galois.Lemmas
open FStar.Mul
module PL = Vale.Math.Poly2.Lemmas
let lemma_eq_to_poly #f a b =
lemma_felem_poly a;
lemma_felem_poly b;
()
let lemma_mul_zero #f a =
let pa = to_poly a in
let m = irred_poly f in
lemma_mul_zero pa;
PL.lemma_mod_small zero m;
lemma_eq_to_poly (fmul a... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Math.Poly2.Galois.Lemmas.fst"
} | [
{
"abbrev": true,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": "PL"
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Galois",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.GaloisField.felem f
-> FStar.Pervasives.Lemma (ensures Vale.Math.Poly2.Galois.Lemmas.fmul a Spec.GaloisField.one == a) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.GaloisField.field",
"Spec.GaloisField.felem",
"Vale.Math.Poly2.Galois.Lemmas.lemma_eq_to_poly",
"Vale.Math.Poly2.Galois.Lemmas.fmul",
"Spec.GaloisField.one",
"Prims.unit",
"Vale.Math.Poly2.Lemmas.lemma_mod_small",
"Vale.Math.Poly2.lemma_mul_one",
"Vale.Math.Poly2_s.poly",
"Vale.Math.Poly2.Ga... | [] | true | false | true | false | false | let lemma_mul_one #f a =
| let pa = to_poly a in
let m = irred_poly f in
lemma_mul_one pa;
PL.lemma_mod_small pa m;
lemma_eq_to_poly (fmul a G.one) a | false |
Hacl.Impl.HPKE.fsti | Hacl.Impl.HPKE.serialized_point_dh | val serialized_point_dh : cs: Spec.Agile.HPKE.ciphersuite -> Type0 | let serialized_point_dh (cs:S.ciphersuite) = lbuffer uint8 (size (S.size_dh_serialized cs)) | {
"file_name": "code/hpke/Hacl.Impl.HPKE.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 91,
"end_line": 20,
"start_col": 0,
"start_line": 20
} | module Hacl.Impl.HPKE
open FStar.HyperStack
open FStar.HyperStack.All
module B = LowStar.Buffer
open Lib.Buffer
open Lib.IntTypes
module S = Spec.Agile.HPKE
module SAEAD = Spec.Agile.AEAD
#set-options "--z3rlimit 20 --max_fuel 0 --max_ifuel 0"
inline_for_extraction noextract
let key_dh_public (cs:S.ciphersuite) = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.AEAD.fsti.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "Spec.Agile.AEAD",
"short_module": "SAEAD"
},
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"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 | cs: Spec.Agile.HPKE.ciphersuite -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Agile.HPKE.ciphersuite",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Lib.IntTypes.size",
"Spec.Agile.HPKE.size_dh_serialized"
] | [] | false | false | false | true | true | let serialized_point_dh (cs: S.ciphersuite) =
| lbuffer uint8 (size (S.size_dh_serialized cs)) | false | |
Hacl.Impl.HPKE.fsti | Hacl.Impl.HPKE.key_dh_public | val key_dh_public : cs: Spec.Agile.HPKE.ciphersuite -> Type0 | let key_dh_public (cs:S.ciphersuite) = lbuffer uint8 (size (S.size_dh_public cs)) | {
"file_name": "code/hpke/Hacl.Impl.HPKE.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 81,
"end_line": 16,
"start_col": 0,
"start_line": 16
} | module Hacl.Impl.HPKE
open FStar.HyperStack
open FStar.HyperStack.All
module B = LowStar.Buffer
open Lib.Buffer
open Lib.IntTypes
module S = Spec.Agile.HPKE
module SAEAD = Spec.Agile.AEAD
#set-options "--z3rlimit 20 --max_fuel 0 --max_ifuel 0" | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.AEAD.fsti.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "Spec.Agile.AEAD",
"short_module": "SAEAD"
},
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"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 | cs: Spec.Agile.HPKE.ciphersuite -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Agile.HPKE.ciphersuite",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Lib.IntTypes.size",
"Spec.Agile.HPKE.size_dh_public"
] | [] | false | false | false | true | true | let key_dh_public (cs: S.ciphersuite) =
| lbuffer uint8 (size (S.size_dh_public cs)) | false | |
Vale.Math.Poly2.Galois.Lemmas.fst | Vale.Math.Poly2.Galois.Lemmas.lemma_eq_to_poly | val lemma_eq_to_poly (#f:G.field) (a b:G.felem f) : Lemma
(requires to_poly a == to_poly b)
(ensures a == b) | val lemma_eq_to_poly (#f:G.field) (a b:G.felem f) : Lemma
(requires to_poly a == to_poly b)
(ensures a == b) | let lemma_eq_to_poly #f a b =
lemma_felem_poly a;
lemma_felem_poly b;
() | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Galois.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 8,
"start_col": 0,
"start_line": 5
} | module Vale.Math.Poly2.Galois.Lemmas
open FStar.Mul
module PL = Vale.Math.Poly2.Lemmas | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Math.Poly2.Galois.Lemmas.fst"
} | [
{
"abbrev": true,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": "PL"
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Galois",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.GaloisField.felem f -> b: Spec.GaloisField.felem f
-> FStar.Pervasives.Lemma
(requires Vale.Math.Poly2.Galois.to_poly a == Vale.Math.Poly2.Galois.to_poly b)
(ensures a == b) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.GaloisField.field",
"Spec.GaloisField.felem",
"Prims.unit",
"Vale.Math.Poly2.Galois.lemma_felem_poly"
] | [] | true | false | true | false | false | let lemma_eq_to_poly #f a b =
| lemma_felem_poly a;
lemma_felem_poly b;
() | false |
Vale.Math.Poly2.Galois.Lemmas.fst | Vale.Math.Poly2.Galois.Lemmas.lemma_mul_zero | val lemma_mul_zero (#f:G.field) (a:G.felem f) : Lemma (fmul a G.zero == G.zero) | val lemma_mul_zero (#f:G.field) (a:G.felem f) : Lemma (fmul a G.zero == G.zero) | let lemma_mul_zero #f a =
let pa = to_poly a in
let m = irred_poly f in
lemma_mul_zero pa;
PL.lemma_mod_small zero m;
lemma_eq_to_poly (fmul a G.zero) G.zero | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Galois.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 41,
"end_line": 15,
"start_col": 0,
"start_line": 10
} | module Vale.Math.Poly2.Galois.Lemmas
open FStar.Mul
module PL = Vale.Math.Poly2.Lemmas
let lemma_eq_to_poly #f a b =
lemma_felem_poly a;
lemma_felem_poly b;
() | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Math.Poly2.Galois.Lemmas.fst"
} | [
{
"abbrev": true,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": "PL"
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Galois",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.GaloisField.felem f
-> FStar.Pervasives.Lemma
(ensures Vale.Math.Poly2.Galois.Lemmas.fmul a Spec.GaloisField.zero == Spec.GaloisField.zero) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.GaloisField.field",
"Spec.GaloisField.felem",
"Vale.Math.Poly2.Galois.Lemmas.lemma_eq_to_poly",
"Vale.Math.Poly2.Galois.Lemmas.fmul",
"Spec.GaloisField.zero",
"Prims.unit",
"Vale.Math.Poly2.Lemmas.lemma_mod_small",
"Vale.Math.Poly2_s.zero",
"Vale.Math.Poly2.lemma_mul_zero",
"Vale.Math.Poly2_... | [] | true | false | true | false | false | let lemma_mul_zero #f a =
| let pa = to_poly a in
let m = irred_poly f in
lemma_mul_zero pa;
PL.lemma_mod_small zero m;
lemma_eq_to_poly (fmul a G.zero) G.zero | false |
Hacl.Impl.HPKE.fsti | Hacl.Impl.HPKE.nonce_aead | val nonce_aead : cs: Spec.Agile.HPKE.ciphersuite -> Type0 | let nonce_aead (cs:S.ciphersuite) = lbuffer uint8 (size (S.size_aead_nonce cs)) | {
"file_name": "code/hpke/Hacl.Impl.HPKE.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 79,
"end_line": 24,
"start_col": 0,
"start_line": 24
} | module Hacl.Impl.HPKE
open FStar.HyperStack
open FStar.HyperStack.All
module B = LowStar.Buffer
open Lib.Buffer
open Lib.IntTypes
module S = Spec.Agile.HPKE
module SAEAD = Spec.Agile.AEAD
#set-options "--z3rlimit 20 --max_fuel 0 --max_ifuel 0"
inline_for_extraction noextract
let key_dh_public (cs:S.ciphersuite) = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.AEAD.fsti.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "Spec.Agile.AEAD",
"short_module": "SAEAD"
},
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"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 | cs: Spec.Agile.HPKE.ciphersuite -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Agile.HPKE.ciphersuite",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Lib.IntTypes.size",
"Spec.Agile.HPKE.size_aead_nonce"
] | [] | false | false | false | true | true | let nonce_aead (cs: S.ciphersuite) =
| lbuffer uint8 (size (S.size_aead_nonce cs)) | false | |
BinarySearchTreeBasic.fst | BinarySearchTreeBasic.gt | val gt : int -> int -> Tot bool | val gt : int -> int -> Tot bool | let gt n1 n2 = n1 > n2 | {
"file_name": "examples/data_structures/BinarySearchTreeBasic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 22,
"end_line": 39,
"start_col": 0,
"start_line": 39
} | (*
Copyright 2008-2018 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",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTreeBasic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"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 | n1: Prims.int -> n2: Prims.int -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"Prims.op_GreaterThan",
"Prims.bool"
] | [] | false | false | false | true | false | let gt n1 n2 =
| n1 > n2 | false |
BinarySearchTreeBasic.fst | BinarySearchTreeBasic.lt | val lt : int -> int -> Tot bool | val lt : int -> int -> Tot bool | let lt n1 n2 = n1 < n2 | {
"file_name": "examples/data_structures/BinarySearchTreeBasic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 22,
"end_line": 36,
"start_col": 0,
"start_line": 36
} | (*
Copyright 2008-2018 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",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTreeBasic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"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 | n1: Prims.int -> n2: Prims.int -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"Prims.op_LessThan",
"Prims.bool"
] | [] | false | false | false | true | false | let lt n1 n2 =
| n1 < n2 | false |
SteelTableJoin.fst | SteelTableJoin.v2' | val v2' (#p: Ghost.erased nat) (al err: ptr)
: STT unit
((pts_to1 al p) `star` (pts_to1 err 0))
(fun _ -> exists_ (fun p -> exists_ (fun v -> (pts_to1 al p) `star` (pts_to1 err v)))) | val v2' (#p: Ghost.erased nat) (al err: ptr)
: STT unit
((pts_to1 al p) `star` (pts_to1 err 0))
(fun _ -> exists_ (fun p -> exists_ (fun v -> (pts_to1 al p) `star` (pts_to1 err v)))) | let v2' (#p: Ghost.erased nat) (al: ptr) (err: ptr) : STT unit
(pts_to1 al p `star` pts_to1 err 0)
(fun _ -> exists_ (fun p -> exists_ (fun v -> pts_to1 al p `star` pts_to1 err v)))
= let ar = split al in
let _ = gen_elim () in
let _ = v1 ar err in
let _ = elim_exists () in
// let _ = elim_pure _ in
let _ ... | {
"file_name": "share/steel/tests/SteelTableJoin.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 11,
"end_line": 47,
"start_col": 0,
"start_line": 37
} | module SteelTableJoin
open Steel.ST.GenElim
assume
val ptr : Type0
assume
val pts_to1 (p: ptr) (v: Ghost.erased nat) : vprop
assume
val split
(#v: Ghost.erased nat)
(p: ptr)
: STT ptr
(pts_to1 p v)
(fun res -> exists_ (fun vl -> exists_ (fun vr -> pts_to1 p vl `star` pts_to1 res vr)))
assume val join (... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.GenElim.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "SteelTableJoin.fst"
} | [
{
"abbrev": false,
"full_module": "Steel.ST.GenElim",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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 | al: SteelTableJoin.ptr -> err: SteelTableJoin.ptr -> Steel.ST.Effect.STT Prims.unit | Steel.ST.Effect.STT | [] | [] | [
"FStar.Ghost.erased",
"Prims.nat",
"SteelTableJoin.ptr",
"Steel.ST.Util.return",
"Prims.unit",
"FStar.Ghost.hide",
"FStar.Set.set",
"Steel.Memory.iname",
"FStar.Set.empty",
"Steel.ST.Util.exists_",
"Steel.Effect.Common.VStar",
"SteelTableJoin.pts_to1",
"Steel.Effect.Common.vprop",
"SteelTa... | [] | false | true | false | false | false | let v2' (#p: Ghost.erased nat) (al err: ptr)
: STT unit
((pts_to1 al p) `star` (pts_to1 err 0))
(fun _ -> exists_ (fun p -> exists_ (fun v -> (pts_to1 al p) `star` (pts_to1 err v)))) =
| let ar = split al in
let _ = gen_elim () in
let _ = v1 ar err in
let _ = elim_exists () in
let _ = noop () in
let _ = join al ar in
return () | false |
Hacl.Impl.HPKE.fsti | Hacl.Impl.HPKE.max_length_info | val max_length_info : a: Spec.Agile.HPKE.hash_algorithm -> Prims.int | let max_length_info (a:S.hash_algorithm) =
max_size_t - S.size_label_version - S.size_suite_id_hpke - S.size_label_info_hash - Spec.Hash.Definitions.block_length a | {
"file_name": "code/hpke/Hacl.Impl.HPKE.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 122,
"end_line": 29,
"start_col": 0,
"start_line": 28
} | module Hacl.Impl.HPKE
open FStar.HyperStack
open FStar.HyperStack.All
module B = LowStar.Buffer
open Lib.Buffer
open Lib.IntTypes
module S = Spec.Agile.HPKE
module SAEAD = Spec.Agile.AEAD
#set-options "--z3rlimit 20 --max_fuel 0 --max_ifuel 0"
inline_for_extraction noextract
let key_dh_public (cs:S.ciphersuite) = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.AEAD.fsti.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "Spec.Agile.AEAD",
"short_module": "SAEAD"
},
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"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.Agile.HPKE.hash_algorithm -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"Spec.Agile.HPKE.hash_algorithm",
"Prims.op_Subtraction",
"Lib.IntTypes.max_size_t",
"Spec.Agile.HPKE.size_label_version",
"Spec.Agile.HPKE.size_suite_id_hpke",
"Spec.Agile.HPKE.size_label_info_hash",
"Spec.Hash.Definitions.block_length",
"Prims.int"
] | [] | false | false | false | true | false | let max_length_info (a: S.hash_algorithm) =
| max_size_t - S.size_label_version - S.size_suite_id_hpke - S.size_label_info_hash -
Spec.Hash.Definitions.block_length a | false | |
BinarySearchTreeBasic.fst | BinarySearchTreeBasic.in_tree | val in_tree : int -> tree -> Tot bool | val in_tree : int -> tree -> Tot bool | let rec in_tree x t =
match t with
| Leaf -> false
| Node n t1 t2 -> x = n || in_tree x t1 || in_tree x t2 | {
"file_name": "examples/data_structures/BinarySearchTreeBasic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 57,
"end_line": 26,
"start_col": 0,
"start_line": 23
} | (*
Copyright 2008-2018 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",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTreeBasic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"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 | x: Prims.int -> t: BinarySearchTreeBasic.tree -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"BinarySearchTreeBasic.tree",
"Prims.op_BarBar",
"Prims.op_Equality",
"BinarySearchTreeBasic.in_tree",
"Prims.bool"
] | [
"recursion"
] | false | false | false | true | false | let rec in_tree x t =
| match t with
| Leaf -> false
| Node n t1 t2 -> x = n || in_tree x t1 || in_tree x t2 | false |
BinarySearchTreeBasic.fst | BinarySearchTreeBasic.is_bst | val is_bst : tree -> Tot bool | val is_bst : tree -> Tot bool | let rec is_bst t =
match t with
| Leaf -> true
| Node n t1 t2 -> all (gt n) t1 && all (lt n) t2 && is_bst t1 && is_bst t2 | {
"file_name": "examples/data_structures/BinarySearchTreeBasic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 76,
"end_line": 45,
"start_col": 0,
"start_line": 42
} | (*
Copyright 2008-2018 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",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTreeBasic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"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 | t: BinarySearchTreeBasic.tree -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"BinarySearchTreeBasic.tree",
"Prims.int",
"Prims.op_AmpAmp",
"BinarySearchTreeBasic.all",
"BinarySearchTreeBasic.gt",
"BinarySearchTreeBasic.lt",
"BinarySearchTreeBasic.is_bst",
"Prims.bool"
] | [
"recursion"
] | false | false | false | true | false | let rec is_bst t =
| match t with
| Leaf -> true
| Node n t1 t2 -> all (gt n) t1 && all (lt n) t2 && is_bst t1 && is_bst t2 | false |
BinarySearchTreeBasic.fst | BinarySearchTreeBasic.ge | val ge : int -> int -> Tot bool | val ge : int -> int -> Tot bool | let ge n1 n2 = n1 >= n2 | {
"file_name": "examples/data_structures/BinarySearchTreeBasic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 23,
"end_line": 114,
"start_col": 0,
"start_line": 114
} | (*
Copyright 2008-2018 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",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTreeBasic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"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 | n1: Prims.int -> n2: Prims.int -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"Prims.op_GreaterThanOrEqual",
"Prims.bool"
] | [] | false | false | false | true | false | let ge n1 n2 =
| n1 >= n2 | false |
BinarySearchTreeBasic.fst | BinarySearchTreeBasic.all | val all : p:(int -> Tot bool) -> t:tree ->
Tot (r:bool{r <==> (forall x. in_tree x t ==> p x)}) | val all : p:(int -> Tot bool) -> t:tree ->
Tot (r:bool{r <==> (forall x. in_tree x t ==> p x)}) | let rec all p t =
match t with
| Leaf -> true
| Node n t1 t2 -> p n && all p t1 && all p t2 | {
"file_name": "examples/data_structures/BinarySearchTreeBasic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 47,
"end_line": 33,
"start_col": 0,
"start_line": 30
} | (*
Copyright 2008-2018 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",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTreeBasic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"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: (_: Prims.int -> Prims.bool) -> t: BinarySearchTreeBasic.tree
-> r: Prims.bool{r <==> (forall (x: Prims.int). BinarySearchTreeBasic.in_tree x t ==> p x)} | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"Prims.bool",
"BinarySearchTreeBasic.tree",
"Prims.op_AmpAmp",
"BinarySearchTreeBasic.all",
"Prims.l_iff",
"Prims.b2t",
"Prims.l_Forall",
"Prims.l_imp",
"BinarySearchTreeBasic.in_tree"
] | [
"recursion"
] | false | false | false | false | false | let rec all p t =
| match t with
| Leaf -> true
| Node n t1 t2 -> p n && all p t1 && all p t2 | false |
BinarySearchTreeBasic.fst | BinarySearchTreeBasic.search | val search : x:int -> t:tree{is_bst t} -> Tot (r:bool{r <==> in_tree x t}) | val search : x:int -> t:tree{is_bst t} -> Tot (r:bool{r <==> in_tree x t}) | let rec search x t =
match t with
| Leaf -> false
| Node n t1 t2 -> if x = n then true
else if x < n then search x t1
else search x t2 | {
"file_name": "examples/data_structures/BinarySearchTreeBasic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 63,
"start_col": 0,
"start_line": 58
} | (*
Copyright 2008-2018 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",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTreeBasic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"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 | x: Prims.int -> t: BinarySearchTreeBasic.tree{BinarySearchTreeBasic.is_bst t}
-> r: Prims.bool{r <==> BinarySearchTreeBasic.in_tree x t} | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"BinarySearchTreeBasic.tree",
"Prims.b2t",
"BinarySearchTreeBasic.is_bst",
"Prims.op_Equality",
"Prims.bool",
"Prims.op_LessThan",
"BinarySearchTreeBasic.search",
"Prims.l_iff",
"BinarySearchTreeBasic.in_tree"
] | [
"recursion"
] | false | false | false | false | false | let rec search x t =
| match t with
| Leaf -> false
| Node n t1 t2 -> if x = n then true else if x < n then search x t1 else search x t2 | false |
Vale.Math.Poly2.Galois.Lemmas.fst | Vale.Math.Poly2.Galois.Lemmas.lemma_mul_commute | val lemma_mul_commute (#f:G.field) (a b:G.felem f) : Lemma
(fmul a b == fmul b a) | val lemma_mul_commute (#f:G.field) (a b:G.felem f) : Lemma
(fmul a b == fmul b a) | let lemma_mul_commute #f a b =
let pa = to_poly a in
let pb = to_poly b in
let m = irred_poly f in
lemma_mul_commute pa pb;
lemma_eq_to_poly (fmul a b) (fmul b a) | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Galois.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 40,
"end_line": 29,
"start_col": 0,
"start_line": 24
} | module Vale.Math.Poly2.Galois.Lemmas
open FStar.Mul
module PL = Vale.Math.Poly2.Lemmas
let lemma_eq_to_poly #f a b =
lemma_felem_poly a;
lemma_felem_poly b;
()
let lemma_mul_zero #f a =
let pa = to_poly a in
let m = irred_poly f in
lemma_mul_zero pa;
PL.lemma_mod_small zero m;
lemma_eq_to_poly (fmul a... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Math.Poly2.Galois.Lemmas.fst"
} | [
{
"abbrev": true,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": "PL"
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Galois",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.GaloisField.felem f -> b: Spec.GaloisField.felem f
-> FStar.Pervasives.Lemma
(ensures Vale.Math.Poly2.Galois.Lemmas.fmul a b == Vale.Math.Poly2.Galois.Lemmas.fmul b a) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.GaloisField.field",
"Spec.GaloisField.felem",
"Vale.Math.Poly2.Galois.Lemmas.lemma_eq_to_poly",
"Vale.Math.Poly2.Galois.Lemmas.fmul",
"Prims.unit",
"Vale.Math.Poly2.lemma_mul_commute",
"Vale.Math.Poly2_s.poly",
"Vale.Math.Poly2.Galois.irred_poly",
"Vale.Math.Poly2.Galois.to_poly"
] | [] | true | false | true | false | false | let lemma_mul_commute #f a b =
| let pa = to_poly a in
let pb = to_poly b in
let m = irred_poly f in
lemma_mul_commute pa pb;
lemma_eq_to_poly (fmul a b) (fmul b a) | false |
Vale.Math.Poly2.Galois.Lemmas.fst | Vale.Math.Poly2.Galois.Lemmas.lemma_mul_associate | val lemma_mul_associate (#f:G.field) (a b c:G.felem f) : Lemma
(fmul a (fmul b c) == fmul (fmul a b) c) | val lemma_mul_associate (#f:G.field) (a b c:G.felem f) : Lemma
(fmul a (fmul b c) == fmul (fmul a b) c) | let lemma_mul_associate #f a b c =
let pa = to_poly a in
let pb = to_poly b in
let pc = to_poly c in
let m = irred_poly f in
lemma_mul_associate pa pb pc;
// (((a * b) % m) * c) % m
// (a * ((b * c) % m)) % m
PL.lemma_mod_mul_mod (pa *. pb) m pc;
PL.lemma_mod_mul_mod (pb *. pc) m pa;
Vale.Math.Poly2... | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Galois.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 58,
"end_line": 43,
"start_col": 0,
"start_line": 31
} | module Vale.Math.Poly2.Galois.Lemmas
open FStar.Mul
module PL = Vale.Math.Poly2.Lemmas
let lemma_eq_to_poly #f a b =
lemma_felem_poly a;
lemma_felem_poly b;
()
let lemma_mul_zero #f a =
let pa = to_poly a in
let m = irred_poly f in
lemma_mul_zero pa;
PL.lemma_mod_small zero m;
lemma_eq_to_poly (fmul a... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Math.Poly2.Galois.Lemmas.fst"
} | [
{
"abbrev": true,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": "PL"
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Galois",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.GaloisField.felem f -> b: Spec.GaloisField.felem f -> c: Spec.GaloisField.felem f
-> FStar.Pervasives.Lemma
(ensures
Vale.Math.Poly2.Galois.Lemmas.fmul a (Vale.Math.Poly2.Galois.Lemmas.fmul b c) ==
Vale.Math.Poly2.Galois.Lemmas.fmul (Vale.Math.Poly2.Galois.Lemmas.fmul a b) c) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.GaloisField.field",
"Spec.GaloisField.felem",
"Vale.Math.Poly2.Galois.Lemmas.lemma_eq_to_poly",
"Vale.Math.Poly2.Galois.Lemmas.fmul",
"Prims.unit",
"Vale.Math.Poly2.lemma_mul_commute",
"Vale.Math.Poly2.op_Percent_Dot",
"Vale.Math.Poly2.op_Star_Dot",
"Vale.Math.Poly2.Lemmas.lemma_mod_mul_mod",
... | [] | true | false | true | false | false | let lemma_mul_associate #f a b c =
| let pa = to_poly a in
let pb = to_poly b in
let pc = to_poly c in
let m = irred_poly f in
lemma_mul_associate pa pb pc;
PL.lemma_mod_mul_mod (pa *. pb) m pc;
PL.lemma_mod_mul_mod (pb *. pc) m pa;
Vale.Math.Poly2.lemma_mul_commute pa (pb *. pc);
Vale.Math.Poly2.lemma_mul_commute pa ((pb *. pc) %. m);
lemma_eq_to_poly (f... | false |
Pulse.Typing.Combinators.fst | Pulse.Typing.Combinators.mk_bind_atomic_atomic | val mk_bind_atomic_atomic:bind_t C_STAtomic? C_STAtomic? | val mk_bind_atomic_atomic:bind_t C_STAtomic? C_STAtomic? | let mk_bind_atomic_atomic
: bind_t C_STAtomic? C_STAtomic?
= fun g pre e1 e2 c1 c2 px d_e1 d_c1res d_e2 res_typing post_typing bias_k ->
let _, x = px in
let b = nvar_as_binder px (comp_res c1) in
let C_STAtomic inames1 obs1 sc1 = c1 in
let C_STAtomic inames2 obs2 sc2 = c2 in
if at_mos... | {
"file_name": "lib/steel/pulse/Pulse.Typing.Combinators.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 7,
"end_line": 270,
"start_col": 0,
"start_line": 237
} | (*
Copyright 2023 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.PP.fst.checked",
"Pulse.Checker.Pure.fsti.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked"... | [
{
"abbrev": false,
"full_module": "Pulse.Checker.Pure",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Typing",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Syntax",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"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 | Pulse.Typing.Combinators.bind_t C_STAtomic? C_STAtomic? | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Base.st_term",
"Pulse.Syntax.Base.comp_st",
"Prims.b2t",
"Pulse.Syntax.Base.uu___is_C_STAtomic",
"Pulse.Syntax.Base.nvar",
"Prims.l_not",
"FStar.Set.mem",
"Pulse.Syntax.Base.var",
"FStar.Pervasives.Native.snd",
"Pulse.Syntax.Base.... | [] | false | false | false | true | false | let mk_bind_atomic_atomic:bind_t C_STAtomic? C_STAtomic? =
| fun g pre e1 e2 c1 c2 px d_e1 d_c1res d_e2 res_typing post_typing bias_k ->
let _, x = px in
let b = nvar_as_binder px (comp_res c1) in
let C_STAtomic inames1 obs1 sc1 = c1 in
let C_STAtomic inames2 obs2 sc2 = c2 in
if at_most_one_observable obs1 obs2
then
(if eq_tm inames1 inames2
then
le... | false |
BinarySearchTreeBasic.fst | BinarySearchTreeBasic.insert | val insert : x:int -> t:tree{is_bst t} ->
Tot (r:tree{is_bst r /\
(forall y. in_tree y r <==> (in_tree y t \/ x = y))}) | val insert : x:int -> t:tree{is_bst t} ->
Tot (r:tree{is_bst r /\
(forall y. in_tree y r <==> (in_tree y t \/ x = y))}) | let rec insert x t =
match t with
| Leaf -> Node x Leaf Leaf
| Node n t1 t2 -> if x = n then t
else if x < n then Node n (insert x t1) t2
else Node n t1 (insert x t2) | {
"file_name": "examples/data_structures/BinarySearchTreeBasic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 73,
"start_col": 0,
"start_line": 68
} | (*
Copyright 2008-2018 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",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTreeBasic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"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 | x: Prims.int -> t: BinarySearchTreeBasic.tree{BinarySearchTreeBasic.is_bst t}
-> r:
BinarySearchTreeBasic.tree
{ BinarySearchTreeBasic.is_bst r /\
(forall (y: Prims.int).
BinarySearchTreeBasic.in_tree y r <==> BinarySearchTreeBasic.in_tree y t \/ x = y) } | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"BinarySearchTreeBasic.tree",
"Prims.b2t",
"BinarySearchTreeBasic.is_bst",
"BinarySearchTreeBasic.Node",
"BinarySearchTreeBasic.Leaf",
"Prims.op_Equality",
"Prims.bool",
"Prims.op_LessThan",
"BinarySearchTreeBasic.insert",
"Prims.l_and",
"Prims.l_Forall",
"Prims.l_iff",
"Binar... | [
"recursion"
] | false | false | false | false | false | let rec insert x t =
| match t with
| Leaf -> Node x Leaf Leaf
| Node n t1 t2 ->
if x = n then t else if x < n then Node n (insert x t1) t2 else Node n t1 (insert x t2) | false |
BinarySearchTreeBasic.fst | BinarySearchTreeBasic.insert' | val insert' : x:int -> t:tree -> Pure tree
(requires (b2t (is_bst t)))
(ensures (fun r -> is_bst r /\
(forall y. in_tree y r <==> (in_tree y t \/ x = y)))) | val insert' : x:int -> t:tree -> Pure tree
(requires (b2t (is_bst t)))
(ensures (fun r -> is_bst r /\
(forall y. in_tree y r <==> (in_tree y t \/ x = y)))) | let rec insert' x t =
match t with
| Leaf -> Node x Leaf Leaf
| Node n t1 t2 -> if x = n then t
else if x < n then
(let y = insert' x t1 in
Node n (insert' x t1) t2)
else
Node n t1 (insert' x t2) | {
"file_name": "examples/data_structures/BinarySearchTreeBasic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 88,
"start_col": 0,
"start_line": 80
} | (*
Copyright 2008-2018 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",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTreeBasic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"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 | x: Prims.int -> t: BinarySearchTreeBasic.tree -> Prims.Pure BinarySearchTreeBasic.tree | Prims.Pure | [] | [] | [
"Prims.int",
"BinarySearchTreeBasic.tree",
"BinarySearchTreeBasic.Node",
"BinarySearchTreeBasic.Leaf",
"Prims.op_Equality",
"Prims.bool",
"Prims.op_LessThan",
"BinarySearchTreeBasic.insert'"
] | [
"recursion"
] | false | false | false | false | false | let rec insert' x t =
| match t with
| Leaf -> Node x Leaf Leaf
| Node n t1 t2 ->
if x = n
then t
else
if x < n
then
(let y = insert' x t1 in
Node n (insert' x t1) t2)
else Node n t1 (insert' x t2) | false |
BinarySearchTreeBasic.fst | BinarySearchTreeBasic.find_max | val find_max : t:tree{is_bst t /\ Node? t} ->
Tot (x:int{b2t (all (ge x) t) /\ in_tree x t}) | val find_max : t:tree{is_bst t /\ Node? t} ->
Tot (x:int{b2t (all (ge x) t) /\ in_tree x t}) | let rec find_max (Node n _ t2) = if Leaf? t2 then n else find_max t2 | {
"file_name": "examples/data_structures/BinarySearchTreeBasic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 68,
"end_line": 118,
"start_col": 0,
"start_line": 118
} | (*
Copyright 2008-2018 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",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTreeBasic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"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 | t: BinarySearchTreeBasic.tree{BinarySearchTreeBasic.is_bst t /\ Node? t}
-> x:
Prims.int
{ BinarySearchTreeBasic.all (BinarySearchTreeBasic.ge x) t /\
BinarySearchTreeBasic.in_tree x t } | Prims.Tot | [
"total"
] | [] | [
"BinarySearchTreeBasic.tree",
"Prims.l_and",
"Prims.b2t",
"BinarySearchTreeBasic.is_bst",
"BinarySearchTreeBasic.uu___is_Node",
"Prims.int",
"BinarySearchTreeBasic.uu___is_Leaf",
"Prims.bool",
"BinarySearchTreeBasic.find_max",
"BinarySearchTreeBasic.all",
"BinarySearchTreeBasic.ge",
"BinarySea... | [
"recursion"
] | false | false | false | false | false | let rec find_max (Node n _ t2) =
| if Leaf? t2 then n else find_max t2 | false |
BinarySearchTreeBasic.fst | BinarySearchTreeBasic.find_max' | val find_max' : t:tree{Node? t}-> Tot int | val find_max' : t:tree{Node? t}-> Tot int | let rec find_max' (Node n _ t2) = if Leaf? t2 then n else find_max' t2 | {
"file_name": "examples/data_structures/BinarySearchTreeBasic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 70,
"end_line": 121,
"start_col": 0,
"start_line": 121
} | (*
Copyright 2008-2018 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",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTreeBasic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"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 | t: BinarySearchTreeBasic.tree{Node? t} -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"BinarySearchTreeBasic.tree",
"Prims.b2t",
"BinarySearchTreeBasic.uu___is_Node",
"Prims.int",
"BinarySearchTreeBasic.uu___is_Leaf",
"Prims.bool",
"BinarySearchTreeBasic.find_max'"
] | [
"recursion"
] | false | false | false | false | false | let rec find_max' (Node n _ t2) =
| if Leaf? t2 then n else find_max' t2 | false |
Vale.Math.Poly2.Galois.Lemmas.fst | Vale.Math.Poly2.Galois.Lemmas.lemma_mul_distribute_left | val lemma_mul_distribute_left (#f:G.field) (a b c:G.felem f) : Lemma
(fmul (fadd a b) c == fadd (fmul a c) (fmul b c)) | val lemma_mul_distribute_left (#f:G.field) (a b c:G.felem f) : Lemma
(fmul (fadd a b) c == fadd (fmul a c) (fmul b c)) | let lemma_mul_distribute_left #f a b c =
let pa = to_poly a in
let pb = to_poly b in
let pc = to_poly c in
let m = irred_poly f in
PL.lemma_mul_distribute_left pa pb pc;
PL.lemma_mod_distribute (pa *. pc) (pb *. pc) m;
lemma_eq_to_poly (fmul (fadd a b) c) (fadd (fmul a c) (fmul b c)) | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Galois.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 67,
"end_line": 52,
"start_col": 0,
"start_line": 45
} | module Vale.Math.Poly2.Galois.Lemmas
open FStar.Mul
module PL = Vale.Math.Poly2.Lemmas
let lemma_eq_to_poly #f a b =
lemma_felem_poly a;
lemma_felem_poly b;
()
let lemma_mul_zero #f a =
let pa = to_poly a in
let m = irred_poly f in
lemma_mul_zero pa;
PL.lemma_mod_small zero m;
lemma_eq_to_poly (fmul a... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Math.Poly2.Galois.Lemmas.fst"
} | [
{
"abbrev": true,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": "PL"
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Galois",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.GaloisField.felem f -> b: Spec.GaloisField.felem f -> c: Spec.GaloisField.felem f
-> FStar.Pervasives.Lemma
(ensures
Vale.Math.Poly2.Galois.Lemmas.fmul (Vale.Math.Poly2.Galois.Lemmas.fadd a b) c ==
Vale.Math.Poly2.Galois.Lemmas.fadd (Vale.Math.Poly2.Galois.Lemmas.fmul a c)
(Vale.Math.P... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.GaloisField.field",
"Spec.GaloisField.felem",
"Vale.Math.Poly2.Galois.Lemmas.lemma_eq_to_poly",
"Vale.Math.Poly2.Galois.Lemmas.fmul",
"Vale.Math.Poly2.Galois.Lemmas.fadd",
"Prims.unit",
"Vale.Math.Poly2.Lemmas.lemma_mod_distribute",
"Vale.Math.Poly2.op_Star_Dot",
"Vale.Math.Poly2.Lemmas.lemma_... | [] | true | false | true | false | false | let lemma_mul_distribute_left #f a b c =
| let pa = to_poly a in
let pb = to_poly b in
let pc = to_poly c in
let m = irred_poly f in
PL.lemma_mul_distribute_left pa pb pc;
PL.lemma_mod_distribute (pa *. pc) (pb *. pc) m;
lemma_eq_to_poly (fmul (fadd a b) c) (fadd (fmul a c) (fmul b c)) | false |
BinarySearchTreeBasic.fst | BinarySearchTreeBasic.insert'' | val insert'' : int -> tree -> Tot tree | val insert'' : int -> tree -> Tot tree | let rec insert'' x t =
match t with
| Leaf -> Node x Leaf Leaf
| Node n t1 t2 -> if x = n then t
else if x < n then Node n (insert'' x t1) t2
else Node n t1 (insert'' x t2) | {
"file_name": "examples/data_structures/BinarySearchTreeBasic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 64,
"end_line": 97,
"start_col": 0,
"start_line": 92
} | (*
Copyright 2008-2018 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",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTreeBasic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"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 | x: Prims.int -> t: BinarySearchTreeBasic.tree -> BinarySearchTreeBasic.tree | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"BinarySearchTreeBasic.tree",
"BinarySearchTreeBasic.Node",
"BinarySearchTreeBasic.Leaf",
"Prims.op_Equality",
"Prims.bool",
"Prims.op_LessThan",
"BinarySearchTreeBasic.insert''"
] | [
"recursion"
] | false | false | false | true | false | let rec insert'' x t =
| match t with
| Leaf -> Node x Leaf Leaf
| Node n t1 t2 ->
if x = n then t else if x < n then Node n (insert'' x t1) t2 else Node n t1 (insert'' x t2) | false |
BinarySearchTreeBasic.fst | BinarySearchTreeBasic.find_max_eq | val find_max_eq : t:tree{Node? t /\ is_bst t} -> Lemma (find_max t = find_max' t) | val find_max_eq : t:tree{Node? t /\ is_bst t} -> Lemma (find_max t = find_max' t) | let find_max_eq t = find_max_lemma t | {
"file_name": "examples/data_structures/BinarySearchTreeBasic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 128,
"start_col": 0,
"start_line": 128
} | (*
Copyright 2008-2018 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",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTreeBasic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"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 | t: BinarySearchTreeBasic.tree{Node? t /\ BinarySearchTreeBasic.is_bst t}
-> FStar.Pervasives.Lemma
(ensures BinarySearchTreeBasic.find_max t = BinarySearchTreeBasic.find_max' t) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"BinarySearchTreeBasic.tree",
"Prims.l_and",
"Prims.b2t",
"BinarySearchTreeBasic.uu___is_Node",
"BinarySearchTreeBasic.is_bst",
"BinarySearchTreeBasic.find_max_lemma",
"Prims.unit"
] | [] | true | false | true | false | false | let find_max_eq t =
| find_max_lemma t | false |
BinarySearchTreeBasic.fst | BinarySearchTreeBasic.delete' | val delete' : x : int -> t:tree -> Tot tree (decreases t) | val delete' : x : int -> t:tree -> Tot tree (decreases t) | let rec delete' x t = match t with
| Leaf -> Leaf
| Node n t1 t2 -> if n = x then match (t1, t2) with
| (Leaf, Leaf) -> Leaf
| (_, Leaf) -> t1
| (Leaf, _) -> t2
| _ ->
let y = find_max' t1 in
... | {
"file_name": "examples/data_structures/BinarySearchTreeBasic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 157,
"start_col": 0,
"start_line": 147
} | (*
Copyright 2008-2018 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",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTreeBasic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"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 | x: Prims.int -> t: BinarySearchTreeBasic.tree -> Prims.Tot BinarySearchTreeBasic.tree | Prims.Tot | [
"total",
""
] | [] | [
"Prims.int",
"BinarySearchTreeBasic.tree",
"BinarySearchTreeBasic.Leaf",
"Prims.op_Equality",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple2",
"BinarySearchTreeBasic.Node",
"BinarySearchTreeBasic.delete'",
"BinarySearchTreeBasic.find_max'",
"Prims.bool",
"Prims.op_LessThan"
... | [
"recursion"
] | false | false | false | true | false | let rec delete' x t =
| match t with
| Leaf -> Leaf
| Node n t1 t2 ->
if n = x
then
match (t1, t2) with
| Leaf, Leaf -> Leaf
| _, Leaf -> t1
| Leaf, _ -> t2
| _ ->
let y = find_max' t1 in
Node y (delete' y t1) t2
else if x < n then Node n (delete' x t1) t2 else Node n t1 (delete' x t2) | false |
BinarySearchTreeBasic.fst | BinarySearchTreeBasic.find_max_lemma | val find_max_lemma : t:tree{Node? t /\ is_bst t} ->
Lemma (in_tree (find_max' t) t /\ b2t (all (ge (find_max' t)) t)) | val find_max_lemma : t:tree{Node? t /\ is_bst t} ->
Lemma (in_tree (find_max' t) t /\ b2t (all (ge (find_max' t)) t)) | let rec find_max_lemma (Node _ _ t2) = if Node? t2 then find_max_lemma t2 | {
"file_name": "examples/data_structures/BinarySearchTreeBasic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 73,
"end_line": 125,
"start_col": 0,
"start_line": 125
} | (*
Copyright 2008-2018 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",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTreeBasic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"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 | t: BinarySearchTreeBasic.tree{Node? t /\ BinarySearchTreeBasic.is_bst t}
-> FStar.Pervasives.Lemma
(ensures
BinarySearchTreeBasic.in_tree (BinarySearchTreeBasic.find_max' t) t /\
BinarySearchTreeBasic.all (BinarySearchTreeBasic.ge (BinarySearchTreeBasic.find_max' t)) t) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"BinarySearchTreeBasic.tree",
"Prims.l_and",
"Prims.b2t",
"BinarySearchTreeBasic.uu___is_Node",
"BinarySearchTreeBasic.is_bst",
"Prims.int",
"BinarySearchTreeBasic.find_max_lemma",
"Prims.bool",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec find_max_lemma (Node _ _ t2) =
| if Node? t2 then find_max_lemma t2 | false |
BinarySearchTreeBasic.fst | BinarySearchTreeBasic.insert_lemma | val insert_lemma : x:int -> t:tree{is_bst t} -> Lemma
(is_bst (insert'' x t) /\
(forall y. in_tree y (insert'' x t) <==> in_tree y t \/ x = y)) | val insert_lemma : x:int -> t:tree{is_bst t} -> Lemma
(is_bst (insert'' x t) /\
(forall y. in_tree y (insert'' x t) <==> in_tree y t \/ x = y)) | let rec insert_lemma x t = match t with
| Leaf -> ()
| Node _ t1 t2 -> insert_lemma x t1; insert_lemma x t2 | {
"file_name": "examples/data_structures/BinarySearchTreeBasic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 56,
"end_line": 108,
"start_col": 0,
"start_line": 106
} | (*
Copyright 2008-2018 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",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTreeBasic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.int -> t: BinarySearchTreeBasic.tree{BinarySearchTreeBasic.is_bst t}
-> FStar.Pervasives.Lemma
(ensures
BinarySearchTreeBasic.is_bst (BinarySearchTreeBasic.insert'' x t) /\
(forall (y: Prims.int).
BinarySearchTreeBasic.in_tree y (BinarySearchTreeBasic.insert'' x t) <==>
Bi... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.int",
"BinarySearchTreeBasic.tree",
"Prims.b2t",
"BinarySearchTreeBasic.is_bst",
"BinarySearchTreeBasic.insert_lemma",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec insert_lemma x t =
| match t with
| Leaf -> ()
| Node _ t1 t2 ->
insert_lemma x t1;
insert_lemma x t2 | false |
Vale.Math.Poly2.Galois.Lemmas.fst | Vale.Math.Poly2.Galois.Lemmas.lemma_mul_distribute_right | val lemma_mul_distribute_right (#f:G.field) (a b c:G.felem f) : Lemma
(fmul a (fadd b c) == fadd (fmul a b) (fmul a c)) | val lemma_mul_distribute_right (#f:G.field) (a b c:G.felem f) : Lemma
(fmul a (fadd b c) == fadd (fmul a b) (fmul a c)) | let lemma_mul_distribute_right #f a b c =
lemma_mul_distribute_left b c a;
// fmul (fadd b c) a == fadd (fmul b a) (fmul c a)
lemma_mul_commute a b;
lemma_mul_commute a c;
lemma_mul_commute a (fadd b c);
() | {
"file_name": "vale/code/lib/math/Vale.Math.Poly2.Galois.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 60,
"start_col": 0,
"start_line": 54
} | module Vale.Math.Poly2.Galois.Lemmas
open FStar.Mul
module PL = Vale.Math.Poly2.Lemmas
let lemma_eq_to_poly #f a b =
lemma_felem_poly a;
lemma_felem_poly b;
()
let lemma_mul_zero #f a =
let pa = to_poly a in
let m = irred_poly f in
lemma_mul_zero pa;
PL.lemma_mod_small zero m;
lemma_eq_to_poly (fmul a... | {
"checked_file": "/",
"dependencies": [
"Vale.Math.Poly2.Lemmas.fsti.checked",
"Vale.Math.Poly2.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked"
],
"interface_file": true,
"source_file": "Vale.Math.Poly2.Galois.Lemmas.fst"
} | [
{
"abbrev": true,
"full_module": "Vale.Math.Poly2.Lemmas",
"short_module": "PL"
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2.Galois",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Math.Poly2",
"short_module": null
},
{
"abbrev": false,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a: Spec.GaloisField.felem f -> b: Spec.GaloisField.felem f -> c: Spec.GaloisField.felem f
-> FStar.Pervasives.Lemma
(ensures
Vale.Math.Poly2.Galois.Lemmas.fmul a (Vale.Math.Poly2.Galois.Lemmas.fadd b c) ==
Vale.Math.Poly2.Galois.Lemmas.fadd (Vale.Math.Poly2.Galois.Lemmas.fmul a b)
(Vale.Math.P... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.GaloisField.field",
"Spec.GaloisField.felem",
"Prims.unit",
"Vale.Math.Poly2.Galois.Lemmas.lemma_mul_commute",
"Vale.Math.Poly2.Galois.Lemmas.fadd",
"Vale.Math.Poly2.Galois.Lemmas.lemma_mul_distribute_left"
] | [] | true | false | true | false | false | let lemma_mul_distribute_right #f a b c =
| lemma_mul_distribute_left b c a;
lemma_mul_commute a b;
lemma_mul_commute a c;
lemma_mul_commute a (fadd b c);
() | false |
Steel.ST.CancellableSpinLock.fst | Steel.ST.CancellableSpinLock.release | val release (#v:vprop) (c:cancellable_lock v)
: STT unit (v `star` can_release c) (fun _ -> emp) | val release (#v:vprop) (c:cancellable_lock v)
: STT unit (v `star` can_release c) (fun _ -> emp) | let release #v c =
intro_exists true (lock_inv_pred c.lref v);
release c.llock | {
"file_name": "lib/steel/Steel.ST.CancellableSpinLock.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 17,
"end_line": 70,
"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": [
"Steel.ST.Util.fsti.checked",
"Steel.ST.SpinLock.fsti.checked",
"Steel.ST.Reference.fsti.checked",
"Steel.ST.Effect.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fst... | [
{
"abbrev": true,
"full_module": "FStar.Ghost",
"short_module": "G"
},
{
"abbrev": false,
"full_module": "Steel.ST.SpinLock",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.ST.Reference",
"short_module": null
},
{
"abbrev": false,
"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 | c: Steel.ST.CancellableSpinLock.cancellable_lock v -> Steel.ST.Effect.STT Prims.unit | Steel.ST.Effect.STT | [] | [] | [
"Steel.Effect.Common.vprop",
"Steel.ST.CancellableSpinLock.cancellable_lock",
"Steel.ST.SpinLock.release",
"Steel.ST.CancellableSpinLock.lock_inv",
"Steel.ST.CancellableSpinLock.__proj__Mkcancellable_lock__item__lref",
"Steel.ST.CancellableSpinLock.__proj__Mkcancellable_lock__item__llock",
"Prims.unit",... | [] | false | true | false | false | false | let release #v c =
| intro_exists true (lock_inv_pred c.lref v);
release c.llock | false |
BinarySearchTreeBasic.fst | BinarySearchTreeBasic.delete | val delete : x:int -> t:tree{is_bst t} ->
Tot (r:tree{is_bst r /\ not (in_tree x r) /\
(forall y. x <> y ==> (in_tree y t = in_tree y r))}) (decreases t) | val delete : x:int -> t:tree{is_bst t} ->
Tot (r:tree{is_bst r /\ not (in_tree x r) /\
(forall y. x <> y ==> (in_tree y t = in_tree y r))}) (decreases t) | let rec delete x t = match t with
| Leaf -> Leaf
| Node n t1 t2 -> if n = x then
match t1, t2 with
| Leaf, Leaf -> Leaf
| _ , Leaf -> t1
| Leaf, _ -> t2
| _ -> let y = find_max t1 in
... | {
"file_name": "examples/data_structures/BinarySearchTreeBasic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 144,
"start_col": 0,
"start_line": 134
} | (*
Copyright 2008-2018 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",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTreeBasic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"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 | x: Prims.int -> t: BinarySearchTreeBasic.tree{BinarySearchTreeBasic.is_bst t}
-> Prims.Tot
(r:
BinarySearchTreeBasic.tree
{ BinarySearchTreeBasic.is_bst r /\ Prims.op_Negation (BinarySearchTreeBasic.in_tree x r) /\
(forall (y: Prims.int).
x <> y ==> BinarySearchTreeBasic.in_t... | Prims.Tot | [
"total",
""
] | [] | [
"Prims.int",
"BinarySearchTreeBasic.tree",
"Prims.b2t",
"BinarySearchTreeBasic.is_bst",
"BinarySearchTreeBasic.Leaf",
"Prims.op_Equality",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple2",
"BinarySearchTreeBasic.Node",
"BinarySearchTreeBasic.delete",
"Prims.l_and",
"BinaryS... | [
"recursion"
] | false | false | false | false | false | let rec delete x t =
| match t with
| Leaf -> Leaf
| Node n t1 t2 ->
if n = x
then
match t1, t2 with
| Leaf, Leaf -> Leaf
| _, Leaf -> t1
| Leaf, _ -> t2
| _ ->
let y = find_max t1 in
Node y (delete y t1) t2
else if x < n then Node n (delete x t1) t2 else Node n t1 (delete x t2) | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.lemma_append_inj_r | val lemma_append_inj_r: #a:Type -> s1:seq a -> s2:seq a -> t1:seq a -> t2:seq a{length s1 = length t1 /\ length s2 = length t2 /\ equal (append s1 s2) (append t1 t2)} -> i:nat{i < length s2}
-> Lemma (ensures (index s2 i == index t2 i)) | val lemma_append_inj_r: #a:Type -> s1:seq a -> s2:seq a -> t1:seq a -> t2:seq a{length s1 = length t1 /\ length s2 = length t2 /\ equal (append s1 s2) (append t1 t2)} -> i:nat{i < length s2}
-> Lemma (ensures (index s2 i == index t2 i)) | let lemma_append_inj_r #_ s1 s2 t1 t2 i =
assert (index s2 i == (index (append s1 s2) (i + length s1)));
assert (index t2 i == (index (append t1 t2) (i + length t1))) | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 63,
"end_line": 28,
"start_col": 0,
"start_line": 26
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: FStar.Seq.Base.seq a ->
s2: FStar.Seq.Base.seq a ->
t1: FStar.Seq.Base.seq a ->
t2:
FStar.Seq.Base.seq a
{ FStar.Seq.Base.length s1 = FStar.Seq.Base.length t1 /\
FStar.Seq.Base.length s2 = FStar.Seq.Base.length t2 /\
FStar.Seq.Base.equal (FStar.Seq.Base.append s1 s... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.l_and",
"Prims.b2t",
"Prims.op_Equality",
"Prims.nat",
"FStar.Seq.Base.length",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.append",
"Prims.op_LessThan",
"Prims._assert",
"Prims.eq2",
"FStar.Seq.Base.index",
"Prims.op_Addition",
"Prims.unit"
] | [] | true | false | true | false | false | let lemma_append_inj_r #_ s1 s2 t1 t2 i =
| assert (index s2 i == (index (append s1 s2) (i + length s1)));
assert (index t2 i == (index (append t1 t2) (i + length t1))) | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.mem_index | val mem_index (#a:eqtype) (x:a) (s:seq a)
: Lemma (requires (mem x s))
(ensures (exists i. index s i == x)) | val mem_index (#a:eqtype) (x:a) (s:seq a)
: Lemma (requires (mem x s))
(ensures (exists i. index s i == x)) | let mem_index = mem_index' | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 60,
"start_col": 0,
"start_line": 60
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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 | x: a -> s: FStar.Seq.Base.seq a
-> FStar.Pervasives.Lemma (requires FStar.Seq.Properties.mem x s)
(ensures exists (i: Prims.nat{i < FStar.Seq.Base.length s}). FStar.Seq.Base.index s i == x) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Properties.mem_index'"
] | [] | true | false | true | false | false | let mem_index =
| mem_index' | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.lemma_append_len_disj | val lemma_append_len_disj: #a:Type -> s1:seq a -> s2:seq a -> t1:seq a -> t2:seq a {(length s1 = length t1 \/ length s2 = length t2) /\ (equal (append s1 s2) (append t1 t2))}
-> Lemma (ensures (length s1 = length t1 /\ length s2 = length t2)) | val lemma_append_len_disj: #a:Type -> s1:seq a -> s2:seq a -> t1:seq a -> t2:seq a {(length s1 = length t1 \/ length s2 = length t2) /\ (equal (append s1 s2) (append t1 t2))}
-> Lemma (ensures (length s1 = length t1 /\ length s2 = length t2)) | let lemma_append_len_disj #_ s1 s2 t1 t2 =
cut (length (append s1 s2) == length s1 + length s2);
cut (length (append t1 t2) == length t1 + length t2) | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 32,
"start_col": 0,
"start_line": 30
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: FStar.Seq.Base.seq a ->
s2: FStar.Seq.Base.seq a ->
t1: FStar.Seq.Base.seq a ->
t2:
FStar.Seq.Base.seq a
{ (FStar.Seq.Base.length s1 = FStar.Seq.Base.length t1 \/
FStar.Seq.Base.length s2 = FStar.Seq.Base.length t2) /\
FStar.Seq.Base.equal (FStar.Seq.Base.append ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.l_and",
"Prims.l_or",
"Prims.b2t",
"Prims.op_Equality",
"Prims.nat",
"FStar.Seq.Base.length",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.append",
"Prims.cut",
"Prims.eq2",
"Prims.int",
"Prims.op_Addition",
"Prims.unit"
] | [] | true | false | true | false | false | let lemma_append_len_disj #_ s1 s2 t1 t2 =
| cut (length (append s1 s2) == length s1 + length s2);
cut (length (append t1 t2) == length t1 + length t2) | false |
BinarySearchTreeBasic.fst | BinarySearchTreeBasic.delete_lemma | val delete_lemma : x:int -> t:tree{is_bst t} ->
Lemma (ensures (is_bst (delete' x t) /\ not (in_tree x (delete' x t)) /\
(forall y. x <> y ==> (in_tree y (delete' x t) = in_tree y t))))
(decreases t) | val delete_lemma : x:int -> t:tree{is_bst t} ->
Lemma (ensures (is_bst (delete' x t) /\ not (in_tree x (delete' x t)) /\
(forall y. x <> y ==> (in_tree y (delete' x t) = in_tree y t))))
(decreases t) | let rec delete_lemma x t = match t with
| Leaf -> ()
| Node n t1 t2 ->
if x <> n then (delete_lemma x t1; delete_lemma x t2)
else if Node? t1 then (find_max_lemma t1; delete_lemma (find_max' t1) t1) | {
"file_name": "examples/data_structures/BinarySearchTreeBasic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 78,
"end_line": 168,
"start_col": 0,
"start_line": 164
} | (*
Copyright 2008-2018 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",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "BinarySearchTreeBasic.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"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 | x: Prims.int -> t: BinarySearchTreeBasic.tree{BinarySearchTreeBasic.is_bst t}
-> FStar.Pervasives.Lemma
(ensures
BinarySearchTreeBasic.is_bst (BinarySearchTreeBasic.delete' x t) /\
Prims.op_Negation (BinarySearchTreeBasic.in_tree x (BinarySearchTreeBasic.delete' x t)) /\
(forall (y: Prim... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.int",
"BinarySearchTreeBasic.tree",
"Prims.b2t",
"BinarySearchTreeBasic.is_bst",
"Prims.op_disEquality",
"BinarySearchTreeBasic.delete_lemma",
"Prims.unit",
"Prims.bool",
"BinarySearchTreeBasic.uu___is_Node",
"BinarySearchTreeBasic.find_max'",
"BinarySearchTreeBasic.find_max_lemma"
] | [
"recursion"
] | false | false | true | false | false | let rec delete_lemma x t =
| match t with
| Leaf -> ()
| Node n t1 t2 ->
if x <> n
then
(delete_lemma x t1;
delete_lemma x t2)
else
if Node? t1
then
(find_max_lemma t1;
delete_lemma (find_max' t1) t1) | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.lemma_cons_inj | val lemma_cons_inj: #a:Type -> v1:a -> v2:a -> s1:seq a -> s2:seq a
-> Lemma (requires (equal (cons v1 s1) (cons v2 s2)))
(ensures (v1 == v2 /\ equal s1 s2)) | val lemma_cons_inj: #a:Type -> v1:a -> v2:a -> s1:seq a -> s2:seq a
-> Lemma (requires (equal (cons v1 s1) (cons v2 s2)))
(ensures (v1 == v2 /\ equal s1 s2)) | let lemma_cons_inj #_ v1 v2 s1 s2 =
let t1 = create 1 v1 in
let t2 = create 1 v2 in
lemma_append_inj t1 s1 t2 s2;
assert(index t1 0 == index t2 0) | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 47,
"start_col": 0,
"start_line": 43
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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 | v1: a -> v2: a -> s1: FStar.Seq.Base.seq a -> s2: FStar.Seq.Base.seq a
-> FStar.Pervasives.Lemma
(requires FStar.Seq.Base.equal (FStar.Seq.Base.cons v1 s1) (FStar.Seq.Base.cons v2 s2))
(ensures v1 == v2 /\ FStar.Seq.Base.equal s1 s2) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Prims._assert",
"Prims.eq2",
"FStar.Seq.Base.index",
"Prims.unit",
"FStar.Seq.Properties.lemma_append_inj",
"FStar.Seq.Base.create"
] | [] | true | false | true | false | false | let lemma_cons_inj #_ v1 v2 s1 s2 =
| let t1 = create 1 v1 in
let t2 = create 1 v2 in
lemma_append_inj t1 s1 t2 s2;
assert (index t1 0 == index t2 0) | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.lemma_append_inj_l | val lemma_append_inj_l: #a:Type -> s1:seq a -> s2:seq a -> t1:seq a -> t2:seq a{length s1 = length t1 /\ equal (append s1 s2) (append t1 t2)} -> i:nat{i < length s1}
-> Lemma (index s1 i == index t1 i) | val lemma_append_inj_l: #a:Type -> s1:seq a -> s2:seq a -> t1:seq a -> t2:seq a{length s1 = length t1 /\ equal (append s1 s2) (append t1 t2)} -> i:nat{i < length s1}
-> Lemma (index s1 i == index t1 i) | let lemma_append_inj_l #_ s1 s2 t1 t2 i =
assert (index s1 i == (index (append s1 s2) i));
assert (index t1 i == (index (append t1 t2) i)) | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 24,
"start_col": 0,
"start_line": 22
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: FStar.Seq.Base.seq a ->
s2: FStar.Seq.Base.seq a ->
t1: FStar.Seq.Base.seq a ->
t2:
FStar.Seq.Base.seq a
{ FStar.Seq.Base.length s1 = FStar.Seq.Base.length t1 /\
FStar.Seq.Base.equal (FStar.Seq.Base.append s1 s2) (FStar.Seq.Base.append t1 t2) } ->
i: Prims.nat{i < FStar.... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.l_and",
"Prims.b2t",
"Prims.op_Equality",
"Prims.nat",
"FStar.Seq.Base.length",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.append",
"Prims.op_LessThan",
"Prims._assert",
"Prims.eq2",
"FStar.Seq.Base.index",
"Prims.unit"
] | [] | true | false | true | false | false | let lemma_append_inj_l #_ s1 s2 t1 t2 i =
| assert (index s1 i == (index (append s1 s2) i));
assert (index t1 i == (index (append t1 t2) i)) | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.lemma_tail_append | val lemma_tail_append: #a:Type -> s1:seq a{length s1 > 0} -> s2:seq a -> Lemma
(tail (append s1 s2) == append (tail s1) s2) | val lemma_tail_append: #a:Type -> s1:seq a{length s1 > 0} -> s2:seq a -> Lemma
(tail (append s1 s2) == append (tail s1) s2) | let lemma_tail_append #_ s1 s2 = cut (equal (tail (append s1 s2)) (append (tail s1) s2)) | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 88,
"end_line": 41,
"start_col": 0,
"start_line": 41
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: FStar.Seq.Base.seq a {FStar.Seq.Base.length s1 > 0} -> s2: FStar.Seq.Base.seq a
-> FStar.Pervasives.Lemma
(ensures
FStar.Seq.Properties.tail (FStar.Seq.Base.append s1 s2) ==
FStar.Seq.Base.append (FStar.Seq.Properties.tail s1) s2) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.Seq.Base.length",
"Prims.cut",
"FStar.Seq.Base.equal",
"FStar.Seq.Properties.tail",
"FStar.Seq.Base.append",
"Prims.unit"
] | [] | true | false | true | false | false | let lemma_tail_append #_ s1 s2 =
| cut (equal (tail (append s1 s2)) (append (tail s1) s2)) | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.lemma_append_inj | val lemma_append_inj: #a:Type -> s1:seq a -> s2:seq a -> t1:seq a -> t2:seq a {length s1 = length t1 \/ length s2 = length t2}
-> Lemma (requires (equal (append s1 s2) (append t1 t2)))
(ensures (equal s1 t1 /\ equal s2 t2)) | val lemma_append_inj: #a:Type -> s1:seq a -> s2:seq a -> t1:seq a -> t2:seq a {length s1 = length t1 \/ length s2 = length t2}
-> Lemma (requires (equal (append s1 s2) (append t1 t2)))
(ensures (equal s1 t1 /\ equal s2 t2)) | let lemma_append_inj #_ s1 s2 t1 t2 =
lemma_append_len_disj s1 s2 t1 t2;
FStar.Classical.forall_intro #(i:nat{i < length s1}) #(fun i -> index s1 i == index t1 i) (lemma_append_inj_l s1 s2 t1 t2);
FStar.Classical.forall_intro #(i:nat{i < length s2}) #(fun i -> index s2 i == index t2 i) (lemma_append_inj_r s1 s2 t... | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 124,
"end_line": 37,
"start_col": 0,
"start_line": 34
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: FStar.Seq.Base.seq a ->
s2: FStar.Seq.Base.seq a ->
t1: FStar.Seq.Base.seq a ->
t2:
FStar.Seq.Base.seq a
{ FStar.Seq.Base.length s1 = FStar.Seq.Base.length t1 \/
FStar.Seq.Base.length s2 = FStar.Seq.Base.length t2 }
-> FStar.Pervasives.Lemma
(requires FStar.Seq.Base.... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.l_or",
"Prims.b2t",
"Prims.op_Equality",
"Prims.nat",
"FStar.Seq.Base.length",
"FStar.Classical.forall_intro",
"Prims.op_LessThan",
"Prims.eq2",
"FStar.Seq.Base.index",
"FStar.Seq.Properties.lemma_append_inj_r",
"Prims.unit",
"FStar.Seq.Properties.lemma_append_in... | [] | false | false | true | false | false | let lemma_append_inj #_ s1 s2 t1 t2 =
| lemma_append_len_disj s1 s2 t1 t2;
FStar.Classical.forall_intro #(i: nat{i < length s1})
#(fun i -> index s1 i == index t1 i)
(lemma_append_inj_l s1 s2 t1 t2);
FStar.Classical.forall_intro #(i: nat{i < length s2})
#(fun i -> index s2 i == index t2 i)
(lemma_append_inj_r s1 s2 t1 t2) | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.lemma_split | val lemma_split : #a:Type -> s:seq a -> i:nat{(0 <= i /\ i <= length s)} -> Lemma
(ensures (append (fst (split s i)) (snd (split s i)) == s)) | val lemma_split : #a:Type -> s:seq a -> i:nat{(0 <= i /\ i <= length s)} -> Lemma
(ensures (append (fst (split s i)) (snd (split s i)) == s)) | let lemma_split #_ s i =
cut (equal (append (fst (split s i)) (snd (split s i))) s) | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 50,
"start_col": 0,
"start_line": 49
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: FStar.Seq.Base.seq a -> i: Prims.nat{0 <= i /\ i <= FStar.Seq.Base.length s}
-> FStar.Pervasives.Lemma
(ensures
FStar.Seq.Base.append (FStar.Pervasives.Native.fst (FStar.Seq.Properties.split s i))
(FStar.Pervasives.Native.snd (FStar.Seq.Properties.split s i)) ==
s) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Seq.Base.length",
"Prims.cut",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.append",
"FStar.Pervasives.Native.fst",
"FStar.Seq.Properties.split",
"FStar.Pervasives.Native.snd",
"Prims.unit"
] | [] | true | false | true | false | false | let lemma_split #_ s i =
| cut (equal (append (fst (split s i)) (snd (split s i))) s) | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.sorted_feq | val sorted_feq (#a:Type)
(f g : (a -> a -> Tot bool))
(s:seq a{forall x y. f x y == g x y})
: Lemma (ensures (sorted f s <==> sorted g s)) | val sorted_feq (#a:Type)
(f g : (a -> a -> Tot bool))
(s:seq a{forall x y. f x y == g x y})
: Lemma (ensures (sorted f s <==> sorted g s)) | let sorted_feq = sorted_feq' | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 28,
"end_line": 92,
"start_col": 0,
"start_line": 92
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: (_: a -> _: a -> Prims.bool) ->
g: (_: a -> _: a -> Prims.bool) ->
s: FStar.Seq.Base.seq a {forall (x: a) (y: a). f x y == g x y}
-> FStar.Pervasives.Lemma
(ensures FStar.Seq.Properties.sorted f s <==> FStar.Seq.Properties.sorted g s) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Properties.sorted_feq'"
] | [] | true | false | true | false | false | let sorted_feq =
| sorted_feq' | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.lemma_append_count | val lemma_append_count: #a:eqtype -> lo:seq a -> hi:seq a -> Lemma
(requires True)
(ensures (forall x. count x (append lo hi) = (count x lo + count x hi))) | val lemma_append_count: #a:eqtype -> lo:seq a -> hi:seq a -> Lemma
(requires True)
(ensures (forall x. count x (append lo hi) = (count x lo + count x hi))) | let lemma_append_count = lemma_append_count' | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 108,
"start_col": 0,
"start_line": 108
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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 | lo: FStar.Seq.Base.seq a -> hi: FStar.Seq.Base.seq a
-> FStar.Pervasives.Lemma
(ensures
forall (x: a).
FStar.Seq.Properties.count x (FStar.Seq.Base.append lo hi) =
FStar.Seq.Properties.count x lo + FStar.Seq.Properties.count x hi) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Properties.lemma_append_count'"
] | [] | true | false | true | false | false | let lemma_append_count =
| lemma_append_count' | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.lemma_slice_first_in_append' | val lemma_slice_first_in_append' (#a: Type) (s1 s2: seq a) (i: nat{i <= length s1})
: Lemma
(ensures
(equal (slice (append s1 s2) i (length (append s1 s2))) (append (slice s1 i (length s1)) s2)
)) (decreases (length s1)) | val lemma_slice_first_in_append' (#a: Type) (s1 s2: seq a) (i: nat{i <= length s1})
: Lemma
(ensures
(equal (slice (append s1 s2) i (length (append s1 s2))) (append (slice s1 i (length s1)) s2)
)) (decreases (length s1)) | let rec lemma_slice_first_in_append' (#a:Type) (s1:seq a) (s2:seq a)
(i:nat{i <= length s1})
: Lemma
(ensures (equal (slice (append s1 s2) i (length (append s1 s2))) (append (slice s1 i (length s1)) s2)))
(decreases (length s1))
= if i = 0 then ()
else lemma_slice_first_in_append' (tail s1) s2 (i - 1) | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 56,
"end_line": 70,
"start_col": 0,
"start_line": 64
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s1: FStar.Seq.Base.seq a -> s2: FStar.Seq.Base.seq a -> i: Prims.nat{i <= FStar.Seq.Base.length s1}
-> FStar.Pervasives.Lemma
(ensures
FStar.Seq.Base.equal (FStar.Seq.Base.slice (FStar.Seq.Base.append s1 s2)
i
(FStar.Seq.Base.length (FStar.Seq.Base.append s1 s2)))
(... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Seq.Base.length",
"Prims.op_Equality",
"Prims.int",
"Prims.bool",
"FStar.Seq.Properties.lemma_slice_first_in_append'",
"FStar.Seq.Properties.tail",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.l_True",
"Prim... | [
"recursion"
] | false | false | true | false | false | let rec lemma_slice_first_in_append' (#a: Type) (s1 s2: seq a) (i: nat{i <= length s1})
: Lemma
(ensures
(equal (slice (append s1 s2) i (length (append s1 s2))) (append (slice s1 i (length s1)) s2)
)) (decreases (length s1)) =
| if i = 0 then () else lemma_slice_first_in_append' (tail s1) s2 (i - 1) | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.slice_upd | val slice_upd: #a:Type -> s:seq a -> i:nat -> j:nat{i <= j /\ j <= length s}
-> k:nat{k < length s} -> v:a -> Lemma
(requires k < i \/ j <= k)
(ensures slice (upd s k v) i j == slice s i j)
[SMTPat (slice (upd s k v) i j)] | val slice_upd: #a:Type -> s:seq a -> i:nat -> j:nat{i <= j /\ j <= length s}
-> k:nat{k < length s} -> v:a -> Lemma
(requires k < i \/ j <= k)
(ensures slice (upd s k v) i j == slice s i j)
[SMTPat (slice (upd s k v) i j)] | let slice_upd #_ s i j k v =
lemma_eq_intro (slice (upd s k v) i j) (slice s i j) | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 75,
"start_col": 0,
"start_line": 74
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: FStar.Seq.Base.seq a ->
i: Prims.nat ->
j: Prims.nat{i <= j /\ j <= FStar.Seq.Base.length s} ->
k: Prims.nat{k < FStar.Seq.Base.length s} ->
v: a
-> FStar.Pervasives.Lemma (requires k < i \/ j <= k)
(ensures FStar.Seq.Base.slice (FStar.Seq.Base.upd s k v) i j == FStar.Seq.Base.slice s i ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Seq.Base.length",
"Prims.op_LessThan",
"FStar.Seq.Base.lemma_eq_intro",
"FStar.Seq.Base.slice",
"FStar.Seq.Base.upd",
"Prims.unit"
] | [] | true | false | true | false | false | let slice_upd #_ s i j k v =
| lemma_eq_intro (slice (upd s k v) i j) (slice s i j) | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.lemma_mem_count | val lemma_mem_count: #a:eqtype -> s:seq a -> f:(a -> Tot bool) -> Lemma
(requires (forall (i:nat{i<length s}). f (index s i)))
(ensures (forall (x:a). mem x s ==> f x)) | val lemma_mem_count: #a:eqtype -> s:seq a -> f:(a -> Tot bool) -> Lemma
(requires (forall (i:nat{i<length s}). f (index s i)))
(ensures (forall (x:a). mem x s ==> f x)) | let lemma_mem_count = lemma_mem_count' | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 125,
"start_col": 0,
"start_line": 125
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: FStar.Seq.Base.seq a -> f: (_: a -> Prims.bool)
-> FStar.Pervasives.Lemma
(requires forall (i: Prims.nat{i < FStar.Seq.Base.length s}). f (FStar.Seq.Base.index s i))
(ensures forall (x: a). FStar.Seq.Properties.mem x s ==> f x) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Properties.lemma_mem_count'"
] | [] | true | false | true | false | false | let lemma_mem_count =
| lemma_mem_count' | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.sorted_feq' | val sorted_feq' (#a: Type) (f g: (a -> a -> Tot bool)) (s: seq a {forall x y. f x y == g x y})
: Lemma (ensures (sorted f s <==> sorted g s)) (decreases (length s)) | val sorted_feq' (#a: Type) (f g: (a -> a -> Tot bool)) (s: seq a {forall x y. f x y == g x y})
: Lemma (ensures (sorted f s <==> sorted g s)) (decreases (length s)) | let rec sorted_feq' (#a:Type)
(f g : (a -> a -> Tot bool))
(s:seq a{forall x y. f x y == g x y})
: Lemma (ensures (sorted f s <==> sorted g s))
(decreases (length s))
= if length s <= 1 then ()
else sorted_feq' f g (tail s) | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 90,
"start_col": 0,
"start_line": 84
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
f: (_: a -> _: a -> Prims.bool) ->
g: (_: a -> _: a -> Prims.bool) ->
s: FStar.Seq.Base.seq a {forall (x: a) (y: a). f x y == g x y}
-> FStar.Pervasives.Lemma
(ensures FStar.Seq.Properties.sorted f s <==> FStar.Seq.Properties.sorted g s)
(decreases FStar.Seq.Base.length s) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.bool",
"FStar.Seq.Base.seq",
"Prims.l_Forall",
"Prims.eq2",
"Prims.op_LessThanOrEqual",
"FStar.Seq.Base.length",
"FStar.Seq.Properties.sorted_feq'",
"FStar.Seq.Properties.tail",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_iff",
"Prims.b2t",
"FStar.Seq.Properties.sorted",
... | [
"recursion"
] | false | false | true | false | false | let rec sorted_feq' (#a: Type) (f g: (a -> a -> Tot bool)) (s: seq a {forall x y. f x y == g x y})
: Lemma (ensures (sorted f s <==> sorted g s)) (decreases (length s)) =
| if length s <= 1 then () else sorted_feq' f g (tail s) | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.sorted_concat_lemma | val sorted_concat_lemma: #a:eqtype
-> f:(a -> a -> Tot bool){total_order a f}
-> lo:seq a{sorted f lo}
-> pivot:a
-> hi:seq a{sorted f hi}
-> Lemma (requires (forall y. (mem y lo ==> f y pivot)
... | val sorted_concat_lemma: #a:eqtype
-> f:(a -> a -> Tot bool){total_order a f}
-> lo:seq a{sorted f lo}
-> pivot:a
-> hi:seq a{sorted f hi}
-> Lemma (requires (forall y. (mem y lo ==> f y pivot)
... | let sorted_concat_lemma = sorted_concat_lemma' | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 148,
"start_col": 0,
"start_line": 148
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: (_: a -> _: a -> Prims.bool){FStar.Seq.Properties.total_order a f} ->
lo: FStar.Seq.Base.seq a {FStar.Seq.Properties.sorted f lo} ->
pivot: a ->
hi: FStar.Seq.Base.seq a {FStar.Seq.Properties.sorted f hi}
-> FStar.Pervasives.Lemma
(requires
forall (y: a).
(FStar.Seq.Propert... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Properties.sorted_concat_lemma'"
] | [] | true | false | true | false | false | let sorted_concat_lemma =
| sorted_concat_lemma' | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.lemma_slice_first_in_append | val lemma_slice_first_in_append: #a:Type -> s1:seq a -> s2:seq a -> i:nat{i <= length s1} -> Lemma
(ensures (equal (slice (append s1 s2) i (length (append s1 s2))) (append (slice s1 i (length s1)) s2))) | val lemma_slice_first_in_append: #a:Type -> s1:seq a -> s2:seq a -> i:nat{i <= length s1} -> Lemma
(ensures (equal (slice (append s1 s2) i (length (append s1 s2))) (append (slice s1 i (length s1)) s2))) | let lemma_slice_first_in_append = lemma_slice_first_in_append' | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 72,
"start_col": 0,
"start_line": 72
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: FStar.Seq.Base.seq a -> s2: FStar.Seq.Base.seq a -> i: Prims.nat{i <= FStar.Seq.Base.length s1}
-> FStar.Pervasives.Lemma
(ensures
FStar.Seq.Base.equal (FStar.Seq.Base.slice (FStar.Seq.Base.append s1 s2)
i
(FStar.Seq.Base.length (FStar.Seq.Base.append s1 s2)))
(FStar.Seq.... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Properties.lemma_slice_first_in_append'"
] | [] | true | false | true | false | false | let lemma_slice_first_in_append =
| lemma_slice_first_in_append' | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.lemma_append_count_aux | val lemma_append_count_aux: #a:eqtype -> x:a -> lo:seq a -> hi:seq a -> Lemma
(requires True)
(ensures (count x (append lo hi) = (count x lo + count x hi))) | val lemma_append_count_aux: #a:eqtype -> x:a -> lo:seq a -> hi:seq a -> Lemma
(requires True)
(ensures (count x (append lo hi) = (count x lo + count x hi))) | let lemma_append_count_aux #_ _ lo hi = lemma_append_count lo hi | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 64,
"end_line": 110,
"start_col": 0,
"start_line": 110
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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 | x: a -> lo: FStar.Seq.Base.seq a -> hi: FStar.Seq.Base.seq a
-> FStar.Pervasives.Lemma
(ensures
FStar.Seq.Properties.count x (FStar.Seq.Base.append lo hi) =
FStar.Seq.Properties.count x lo + FStar.Seq.Properties.count x hi) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.Seq.Base.seq",
"FStar.Seq.Properties.lemma_append_count",
"Prims.unit"
] | [] | true | false | true | false | false | let lemma_append_count_aux #_ _ lo hi =
| lemma_append_count lo hi | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.upd_slice | val upd_slice: #a:Type -> s:seq a -> i:nat -> j:nat{i <= j /\ j <= length s}
-> k:nat{k < j - i} -> v:a -> Lemma
(requires i + k < j)
(ensures upd (slice s i j) k v == slice (upd s (i + k) v) i j)
[SMTPat (upd (slice s i j) k v)] | val upd_slice: #a:Type -> s:seq a -> i:nat -> j:nat{i <= j /\ j <= length s}
-> k:nat{k < j - i} -> v:a -> Lemma
(requires i + k < j)
(ensures upd (slice s i j) k v == slice (upd s (i + k) v) i j)
[SMTPat (upd (slice s i j) k v)] | let upd_slice #_ s i j k v =
lemma_eq_intro (upd (slice s i j) k v) (slice (upd s (i + k) v) i j) | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 70,
"end_line": 78,
"start_col": 0,
"start_line": 77
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: FStar.Seq.Base.seq a ->
i: Prims.nat ->
j: Prims.nat{i <= j /\ j <= FStar.Seq.Base.length s} ->
k: Prims.nat{k < j - i} ->
v: a
-> FStar.Pervasives.Lemma (requires i + k < j)
(ensures
FStar.Seq.Base.upd (FStar.Seq.Base.slice s i j) k v ==
FStar.Seq.Base.slice (FStar.Seq.B... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Seq.Base.length",
"Prims.op_LessThan",
"Prims.op_Subtraction",
"FStar.Seq.Base.lemma_eq_intro",
"FStar.Seq.Base.upd",
"FStar.Seq.Base.slice",
"Prims.op_Addition",
"Prims.unit"
] | [] | true | false | true | false | false | let upd_slice #_ s i j k v =
| lemma_eq_intro (upd (slice s i j) k v) (slice (upd s (i + k) v) i j) | false |
Hacl.Impl.HPKE.fsti | Hacl.Impl.HPKE.openBase_st | val openBase_st : cs: Spec.Agile.HPKE.ciphersuite -> p: Type0 -> Type0 | let openBase_st (cs:S.ciphersuite) (p:Type0) =
pkE: key_dh_public cs { S.is_valid_not_export_only_ciphersuite cs }
-> skR: key_dh_secret cs
-> infolen: size_t {v infolen <= max_length_info (S.hash_of_cs cs)}
-> info: lbuffer uint8 infolen
-> aadlen: size_t {v aadlen <= SAEAD.max_length (S.aead_alg_of cs)}
... | {
"file_name": "code/hpke/Hacl.Impl.HPKE.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 8,
"end_line": 160,
"start_col": 0,
"start_line": 133
} | module Hacl.Impl.HPKE
open FStar.HyperStack
open FStar.HyperStack.All
module B = LowStar.Buffer
open Lib.Buffer
open Lib.IntTypes
module S = Spec.Agile.HPKE
module SAEAD = Spec.Agile.AEAD
#set-options "--z3rlimit 20 --max_fuel 0 --max_ifuel 0"
inline_for_extraction noextract
let key_dh_public (cs:S.ciphersuite) = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.AEAD.fsti.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "Spec.Agile.AEAD",
"short_module": "SAEAD"
},
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"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 | cs: Spec.Agile.HPKE.ciphersuite -> p: Type0 -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Agile.HPKE.ciphersuite",
"Hacl.Impl.HPKE.key_dh_public",
"Prims.b2t",
"Spec.Agile.HPKE.is_valid_not_export_only_ciphersuite",
"Hacl.Impl.HPKE.key_dh_secret",
"Lib.IntTypes.size_t",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Impl.HPKE.max_len... | [] | false | false | false | true | true | let openBase_st (cs: S.ciphersuite) (p: Type0) =
|
pkE: key_dh_public cs {S.is_valid_not_export_only_ciphersuite cs} ->
skR: key_dh_secret cs ->
infolen: size_t{v infolen <= max_length_info (S.hash_of_cs cs)} ->
info: lbuffer uint8 infolen ->
aadlen: size_t{v aadlen <= SAEAD.max_length (S.aead_alg_of cs)} ->
aad: lbuffer uint8 aadlen ->
ctl... | false | |
FStar.Seq.Properties.fst | FStar.Seq.Properties.mem_index' | val mem_index' (#a: eqtype) (x: a) (s: seq a)
: Lemma (requires (mem x s)) (ensures (exists i. index s i == x)) (decreases (length s)) | val mem_index' (#a: eqtype) (x: a) (s: seq a)
: Lemma (requires (mem x s)) (ensures (exists i. index s i == x)) (decreases (length s)) | let rec mem_index' (#a:eqtype) (x:a) (s:seq a)
: Lemma (requires (mem x s))
(ensures (exists i. index s i == x))
(decreases (length s))
= if length s = 0 then ()
else if head s = x then ()
else mem_index' x (tail s) | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 58,
"start_col": 0,
"start_line": 52
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: a -> s: FStar.Seq.Base.seq a
-> FStar.Pervasives.Lemma (requires FStar.Seq.Properties.mem x s)
(ensures exists (i: Prims.nat{i < FStar.Seq.Base.length s}). FStar.Seq.Base.index s i == x)
(decreases FStar.Seq.Base.length s) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.eqtype",
"FStar.Seq.Base.seq",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"Prims.bool",
"FStar.Seq.Properties.head",
"FStar.Seq.Properties.mem_index'",
"FStar.Seq.Properties.tail",
"Prims.unit",
"Prims.b2t",
"FStar.Seq.Properties.mem",
"Prims.squash",
"Prims.l_Exists... | [
"recursion"
] | false | false | true | false | false | let rec mem_index' (#a: eqtype) (x: a) (s: seq a)
: Lemma (requires (mem x s)) (ensures (exists i. index s i == x)) (decreases (length s)) =
| if length s = 0 then () else if head s = x then () else mem_index' x (tail s) | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.perm_len | val perm_len (#a:eqtype) (s1 s2: seq a)
: Lemma (requires (permutation a s1 s2))
(ensures (length s1 == length s2)) | val perm_len (#a:eqtype) (s1 s2: seq a)
: Lemma (requires (permutation a s1 s2))
(ensures (length s1 == length s2)) | let perm_len = perm_len' | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 238,
"start_col": 0,
"start_line": 238
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: FStar.Seq.Base.seq a -> s2: FStar.Seq.Base.seq a
-> FStar.Pervasives.Lemma (requires FStar.Seq.Properties.permutation a s1 s2)
(ensures FStar.Seq.Base.length s1 == FStar.Seq.Base.length s2) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Properties.perm_len'"
] | [] | true | false | true | false | false | let perm_len =
| perm_len' | false |
Hacl.Impl.HPKE.fsti | Hacl.Impl.HPKE.setupBaseS_st | val setupBaseS_st : cs: Spec.Agile.HPKE.ciphersuite -> p: Type0 -> Type0 | let setupBaseS_st (cs:S.ciphersuite) (p:Type0) =
o_pkE: key_dh_public cs
-> o_ctx: context_s cs
-> skE: key_dh_secret cs
-> pkR: serialized_point_dh cs
-> infolen: size_t{v infolen <= max_length_info (S.hash_of_cs cs)}
-> info: lbuffer uint8 infolen
-> Stack UInt32.t
(requires fun h0 ->
p ... | {
"file_name": "code/hpke/Hacl.Impl.HPKE.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 6,
"end_line": 67,
"start_col": 0,
"start_line": 42
} | module Hacl.Impl.HPKE
open FStar.HyperStack
open FStar.HyperStack.All
module B = LowStar.Buffer
open Lib.Buffer
open Lib.IntTypes
module S = Spec.Agile.HPKE
module SAEAD = Spec.Agile.AEAD
#set-options "--z3rlimit 20 --max_fuel 0 --max_ifuel 0"
inline_for_extraction noextract
let key_dh_public (cs:S.ciphersuite) = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.AEAD.fsti.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "Spec.Agile.AEAD",
"short_module": "SAEAD"
},
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"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 | cs: Spec.Agile.HPKE.ciphersuite -> p: Type0 -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Agile.HPKE.ciphersuite",
"Hacl.Impl.HPKE.key_dh_public",
"Hacl.Impl.HPKE.context_s",
"Hacl.Impl.HPKE.key_dh_secret",
"Hacl.Impl.HPKE.serialized_point_dh",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Impl.... | [] | false | false | false | true | true | let setupBaseS_st (cs: S.ciphersuite) (p: Type0) =
|
o_pkE: key_dh_public cs ->
o_ctx: context_s cs ->
skE: key_dh_secret cs ->
pkR: serialized_point_dh cs ->
infolen: size_t{v infolen <= max_length_info (S.hash_of_cs cs)} ->
info: lbuffer uint8 infolen
-> Stack UInt32.t
(requires
fun h0 ->
p /\ live h0 o_pkE /\ ctx_inva... | false | |
FStar.Seq.Properties.fst | FStar.Seq.Properties.lemma_count_slice | val lemma_count_slice: #a:eqtype -> s:seq a -> i:nat{i<=length s} -> Lemma
(requires True)
(ensures (forall x. count x s = count x (slice s 0 i) + count x (slice s i (length s)))) | val lemma_count_slice: #a:eqtype -> s:seq a -> i:nat{i<=length s} -> Lemma
(requires True)
(ensures (forall x. count x s = count x (slice s 0 i) + count x (slice s i (length s)))) | let lemma_count_slice #_ s i =
cut (equal s (append (slice s 0 i) (slice s i (length s))));
lemma_append_count (slice s 0 i) (slice s i (length s)) | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 57,
"end_line": 129,
"start_col": 0,
"start_line": 127
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: FStar.Seq.Base.seq a -> i: Prims.nat{i <= FStar.Seq.Base.length s}
-> FStar.Pervasives.Lemma
(ensures
forall (x: a).
FStar.Seq.Properties.count x s =
FStar.Seq.Properties.count x (FStar.Seq.Base.slice s 0 i) +
FStar.Seq.Properties.count x (FStar.Seq.Base.slice s i (FStar.Seq.Base.... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Seq.Base.length",
"FStar.Seq.Properties.lemma_append_count",
"FStar.Seq.Base.slice",
"Prims.unit",
"Prims.cut",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.append"
] | [] | true | false | true | false | false | let lemma_count_slice #_ s i =
| cut (equal s (append (slice s 0 i) (slice s i (length s))));
lemma_append_count (slice s 0 i) (slice s i (length s)) | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.append_permutations | val append_permutations: #a:eqtype -> s1:seq a -> s2:seq a -> s1':seq a -> s2':seq a -> Lemma
(requires permutation a s1 s1' /\ permutation a s2 s2')
(ensures permutation a (append s1 s2) (append s1' s2')) | val append_permutations: #a:eqtype -> s1:seq a -> s2:seq a -> s1':seq a -> s2':seq a -> Lemma
(requires permutation a s1 s1' /\ permutation a s2 s2')
(ensures permutation a (append s1 s2) (append s1' s2')) | let append_permutations #a s1 s2 s1' s2' =
(
lemma_append_count s1 s2;
lemma_append_count s1' s2'
) | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 196,
"start_col": 0,
"start_line": 192
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: FStar.Seq.Base.seq a ->
s2: FStar.Seq.Base.seq a ->
s1': FStar.Seq.Base.seq a ->
s2': FStar.Seq.Base.seq a
-> FStar.Pervasives.Lemma
(requires
FStar.Seq.Properties.permutation a s1 s1' /\ FStar.Seq.Properties.permutation a s2 s2')
(ensures
FStar.Seq.Properties.permutat... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.Seq.Base.seq",
"FStar.Seq.Properties.lemma_append_count",
"Prims.unit"
] | [] | true | false | true | false | false | let append_permutations #a s1 s2 s1' s2' =
| (lemma_append_count s1 s2;
lemma_append_count s1' s2') | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.lemma_mem_count' | val lemma_mem_count' (#a: eqtype) (s: seq a) (f: (a -> Tot bool))
: Lemma (requires (forall (i: nat{i < length s}). f (index s i)))
(ensures (forall (x: a). mem x s ==> f x))
(decreases (length s)) | val lemma_mem_count' (#a: eqtype) (s: seq a) (f: (a -> Tot bool))
: Lemma (requires (forall (i: nat{i < length s}). f (index s i)))
(ensures (forall (x: a). mem x s ==> f x))
(decreases (length s)) | let rec lemma_mem_count' (#a:eqtype) (s:seq a) (f:a -> Tot bool)
: Lemma
(requires (forall (i:nat{i<length s}). f (index s i)))
(ensures (forall (x:a). mem x s ==> f x))
(decreases (length s))
= if length s = 0
then ()
else (let t = i:nat{i<length (tail s)} in
cut (forall (i:t). index (tail s) i = ind... | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 123,
"start_col": 0,
"start_line": 114
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.Seq.Base.seq a -> f: (_: a -> Prims.bool)
-> FStar.Pervasives.Lemma
(requires forall (i: Prims.nat{i < FStar.Seq.Base.length s}). f (FStar.Seq.Base.index s i))
(ensures forall (x: a). FStar.Seq.Properties.mem x s ==> f x)
(decreases FStar.Seq.Base.length s) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.eqtype",
"FStar.Seq.Base.seq",
"Prims.bool",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.Seq.Properties.lemma_mem_count'",
"FStar.Seq.Properties.tail",
"Prims.unit",
"Prims.cut",
"Prims.l_Forall",
"Prims.b2t",
"FStar.Seq.Base.index",
"Prims.op_Addition",
"Pri... | [
"recursion"
] | false | false | true | false | false | let rec lemma_mem_count' (#a: eqtype) (s: seq a) (f: (a -> Tot bool))
: Lemma (requires (forall (i: nat{i < length s}). f (index s i)))
(ensures (forall (x: a). mem x s ==> f x))
(decreases (length s)) =
| if length s = 0
then ()
else
(let t = i: nat{i < length (tail s)} in
cut (forall (i: t). index (tail s) i = index s (i + 1));
lemma_mem_count' (tail s) f) | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.lemma_swap_permutes | val lemma_swap_permutes (#a:eqtype) (s:seq a) (i:nat{i<length s}) (j:nat{i <= j && j<length s})
: Lemma (permutation a s (swap s i j)) | val lemma_swap_permutes (#a:eqtype) (s:seq a) (i:nat{i<length s}) (j:nat{i <= j && j<length s})
: Lemma (permutation a s (swap s i j)) | let lemma_swap_permutes #a s i j
= FStar.Classical.forall_intro
#a
#(fun x -> count x s = count x (swap s i j))
(lemma_swap_permutes_aux s i j) | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 202,
"start_col": 0,
"start_line": 198
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: FStar.Seq.Base.seq a ->
i: Prims.nat{i < FStar.Seq.Base.length s} ->
j: Prims.nat{i <= j && j < FStar.Seq.Base.length s}
-> FStar.Pervasives.Lemma
(ensures FStar.Seq.Properties.permutation a s (FStar.Seq.Properties.swap s i j)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"Prims.op_AmpAmp",
"Prims.op_LessThanOrEqual",
"FStar.Classical.forall_intro",
"Prims.op_Equality",
"FStar.Seq.Properties.count",
"FStar.Seq.Properties.swap",
"FStar.Seq.Properties.l... | [] | false | false | true | false | false | let lemma_swap_permutes #a s i j =
| FStar.Classical.forall_intro #a
#(fun x -> count x s = count x (swap s i j))
(lemma_swap_permutes_aux s i j) | false |
Hacl.Impl.HPKE.fsti | Hacl.Impl.HPKE.sealBase_st | val sealBase_st : cs: Spec.Agile.HPKE.ciphersuite -> p: Type0 -> Type0 | let sealBase_st (cs:S.ciphersuite) (p:Type0) =
skE: key_dh_secret cs { S.is_valid_not_export_only_ciphersuite cs }
-> pkR: serialized_point_dh cs
-> infolen: size_t {v infolen <= max_length_info (S.hash_of_cs cs)}
-> info: lbuffer uint8 infolen
-> aadlen: size_t {v aadlen <= SAEAD.max_length (S.aead_alg_of... | {
"file_name": "code/hpke/Hacl.Impl.HPKE.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 8,
"end_line": 129,
"start_col": 0,
"start_line": 99
} | module Hacl.Impl.HPKE
open FStar.HyperStack
open FStar.HyperStack.All
module B = LowStar.Buffer
open Lib.Buffer
open Lib.IntTypes
module S = Spec.Agile.HPKE
module SAEAD = Spec.Agile.AEAD
#set-options "--z3rlimit 20 --max_fuel 0 --max_ifuel 0"
inline_for_extraction noextract
let key_dh_public (cs:S.ciphersuite) = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.AEAD.fsti.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "Spec.Agile.AEAD",
"short_module": "SAEAD"
},
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"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 | cs: Spec.Agile.HPKE.ciphersuite -> p: Type0 -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Agile.HPKE.ciphersuite",
"Hacl.Impl.HPKE.key_dh_secret",
"Prims.b2t",
"Spec.Agile.HPKE.is_valid_not_export_only_ciphersuite",
"Hacl.Impl.HPKE.serialized_point_dh",
"Lib.IntTypes.size_t",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Impl.HPKE.m... | [] | false | false | false | true | true | let sealBase_st (cs: S.ciphersuite) (p: Type0) =
|
skE: key_dh_secret cs {S.is_valid_not_export_only_ciphersuite cs} ->
pkR: serialized_point_dh cs ->
infolen: size_t{v infolen <= max_length_info (S.hash_of_cs cs)} ->
info: lbuffer uint8 infolen ->
aadlen: size_t{v aadlen <= SAEAD.max_length (S.aead_alg_of cs)} ->
aad: lbuffer uint8 aadlen ->
... | false | |
FStar.Seq.Properties.fst | FStar.Seq.Properties.lemma_append_count' | val lemma_append_count' (#a: eqtype) (lo hi: seq a)
: Lemma (requires True)
(ensures (forall x. count x (append lo hi) = (count x lo + count x hi)))
(decreases (length lo)) | val lemma_append_count' (#a: eqtype) (lo hi: seq a)
: Lemma (requires True)
(ensures (forall x. count x (append lo hi) = (count x lo + count x hi)))
(decreases (length lo)) | let rec lemma_append_count' (#a:eqtype) (lo:seq a) (hi:seq a)
: Lemma
(requires True)
(ensures (forall x. count x (append lo hi) = (count x lo + count x hi)))
(decreases (length lo))
= if length lo = 0
then cut (equal (append lo hi) hi)
else (cut (equal (cons (head lo) (append (tail lo) hi))
(... | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 106,
"start_col": 0,
"start_line": 94
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | lo: FStar.Seq.Base.seq a -> hi: FStar.Seq.Base.seq a
-> FStar.Pervasives.Lemma
(ensures
forall (x: a).
FStar.Seq.Properties.count x (FStar.Seq.Base.append lo hi) =
FStar.Seq.Properties.count x lo + FStar.Seq.Properties.count x hi)
(decreases FStar.Seq.Base.length lo) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.eqtype",
"FStar.Seq.Base.seq",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"Prims.cut",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.append",
"Prims.bool",
"FStar.Seq.Properties.tail",
"FStar.Seq.Base.cons",
"FStar.Seq.Properties.head",
"Prims.unit",
"FStar.Seq.Properties.... | [
"recursion"
] | false | false | true | false | false | let rec lemma_append_count' (#a: eqtype) (lo hi: seq a)
: Lemma (requires True)
(ensures (forall x. count x (append lo hi) = (count x lo + count x hi)))
(decreases (length lo)) =
| if length lo = 0
then cut (equal (append lo hi) hi)
else
(cut (equal (cons (head lo) (append (tail lo) hi)) (append lo hi));
lemma_append_count' (tail lo) hi;
let tl_l_h = append (tail lo) hi in
let lh = cons (head lo) tl_l_h in
cut (equal (tail lh) tl_l_h)) | false |
Hacl.Impl.HPKE.fsti | Hacl.Impl.HPKE.setupBaseR_st | val setupBaseR_st : cs: Spec.Agile.HPKE.ciphersuite -> p: Type0 -> Type0 | let setupBaseR_st (cs:S.ciphersuite) (p:Type0) =
o_ctx : context_s cs
-> pkE: key_dh_public cs
-> skR: key_dh_secret cs
-> infolen: size_t{v infolen <= max_length_info (S.hash_of_cs cs)}
-> info: lbuffer uint8 infolen
-> Stack UInt32.t
(requires fun h0 ->
p /\
ctx_invariant h0 o_ctx ... | {
"file_name": "code/hpke/Hacl.Impl.HPKE.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 6,
"end_line": 91,
"start_col": 0,
"start_line": 70
} | module Hacl.Impl.HPKE
open FStar.HyperStack
open FStar.HyperStack.All
module B = LowStar.Buffer
open Lib.Buffer
open Lib.IntTypes
module S = Spec.Agile.HPKE
module SAEAD = Spec.Agile.AEAD
#set-options "--z3rlimit 20 --max_fuel 0 --max_ifuel 0"
inline_for_extraction noextract
let key_dh_public (cs:S.ciphersuite) = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.AEAD.fsti.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"FStar.UInt32.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "Spec.Agile.AEAD",
"short_module": "SAEAD"
},
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"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 | cs: Spec.Agile.HPKE.ciphersuite -> p: Type0 -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Agile.HPKE.ciphersuite",
"Hacl.Impl.HPKE.context_s",
"Hacl.Impl.HPKE.key_dh_public",
"Hacl.Impl.HPKE.key_dh_secret",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Hacl.Impl.HPKE.max_length_info",
"Spec.Agile.HPK... | [] | false | false | false | true | true | let setupBaseR_st (cs: S.ciphersuite) (p: Type0) =
|
o_ctx: context_s cs ->
pkE: key_dh_public cs ->
skR: key_dh_secret cs ->
infolen: size_t{v infolen <= max_length_info (S.hash_of_cs cs)} ->
info: lbuffer uint8 infolen
-> Stack UInt32.t
(requires
fun h0 ->
p /\ ctx_invariant h0 o_ctx /\ live h0 pkE /\ live h0 skR /\ live h... | false | |
FStar.Seq.Properties.fst | FStar.Seq.Properties.lemma_mem_append | val lemma_mem_append : #a:eqtype -> s1:seq a -> s2:seq a
-> Lemma (ensures (forall x. mem x (append s1 s2) <==> (mem x s1 || mem x s2))) | val lemma_mem_append : #a:eqtype -> s1:seq a -> s2:seq a
-> Lemma (ensures (forall x. mem x (append s1 s2) <==> (mem x s1 || mem x s2))) | let lemma_mem_append #_ s1 s2 = lemma_append_count s1 s2 | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 56,
"end_line": 242,
"start_col": 0,
"start_line": 242
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: FStar.Seq.Base.seq a -> s2: FStar.Seq.Base.seq a
-> FStar.Pervasives.Lemma
(ensures
forall (x: a).
FStar.Seq.Properties.mem x (FStar.Seq.Base.append s1 s2) <==>
FStar.Seq.Properties.mem x s1 || FStar.Seq.Properties.mem x s2) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.Seq.Base.seq",
"FStar.Seq.Properties.lemma_append_count",
"Prims.unit"
] | [] | true | false | true | false | false | let lemma_mem_append #_ s1 s2 =
| lemma_append_count s1 s2 | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.sorted_concat_lemma' | val sorted_concat_lemma'
(#a: eqtype)
(f: (a -> a -> Tot bool){total_order a f})
(lo: seq a {sorted f lo})
(pivot: a)
(hi: seq a {sorted f hi})
: Lemma (requires (forall y. (mem y lo ==> f y pivot) /\ (mem y hi ==> f pivot y)))
(ensures (sorted f (append lo (cons pivot hi))))
... | val sorted_concat_lemma'
(#a: eqtype)
(f: (a -> a -> Tot bool){total_order a f})
(lo: seq a {sorted f lo})
(pivot: a)
(hi: seq a {sorted f hi})
: Lemma (requires (forall y. (mem y lo ==> f y pivot) /\ (mem y hi ==> f pivot y)))
(ensures (sorted f (append lo (cons pivot hi))))
... | let rec sorted_concat_lemma': #a:eqtype
-> f:(a -> a -> Tot bool){total_order a f}
-> lo:seq a{sorted f lo}
-> pivot:a
-> hi:seq a{sorted f hi}
-> Lemma (requires (forall y. (mem y lo ==> f y pivot)
... | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 146,
"start_col": 0,
"start_line": 131
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
f: (_: a -> _: a -> Prims.bool){FStar.Seq.Properties.total_order a f} ->
lo: FStar.Seq.Base.seq a {FStar.Seq.Properties.sorted f lo} ->
pivot: a ->
hi: FStar.Seq.Base.seq a {FStar.Seq.Properties.sorted f hi}
-> FStar.Pervasives.Lemma
(requires
forall (y: a).
(FStar.Seq.Propert... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.eqtype",
"Prims.bool",
"FStar.Seq.Properties.total_order",
"FStar.Seq.Base.seq",
"Prims.b2t",
"FStar.Seq.Properties.sorted",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"Prims.cut",
"FStar.Seq.Base.equal",
"FStar.Seq.Properties.tail",
"FStar.Seq.Base.cons",
"Prims.uni... | [
"recursion"
] | false | false | true | false | false | let rec sorted_concat_lemma':
#a: eqtype ->
f: (a -> a -> Tot bool){total_order a f} ->
lo: seq a {sorted f lo} ->
pivot: a ->
hi: seq a {sorted f hi}
-> Lemma (requires (forall y. (mem y lo ==> f y pivot) /\ (mem y hi ==> f pivot y)))
(ensures (sorted f (append lo (cons pivot hi))))
(... | fun #_ f lo pivot hi ->
if length lo = 0
then
(cut (equal (append lo (cons pivot hi)) (cons pivot hi));
cut (equal (tail (cons pivot hi)) hi))
else
(sorted_concat_lemma' f (tail lo) pivot hi;
lemma_append_cons lo (cons pivot hi);
lemma_tl (head lo) (append (tail lo) (cons pivot hi))) | false |
FStar.Seq.Properties.fst | FStar.Seq.Properties.cons_perm | val cons_perm: #a:eqtype -> tl:seq a -> s:seq a{length s > 0} ->
Lemma (requires (permutation a tl (tail s)))
(ensures (permutation a (cons (head s) tl) s)) | val cons_perm: #a:eqtype -> tl:seq a -> s:seq a{length s > 0} ->
Lemma (requires (permutation a tl (tail s)))
(ensures (permutation a (cons (head s) tl) s)) | let cons_perm #_ tl s = lemma_tl (head s) tl | {
"file_name": "ulib/FStar.Seq.Properties.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 240,
"start_col": 0,
"start_line": 240
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.Properties.fst.checked",
"FStar.List.Tot.Base.fst.checked",
"FStar.List.To... | [
{
"abbrev": true,
"full_module": "FStar.Seq.Base",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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 | tl: FStar.Seq.Base.seq a -> s: FStar.Seq.Base.seq a {FStar.Seq.Base.length s > 0}
-> FStar.Pervasives.Lemma
(requires FStar.Seq.Properties.permutation a tl (FStar.Seq.Properties.tail s))
(ensures
FStar.Seq.Properties.permutation a (FStar.Seq.Base.cons (FStar.Seq.Properties.head s) tl) s) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.eqtype",
"FStar.Seq.Base.seq",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.Seq.Base.length",
"FStar.Seq.Properties.lemma_tl",
"FStar.Seq.Properties.head",
"Prims.unit"
] | [] | true | false | true | false | false | let cons_perm #_ tl s =
| lemma_tl (head s) tl | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.