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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Pulse.Typing.fst | Pulse.Typing.lift_typing_to_ghost_typing | val lift_typing_to_ghost_typing
(#g: env)
(#e: term)
(#eff: T.tot_or_ghost)
(#t: term)
(d: typing g e eff t)
: ghost_typing g e t | val lift_typing_to_ghost_typing
(#g: env)
(#e: term)
(#eff: T.tot_or_ghost)
(#t: term)
(d: typing g e eff t)
: ghost_typing g e t | let lift_typing_to_ghost_typing (#g:env) (#e:term) (#eff:T.tot_or_ghost) (#t:term)
(d:typing g e eff t)
: ghost_typing g e t =
if eff = T.E_Ghost
then d
else let E d = d in
E (RT.T_Sub _ _ _ _ d (RT.Relc_total_ghost _ _)) | {
"file_name": "lib/steel/pulse/Pulse.Typing.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 55,
"end_line": 508,
"start_col": 0,
"start_line": 502
} | (*
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.Env.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Sealed.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Pulse.Typing.Env",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | d: Pulse.Typing.typing g e eff t -> Pulse.Typing.ghost_typing g e t | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.term",
"FStar.Stubs.TypeChecker.Core.tot_or_ghost",
"Pulse.Typing.typing",
"Prims.op_Equality",
"FStar.Stubs.TypeChecker.Core.E_Ghost",
"Prims.bool",
"FStar.Reflection.Typing.typing",
"Pulse.Typing.elab_env",
"Pulse.Elaborate.Pure.elab_term",
"FStar.Per... | [] | false | false | false | false | false | let lift_typing_to_ghost_typing
(#g: env)
(#e: term)
(#eff: T.tot_or_ghost)
(#t: term)
(d: typing g e eff t)
: ghost_typing g e t =
| if eff = T.E_Ghost
then d
else
let E d = d in
E (RT.T_Sub _ _ _ _ d (RT.Relc_total_ghost _ _)) | false |
Pulse.Typing.fst | Pulse.Typing.non_informative_c | val non_informative_c : g: Pulse.Typing.Env.env -> c: Pulse.Syntax.Base.comp_st -> Type0 | let non_informative_c (g:env) (c:comp_st) =
non_informative_t g (comp_u c) (comp_res c) | {
"file_name": "lib/steel/pulse/Pulse.Typing.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 45,
"end_line": 517,
"start_col": 0,
"start_line": 516
} | (*
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.Env.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Sealed.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Pulse.Typing.Env",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | g: Pulse.Typing.Env.env -> c: Pulse.Syntax.Base.comp_st -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.comp_st",
"Pulse.Typing.non_informative_t",
"Pulse.Syntax.Base.comp_u",
"Pulse.Syntax.Base.comp_res"
] | [] | false | false | false | true | true | let non_informative_c (g: env) (c: comp_st) =
| non_informative_t g (comp_u c) (comp_res c) | false | |
Pulse.Typing.fst | Pulse.Typing.add_iname_at_least_unobservable | val add_iname_at_least_unobservable : s: Pulse.Syntax.Base.comp_st{C_STAtomic? s} ->
inv_vprop: Pulse.Syntax.Base.term ->
inv_tm: Pulse.Syntax.Base.term
-> Pulse.Syntax.Base.comp | let add_iname_at_least_unobservable (s:comp_st {C_STAtomic? s}) (inv_vprop inv_tm:term) =
let add_inv_tm (inames:term) =
tm_fstar (Pulse.Reflection.Util.add_inv_tm (elab_term inv_vprop) (elab_term inames) (elab_term inv_tm))
inames.range
in
let C_STAtomic inames obs s = s in
C_STAtomic (add_i... | {
"file_name": "lib/steel/pulse/Pulse.Typing.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 62,
"end_line": 252,
"start_col": 0,
"start_line": 246
} | (*
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.Env.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Sealed.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Pulse.Typing.Env",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
s: Pulse.Syntax.Base.comp_st{C_STAtomic? s} ->
inv_vprop: Pulse.Syntax.Base.term ->
inv_tm: Pulse.Syntax.Base.term
-> Pulse.Syntax.Base.comp | Prims.Tot | [
"total"
] | [] | [
"Pulse.Syntax.Base.comp_st",
"Prims.b2t",
"Pulse.Syntax.Base.uu___is_C_STAtomic",
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Base.observability",
"Pulse.Syntax.Base.st_comp",
"Pulse.Syntax.Base.C_STAtomic",
"Pulse.Typing.join_obs",
"Pulse.Syntax.Base.Unobservable",
"Pulse.Syntax.Base.comp",
"Pulse.... | [] | false | false | false | false | false | let add_iname_at_least_unobservable (s: comp_st{C_STAtomic? s}) (inv_vprop inv_tm: term) =
| let add_inv_tm (inames: term) =
tm_fstar (Pulse.Reflection.Util.add_inv_tm (elab_term inv_vprop)
(elab_term inames)
(elab_term inv_tm))
inames.range
in
let C_STAtomic inames obs s = s in
C_STAtomic (add_inv_tm inames) (join_obs obs Unobservable) s | false | |
Pulse.Typing.fst | Pulse.Typing.tr_binding | val tr_binding (vt: var & typ) : Tot R.binding | val tr_binding (vt: var & typ) : Tot R.binding | let tr_binding (vt : var & typ) : Tot R.binding =
let v, t = vt in
{
uniq = v;
sort = elab_term t;
ppname = ppname_default.name;
} | {
"file_name": "lib/steel/pulse/Pulse.Typing.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 2,
"end_line": 670,
"start_col": 0,
"start_line": 664
} | (*
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.Env.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Sealed.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Pulse.Typing.Env",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | vt: (Pulse.Syntax.Base.var * Pulse.Syntax.Base.typ) -> FStar.Stubs.Reflection.V2.Data.binding | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.tuple2",
"Pulse.Syntax.Base.var",
"Pulse.Syntax.Base.typ",
"FStar.Stubs.Reflection.V2.Data.Mkbinding",
"Pulse.Elaborate.Pure.elab_term",
"Pulse.Syntax.Base.__proj__Mkppname__item__name",
"Pulse.Syntax.Base.ppname_default",
"FStar.Stubs.Reflection.V2.Data.binding"
] | [] | false | false | false | true | false | let tr_binding (vt: var & typ) : Tot R.binding =
| let v, t = vt in
{ uniq = v; sort = elab_term t; ppname = ppname_default.name } | false |
Pulse.Typing.fst | Pulse.Typing.wr | val wr (ct: comp_st) (t: st_term') : st_term | val wr (ct: comp_st) (t: st_term') : st_term | let wr (ct:comp_st) (t:st_term') : st_term = { term = t; range = FStar.Range.range_0; effect_tag = as_effect_hint (ctag_of_comp_st ct) } | {
"file_name": "lib/steel/pulse/Pulse.Typing.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 136,
"end_line": 634,
"start_col": 0,
"start_line": 634
} | (*
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.Env.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Sealed.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Pulse.Typing.Env",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | ct: Pulse.Syntax.Base.comp_st -> t: Pulse.Syntax.Base.st_term' -> Pulse.Syntax.Base.st_term | Prims.Tot | [
"total"
] | [] | [
"Pulse.Syntax.Base.comp_st",
"Pulse.Syntax.Base.st_term'",
"Pulse.Syntax.Base.Mkst_term",
"FStar.Range.range_0",
"Pulse.Syntax.Base.as_effect_hint",
"Pulse.Syntax.Base.ctag_of_comp_st",
"Pulse.Syntax.Base.st_term"
] | [] | false | false | false | true | false | let wr (ct: comp_st) (t: st_term') : st_term =
| { term = t; range = FStar.Range.range_0; effect_tag = as_effect_hint (ctag_of_comp_st ct) } | false |
Pulse.Typing.fst | Pulse.Typing.sub_observability | val sub_observability : o1: Pulse.Syntax.Base.observability -> o2: Pulse.Syntax.Base.observability -> Prims.bool | let sub_observability (o1 o2:observability) = o1 = Neutral || o1 = o2 || o2 = Observable | {
"file_name": "lib/steel/pulse/Pulse.Typing.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 88,
"end_line": 578,
"start_col": 0,
"start_line": 578
} | (*
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.Env.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Sealed.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Pulse.Typing.Env",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | o1: Pulse.Syntax.Base.observability -> o2: Pulse.Syntax.Base.observability -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Pulse.Syntax.Base.observability",
"Prims.op_BarBar",
"Prims.op_Equality",
"Pulse.Syntax.Base.Neutral",
"Pulse.Syntax.Base.Observable",
"Prims.bool"
] | [] | false | false | false | true | false | let sub_observability (o1 o2: observability) =
| o1 = Neutral || o1 = o2 || o2 = Observable | false | |
Pulse.Typing.fst | Pulse.Typing.wtag | val wtag (ct: option ctag) (t: st_term') : st_term | val wtag (ct: option ctag) (t: st_term') : st_term | let wtag (ct:option ctag) (t:st_term') : st_term = { term = t; range = FStar.Range.range_0; effect_tag = FStar.Sealed.seal ct } | {
"file_name": "lib/steel/pulse/Pulse.Typing.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 128,
"end_line": 635,
"start_col": 0,
"start_line": 635
} | (*
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.Env.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Sealed.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Pulse.Typing.Env",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | ct: FStar.Pervasives.Native.option Pulse.Syntax.Base.ctag -> t: Pulse.Syntax.Base.st_term'
-> Pulse.Syntax.Base.st_term | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.option",
"Pulse.Syntax.Base.ctag",
"Pulse.Syntax.Base.st_term'",
"Pulse.Syntax.Base.Mkst_term",
"FStar.Range.range_0",
"FStar.Sealed.seal",
"Pulse.Syntax.Base.st_term"
] | [] | false | false | false | true | false | let wtag (ct: option ctag) (t: st_term') : st_term =
| { term = t; range = FStar.Range.range_0; effect_tag = FStar.Sealed.seal ct } | false |
Pulse.Typing.fst | Pulse.Typing.inv_disjointness | val inv_disjointness : inv_p: Pulse.Syntax.Base.term -> inames: Pulse.Syntax.Base.term -> inv: Pulse.Syntax.Base.term
-> Pulse.Syntax.Base.term | let inv_disjointness (inv_p inames inv:term) =
let g = Pulse.Reflection.Util.inv_disjointness_goal (elab_term inv_p) (elab_term inames) (elab_term inv) in
tm_fstar g inv.range | {
"file_name": "lib/steel/pulse/Pulse.Typing.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 22,
"end_line": 724,
"start_col": 0,
"start_line": 722
} | (*
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.Env.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Sealed.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Pulse.Typing.Env",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | inv_p: Pulse.Syntax.Base.term -> inames: Pulse.Syntax.Base.term -> inv: Pulse.Syntax.Base.term
-> Pulse.Syntax.Base.term | Prims.Tot | [
"total"
] | [] | [
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Base.tm_fstar",
"Pulse.Syntax.Base.__proj__Mkterm__item__range",
"FStar.Stubs.Reflection.Types.term",
"Pulse.Reflection.Util.inv_disjointness_goal",
"Pulse.Elaborate.Pure.elab_term"
] | [] | false | false | false | true | false | let inv_disjointness (inv_p inames inv: term) =
| let g =
Pulse.Reflection.Util.inv_disjointness_goal (elab_term inv_p) (elab_term inames) (elab_term inv)
in
tm_fstar g inv.range | false | |
Pulse.Typing.fst | Pulse.Typing.tm_join_inames | val tm_join_inames (inames1 inames2: term) : term | val tm_join_inames (inames1 inames2: term) : term | let tm_join_inames (inames1 inames2 : term) : term =
if eq_tm inames1 tm_emp_inames then inames2 else
if eq_tm inames2 tm_emp_inames then inames1 else
if eq_tm inames1 inames2 then inames1 else
let inames1 = elab_term inames1 in
let inames2 = elab_term inames2 in
let join_lid = Pulse.Reflection.Util.mk_pul... | {
"file_name": "lib/steel/pulse/Pulse.Typing.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 38,
"end_line": 530,
"start_col": 0,
"start_line": 520
} | (*
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.Env.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Sealed.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Pulse.Typing.Env",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | inames1: Pulse.Syntax.Base.term -> inames2: Pulse.Syntax.Base.term -> Pulse.Syntax.Base.term | Prims.Tot | [
"total"
] | [] | [
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Base.eq_tm",
"Pulse.Syntax.Base.tm_emp_inames",
"Prims.bool",
"Pulse.Syntax.Base.with_range",
"Pulse.Syntax.Base.Tm_FStar",
"FStar.Reflection.V2.Derived.mk_e_app",
"Prims.Cons",
"FStar.Stubs.Reflection.Types.term",
"Prims.Nil",
"FStar.Stubs.Reflection.V2.B... | [] | false | false | false | true | false | let tm_join_inames (inames1 inames2: term) : term =
| if eq_tm inames1 tm_emp_inames
then inames2
else
if eq_tm inames2 tm_emp_inames
then inames1
else
if eq_tm inames1 inames2
then inames1
else
let inames1 = elab_term inames1 in
let inames2 = elab_term inames2 in
let join_lid = Pulse.Reflection.Util.mk_pulse_lib_core_lid "join_inames" ... | false |
Pulse.Typing.fst | Pulse.Typing.comp_post_matches_hint | val comp_post_matches_hint : c: Pulse.Syntax.Base.comp_st -> post_hint: FStar.Pervasives.Native.option Pulse.Typing.post_hint_t
-> Prims.logical | let comp_post_matches_hint (c:comp_st) (post_hint:option post_hint_t) =
match post_hint with
| None -> True
| Some post_hint ->
comp_res c == post_hint.ret_ty /\
comp_u c == post_hint.u /\
comp_post c == post_hint.post /\
effect_annot_matches c post_hint.effect_annot | {
"file_name": "lib/steel/pulse/Pulse.Typing.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 49,
"end_line": 1208,
"start_col": 0,
"start_line": 1201
} | (*
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.Env.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Sealed.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Pulse.Typing.Env",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | c: Pulse.Syntax.Base.comp_st -> post_hint: FStar.Pervasives.Native.option Pulse.Typing.post_hint_t
-> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Pulse.Syntax.Base.comp_st",
"FStar.Pervasives.Native.option",
"Pulse.Typing.post_hint_t",
"Prims.l_True",
"Prims.l_and",
"Prims.eq2",
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Base.comp_res",
"Pulse.Typing.__proj__Mkpost_hint_t__item__ret_ty",
"Pulse.Syntax.Base.universe",
"Pulse.Syntax.Base.comp... | [] | false | false | false | true | true | let comp_post_matches_hint (c: comp_st) (post_hint: option post_hint_t) =
| match post_hint with
| None -> True
| Some post_hint ->
comp_res c == post_hint.ret_ty /\ comp_u c == post_hint.u /\ comp_post c == post_hint.post /\
effect_annot_matches c post_hint.effect_annot | false | |
Pulse.Typing.fst | Pulse.Typing.fresh_wrt | val fresh_wrt : x: Pulse.Syntax.Base.var -> g: Pulse.Typing.Env.env -> vars: FStar.Set.set Pulse.Syntax.Base.var
-> Prims.logical | let fresh_wrt (x:var) (g:env) (vars:_) =
None? (lookup g x) /\ ~(x `Set.mem` vars) | {
"file_name": "lib/steel/pulse/Pulse.Typing.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 46,
"end_line": 1127,
"start_col": 0,
"start_line": 1126
} | (*
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.Env.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Sealed.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Pulse.Typing.Env",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Pulse.Syntax.Base.var -> g: Pulse.Typing.Env.env -> vars: FStar.Set.set Pulse.Syntax.Base.var
-> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Pulse.Syntax.Base.var",
"Pulse.Typing.Env.env",
"FStar.Set.set",
"Prims.l_and",
"Prims.b2t",
"FStar.Pervasives.Native.uu___is_None",
"Pulse.Syntax.Base.typ",
"Pulse.Typing.Env.lookup",
"Prims.l_not",
"FStar.Set.mem",
"Prims.logical"
] | [] | false | false | false | true | true | let fresh_wrt (x: var) (g: env) (vars: _) =
| None? (lookup g x) /\ ~(x `Set.mem` vars) | false | |
Pulse.Typing.fst | Pulse.Typing.tm_inames_subset | val tm_inames_subset (inames1 inames2: term) : term | val tm_inames_subset (inames1 inames2: term) : term | let tm_inames_subset (inames1 inames2 : term) : term =
let inames1 = elab_term inames1 in
let inames2 = elab_term inames2 in
let join_lid = Pulse.Reflection.Util.mk_pulse_lib_core_lid "inames_subset" in
let join : R.term = R.pack_ln (R.Tv_FVar (R.pack_fv join_lid)) in
with_range (Tm_FStar (R.mk_e_app join [in... | {
"file_name": "lib/steel/pulse/Pulse.Typing.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 38,
"end_line": 538,
"start_col": 0,
"start_line": 532
} | (*
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.Env.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Sealed.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Pulse.Typing.Env",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | inames1: Pulse.Syntax.Base.term -> inames2: Pulse.Syntax.Base.term -> Pulse.Syntax.Base.term | Prims.Tot | [
"total"
] | [] | [
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Base.with_range",
"Pulse.Syntax.Base.Tm_FStar",
"FStar.Reflection.V2.Derived.mk_e_app",
"Prims.Cons",
"FStar.Stubs.Reflection.Types.term",
"Prims.Nil",
"FStar.Stubs.Reflection.V2.Builtins.range_of_term",
"FStar.Stubs.Reflection.V2.Builtins.pack_ln",
"FStar.S... | [] | false | false | false | true | false | let tm_inames_subset (inames1 inames2: term) : term =
| let inames1 = elab_term inames1 in
let inames2 = elab_term inames2 in
let join_lid = Pulse.Reflection.Util.mk_pulse_lib_core_lid "inames_subset" in
let join:R.term = R.pack_ln (R.Tv_FVar (R.pack_fv join_lid)) in
with_range (Tm_FStar (R.mk_e_app join [inames1; inames2])) (T.range_of_term inames1) | false |
TwoLockQueue.fst | TwoLockQueue.enqueue | val enqueue (#a: _) (hdl: t a) (x: a) : SteelT unit emp (fun _ -> emp) | val enqueue (#a: _) (hdl: t a) (x: a) : SteelT unit emp (fun _ -> emp) | let enqueue (#a:_) (hdl:t a) (x:a)
: SteelT unit emp (fun _ -> emp)
= // Blocks until it can acquire the tail lock corresponding to the enqueuer
Steel.SpinLock.acquire hdl.tail.lock;
let cell = Q.({ data = x; next = null} ) in
let v:erased (Q.t a) = open_exists () in
let tl = read_pt hdl.tail.ptr in... | {
"file_name": "share/steel/examples/steel/TwoLockQueue.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 40,
"end_line": 207,
"start_col": 0,
"start_line": 167
} | module TwoLockQueue
open FStar.Ghost
open Steel.Memory
open Steel.Effect.Atomic
open Steel.Effect
open Steel.FractionalPermission
open Steel.Reference
open Steel.SpinLock
module L = FStar.List.Tot
module U = Steel.Utils
module Q = Queue
/// This module provides an implementation of Michael and Scott's two lock queue... | {
"checked_file": "/",
"dependencies": [
"Steel.Utils.fst.checked",
"Steel.SpinLock.fsti.checked",
"Steel.Reference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"Queue.fsti.check... | [
{
"abbrev": true,
"full_module": "Queue",
"short_module": "Q"
},
{
"abbrev": true,
"full_module": "Steel.Utils",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Steel.SpinLock"... | {
"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 | hdl: TwoLockQueue.t a -> x: a -> Steel.Effect.SteelT Prims.unit | Steel.Effect.SteelT | [] | [] | [
"TwoLockQueue.t",
"Steel.SpinLock.release",
"TwoLockQueue.lock_inv",
"TwoLockQueue.__proj__Mkq_ptr__item__ptr",
"TwoLockQueue.__proj__Mkt__item__tail",
"TwoLockQueue.__proj__Mkq_ptr__item__ghost",
"TwoLockQueue.__proj__Mkq_ptr__item__lock",
"Prims.unit",
"Steel.Effect.Atomic.intro_exists",
"Queue.... | [] | false | true | false | false | false | let enqueue (#a: _) (hdl: t a) (x: a) : SteelT unit emp (fun _ -> emp) =
| Steel.SpinLock.acquire hdl.tail.lock;
let cell = let open Q in { data = x; next = null } in
let v:erased (Q.t a) = open_exists () in
let tl = read_pt hdl.tail.ptr in
let node = alloc_pt cell in
let enqueue_core #u ()
: SteelAtomicT unit
u
((queue_invariant hdl.head hdl.tail)
`star`
((gho... | false |
Pulse.Typing.fst | Pulse.Typing.post_hint_opt | val post_hint_opt : g: Pulse.Typing.Env.env -> Type0 | let post_hint_opt (g:env) = o:option post_hint_t { None? o \/ post_hint_for_env_p g (Some?.v o) } | {
"file_name": "lib/steel/pulse/Pulse.Typing.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 97,
"end_line": 1164,
"start_col": 0,
"start_line": 1164
} | (*
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.Env.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Sealed.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Pulse.Typing.Env",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | g: Pulse.Typing.Env.env -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"FStar.Pervasives.Native.option",
"Pulse.Typing.post_hint_t",
"Prims.l_or",
"Prims.b2t",
"FStar.Pervasives.Native.uu___is_None",
"Pulse.Typing.post_hint_for_env_p",
"FStar.Pervasives.Native.__proj__Some__item__v"
] | [] | false | false | false | true | true | let post_hint_opt (g: env) =
| o: option post_hint_t {None? o \/ post_hint_for_env_p g (Some?.v o)} | false | |
Pulse.Typing.fst | Pulse.Typing.post_hint_for_env_extends | val post_hint_for_env_extends (g: env) (p: post_hint_t) (x: var{~(Set.mem x (dom g))}) (b: typ)
: Lemma (requires post_hint_for_env_p g p)
(ensures post_hint_for_env_p (push_binding g x ppname_default b) p)
[SMTPat (post_hint_for_env_p (push_binding g x ppname_default b) p)] | val post_hint_for_env_extends (g: env) (p: post_hint_t) (x: var{~(Set.mem x (dom g))}) (b: typ)
: Lemma (requires post_hint_for_env_p g p)
(ensures post_hint_for_env_p (push_binding g x ppname_default b) p)
[SMTPat (post_hint_for_env_p (push_binding g x ppname_default b) p)] | let post_hint_for_env_extends (g:env) (p:post_hint_t) (x:var { ~ (Set.mem x (dom g)) }) (b:typ)
: Lemma
(requires post_hint_for_env_p g p)
(ensures post_hint_for_env_p (push_binding g x ppname_default b) p)
[SMTPat (post_hint_for_env_p (push_binding g x ppname_default b) p)]
= env_extends_push g x ppnam... | {
"file_name": "lib/steel/pulse/Pulse.Typing.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 41,
"end_line": 1161,
"start_col": 0,
"start_line": 1156
} | (*
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.Env.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Sealed.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Pulse.Typing.Env",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
g: Pulse.Typing.Env.env ->
p: Pulse.Typing.post_hint_t ->
x: Pulse.Syntax.Base.var{~(FStar.Set.mem x (Pulse.Typing.Env.dom g))} ->
b: Pulse.Syntax.Base.typ
-> FStar.Pervasives.Lemma (requires Pulse.Typing.post_hint_for_env_p g p)
(ensures
Pulse.Typing.post_hint_for_env_p (Pulse.Typing.E... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Typing.post_hint_t",
"Pulse.Syntax.Base.var",
"Prims.l_not",
"Prims.b2t",
"FStar.Set.mem",
"Pulse.Typing.Env.dom",
"Pulse.Syntax.Base.typ",
"Pulse.Typing.Env.env_extends_push",
"Pulse.Syntax.Base.ppname_default",
"Prims.unit",
"Pulse.Typing.post_hint_for_env_p",
... | [] | true | false | true | false | false | let post_hint_for_env_extends (g: env) (p: post_hint_t) (x: var{~(Set.mem x (dom g))}) (b: typ)
: Lemma (requires post_hint_for_env_p g p)
(ensures post_hint_for_env_p (push_binding g x ppname_default b) p)
[SMTPat (post_hint_for_env_p (push_binding g x ppname_default b) p)] =
| env_extends_push g x ppname_default b | false |
Pulse.Typing.fst | Pulse.Typing.post_hint_typing | val post_hint_typing (g: env) (p: post_hint_for_env g) (x: var{fresh_wrt x g (freevars p.post)})
: post_hint_typing_t g p x | val post_hint_typing (g: env) (p: post_hint_for_env g) (x: var{fresh_wrt x g (freevars p.post)})
: post_hint_typing_t g p x | let post_hint_typing (g:env)
(p:post_hint_for_env g)
(x:var { fresh_wrt x g (freevars p.post) })
: post_hint_typing_t g p x
= let effect_annot_typing : effect_annot_typing g p.effect_annot =
match p.effect_annot with
| EffectAnnotAtomic { opens } ->
let... | {
"file_name": "lib/steel/pulse/Pulse.Typing.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 3,
"end_line": 1191,
"start_col": 0,
"start_line": 1175
} | (*
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.Env.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Sealed.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Pulse.Typing.Env",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Tactics.V2",
"short_module": "T"
},
{
"abbrev": true,
"full_module":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
g: Pulse.Typing.Env.env ->
p: Pulse.Typing.post_hint_for_env g ->
x:
Pulse.Syntax.Base.var
{Pulse.Typing.fresh_wrt x g (Pulse.Syntax.Naming.freevars (Mkpost_hint_t?.post p))}
-> Pulse.Typing.post_hint_typing_t g p x | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Typing.post_hint_for_env",
"Pulse.Syntax.Base.var",
"Pulse.Typing.fresh_wrt",
"Pulse.Syntax.Naming.freevars",
"Pulse.Typing.__proj__Mkpost_hint_t__item__post",
"Pulse.Typing.Mkpost_hint_typing_t",
"Pulse.RuntimeUtils.magic",
"Pulse.Typing.universe_of",
"Pulse.Typing.... | [] | false | false | false | false | false | let post_hint_typing (g: env) (p: post_hint_for_env g) (x: var{fresh_wrt x g (freevars p.post)})
: post_hint_typing_t g p x =
| let effect_annot_typing:effect_annot_typing g p.effect_annot =
match p.effect_annot with
| EffectAnnotAtomic { opens = opens } ->
let opens_typing:tot_typing g opens tm_inames = RU.magic () in
opens_typing
| _ -> ()
in
{ effect_annot_typing = effect_annot_typing; ty_typing = RU.magic (); post_typing = RU.... | false |
Benton2004.fst | Benton2004.reify_raw_computation | val reify_raw_computation (f: raw_computation) : reified_raw_computation | val reify_raw_computation (f: raw_computation) : reified_raw_computation | let reify_raw_computation (f : raw_computation) : reified_raw_computation =
fun n h -> reify (f n) h | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 54,
"start_col": 0,
"start_line": 53
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"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: Benton2004.raw_computation -> Benton2004.reified_raw_computation | Prims.Tot | [
"total"
] | [] | [
"Benton2004.raw_computation",
"Prims.nat",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.bool",
"FStar.Pervasives.Native.tuple2",
"Benton2004.reified_raw_computation"
] | [] | false | false | false | true | false | let reify_raw_computation (f: raw_computation) : reified_raw_computation =
| fun n h -> reify (f n) h | false |
Benton2004.fst | Benton2004.fuel_monotonic | val fuel_monotonic (f: reified_raw_computation) : GTot Type0 | val fuel_monotonic (f: reified_raw_computation) : GTot Type0 | let fuel_monotonic
(f: reified_raw_computation)
: GTot Type0
= forall (fuel fuel' : nat) h .{:pattern has_type fuel nat; has_type fuel' nat; has_type h heap} (
fuel <= fuel' /\
fst (f fuel h) == true
) ==> (
f fuel' h == f fuel h
) | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 36,
"start_col": 0,
"start_line": 28
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"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: Benton2004.reified_raw_computation -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"Benton2004.reified_raw_computation",
"Prims.l_Forall",
"Prims.nat",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.l_imp",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.eq2",
"Prims.bool",
"FStar.Pervasives.Native.fst",
"FStar.Pervasives.Native.tuple2",
"Prims.has_type"
] | [] | false | false | false | false | true | let fuel_monotonic (f: reified_raw_computation) : GTot Type0 =
| forall (fuel: nat) (fuel': nat) h. {:pattern has_type fuel nat; has_type fuel' nat; has_type h heap}
(fuel <= fuel' /\ fst (f fuel h) == true) ==> (f fuel' h == f fuel h) | false |
Benton2004.fst | Benton2004.reified_exp | val reified_exp (t: Type0) : Tot Type0 | val reified_exp (t: Type0) : Tot Type0 | let reified_exp (t: Type0) : Tot Type0 = (h: heap) -> Ghost (t * heap) (requires True) (ensures (fun rh -> snd rh == h)) | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 120,
"end_line": 69,
"start_col": 0,
"start_line": 69
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Type0 -> Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.DM4F.Heap.IntStoreFixed.heap",
"FStar.Pervasives.Native.tuple2",
"Prims.l_True",
"Prims.eq2",
"FStar.Pervasives.Native.snd"
] | [] | false | false | false | true | true | let reified_exp (t: Type0) : Tot Type0 =
| h: heap -> Ghost (t * heap) (requires True) (ensures (fun rh -> snd rh == h)) | false |
Benton2004.fst | Benton2004.is_per | val is_per (#t: Type0) (f: rel t) : GTot Type0 | val is_per (#t: Type0) (f: rel t) : GTot Type0 | let is_per (#t: Type0) (f: rel t) : GTot Type0 =
(forall x1 x2 . f x1 x2 <==> f x2 x1) /\
(forall x1 x2 x3 . (f x1 x2 /\ f x2 x3) ==> f x1 x3) | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 184,
"start_col": 0,
"start_line": 182
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.Aux.rel t -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"Benton2004.Aux.rel",
"Prims.l_and",
"Prims.l_Forall",
"Prims.l_iff",
"Prims.l_imp"
] | [] | false | false | false | false | true | let is_per (#t: Type0) (f: rel t) : GTot Type0 =
| (forall x1 x2. f x1 x2 <==> f x2 x1) /\ (forall x1 x2 x3. (f x1 x2 /\ f x2 x3) ==> f x1 x3) | false |
Benton2004.fst | Benton2004.included | val included (#t: Type0) (r1 r2: rel t) : GTot Type0 | val included (#t: Type0) (r1 r2: rel t) : GTot Type0 | let included
(#t: Type0)
(r1 r2: rel t)
: GTot Type0
= forall x y . holds r1 x y ==> holds r2 x y | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 180,
"start_col": 0,
"start_line": 176
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r1: Benton2004.Aux.rel t -> r2: Benton2004.Aux.rel t -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"Benton2004.Aux.rel",
"Prims.l_Forall",
"Prims.l_imp",
"Benton2004.Aux.holds"
] | [] | false | false | false | false | true | let included (#t: Type0) (r1 r2: rel t) : GTot Type0 =
| forall x y. holds r1 x y ==> holds r2 x y | false |
Benton2004.fst | Benton2004.const | val const (#t: Type0) (v: t) : Tot (exp t) | val const (#t: Type0) (v: t) : Tot (exp t) | let const (#t: Type0) (v: t) : Tot (exp t) = fun _ -> v | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 55,
"end_line": 75,
"start_col": 0,
"start_line": 75
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | v: t -> Benton2004.exp t | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"Benton2004.exp"
] | [] | false | false | false | true | false | let const (#t: Type0) (v: t) : Tot (exp t) =
| fun _ -> v | false |
Benton2004.fst | Benton2004.terminates_on | val terminates_on (f: reified_computation) (h: heap) : GTot Type0 | val terminates_on (f: reified_computation) (h: heap) : GTot Type0 | let terminates_on (f: reified_computation) (h: heap) : GTot Type0 =
exists fuel . fst (f fuel h) == true | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 174,
"start_col": 0,
"start_line": 173
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.reified_computation -> h: FStar.DM4F.Heap.IntStoreFixed.heap -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"Benton2004.reified_computation",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.l_Exists",
"Prims.nat",
"Prims.eq2",
"Prims.bool",
"FStar.Pervasives.Native.fst"
] | [] | false | false | false | false | true | let terminates_on (f: reified_computation) (h: heap) : GTot Type0 =
| exists fuel. fst (f fuel h) == true | false |
Benton2004.fst | Benton2004.reify_exp | val reify_exp (#t: Type0) (e: exp t) : GTot (reified_exp t) | val reify_exp (#t: Type0) (e: exp t) : GTot (reified_exp t) | let reify_exp (#t: Type0) (e: exp t) : GTot (reified_exp t) =
let f = reify (e ()) in
f | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 73,
"start_col": 0,
"start_line": 71
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | e: Benton2004.exp t -> Prims.GTot (Benton2004.reified_exp t) | Prims.GTot | [
"sometrivial"
] | [] | [
"Benton2004.exp",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"FStar.Pervasives.Native.tuple2",
"Prims.l_and",
"Prims.l_True",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.eq2",
"FStar.Pervasives.Native.Mktuple2",
"Benton2004.reified_exp"
] | [] | false | false | false | false | false | let reify_exp (#t: Type0) (e: exp t) : GTot (reified_exp t) =
| let f = reify (e ()) in
f | false |
Benton2004.fst | Benton2004.reify_computation | val reify_computation (c: computation) : GTot reified_computation | val reify_computation (c: computation) : GTot reified_computation | let reify_computation (c: computation) : GTot reified_computation =
reify_raw_computation c | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 25,
"end_line": 60,
"start_col": 0,
"start_line": 59
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"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: Benton2004.computation -> Prims.GTot Benton2004.reified_computation | Prims.GTot | [
"sometrivial"
] | [] | [
"Benton2004.computation",
"Benton2004.reify_raw_computation",
"Benton2004.reified_computation"
] | [] | false | false | false | false | false | let reify_computation (c: computation) : GTot reified_computation =
| reify_raw_computation c | false |
Benton2004.fst | Benton2004.intersect | val intersect (#t: Type0) (ns1 ns2: rel t) : GTot (rel t) | val intersect (#t: Type0) (ns1 ns2: rel t) : GTot (rel t) | let intersect
(#t: Type0)
(ns1 ns2: rel t)
: GTot (rel t)
= let f x y = holds ns1 x y /\ holds ns2 x y in
Classical.forall_intro_2 (holds_equiv f);
f | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 219,
"start_col": 0,
"start_line": 213
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | ns1: Benton2004.Aux.rel t -> ns2: Benton2004.Aux.rel t -> Prims.GTot (Benton2004.Aux.rel t) | Prims.GTot | [
"sometrivial"
] | [] | [
"Benton2004.Aux.rel",
"Prims.unit",
"FStar.Classical.forall_intro_2",
"Prims.l_iff",
"Benton2004.Aux.holds",
"Benton2004.Aux.holds_equiv",
"Prims.logical",
"Prims.l_and"
] | [] | false | false | false | false | false | let intersect (#t: Type0) (ns1 ns2: rel t) : GTot (rel t) =
| let f x y = holds ns1 x y /\ holds ns2 x y in
Classical.forall_intro_2 (holds_equiv f);
f | false |
Benton2004.fst | Benton2004.evar | val evar (x: var) : Tot (exp int) | val evar (x: var) : Tot (exp int) | let evar (x: var) : Tot (exp int) = fun _ -> read x | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 77,
"start_col": 0,
"start_line": 77
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.var -> Benton2004.exp Prims.int | Prims.Tot | [
"total"
] | [] | [
"Benton2004.var",
"Prims.unit",
"FStar.DM4F.IntStoreFixed.read",
"Prims.int",
"Benton2004.exp"
] | [] | false | false | false | true | false | let evar (x: var) : Tot (exp int) =
| fun _ -> read x | false |
Benton2004.fst | Benton2004.skip | val skip:computation | val skip:computation | let skip : computation = let f (fuel: nat) : ISNull bool = true in f | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 68,
"end_line": 62,
"start_col": 0,
"start_line": 62
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"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 | Benton2004.computation | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.bool"
] | [] | false | false | false | true | false | let skip:computation =
| let f (fuel: nat) : ISNull bool = true in
f | false |
Benton2004.fst | Benton2004.while_raw | val while_raw (b: exp bool) (c: computation) (fuel: nat) : ISNull bool (decreases fuel) | val while_raw (b: exp bool) (c: computation) (fuel: nat) : ISNull bool (decreases fuel) | let rec while_raw (b: exp bool) (c: computation) (fuel: nat) : ISNull bool (decreases fuel) =
if b ()
then
if c fuel
then
if fuel = 0
then false
else while_raw b c (fuel - 1)
else false
else true | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 129,
"start_col": 0,
"start_line": 120
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.exp Prims.bool -> c: Benton2004.computation -> fuel: Prims.nat
-> FStar.DM4F.IntStoreFixed.ISNull Prims.bool | FStar.DM4F.IntStoreFixed.ISNull | [
""
] | [] | [
"Benton2004.exp",
"Prims.bool",
"Benton2004.computation",
"Prims.nat",
"Prims.op_Equality",
"Prims.int",
"Benton2004.while_raw",
"Prims.op_Subtraction"
] | [
"recursion"
] | false | true | false | false | false | let rec while_raw (b: exp bool) (c: computation) (fuel: nat) : ISNull bool (decreases fuel) =
| if b ()
then if c fuel then if fuel = 0 then false else while_raw b c (fuel - 1) else false
else true | false |
Benton2004.fst | Benton2004.eval_equiv_reified | val eval_equiv_reified (#t: Type0) (p: sttype) (e: nstype t) (f f': reified_exp t) : GTot Type0 | val eval_equiv_reified (#t: Type0) (p: sttype) (e: nstype t) (f f': reified_exp t) : GTot Type0 | let eval_equiv_reified
(#t: Type0)
(p: sttype)
(e: nstype t)
(f f': reified_exp t)
: GTot Type0
= forall (s s' : heap) .
holds p s s' ==> holds e (fst (f s)) (fst (f' s')) | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 258,
"start_col": 0,
"start_line": 251
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.sttype ->
e: Benton2004.nstype t ->
f: Benton2004.reified_exp t ->
f': Benton2004.reified_exp t
-> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"Benton2004.sttype",
"Benton2004.nstype",
"Benton2004.reified_exp",
"Prims.l_Forall",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.l_imp",
"Benton2004.Aux.holds",
"FStar.Pervasives.Native.fst"
] | [] | false | false | false | false | true | let eval_equiv_reified (#t: Type0) (p: sttype) (e: nstype t) (f f': reified_exp t) : GTot Type0 =
| forall (s: heap) (s': heap). holds p s s' ==> holds e (fst (f s)) (fst (f' s')) | false |
Benton2004.fst | Benton2004.interpolable | val interpolable (#t: Type0) (f: rel t) : GTot Type0 | val interpolable (#t: Type0) (f: rel t) : GTot Type0 | let interpolable
(#t: Type0)
(f: rel t)
: GTot Type0
= forall (x1 x3 : t) . f x1 x3 ==> (exists x2 . f x1 x2 /\ f x2 x3) | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 67,
"end_line": 236,
"start_col": 0,
"start_line": 232
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.Aux.rel t -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"Benton2004.Aux.rel",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_Exists",
"Prims.l_and"
] | [] | false | false | false | false | true | let interpolable (#t: Type0) (f: rel t) : GTot Type0 =
| forall (x1: t) (x3: t). f x1 x3 ==> (exists x2. f x1 x2 /\ f x2 x3) | false |
Benton2004.fst | Benton2004.terminates_equiv_reified | val terminates_equiv_reified (p: sttype) (f f': reified_computation) : GTot Type0 | val terminates_equiv_reified (p: sttype) (f f': reified_computation) : GTot Type0 | let terminates_equiv_reified
(p : sttype)
(f f' : reified_computation)
: GTot Type0
= forall s s' . holds p s s' ==> (terminates_on f s <==> terminates_on f' s') | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 77,
"end_line": 274,
"start_col": 0,
"start_line": 270
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.sttype -> f: Benton2004.reified_computation -> f': Benton2004.reified_computation
-> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"Benton2004.sttype",
"Benton2004.reified_computation",
"Prims.l_Forall",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.l_imp",
"Benton2004.Aux.holds",
"Prims.l_iff",
"Benton2004.terminates_on"
] | [] | false | false | false | false | true | let terminates_equiv_reified (p: sttype) (f f': reified_computation) : GTot Type0 =
| forall s s'. holds p s s' ==> (terminates_on f s <==> terminates_on f' s') | false |
Benton2004.fst | Benton2004.assign | val assign (r: var) (n: exp int) : Tot computation | val assign (r: var) (n: exp int) : Tot computation | let assign (r: var) (n: exp int) : Tot computation =
let g _ : ISNull bool =
let n = n () in
write r n;
true
in
g | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 85,
"start_col": 0,
"start_line": 79
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.var -> n: Benton2004.exp Prims.int -> Benton2004.computation | Prims.Tot | [
"total"
] | [] | [
"Benton2004.var",
"Benton2004.exp",
"Prims.int",
"Prims.nat",
"Prims.bool",
"Prims.unit",
"FStar.DM4F.IntStoreFixed.write",
"Benton2004.computation"
] | [] | false | false | false | true | false | let assign (r: var) (n: exp int) : Tot computation =
| let g _ : ISNull bool =
let n = n () in
write r n;
true
in
g | false |
Benton2004.fst | Benton2004.eval_equiv | val eval_equiv (#t: Type0) (p: sttype) (e: nstype t) (f f': exp t) : GTot Type0 | val eval_equiv (#t: Type0) (p: sttype) (e: nstype t) (f f': exp t) : GTot Type0 | let eval_equiv
(#t: Type0)
(p: sttype)
(e: nstype t)
(f f': exp t)
: GTot Type0
= let f = reify_exp f in
let f' = reify_exp f' in
eval_equiv_reified p e f f' | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 268,
"start_col": 0,
"start_line": 260
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.sttype -> e: Benton2004.nstype t -> f: Benton2004.exp t -> f': Benton2004.exp t
-> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"Benton2004.sttype",
"Benton2004.nstype",
"Benton2004.exp",
"Benton2004.eval_equiv_reified",
"Benton2004.reified_exp",
"Benton2004.reify_exp"
] | [] | false | false | false | false | true | let eval_equiv (#t: Type0) (p: sttype) (e: nstype t) (f f': exp t) : GTot Type0 =
| let f = reify_exp f in
let f' = reify_exp f' in
eval_equiv_reified p e f f' | false |
Benton2004.fst | Benton2004.flip | val flip (#t: Type0) (r: rel t) : Tot (rel t) | val flip (#t: Type0) (r: rel t) : Tot (rel t) | let flip (#t: Type0) (r: rel t) : Tot (rel t) =
let g x y = holds r y x in
g | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 304,
"start_col": 0,
"start_line": 302
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.Aux.rel t -> Benton2004.Aux.rel t | Prims.Tot | [
"total"
] | [] | [
"Benton2004.Aux.rel",
"Benton2004.Aux.holds"
] | [] | false | false | false | true | false | let flip (#t: Type0) (r: rel t) : Tot (rel t) =
| let g x y = holds r y x in
g | false |
Benton2004.fst | Benton2004.exec_equiv_reified | val exec_equiv_reified (p p': sttype) (f f': reified_computation) : GTot Type0 | val exec_equiv_reified (p p': sttype) (f f': reified_computation) : GTot Type0 | let exec_equiv_reified
(p p' : sttype)
(f f' : reified_computation)
: GTot Type0
= terminates_equiv_reified p f f' /\
(forall (s s' : heap) (fuel: nat) .
(holds p s s' /\ fst (f fuel s) == true /\ fst (f' fuel s') == true) ==> holds p' (snd (f fuel s)) (snd (f' fuel s'))) | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 122,
"end_line": 290,
"start_col": 0,
"start_line": 284
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.sttype ->
p': Benton2004.sttype ->
f: Benton2004.reified_computation ->
f': Benton2004.reified_computation
-> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"Benton2004.sttype",
"Benton2004.reified_computation",
"Prims.l_and",
"Benton2004.terminates_equiv_reified",
"Prims.l_Forall",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.nat",
"Prims.l_imp",
"Benton2004.Aux.holds",
"Prims.eq2",
"Prims.bool",
"FStar.Pervasives.Native.fst",
"FStar.Pervasives... | [] | false | false | false | false | true | let exec_equiv_reified (p p': sttype) (f f': reified_computation) : GTot Type0 =
| terminates_equiv_reified p f f' /\
(forall (s: heap) (s': heap) (fuel: nat).
(holds p s s' /\ fst (f fuel s) == true /\ fst (f' fuel s') == true) ==>
holds p' (snd (f fuel s)) (snd (f' fuel s'))) | false |
Benton2004.fst | Benton2004.while | val while (b: exp bool) (c: computation) : Tot computation | val while (b: exp bool) (c: computation) : Tot computation | let while (b: exp bool) (c: computation) : Tot computation =
let f : raw_computation = while_raw b c in
let g = reify_raw_computation f in
fuel_monotonic_while b c g;
f | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 169,
"start_col": 0,
"start_line": 165
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.exp Prims.bool -> c: Benton2004.computation -> Benton2004.computation | Prims.Tot | [
"total"
] | [] | [
"Benton2004.exp",
"Prims.bool",
"Benton2004.computation",
"Prims.unit",
"Benton2004.fuel_monotonic_while",
"Benton2004.reified_raw_computation",
"Benton2004.reify_raw_computation",
"Benton2004.raw_computation",
"Benton2004.while_raw"
] | [] | false | false | false | true | false | let while (b: exp bool) (c: computation) : Tot computation =
| let f:raw_computation = while_raw b c in
let g = reify_raw_computation f in
fuel_monotonic_while b c g;
f | false |
Benton2004.fst | Benton2004.exec_equiv | val exec_equiv (p p': sttype) (f f': computation) : GTot Type0 | val exec_equiv (p p': sttype) (f f': computation) : GTot Type0 | let exec_equiv
(p p' : sttype)
(f f' : computation)
: GTot Type0
= let f = reify_computation f in
let f' = reify_computation f' in
exec_equiv_reified p p' f f' | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 30,
"end_line": 298,
"start_col": 0,
"start_line": 292
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.sttype ->
p': Benton2004.sttype ->
f: Benton2004.computation ->
f': Benton2004.computation
-> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"Benton2004.sttype",
"Benton2004.computation",
"Benton2004.exec_equiv_reified",
"Benton2004.reified_computation",
"Benton2004.reify_computation"
] | [] | false | false | false | false | true | let exec_equiv (p p': sttype) (f f': computation) : GTot Type0 =
| let f = reify_computation f in
let f' = reify_computation f' in
exec_equiv_reified p p' f f' | false |
Benton2004.fst | Benton2004.is_per_holds_sym | val is_per_holds_sym (#t: Type0) (p: rel t) (s s': t)
: Lemma (requires (is_per p)) (ensures (holds p s s' <==> holds p s' s)) [SMTPat (holds p s s')] | val is_per_holds_sym (#t: Type0) (p: rel t) (s s': t)
: Lemma (requires (is_per p)) (ensures (holds p s s' <==> holds p s' s)) [SMTPat (holds p s s')] | let is_per_holds_sym
(#t: Type0)
(p: rel t)
(s s' : t)
: Lemma
(requires (is_per p))
(ensures (holds p s s' <==> holds p s' s))
[SMTPat (holds p s s')]
= holds_equiv p s s';
holds_equiv p s' s | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 195,
"start_col": 0,
"start_line": 186
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.Aux.rel t -> s: t -> s': t
-> FStar.Pervasives.Lemma (requires Benton2004.is_per p)
(ensures Benton2004.Aux.holds p s s' <==> Benton2004.Aux.holds p s' s)
[SMTPat (Benton2004.Aux.holds p s s')] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.Aux.rel",
"Benton2004.Aux.holds_equiv",
"Prims.unit",
"Benton2004.is_per",
"Prims.squash",
"Prims.l_iff",
"Benton2004.Aux.holds",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.Nil"
] | [] | true | false | true | false | false | let is_per_holds_sym (#t: Type0) (p: rel t) (s s': t)
: Lemma (requires (is_per p)) (ensures (holds p s s' <==> holds p s' s)) [SMTPat (holds p s s')] =
| holds_equiv p s s';
holds_equiv p s' s | false |
Benton2004.fst | Benton2004.per_holds_trans | val per_holds_trans (#t: Type0) (f: rel t) (x1 x2 x3: t)
: Lemma (requires (is_per f /\ holds f x1 x2 /\ holds f x2 x3))
(ensures (holds f x1 x3))
[
SMTPatOr
[
[SMTPat (holds f x1 x2); SMTPat (holds f x2 x3)];
[SMTPat (holds f x1 x2); SMTPat (holds f x1 x3)];
... | val per_holds_trans (#t: Type0) (f: rel t) (x1 x2 x3: t)
: Lemma (requires (is_per f /\ holds f x1 x2 /\ holds f x2 x3))
(ensures (holds f x1 x3))
[
SMTPatOr
[
[SMTPat (holds f x1 x2); SMTPat (holds f x2 x3)];
[SMTPat (holds f x1 x2); SMTPat (holds f x1 x3)];
... | let per_holds_trans
(#t: Type0)
(f: rel t)
(x1 x2 x3: t)
: Lemma
(requires (is_per f /\ holds f x1 x2 /\ holds f x2 x3))
(ensures (holds f x1 x3))
[SMTPatOr [
[SMTPat (holds f x1 x2); SMTPat (holds f x2 x3)];
[SMTPat (holds f x1 x2); SMTPat (holds f x1 x3)];
[SMTPat (holds f x2 x3); SMTPat (hold... | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 21,
"end_line": 211,
"start_col": 0,
"start_line": 197
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.Aux.rel t -> x1: t -> x2: t -> x3: t
-> FStar.Pervasives.Lemma
(requires Benton2004.is_per f /\ Benton2004.Aux.holds f x1 x2 /\ Benton2004.Aux.holds f x2 x3)
(ensures Benton2004.Aux.holds f x1 x3)
[
SMTPatOr [
[SMTPat (Benton2004.Aux.holds f x1 x2); SMTPat (Benton20... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.Aux.rel",
"Benton2004.Aux.holds_equiv",
"Prims.unit",
"Prims.l_and",
"Benton2004.is_per",
"Benton2004.Aux.holds",
"Prims.squash",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat_or",
"Prims.list",
"FStar.Pervasives.smt_pat",
"Prims.Nil"
] | [] | true | false | true | false | false | let per_holds_trans (#t: Type0) (f: rel t) (x1 x2 x3: t)
: Lemma (requires (is_per f /\ holds f x1 x2 /\ holds f x2 x3))
(ensures (holds f x1 x3))
[
SMTPatOr
[
[SMTPat (holds f x1 x2); SMTPat (holds f x2 x3)];
[SMTPat (holds f x1 x2); SMTPat (holds f x1 x3)];
... | holds_equiv f x1 x2;
holds_equiv f x2 x3;
holds_equiv f x1 x3 | false |
Benton2004.fst | Benton2004.interpolable_elim | val interpolable_elim (#t: Type0) (f: rel t) (x1 x3: t)
: Lemma (requires (interpolable f /\ holds f x1 x3))
(ensures (exists x2. holds f x1 x2 /\ holds f x2 x3)) | val interpolable_elim (#t: Type0) (f: rel t) (x1 x3: t)
: Lemma (requires (interpolable f /\ holds f x1 x3))
(ensures (exists x2. holds f x1 x2 /\ holds f x2 x3)) | let interpolable_elim
(#t: Type0)
(f: rel t)
(x1 x3: t)
: Lemma
(requires (interpolable f /\ holds f x1 x3))
(ensures (exists x2 . holds f x1 x2 /\ holds f x2 x3))
= Classical.forall_intro_2 (holds_equiv f) | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 42,
"end_line": 245,
"start_col": 0,
"start_line": 238
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.Aux.rel t -> x1: t -> x3: t
-> FStar.Pervasives.Lemma (requires Benton2004.interpolable f /\ Benton2004.Aux.holds f x1 x3)
(ensures exists (x2: t). Benton2004.Aux.holds f x1 x2 /\ Benton2004.Aux.holds f x2 x3) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.Aux.rel",
"FStar.Classical.forall_intro_2",
"Prims.l_iff",
"Benton2004.Aux.holds",
"Benton2004.Aux.holds_equiv",
"Prims.unit",
"Prims.l_and",
"Benton2004.interpolable",
"Prims.squash",
"Prims.l_Exists",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | false | false | true | false | false | let interpolable_elim (#t: Type0) (f: rel t) (x1 x3: t)
: Lemma (requires (interpolable f /\ holds f x1 x3))
(ensures (exists x2. holds f x1 x2 /\ holds f x2 x3)) =
| Classical.forall_intro_2 (holds_equiv f) | false |
Benton2004.fst | Benton2004.holds_intersect | val holds_intersect (#t: Type0) (ns1 ns2: rel t) (x y: t)
: Lemma (holds (intersect ns1 ns2) x y <==> (holds ns1 x y /\ holds ns2 x y))
[SMTPat (holds (intersect ns1 ns2) x y)] | val holds_intersect (#t: Type0) (ns1 ns2: rel t) (x y: t)
: Lemma (holds (intersect ns1 ns2) x y <==> (holds ns1 x y /\ holds ns2 x y))
[SMTPat (holds (intersect ns1 ns2) x y)] | let holds_intersect
(#t: Type0)
(ns1 ns2: rel t)
(x y: t)
: Lemma
(holds (intersect ns1 ns2) x y <==> (holds ns1 x y /\ holds ns2 x y))
[SMTPat (holds (intersect ns1 ns2) x y)]
= holds_equiv (intersect ns1 ns2) x y | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 228,
"start_col": 0,
"start_line": 221
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | ns1: Benton2004.Aux.rel t -> ns2: Benton2004.Aux.rel t -> x: t -> y: t
-> FStar.Pervasives.Lemma
(ensures
Benton2004.Aux.holds (Benton2004.intersect ns1 ns2) x y <==>
Benton2004.Aux.holds ns1 x y /\ Benton2004.Aux.holds ns2 x y)
[SMTPat (Benton2004.Aux.holds (Benton2004.intersect ns1 ns2) ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.Aux.rel",
"Benton2004.Aux.holds_equiv",
"Benton2004.intersect",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_iff",
"Benton2004.Aux.holds",
"Prims.l_and",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.Nil"
] | [] | true | false | true | false | false | let holds_intersect (#t: Type0) (ns1 ns2: rel t) (x y: t)
: Lemma (holds (intersect ns1 ns2) x y <==> (holds ns1 x y /\ holds ns2 x y))
[SMTPat (holds (intersect ns1 ns2) x y)] =
| holds_equiv (intersect ns1 ns2) x y | false |
Benton2004.fst | Benton2004.holds_flip' | val holds_flip' (#t: Type0) (r: rel t) (x y: _)
: Lemma (ensures (holds (flip r) x y <==> holds r y x)) [SMTPat (holds (flip r) x y)] | val holds_flip' (#t: Type0) (r: rel t) (x y: _)
: Lemma (ensures (holds (flip r) x y <==> holds r y x)) [SMTPat (holds (flip r) x y)] | let holds_flip' (#t: Type0) (r: rel t) x y : Lemma
(ensures (holds (flip r) x y <==> holds r y x))
[SMTPat (holds (flip r) x y)]
= holds_flip r | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 14,
"end_line": 313,
"start_col": 0,
"start_line": 310
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.Aux.rel t -> x: t -> y: t
-> FStar.Pervasives.Lemma
(ensures Benton2004.Aux.holds (Benton2004.flip r) x y <==> Benton2004.Aux.holds r y x)
[SMTPat (Benton2004.Aux.holds (Benton2004.flip r) x y)] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.Aux.rel",
"Benton2004.holds_flip",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_iff",
"Benton2004.Aux.holds",
"Benton2004.flip",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.Nil"
] | [] | true | false | true | false | false | let holds_flip' (#t: Type0) (r: rel t) x y
: Lemma (ensures (holds (flip r) x y <==> holds r y x)) [SMTPat (holds (flip r) x y)] =
| holds_flip r | false |
Benton2004.fst | Benton2004.holds_flip | val holds_flip (#t: Type0) (r: rel t) : Lemma (forall x y. holds (flip r) x y <==> holds r y x) | val holds_flip (#t: Type0) (r: rel t) : Lemma (forall x y. holds (flip r) x y <==> holds r y x) | let holds_flip (#t: Type0) (r: rel t) : Lemma
(forall x y . holds (flip r) x y <==> holds r y x)
= Classical.forall_intro_2 (holds_equiv (flip r)) | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 308,
"start_col": 0,
"start_line": 306
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.Aux.rel t
-> FStar.Pervasives.Lemma
(ensures
forall (x: t) (y: t).
Benton2004.Aux.holds (Benton2004.flip r) x y <==> Benton2004.Aux.holds r y x) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.Aux.rel",
"FStar.Classical.forall_intro_2",
"Prims.l_iff",
"Benton2004.Aux.holds",
"Benton2004.flip",
"Benton2004.Aux.holds_equiv",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_Forall",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | false | false | true | false | false | let holds_flip (#t: Type0) (r: rel t) : Lemma (forall x y. holds (flip r) x y <==> holds r y x) =
| Classical.forall_intro_2 (holds_equiv (flip r)) | false |
Benton2004.fst | Benton2004.eval_equiv_flip | val eval_equiv_flip (#t: Type0) (p: sttype) (e: nstype t) (f f': exp t)
: Lemma (eval_equiv (flip p) (flip e) f' f <==> eval_equiv p e f f')
[SMTPat (eval_equiv (flip p) (flip e) f' f)] | val eval_equiv_flip (#t: Type0) (p: sttype) (e: nstype t) (f f': exp t)
: Lemma (eval_equiv (flip p) (flip e) f' f <==> eval_equiv p e f f')
[SMTPat (eval_equiv (flip p) (flip e) f' f)] | let eval_equiv_flip
(#t: Type0)
(p: sttype)
(e: nstype t)
(f f': exp t)
: Lemma
(eval_equiv (flip p) (flip e) f' f <==> eval_equiv p e f f')
[SMTPat (eval_equiv (flip p) (flip e) f' f)]
= holds_flip p;
holds_flip e | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 14,
"end_line": 324,
"start_col": 0,
"start_line": 315
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.sttype -> e: Benton2004.nstype t -> f: Benton2004.exp t -> f': Benton2004.exp t
-> FStar.Pervasives.Lemma
(ensures
Benton2004.eval_equiv (Benton2004.flip p) (Benton2004.flip e) f' f <==>
Benton2004.eval_equiv p e f f')
[SMTPat (Benton2004.eval_equiv (Benton2004.flip p) (Bento... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.sttype",
"Benton2004.nstype",
"Benton2004.exp",
"Benton2004.holds_flip",
"Prims.unit",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.l_True",
"Prims.squash",
"Prims.l_iff",
"Benton2004.eval_equiv",
"Benton2004.flip",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.sm... | [] | true | false | true | false | false | let eval_equiv_flip (#t: Type0) (p: sttype) (e: nstype t) (f f': exp t)
: Lemma (eval_equiv (flip p) (flip e) f' f <==> eval_equiv p e f f')
[SMTPat (eval_equiv (flip p) (flip e) f' f)] =
| holds_flip p;
holds_flip e | false |
Benton2004.fst | Benton2004.mention | val mention : x: a -> Prims.logical | let mention (#a:Type) (x:a) = True | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 829,
"start_col": 0,
"start_line": 829
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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 -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Prims.l_True",
"Prims.logical"
] | [] | false | false | false | true | true | let mention (#a: Type) (x: a) =
| True | false | |
Hacl.Spec.SHA2.Equiv.fst | Hacl.Spec.SHA2.Equiv.load_ws_lemma_l | val load_ws_lemma_l:
#a:sha2_alg
-> #m:m_spec{is_supported a m}
-> b:multiblock_spec a m
-> j:nat{j < lanes a m} ->
Lemma ((ws_spec_v (load_ws b)).[j] == BSeq.uints_from_bytes_be #(word_t a) #SEC #(block_word_length a) b.(|j|)) | val load_ws_lemma_l:
#a:sha2_alg
-> #m:m_spec{is_supported a m}
-> b:multiblock_spec a m
-> j:nat{j < lanes a m} ->
Lemma ((ws_spec_v (load_ws b)).[j] == BSeq.uints_from_bytes_be #(word_t a) #SEC #(block_word_length a) b.(|j|)) | let load_ws_lemma_l #a #m b j =
let lp = Seq.index (ws_spec_v (load_ws b)) j in
let rp = BSeq.uints_from_bytes_be #(word_t a) #SEC #16 b.(|j|) in
let aux (i:nat{i < 16}) : Lemma (Seq.index lp i == Seq.index rp i) =
let l = lanes a m in
BSeq.index_uints_from_bytes_be #(word_t a) #SEC #16 b.(|j|) i;
as... | {
"file_name": "code/sha2-mb/Hacl.Spec.SHA2.Equiv.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 416,
"start_col": 0,
"start_line": 401
} | module Hacl.Spec.SHA2.Equiv
open FStar.Mul
open Lib.IntTypes
open Lib.NTuple
open Lib.Sequence
open Lib.IntVector
open Lib.IntVector.Serialize
open Lib.LoopCombinators
open Spec.Hash.Definitions
open Hacl.Spec.SHA2.Vec
module Spec = Hacl.Spec.SHA2
module LSeq = Lib.Sequence
module BSeq = Lib.ByteSequence
module Lemma... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NTuple.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntVector.Serialize.fsti.checked",
"Lib.IntVector.fsti.c... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.SHA2.Lemmas",
"short_module": "Lemmas"
},
{
"abbrev": true,
"full_module": "Lib.ByteSequence",
"short_module": "BSeq"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"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 | b: Hacl.Spec.SHA2.Vec.multiblock_spec a m -> j: Prims.nat{j < Hacl.Spec.SHA2.Vec.lanes a m}
-> FStar.Pervasives.Lemma
(ensures
(Hacl.Spec.SHA2.Vec.ws_spec_v (Hacl.Spec.SHA2.Vec.load_ws b)).[ j ] ==
Lib.ByteSequence.uints_from_bytes_be b.(| j |)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Spec.Hash.Definitions.sha2_alg",
"Hacl.Spec.SHA2.Vec.m_spec",
"Hacl.Spec.SHA2.Vec.is_supported",
"Hacl.Spec.SHA2.Vec.multiblock_spec",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Hacl.Spec.SHA2.Vec.lanes",
"Lib.Sequence.eq_intro",
"Hacl.Spec.SHA2.Vec.word",
"Prims.unit",
"FStar.Classical.... | [] | false | false | true | false | false | let load_ws_lemma_l #a #m b j =
| let lp = Seq.index (ws_spec_v (load_ws b)) j in
let rp = BSeq.uints_from_bytes_be #(word_t a) #SEC #16 b.(| j |) in
let aux (i: nat{i < 16}) : Lemma (Seq.index lp i == Seq.index rp i) =
let l = lanes a m in
BSeq.index_uints_from_bytes_be #(word_t a) #SEC #16 b.(| j |) i;
assert (Seq.index rp i ==
BSeq.uint_... | false |
Benton2004.fst | Benton2004.eop | val eop (#from #to: Type0) (op: (from -> from -> Tot to)) (e1 e2: exp from) : Tot (exp to) | val eop (#from #to: Type0) (op: (from -> from -> Tot to)) (e1 e2: exp from) : Tot (exp to) | let eop
(#from #to: Type0)
(op: (from -> from -> Tot to))
(e1 e2: exp from)
: Tot (exp to)
= fun () -> (e1 ()) `op` (e2 ()) | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 477,
"start_col": 0,
"start_line": 472
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | op: (_: from -> _: from -> to) -> e1: Benton2004.exp from -> e2: Benton2004.exp from
-> Benton2004.exp to | Prims.Tot | [
"total"
] | [] | [
"Benton2004.exp",
"Prims.unit"
] | [] | false | false | false | true | false | let eop (#from #to: Type0) (op: (from -> from -> Tot to)) (e1 e2: exp from) : Tot (exp to) =
| fun () -> (e1 ()) `op` (e2 ()) | false |
Benton2004.fst | Benton2004.exec_equiv_flip | val exec_equiv_flip (p p': sttype) (f f': computation)
: Lemma (exec_equiv (flip p) (flip p') f f' <==> exec_equiv p p' f' f)
[SMTPat (exec_equiv (flip p) (flip p') f f')] | val exec_equiv_flip (p p': sttype) (f f': computation)
: Lemma (exec_equiv (flip p) (flip p') f f' <==> exec_equiv p p' f' f)
[SMTPat (exec_equiv (flip p) (flip p') f f')] | let exec_equiv_flip
(p p': sttype)
(f f' : computation)
: Lemma
(exec_equiv (flip p) (flip p') f f' <==> exec_equiv p p' f' f)
[SMTPat (exec_equiv (flip p) (flip p') f f')]
= holds_flip p;
holds_flip p' | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 15,
"end_line": 333,
"start_col": 0,
"start_line": 326
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.sttype ->
p': Benton2004.sttype ->
f: Benton2004.computation ->
f': Benton2004.computation
-> FStar.Pervasives.Lemma
(ensures
Benton2004.exec_equiv (Benton2004.flip p) (Benton2004.flip p') f f' <==>
Benton2004.exec_equiv p p' f' f)
[SMTPat (Benton2004.exec_eq... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.sttype",
"Benton2004.computation",
"Benton2004.holds_flip",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_iff",
"Benton2004.exec_equiv",
"Benton2004.flip",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prim... | [] | true | false | true | false | false | let exec_equiv_flip (p p': sttype) (f f': computation)
: Lemma (exec_equiv (flip p) (flip p') f f' <==> exec_equiv p p' f' f)
[SMTPat (exec_equiv (flip p) (flip p') f f')] =
| holds_flip p;
holds_flip p' | false |
Benton2004.fst | Benton2004.eval_equiv_trans | val eval_equiv_trans (#t: Type0) (p: sttype) (e: nstype t) (f1 f2 f3: exp t)
: Lemma (requires (is_per e /\ interpolable p /\ eval_equiv p e f1 f2 /\ eval_equiv p e f2 f3))
(ensures eval_equiv p e f1 f3) | val eval_equiv_trans (#t: Type0) (p: sttype) (e: nstype t) (f1 f2 f3: exp t)
: Lemma (requires (is_per e /\ interpolable p /\ eval_equiv p e f1 f2 /\ eval_equiv p e f2 f3))
(ensures eval_equiv p e f1 f3) | let eval_equiv_trans
(#t: Type0)
(p: sttype)
(e: nstype t)
(f1 f2 f3 : exp t)
: Lemma
(requires (is_per e /\ interpolable p /\ eval_equiv p e f1 f2 /\ eval_equiv p e f2 f3))
(ensures eval_equiv p e f1 f3)
= let lem (s1 s3:heap)
: Lemma (requires holds p s1 s3)
(ensures (holds e (fst (reify_e... | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 69,
"end_line": 376,
"start_col": 0,
"start_line": 357
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"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 |
p: Benton2004.sttype ->
e: Benton2004.nstype t ->
f1: Benton2004.exp t ->
f2: Benton2004.exp t ->
f3: Benton2004.exp t
-> FStar.Pervasives.Lemma
(requires
Benton2004.is_per e /\ Benton2004.interpolable p /\ Benton2004.eval_equiv p e f1 f2 /\
Benton2004.eval_equiv p e f2 f3) ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.sttype",
"Benton2004.nstype",
"Benton2004.exp",
"FStar.Classical.forall_intro_2",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.l_imp",
"Benton2004.Aux.holds",
"FStar.Pervasives.Native.fst",
"Benton2004.reify_exp",
"FStar.Classical.move_requires",
"Prims.unit",
"Prims.l_True",
"Pr... | [] | false | false | true | false | false | let eval_equiv_trans (#t: Type0) (p: sttype) (e: nstype t) (f1 f2 f3: exp t)
: Lemma (requires (is_per e /\ interpolable p /\ eval_equiv p e f1 f2 /\ eval_equiv p e f2 f3))
(ensures eval_equiv p e f1 f3) =
| let lem (s1 s3: heap)
: Lemma (requires holds p s1 s3)
(ensures (holds e (fst (reify_exp f1 s1)) (fst (reify_exp f3 s3)))) =
let w = interpolable_elim p s1 s3 in
Classical.exists_elim (holds e (fst (reify_exp f1 s1)) (fst (reify_exp f3 s3)))
w
(fun (s2: heap{holds p s1 s2 /\ holds p s2 s3}) ->
... | false |
Benton2004.fst | Benton2004.exec_equiv_trans | val exec_equiv_trans (p p': sttype) (c1 c2 c3: computation)
: Lemma
(requires (is_per p' /\ interpolable p /\ exec_equiv p p' c1 c2 /\ exec_equiv p p' c2 c3))
(ensures (exec_equiv p p' c1 c3))
[
SMTPatOr
[
[SMTPat (exec_equiv p p' c1 c2); SMTPat (exec_equiv p p' c2 c3)];
... | val exec_equiv_trans (p p': sttype) (c1 c2 c3: computation)
: Lemma
(requires (is_per p' /\ interpolable p /\ exec_equiv p p' c1 c2 /\ exec_equiv p p' c2 c3))
(ensures (exec_equiv p p' c1 c3))
[
SMTPatOr
[
[SMTPat (exec_equiv p p' c1 c2); SMTPat (exec_equiv p p' c2 c3)];
... | let exec_equiv_trans
(p p' : sttype)
(c1 c2 c3 : computation)
: Lemma
(requires (
is_per p' /\
interpolable p /\
exec_equiv p p' c1 c2 /\
exec_equiv p p' c2 c3
))
(ensures (exec_equiv p p' c1 c3))
[SMTPatOr [
[SMTPat (exec_equiv p p' c1 c2); SMTPat (exec_equiv p p' c2 c3)];
[SMTPat (... | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 440,
"start_col": 0,
"start_line": 421
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.sttype ->
p': Benton2004.sttype ->
c1: Benton2004.computation ->
c2: Benton2004.computation ->
c3: Benton2004.computation
-> FStar.Pervasives.Lemma
(requires
Benton2004.is_per p' /\ Benton2004.interpolable p /\ Benton2004.exec_equiv p p' c1 c2 /\
Benton2004.exe... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.sttype",
"Benton2004.computation",
"Benton2004.exec_equiv_reified_trans",
"Benton2004.reified_computation",
"Benton2004.reify_computation",
"Prims.unit",
"Prims.l_and",
"Benton2004.is_per",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Benton2004.interpolable",
"Benton2004.exec_equiv",
"P... | [] | true | false | true | false | false | let exec_equiv_trans (p p': sttype) (c1 c2 c3: computation)
: Lemma
(requires (is_per p' /\ interpolable p /\ exec_equiv p p' c1 c2 /\ exec_equiv p p' c2 c3))
(ensures (exec_equiv p p' c1 c3))
[
SMTPatOr
[
[SMTPat (exec_equiv p p' c1 c2); SMTPat (exec_equiv p p' c2 c3)];
... | let z1 = reify_computation c1 in
let z2 = reify_computation c2 in
let z3 = reify_computation c3 in
exec_equiv_reified_trans p p' z1 z2 z3 | false |
Benton2004.fst | Benton2004.d_seq_terminates_recip | val d_seq_terminates_recip (p0 p1 p2: sttype) (c01 c01' c12 c12': computation) (s0 s0': heap)
: Lemma
(requires
(exec_equiv p0 p1 c01 c01' /\ exec_equiv p1 p2 c12 c12' /\ holds p0 s0 s0' /\
terminates_on (reify_computation (seq c01' c12')) s0'))
(ensures (terminates_on (reify_computati... | val d_seq_terminates_recip (p0 p1 p2: sttype) (c01 c01' c12 c12': computation) (s0 s0': heap)
: Lemma
(requires
(exec_equiv p0 p1 c01 c01' /\ exec_equiv p1 p2 c12 c12' /\ holds p0 s0 s0' /\
terminates_on (reify_computation (seq c01' c12')) s0'))
(ensures (terminates_on (reify_computati... | let d_seq_terminates_recip
(p0 p1 p2 : sttype)
(c01 c01' c12 c12' : computation)
(s0 s0': heap)
: Lemma
(requires (
exec_equiv p0 p1 c01 c01' /\
exec_equiv p1 p2 c12 c12' /\
holds p0 s0 s0' /\
terminates_on (reify_computation (seq c01' c12')) s0'
))
(ensures (
terminates_on (reify_comput... | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 73,
"end_line": 582,
"start_col": 0,
"start_line": 567
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
p0: Benton2004.sttype ->
p1: Benton2004.sttype ->
p2: Benton2004.sttype ->
c01: Benton2004.computation ->
c01': Benton2004.computation ->
c12: Benton2004.computation ->
c12': Benton2004.computation ->
s0: FStar.DM4F.Heap.IntStoreFixed.heap ->
s0': FStar.DM4F.Heap.IntStoreFixed.heap
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.sttype",
"Benton2004.computation",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Benton2004.d_seq_terminates",
"Benton2004.flip",
"Prims.unit",
"Benton2004.holds_flip'",
"Prims.l_and",
"Benton2004.exec_equiv",
"Benton2004.Aux.holds",
"Benton2004.terminates_on",
"Benton2004.reify_computati... | [] | true | false | true | false | false | let d_seq_terminates_recip (p0 p1 p2: sttype) (c01 c01' c12 c12': computation) (s0 s0': heap)
: Lemma
(requires
(exec_equiv p0 p1 c01 c01' /\ exec_equiv p1 p2 c12 c12' /\ holds p0 s0 s0' /\
terminates_on (reify_computation (seq c01' c12')) s0'))
(ensures (terminates_on (reify_computati... | holds_flip' p0 s0' s0;
d_seq_terminates (flip p0) (flip p1) (flip p2) c01' c01 c12' c12 s0' s0 | false |
Hacl.HPKE.Interface.DH.fst | Hacl.HPKE.Interface.DH.vale_p | val vale_p : Prims.logical | let vale_p = Vale.X64.CPU_Features_s.(adx_enabled /\ bmi2_enabled) | {
"file_name": "code/hpke/Hacl.HPKE.Interface.DH.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 66,
"end_line": 84,
"start_col": 0,
"start_line": 84
} | module Hacl.HPKE.Interface.DH
open FStar.HyperStack
open FStar.HyperStack.All
module HST = FStar.HyperStack.ST
open Lib.Buffer
open Lib.IntTypes
open Lib.ByteBuffer
module DH = Spec.Agile.DH
module S = Spec.Agile.HPKE
#reset-options "--z3rlimit 20 --fuel 0 --ifuel 1"
unfold noextract
let nsize_key (a:DH.algorithm)... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.DH.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Agile.DH",
"short_module": "DH"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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 | Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Prims.l_and",
"Prims.b2t",
"Vale.X64.CPU_Features_s.adx_enabled",
"Vale.X64.CPU_Features_s.bmi2_enabled"
] | [] | false | false | false | true | true | let vale_p =
| let open Vale.X64.CPU_Features_s in adx_enabled /\ bmi2_enabled | false | |
Benton2004.fst | Benton2004.d_assoc | val d_assoc (c1 c2 c3: computation) (phi phi': sttype)
: Lemma (requires (exec_equiv phi phi' (seq (seq c1 c2) c3) (seq (seq c1 c2) c3)))
(ensures (exec_equiv phi phi' (seq (seq c1 c2) c3) (seq c1 (seq c2 c3))))
[SMTPat (exec_equiv phi phi' (seq (seq c1 c2) c3) (seq c1 (seq c2 c3)))] | val d_assoc (c1 c2 c3: computation) (phi phi': sttype)
: Lemma (requires (exec_equiv phi phi' (seq (seq c1 c2) c3) (seq (seq c1 c2) c3)))
(ensures (exec_equiv phi phi' (seq (seq c1 c2) c3) (seq c1 (seq c2 c3))))
[SMTPat (exec_equiv phi phi' (seq (seq c1 c2) c3) (seq c1 (seq c2 c3)))] | let d_assoc
(c1 c2 c3: computation)
(phi phi' : sttype)
: Lemma
(requires (exec_equiv phi phi' (seq (seq c1 c2) c3) (seq (seq c1 c2) c3)))
(ensures (exec_equiv phi phi' (seq (seq c1 c2) c3) (seq c1 (seq c2 c3))))
[SMTPat (exec_equiv phi phi' (seq (seq c1 c2) c3) (seq c1 (seq c2 c3)))]
= let fl = reify_computa... | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 678,
"start_col": 0,
"start_line": 669
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
c1: Benton2004.computation ->
c2: Benton2004.computation ->
c3: Benton2004.computation ->
phi: Benton2004.sttype ->
phi': Benton2004.sttype
-> FStar.Pervasives.Lemma
(requires
Benton2004.exec_equiv phi
phi'
(Benton2004.seq (Benton2004.seq c1 c2) c3)
(Be... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.computation",
"Benton2004.sttype",
"Prims._assert",
"Prims.l_Forall",
"Prims.nat",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.eq2",
"FStar.Pervasives.Native.tuple2",
"Prims.bool",
"Benton2004.reified_computation",
"Benton2004.reify_computation",
"Benton2004.seq",
"Prims.unit",
... | [] | false | false | true | false | false | let d_assoc (c1 c2 c3: computation) (phi phi': sttype)
: Lemma (requires (exec_equiv phi phi' (seq (seq c1 c2) c3) (seq (seq c1 c2) c3)))
(ensures (exec_equiv phi phi' (seq (seq c1 c2) c3) (seq c1 (seq c2 c3))))
[SMTPat (exec_equiv phi phi' (seq (seq c1 c2) c3) (seq c1 (seq c2 c3)))] =
| let fl = reify_computation (seq (seq c1 c2) c3) in
let fr = reify_computation (seq c1 (seq c2 c3)) in
assert (forall s0 fuel. fl s0 fuel == fr s0 fuel) | false |
Benton2004.fst | Benton2004.d_cc | val d_cc (b: exp bool) (c1 c2 c3: computation) (phi phi' phi'': sttype)
: Lemma
(requires
(exec_equiv phi phi' (ifthenelse b c1 c2) (ifthenelse b c1 c2) /\
exec_equiv phi' phi'' c3 c3))
(ensures
(exec_equiv phi phi'' (seq (ifthenelse b c1 c2) c3) (ifthenelse b (seq c1 c3) (seq ... | val d_cc (b: exp bool) (c1 c2 c3: computation) (phi phi' phi'': sttype)
: Lemma
(requires
(exec_equiv phi phi' (ifthenelse b c1 c2) (ifthenelse b c1 c2) /\
exec_equiv phi' phi'' c3 c3))
(ensures
(exec_equiv phi phi'' (seq (ifthenelse b c1 c2) c3) (ifthenelse b (seq c1 c3) (seq ... | let d_cc
(b: exp bool)
(c1 c2 c3: computation)
(phi phi' phi'' : sttype)
: Lemma
(requires (
exec_equiv phi phi' (ifthenelse b c1 c2) (ifthenelse b c1 c2) /\
exec_equiv phi' phi'' c3 c3
))
(ensures (
exec_equiv phi phi'' (seq (ifthenelse b c1 c2) c3) (ifthenelse b (seq c1 c3) (seq c2 c3))
))
... | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 91,
"end_line": 700,
"start_col": 0,
"start_line": 680
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.exp Prims.bool ->
c1: Benton2004.computation ->
c2: Benton2004.computation ->
c3: Benton2004.computation ->
phi: Benton2004.sttype ->
phi': Benton2004.sttype ->
phi'': Benton2004.sttype
-> FStar.Pervasives.Lemma
(requires
Benton2004.exec_equiv phi
phi... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.exp",
"Prims.bool",
"Benton2004.computation",
"Benton2004.sttype",
"Prims._assert",
"Benton2004.exec_equiv",
"Benton2004.seq",
"Benton2004.ifthenelse",
"Prims.unit",
"Prims.l_Forall",
"Prims.nat",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.eq2",
"FStar.Pervasives.Native.tuple... | [] | false | false | true | false | false | let d_cc (b: exp bool) (c1 c2 c3: computation) (phi phi' phi'': sttype)
: Lemma
(requires
(exec_equiv phi phi' (ifthenelse b c1 c2) (ifthenelse b c1 c2) /\
exec_equiv phi' phi'' c3 c3))
(ensures
(exec_equiv phi phi'' (seq (ifthenelse b c1 c2) c3) (ifthenelse b (seq c1 c3) (seq ... | let fl = reify_computation (seq (ifthenelse b c1 c2) c3) in
let fr = reify_computation (ifthenelse b (seq c1 c3) (seq c2 c3)) in
assert (forall s0 fuel. fl s0 fuel == fr s0 fuel);
assert (exec_equiv phi phi'' (seq (ifthenelse b c1 c2) c3) (seq (ifthenelse b c1 c2) c3)) | false |
Benton2004.fst | Benton2004.d_seq_terminates | val d_seq_terminates (p0 p1 p2: sttype) (c01 c01' c12 c12': computation) (s0 s0': heap)
: Lemma
(requires
(exec_equiv p0 p1 c01 c01' /\ exec_equiv p1 p2 c12 c12' /\ holds p0 s0 s0' /\
terminates_on (reify_computation (seq c01 c12)) s0))
(ensures (terminates_on (reify_computation (seq c... | val d_seq_terminates (p0 p1 p2: sttype) (c01 c01' c12 c12': computation) (s0 s0': heap)
: Lemma
(requires
(exec_equiv p0 p1 c01 c01' /\ exec_equiv p1 p2 c12 c12' /\ holds p0 s0 s0' /\
terminates_on (reify_computation (seq c01 c12)) s0))
(ensures (terminates_on (reify_computation (seq c... | let d_seq_terminates
(p0 p1 p2 : sttype)
(c01 c01' c12 c12' : computation)
(s0 s0': heap)
: Lemma
(requires (
exec_equiv p0 p1 c01 c01' /\
exec_equiv p1 p2 c12 c12' /\
holds p0 s0 s0' /\
terminates_on (reify_computation (seq c01 c12)) s0
))
(ensures (
terminates_on (reify_computation (se... | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 563,
"start_col": 0,
"start_line": 518
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
p0: Benton2004.sttype ->
p1: Benton2004.sttype ->
p2: Benton2004.sttype ->
c01: Benton2004.computation ->
c01': Benton2004.computation ->
c12: Benton2004.computation ->
c12': Benton2004.computation ->
s0: FStar.DM4F.Heap.IntStoreFixed.heap ->
s0': FStar.DM4F.Heap.IntStoreFixed.heap
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.sttype",
"Benton2004.computation",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"FStar.Classical.forall_intro",
"Prims.nat",
"Prims.l_imp",
"Prims.l_and",
"Prims.eq2",
"Prims.bool",
"FStar.Pervasives.Native.fst",
"Benton2004.terminates_on",
"FStar.Classical.move_requires",
"Prims.unit",... | [] | false | false | true | false | false | let d_seq_terminates (p0 p1 p2: sttype) (c01 c01' c12 c12': computation) (s0 s0': heap)
: Lemma
(requires
(exec_equiv p0 p1 c01 c01' /\ exec_equiv p1 p2 c12 c12' /\ holds p0 s0 s0' /\
terminates_on (reify_computation (seq c01 c12)) s0))
(ensures (terminates_on (reify_computation (seq c... | let f01 = reify_computation c01 in
let f01' = reify_computation c01' in
let f12 = reify_computation c12 in
let f12' = reify_computation c12' in
let f = reify_computation (seq c01 c12) in
let f' = reify_computation (seq c01' c12') in
let g (fuel: nat)
: Lemma (requires (fst (f01 fuel s0) == true /\ fst (f01' fuel s0... | false |
Benton2004.fst | Benton2004.d_lu1 | val d_lu1 (b: exp bool) (c: computation) (phi phi': sttype)
: Lemma (requires (exec_equiv phi phi' (while b c) (while b c)))
(ensures (exec_equiv phi phi' (while b c) (ifthenelse b (seq c (while b c)) skip))) | val d_lu1 (b: exp bool) (c: computation) (phi phi': sttype)
: Lemma (requires (exec_equiv phi phi' (while b c) (while b c)))
(ensures (exec_equiv phi phi' (while b c) (ifthenelse b (seq c (while b c)) skip))) | let d_lu1
(b: exp bool)
(c: computation)
(phi phi' : sttype)
: Lemma
(requires (exec_equiv phi phi' (while b c) (while b c)))
(ensures (exec_equiv phi phi' (while b c) (ifthenelse b (seq c (while b c)) skip)))
= let fc = reify_computation c in
let fl = reify_computation (while b c) in
let fr = reify_compu... | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 746,
"start_col": 0,
"start_line": 703
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.exp Prims.bool ->
c: Benton2004.computation ->
phi: Benton2004.sttype ->
phi': Benton2004.sttype
-> FStar.Pervasives.Lemma
(requires Benton2004.exec_equiv phi phi' (Benton2004.while b c) (Benton2004.while b c))
(ensures
Benton2004.exec_equiv phi
phi'
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.exp",
"Prims.bool",
"Benton2004.computation",
"Benton2004.sttype",
"FStar.Classical.forall_intro_2",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.nat",
"Prims.l_imp",
"Prims.eq2",
"FStar.Pervasives.Native.fst",
"FStar.Pervasives.Native.tuple2",
"Prims.op_Addition",
"Prims.unit",
... | [] | false | false | true | false | false | let d_lu1 (b: exp bool) (c: computation) (phi phi': sttype)
: Lemma (requires (exec_equiv phi phi' (while b c) (while b c)))
(ensures (exec_equiv phi phi' (while b c) (ifthenelse b (seq c (while b c)) skip))) =
| let fc = reify_computation c in
let fl = reify_computation (while b c) in
let fr = reify_computation (ifthenelse b (seq c (while b c)) skip) in
let eb = reify_exp b in
let prf1 (s0: heap) (fuel: nat)
: Lemma (requires (fst (fl fuel s0) == true)) (ensures (fr fuel s0 == fl fuel s0)) =
if fst (eb s0)
then
let... | false |
Benton2004.fst | Benton2004.d_su1' | val d_su1' (c c' c'': computation) (phi phi' phi'': sttype)
: Lemma (requires (exec_equiv phi phi' c skip /\ exec_equiv phi' phi'' c' c''))
(ensures (exec_equiv phi phi'' (seq c c') c''))
[
SMTPatOr
[
[SMTPat (exec_equiv phi phi' c skip); SMTPat (exec_equiv phi phi'' (seq c c')... | val d_su1' (c c' c'': computation) (phi phi' phi'': sttype)
: Lemma (requires (exec_equiv phi phi' c skip /\ exec_equiv phi' phi'' c' c''))
(ensures (exec_equiv phi phi'' (seq c c') c''))
[
SMTPatOr
[
[SMTPat (exec_equiv phi phi' c skip); SMTPat (exec_equiv phi phi'' (seq c c')... | let d_su1'
(c c' c'' : computation)
(phi phi' phi'' : sttype)
: Lemma
(requires (
exec_equiv phi phi' c skip /\
exec_equiv phi' phi'' c' c''
))
(ensures (exec_equiv phi phi'' (seq c c') c''))
[SMTPatOr [
[SMTPat (exec_equiv phi phi' c skip); SMTPat (exec_equiv phi phi'' (seq c c') c'')];
[SM... | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 657,
"start_col": 0,
"start_line": 640
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.computation ->
c': Benton2004.computation ->
c'': Benton2004.computation ->
phi: Benton2004.sttype ->
phi': Benton2004.sttype ->
phi'': Benton2004.sttype
-> FStar.Pervasives.Lemma
(requires
Benton2004.exec_equiv phi phi' c Benton2004.skip /\ Benton2004.exec_equiv p... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.computation",
"Benton2004.sttype",
"Prims._assert",
"Prims.l_Forall",
"Prims.nat",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.eq2",
"FStar.Pervasives.Native.tuple2",
"Prims.bool",
"Benton2004.reified_computation",
"Benton2004.reify_computation",
"Benton2004.seq",
"Benton2004.sk... | [] | false | false | true | false | false | let d_su1' (c c' c'': computation) (phi phi' phi'': sttype)
: Lemma (requires (exec_equiv phi phi' c skip /\ exec_equiv phi' phi'' c' c''))
(ensures (exec_equiv phi phi'' (seq c c') c''))
[
SMTPatOr
[
[SMTPat (exec_equiv phi phi' c skip); SMTPat (exec_equiv phi phi'' (seq c c')... | assert (exec_equiv phi phi'' (seq c c') (seq skip c''));
let f1 = reify_computation (seq skip c'') in
let f2 = reify_computation c'' in
assert (forall fuel s0. f1 fuel s0 == f2 fuel s0) | false |
Benton2004.fst | Benton2004.d_seq | val d_seq (p0 p1 p2: sttype) (c01 c01' c12 c12': computation)
: Lemma (requires (exec_equiv p0 p1 c01 c01' /\ exec_equiv p1 p2 c12 c12'))
(ensures (exec_equiv p0 p2 (seq c01 c12) (seq c01' c12')))
[
SMTPatOr
[
[SMTPat (exec_equiv p0 p1 c01 c01'); SMTPat (exec_equiv p1 p2 c12 c1... | val d_seq (p0 p1 p2: sttype) (c01 c01' c12 c12': computation)
: Lemma (requires (exec_equiv p0 p1 c01 c01' /\ exec_equiv p1 p2 c12 c12'))
(ensures (exec_equiv p0 p2 (seq c01 c12) (seq c01' c12')))
[
SMTPatOr
[
[SMTPat (exec_equiv p0 p1 c01 c01'); SMTPat (exec_equiv p1 p2 c12 c1... | let d_seq
(p0 p1 p2 : sttype)
(c01 c01' c12 c12' : computation)
: Lemma
(requires (
exec_equiv p0 p1 c01 c01' /\
exec_equiv p1 p2 c12 c12'
))
(ensures (
exec_equiv p0 p2 (seq c01 c12) (seq c01' c12')
))
[SMTPatOr [
[SMTPat (exec_equiv p0 p1 c01 c01'); SMTPat (exec_equiv p1 p2 c12 c12')];
... | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 74,
"end_line": 627,
"start_col": 0,
"start_line": 584
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
p0: Benton2004.sttype ->
p1: Benton2004.sttype ->
p2: Benton2004.sttype ->
c01: Benton2004.computation ->
c01': Benton2004.computation ->
c12: Benton2004.computation ->
c12': Benton2004.computation
-> FStar.Pervasives.Lemma
(requires Benton2004.exec_equiv p0 p1 c01 c01' /\ Benton200... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.sttype",
"Benton2004.computation",
"FStar.Classical.forall_intro_3",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.nat",
"Prims.l_imp",
"Prims.l_and",
"Benton2004.Aux.holds",
"Prims.eq2",
"Prims.bool",
"FStar.Pervasives.Native.fst",
"FStar.Pervasives.Native.snd",
"FStar.Classical.... | [] | false | false | true | false | false | let d_seq (p0 p1 p2: sttype) (c01 c01' c12 c12': computation)
: Lemma (requires (exec_equiv p0 p1 c01 c01' /\ exec_equiv p1 p2 c12 c12'))
(ensures (exec_equiv p0 p2 (seq c01 c12) (seq c01' c12')))
[
SMTPatOr
[
[SMTPat (exec_equiv p0 p1 c01 c01'); SMTPat (exec_equiv p1 p2 c12 c1... | let f01 = reify_computation c01 in
let f01' = reify_computation c01' in
let f12 = reify_computation c12 in
let f12' = reify_computation c12' in
let f = reify_computation (seq c01 c12) in
let f' = reify_computation (seq c01' c12') in
let prf1 (s0 s0': heap)
: Lemma (requires (holds p0 s0 s0')) (ensures (terminates_o... | false |
Benton2004.fst | Benton2004.d_bre | val d_bre (c1 c2 c0: computation) (phi phi': sttype) (b: exp bool)
: Lemma (requires (exec_equiv phi phi' c1 c0 /\ exec_equiv phi phi' c2 c0))
(ensures (exec_equiv phi phi' (ifthenelse b c1 c2) c0))
[SMTPat (exec_equiv phi phi' (ifthenelse b c1 c2) c0)] | val d_bre (c1 c2 c0: computation) (phi phi': sttype) (b: exp bool)
: Lemma (requires (exec_equiv phi phi' c1 c0 /\ exec_equiv phi phi' c2 c0))
(ensures (exec_equiv phi phi' (ifthenelse b c1 c2) c0))
[SMTPat (exec_equiv phi phi' (ifthenelse b c1 c2) c0)] | let d_bre
(c1 c2 c0: computation)
(phi phi' : sttype)
(b: exp bool)
: Lemma
(requires (
exec_equiv phi phi' c1 c0 /\
exec_equiv phi phi' c2 c0
))
(ensures (exec_equiv phi phi' (ifthenelse b c1 c2) c0))
[SMTPat (exec_equiv phi phi' (ifthenelse b c1 c2) c0)]
= assert (mention (reify_exp b)) | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 842,
"start_col": 0,
"start_line": 831
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
c1: Benton2004.computation ->
c2: Benton2004.computation ->
c0: Benton2004.computation ->
phi: Benton2004.sttype ->
phi': Benton2004.sttype ->
b: Benton2004.exp Prims.bool
-> FStar.Pervasives.Lemma
(requires Benton2004.exec_equiv phi phi' c1 c0 /\ Benton2004.exec_equiv phi phi' c2 c0)
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.computation",
"Benton2004.sttype",
"Benton2004.exp",
"Prims.bool",
"Prims._assert",
"Benton2004.mention",
"Benton2004.reified_exp",
"Benton2004.reify_exp",
"Prims.unit",
"Prims.l_and",
"Benton2004.exec_equiv",
"Prims.squash",
"Benton2004.ifthenelse",
"Prims.Cons",
"FStar.Perv... | [] | true | false | true | false | false | let d_bre (c1 c2 c0: computation) (phi phi': sttype) (b: exp bool)
: Lemma (requires (exec_equiv phi phi' c1 c0 /\ exec_equiv phi phi' c2 c0))
(ensures (exec_equiv phi phi' (ifthenelse b c1 c2) c0))
[SMTPat (exec_equiv phi phi' (ifthenelse b c1 c2) c0)] =
| assert (mention (reify_exp b)) | false |
Hacl.Spec.K256.Scalar.Lemmas.fst | Hacl.Spec.K256.Scalar.Lemmas.qmul_shift_383_mod_2_lemma | val qmul_shift_383_mod_2_lemma : l:lseq uint64 8 ->
Lemma (v l.[5] / pow2 63 = SD.bn_v l / pow2 383 % 2) | val qmul_shift_383_mod_2_lemma : l:lseq uint64 8 ->
Lemma (v l.[5] / pow2 63 = SD.bn_v l / pow2 383 % 2) | let qmul_shift_383_mod_2_lemma l =
calc (==) {
v l.[5] / pow2 63;
(==) { SD.bn_eval_index l 5 }
SD.bn_v l / pow2 320 % pow2 64 / pow2 63;
(==) { Math.Lemmas.pow2_modulo_division_lemma_1 (SD.bn_v l) 320 384 }
SD.bn_v l % pow2 384 / pow2 320 / pow2 63;
(==) { Math.Lemmas.division_multiplication_... | {
"file_name": "code/k256/Hacl.Spec.K256.Scalar.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 457,
"start_col": 0,
"start_line": 442
} | module Hacl.Spec.K256.Scalar.Lemmas
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Hacl.Spec.K256.Scalar
module S = Spec.K256
module SD = Hacl.Spec.Bignum.Definitions
module SB = Hacl.Spec.Bignum
module BB = Hacl.Spec.Bignum.Base
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
val ... | {
"checked_file": "/",
"dependencies": [
"Spec.K256.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Hacl.Spec.K256.Scalar.fst.checked",
"Hacl.Spec.Bignum.Definitions.fst.checked",
"Hacl.Spec.Bignum.Base.fs... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Base",
"short_module": "BB"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "SB"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Definitions",
"short_module": "SD"
},
{
"abbrev": true... | {
"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 | l: Lib.Sequence.lseq Lib.IntTypes.uint64 8
-> FStar.Pervasives.Lemma
(ensures
Lib.IntTypes.v l.[ 5 ] / Prims.pow2 63 =
Hacl.Spec.Bignum.Definitions.bn_v l / Prims.pow2 383 % 2) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Lib.Sequence.lseq",
"Lib.IntTypes.uint64",
"FStar.Calc.calc_finish",
"Prims.int",
"Prims.eq2",
"Prims.op_Division",
"Lib.IntTypes.v",
"Lib.IntTypes.U64",
"Lib.IntTypes.SEC",
"Lib.Sequence.op_String_Access",
"Prims.pow2",
"Prims.op_Modulus",
"Hacl.Spec.Bignum.Definitions.bn_v",
"Prims.Cons... | [] | false | false | true | false | false | let qmul_shift_383_mod_2_lemma l =
| calc ( == ) {
v l.[ 5 ] / pow2 63;
( == ) { SD.bn_eval_index l 5 }
SD.bn_v l / pow2 320 % pow2 64 / pow2 63;
( == ) { Math.Lemmas.pow2_modulo_division_lemma_1 (SD.bn_v l) 320 384 }
SD.bn_v l % pow2 384 / pow2 320 / pow2 63;
( == ) { Math.Lemmas.division_multiplication_lemma (SD.bn_v l % pow2 384) (pow2 320)... | false |
FStar.Order.fst | FStar.Order.ne | val ne : order -> bool | val ne : order -> bool | let ne o = o <> Eq | {
"file_name": "ulib/FStar.Order.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 18,
"end_line": 28,
"start_col": 0,
"start_line": 28
} | (*
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": "FStar.Order.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"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 | o: FStar.Order.order -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"FStar.Order.order",
"Prims.op_disEquality",
"FStar.Order.Eq",
"Prims.bool"
] | [] | false | false | false | true | false | let ne o =
| o <> Eq | false |
Hacl.HPKE.Interface.DH.fst | Hacl.HPKE.Interface.DH.nsize_public | val nsize_public : a: Spec.Agile.DH.algorithm -> FStar.UInt32.t | let nsize_public (a:DH.algorithm) =
match a with
| DH.DH_Curve25519 -> 32ul
| DH.DH_P256 -> 64ul | {
"file_name": "code/hpke/Hacl.HPKE.Interface.DH.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 26,
"start_col": 0,
"start_line": 23
} | module Hacl.HPKE.Interface.DH
open FStar.HyperStack
open FStar.HyperStack.All
module HST = FStar.HyperStack.ST
open Lib.Buffer
open Lib.IntTypes
open Lib.ByteBuffer
module DH = Spec.Agile.DH
module S = Spec.Agile.HPKE
#reset-options "--z3rlimit 20 --fuel 0 --ifuel 1"
unfold noextract
let nsize_key (a:DH.algorithm)... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.DH.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Agile.DH",
"short_module": "DH"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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 | a: Spec.Agile.DH.algorithm -> FStar.UInt32.t | Prims.Tot | [
"total"
] | [] | [
"Spec.Agile.DH.algorithm",
"FStar.UInt32.__uint_to_t",
"FStar.UInt32.t"
] | [] | false | false | false | true | false | let nsize_public (a: DH.algorithm) =
| match a with
| DH.DH_Curve25519 -> 32ul
| DH.DH_P256 -> 64ul | false | |
FStar.Order.fst | FStar.Order.ge | val ge : order -> bool | val ge : order -> bool | let ge o = o <> Lt | {
"file_name": "ulib/FStar.Order.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 18,
"end_line": 22,
"start_col": 0,
"start_line": 22
} | (*
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": "FStar.Order.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"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 | o: FStar.Order.order -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"FStar.Order.order",
"Prims.op_disEquality",
"FStar.Order.Lt",
"Prims.bool"
] | [] | false | false | false | true | false | let ge o =
| o <> Lt | false |
FStar.Order.fst | FStar.Order.le | val le : order -> bool | val le : order -> bool | let le o = o <> Gt | {
"file_name": "ulib/FStar.Order.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 18,
"end_line": 25,
"start_col": 0,
"start_line": 25
} | (*
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": "FStar.Order.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"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 | o: FStar.Order.order -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"FStar.Order.order",
"Prims.op_disEquality",
"FStar.Order.Gt",
"Prims.bool"
] | [] | false | false | false | true | false | let le o =
| o <> Gt | false |
Hacl.HPKE.Interface.DH.fst | Hacl.HPKE.Interface.DH.nsize_key | val nsize_key : a: Spec.Agile.DH.algorithm -> FStar.UInt32.t | let nsize_key (a:DH.algorithm) =
match a with
| DH.DH_Curve25519 -> 32ul
| DH.DH_P256 -> 32ul | {
"file_name": "code/hpke/Hacl.HPKE.Interface.DH.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 20,
"start_col": 0,
"start_line": 17
} | module Hacl.HPKE.Interface.DH
open FStar.HyperStack
open FStar.HyperStack.All
module HST = FStar.HyperStack.ST
open Lib.Buffer
open Lib.IntTypes
open Lib.ByteBuffer
module DH = Spec.Agile.DH
module S = Spec.Agile.HPKE
#reset-options "--z3rlimit 20 --fuel 0 --ifuel 1" | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.DH.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Agile.DH",
"short_module": "DH"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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 | a: Spec.Agile.DH.algorithm -> FStar.UInt32.t | Prims.Tot | [
"total"
] | [] | [
"Spec.Agile.DH.algorithm",
"FStar.UInt32.__uint_to_t",
"FStar.UInt32.t"
] | [] | false | false | false | true | false | let nsize_key (a: DH.algorithm) =
| match a with
| DH.DH_Curve25519 -> 32ul
| DH.DH_P256 -> 32ul | false | |
FStar.Order.fst | FStar.Order.order_from_int | val order_from_int : int -> order | val order_from_int : int -> order | let order_from_int i =
if i < 0 then Lt
else if i = 0 then Eq
else Gt | {
"file_name": "ulib/FStar.Order.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 52,
"start_col": 0,
"start_line": 49
} | (*
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": "FStar.Order.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"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 | i: Prims.int -> FStar.Order.order | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"Prims.op_LessThan",
"FStar.Order.Lt",
"Prims.bool",
"Prims.op_Equality",
"FStar.Order.Eq",
"FStar.Order.Gt",
"FStar.Order.order"
] | [] | false | false | false | true | false | let order_from_int i =
| if i < 0 then Lt else if i = 0 then Eq else Gt | false |
FStar.Order.fst | FStar.Order.gt | val gt : order -> bool | val gt : order -> bool | let gt o = o = Gt | {
"file_name": "ulib/FStar.Order.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 32,
"start_col": 0,
"start_line": 32
} | (*
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": "FStar.Order.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"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 | o: FStar.Order.order -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"FStar.Order.order",
"Prims.op_Equality",
"FStar.Order.Gt",
"Prims.bool"
] | [] | false | false | false | true | false | let gt o =
| o = Gt | false |
FStar.Order.fst | FStar.Order.compare_int | val compare_int : int -> int -> order | val compare_int : int -> int -> order | let compare_int i j = order_from_int (i - j) | {
"file_name": "ulib/FStar.Order.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 61,
"start_col": 0,
"start_line": 61
} | (*
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": "FStar.Order.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"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 | i: Prims.int -> j: Prims.int -> FStar.Order.order | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"FStar.Order.order_from_int",
"Prims.op_Subtraction",
"FStar.Order.order"
] | [] | false | false | false | true | false | let compare_int i j =
| order_from_int (i - j) | false |
FStar.Order.fst | FStar.Order.lex | val lex : order -> (unit -> order) -> order | val lex : order -> (unit -> order) -> order | let lex o1 o2 =
match o1 with
| Lt -> Lt
| Eq -> o2 ()
| Gt -> Gt | {
"file_name": "ulib/FStar.Order.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 14,
"end_line": 46,
"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": "FStar.Order.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"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 | o1: FStar.Order.order -> o2: (_: Prims.unit -> FStar.Order.order) -> FStar.Order.order | Prims.Tot | [
"total"
] | [] | [
"FStar.Order.order",
"Prims.unit",
"FStar.Order.Lt",
"FStar.Order.Gt"
] | [] | false | false | false | true | false | let lex o1 o2 =
| match o1 with
| Lt -> Lt
| Eq -> o2 ()
| Gt -> Gt | false |
FStar.Order.fst | FStar.Order.lt | val lt : order -> bool | val lt : order -> bool | let lt o = o = Lt | {
"file_name": "ulib/FStar.Order.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 35,
"start_col": 0,
"start_line": 35
} | (*
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": "FStar.Order.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"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 | o: FStar.Order.order -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"FStar.Order.order",
"Prims.op_Equality",
"FStar.Order.Lt",
"Prims.bool"
] | [] | false | false | false | true | false | let lt o =
| o = Lt | false |
FStar.Order.fst | FStar.Order.eq | val eq : order -> bool | val eq : order -> bool | let eq o = o = Eq | {
"file_name": "ulib/FStar.Order.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 38,
"start_col": 0,
"start_line": 38
} | (*
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": "FStar.Order.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"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 | o: FStar.Order.order -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"FStar.Order.order",
"Prims.op_Equality",
"FStar.Order.Eq",
"Prims.bool"
] | [] | false | false | false | true | false | let eq o =
| o = Eq | false |
FStar.Order.fst | FStar.Order.compare_option | val compare_option : ('a -> 'a -> order) -> option 'a -> option 'a -> order | val compare_option : ('a -> 'a -> order) -> option 'a -> option 'a -> order | let compare_option f x y =
match x, y with
| None , None -> Eq
| None , Some _ -> Lt
| Some _ , None -> Gt
| Some x , Some y -> f x y | {
"file_name": "ulib/FStar.Order.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 30,
"end_line": 85,
"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": "FStar.Order.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"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 -> FStar.Order.order) ->
x: FStar.Pervasives.Native.option 'a ->
y: FStar.Pervasives.Native.option 'a
-> FStar.Order.order | Prims.Tot | [
"total"
] | [] | [
"FStar.Order.order",
"FStar.Pervasives.Native.option",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Order.Eq",
"FStar.Order.Lt",
"FStar.Order.Gt"
] | [] | false | false | false | true | false | let compare_option f x y =
| match x, y with
| None, None -> Eq
| None, Some _ -> Lt
| Some _, None -> Gt
| Some x, Some y -> f x y | false |
FStar.Order.fst | FStar.Order.compare_list | val compare_list (#a: Type) (l1 l2: list a) (f: (x: a{x << l1} -> y: a{y << l2} -> order)) : order | val compare_list (#a: Type) (l1 l2: list a) (f: (x: a{x << l1} -> y: a{y << l2} -> order)) : order | let rec compare_list (#a:Type)
(l1 l2:list a)
(f:(x:a{x << l1} -> y:a{y << l2} -> order))
: order
= match l1, l2 with
| [], [] -> Eq
| [], _ -> Lt
| _, [] -> Gt
| x::xs, y::ys -> lex (f x y) (fun _ -> compare_list xs ys f) | {
"file_name": "ulib/FStar.Order.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 65,
"end_line": 77,
"start_col": 0,
"start_line": 69
} | (*
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": "FStar.Order.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l1: Prims.list a -> l2: Prims.list a -> f: (x: a{x << l1} -> y: a{y << l2} -> FStar.Order.order)
-> FStar.Order.order | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"Prims.precedes",
"FStar.Order.order",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Order.Eq",
"FStar.Order.Lt",
"FStar.Order.Gt",
"FStar.Order.lex",
"Prims.unit",
"FStar.Order.compare_list"
] | [
"recursion"
] | false | false | false | false | false | let rec compare_list (#a: Type) (l1 l2: list a) (f: (x: a{x << l1} -> y: a{y << l2} -> order))
: order =
| match l1, l2 with
| [], [] -> Eq
| [], _ -> Lt
| _, [] -> Gt
| x :: xs, y :: ys -> lex (f x y) (fun _ -> compare_list xs ys f) | false |
Hacl.HPKE.Interface.DH.fst | Hacl.HPKE.Interface.DH.dh_st | val dh_st : a: Spec.Agile.DH.algorithm -> p: Type0 -> Type0 | let dh_st (a:DH.algorithm) (p:Type0) =
o:lbuffer uint8 (nsize_public a)
-> k:lbuffer uint8 (nsize_key a)
-> i:lbuffer uint8 (nsize_public a)
-> Stack UInt32.t
(requires fun h0 ->
p /\
live h0 o /\ live h0 k /\ live h0 i /\
disjoint o i /\ disjoint o k)
(ensures fun h0 result h1... | {
"file_name": "code/hpke/Hacl.HPKE.Interface.DH.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 21,
"end_line": 43,
"start_col": 0,
"start_line": 29
} | module Hacl.HPKE.Interface.DH
open FStar.HyperStack
open FStar.HyperStack.All
module HST = FStar.HyperStack.ST
open Lib.Buffer
open Lib.IntTypes
open Lib.ByteBuffer
module DH = Spec.Agile.DH
module S = Spec.Agile.HPKE
#reset-options "--z3rlimit 20 --fuel 0 --ifuel 1"
unfold noextract
let nsize_key (a:DH.algorithm)... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.DH.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Agile.DH",
"short_module": "DH"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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 | a: Spec.Agile.DH.algorithm -> p: Type0 -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Agile.DH.algorithm",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Hacl.HPKE.Interface.DH.nsize_public",
"Hacl.HPKE.Interface.DH.nsize_key",
"FStar.UInt32.t",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"Lib.Buffer.live",
"Lib.Buffer.MUT",
"Lib.Buffer.disjoint",
"Lib.Buffer.modifies"... | [] | false | false | false | true | true | let dh_st (a: DH.algorithm) (p: Type0) =
|
o: lbuffer uint8 (nsize_public a) ->
k: lbuffer uint8 (nsize_key a) ->
i: lbuffer uint8 (nsize_public a)
-> Stack UInt32.t
(requires fun h0 -> p /\ live h0 o /\ live h0 k /\ live h0 i /\ disjoint o i /\ disjoint o k)
(ensures
fun h0 result h1 ->
modifies (loc o) h0 h1 /\
... | false | |
FStar.Order.fst | FStar.Order.int_of_order | val int_of_order : order -> int | val int_of_order : order -> int | let int_of_order = function
| Lt -> (-1)
| Eq -> 0
| Gt -> 1 | {
"file_name": "ulib/FStar.Order.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 13,
"end_line": 58,
"start_col": 0,
"start_line": 55
} | (*
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": "FStar.Order.fst"
} | [
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: FStar.Order.order -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"FStar.Order.order",
"Prims.op_Minus",
"Prims.int"
] | [] | false | false | false | true | false | let int_of_order =
| function
| Lt -> (- 1)
| Eq -> 0
| Gt -> 1 | false |
IfcMonitor.fst | IfcMonitor.interpret_exp | val interpret_exp (h: heap) (env: label_fun) (e: exp) : Tot (int * label) | val interpret_exp (h: heap) (env: label_fun) (e: exp) : Tot (int * label) | let interpret_exp (h:heap) (env:label_fun) (e:exp) : Tot (int * label) = reify (interpret_exp_st env e) h | {
"file_name": "examples/rel/IfcMonitor.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 106,
"end_line": 92,
"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": [
"Rel.fst.checked",
"prims.fst.checked",
"label.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.IntStoreExcF... | [
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": "X"
},
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixedReader",
"short_module": "ISFR"
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 | h: FStar.DM4F.Heap.IntStoreFixed.heap -> env: IfcMonitor.label_fun -> e: IfcMonitor.exp
-> Prims.int * Label.label | Prims.Tot | [
"total"
] | [] | [
"FStar.DM4F.Heap.IntStoreFixed.heap",
"IfcMonitor.label_fun",
"IfcMonitor.exp",
"IfcMonitor.interpret_exp_st",
"FStar.Pervasives.Native.tuple2",
"Prims.int",
"Label.label"
] | [] | false | false | false | true | false | let interpret_exp (h: heap) (env: label_fun) (e: exp) : Tot (int * label) =
| reify (interpret_exp_st env e) h | false |
IfcMonitor.fst | IfcMonitor.decr_while | val decr_while : heap -> com -> GTot nat | val decr_while : heap -> com -> GTot nat | let decr_while h c =
match c with
| While c b v -> interpret_exp' h v
| _ -> 0 | {
"file_name": "examples/rel/IfcMonitor.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 10,
"end_line": 103,
"start_col": 0,
"start_line": 100
} | (*
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": [
"Rel.fst.checked",
"prims.fst.checked",
"label.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.IntStoreExcF... | [
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": "X"
},
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixedReader",
"short_module": "ISFR"
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 | h: FStar.DM4F.Heap.IntStoreFixed.heap -> c: IfcMonitor.com -> Prims.GTot Prims.nat | Prims.GTot | [
"sometrivial"
] | [] | [
"FStar.DM4F.Heap.IntStoreFixed.heap",
"IfcMonitor.com",
"IfcMonitor.exp",
"IfcMonitor.metric",
"IfcMonitor.interpret_exp'",
"Prims.nat"
] | [] | false | false | false | false | false | let decr_while h c =
| match c with
| While c b v -> interpret_exp' h v
| _ -> 0 | false |
Hacl.HPKE.Interface.DH.fst | Hacl.HPKE.Interface.DH.secret_to_public_st | val secret_to_public_st : a: Spec.Agile.DH.algorithm -> p: Type0 -> Type0 | let secret_to_public_st (a: DH.algorithm) (p:Type0) =
o:lbuffer uint8 (nsize_public a)
-> i:lbuffer uint8 (nsize_key a)
-> Stack UInt32.t
(requires fun h0 ->
p /\
live h0 o /\ live h0 i /\ disjoint o i)
(ensures fun h0 result h1 -> modifies (loc o) h0 h1 /\
(let output = DH.secret_to_... | {
"file_name": "code/hpke/Hacl.HPKE.Interface.DH.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 20,
"end_line": 58,
"start_col": 0,
"start_line": 46
} | module Hacl.HPKE.Interface.DH
open FStar.HyperStack
open FStar.HyperStack.All
module HST = FStar.HyperStack.ST
open Lib.Buffer
open Lib.IntTypes
open Lib.ByteBuffer
module DH = Spec.Agile.DH
module S = Spec.Agile.HPKE
#reset-options "--z3rlimit 20 --fuel 0 --ifuel 1"
unfold noextract
let nsize_key (a:DH.algorithm)... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.DH.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Agile.DH",
"short_module": "DH"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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 | a: Spec.Agile.DH.algorithm -> p: Type0 -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Agile.DH.algorithm",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Hacl.HPKE.Interface.DH.nsize_public",
"Hacl.HPKE.Interface.DH.nsize_key",
"FStar.UInt32.t",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"Lib.Buffer.live",
"Lib.Buffer.MUT",
"Lib.Buffer.disjoint",
"Lib.Buffer.modifies"... | [] | false | false | false | true | true | let secret_to_public_st (a: DH.algorithm) (p: Type0) =
| o: lbuffer uint8 (nsize_public a) -> i: lbuffer uint8 (nsize_key a)
-> Stack UInt32.t
(requires fun h0 -> p /\ live h0 o /\ live h0 i /\ disjoint o i)
(ensures
fun h0 result h1 ->
modifies (loc o) h0 h1 /\
(let output = DH.secret_to_public a (as_seq h0 i) in
match r... | false | |
Hacl.HPKE.Interface.DH.fst | Hacl.HPKE.Interface.DH.secret_to_public_c51 | val secret_to_public_c51:secret_to_public_st (DH.DH_Curve25519) True | val secret_to_public_c51:secret_to_public_st (DH.DH_Curve25519) True | let secret_to_public_c51 : secret_to_public_st (DH.DH_Curve25519) True = fun o i ->
Hacl.Curve25519_51.secret_to_public o i;
0ul | {
"file_name": "code/hpke/Hacl.HPKE.Interface.DH.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 5,
"end_line": 73,
"start_col": 0,
"start_line": 71
} | module Hacl.HPKE.Interface.DH
open FStar.HyperStack
open FStar.HyperStack.All
module HST = FStar.HyperStack.ST
open Lib.Buffer
open Lib.IntTypes
open Lib.ByteBuffer
module DH = Spec.Agile.DH
module S = Spec.Agile.HPKE
#reset-options "--z3rlimit 20 --fuel 0 --ifuel 1"
unfold noextract
let nsize_key (a:DH.algorithm)... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.DH.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Agile.DH",
"short_module": "DH"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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 | Hacl.HPKE.Interface.DH.secret_to_public_st Spec.Agile.DH.DH_Curve25519 Prims.l_True | Prims.Tot | [
"total"
] | [] | [
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Hacl.HPKE.Interface.DH.nsize_public",
"Spec.Agile.DH.DH_Curve25519",
"Hacl.HPKE.Interface.DH.nsize_key",
"FStar.UInt32.__uint_to_t",
"FStar.UInt32.t",
"Prims.unit",
"Hacl.Curve25519_51.secret_to_public"
] | [] | false | false | false | true | false | let secret_to_public_c51:secret_to_public_st (DH.DH_Curve25519) True =
| fun o i ->
Hacl.Curve25519_51.secret_to_public o i;
0ul | false |
IfcMonitor.fst | IfcMonitor.interpret_exp_st | val interpret_exp_st (env: label_fun) (e: exp) : ISFR.ISRNull (int * label) | val interpret_exp_st (env: label_fun) (e: exp) : ISFR.ISRNull (int * label) | let rec interpret_exp_st (env:label_fun) (e:exp)
(* : INT_STORE_EXC int (fun s0 p -> forall x. p (Some x, s0)) *)
: ISFR.ISRNull (int * label)
=
match e with
| AInt i -> i, Low
| AVar x -> ISFR.read x, env x
| AOp o e1 e2 ->
let a,l1 = interpret_exp_st env e1 in
let b,l2 = interpret_exp_st env e2 ... | {
"file_name": "examples/rel/IfcMonitor.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 88,
"start_col": 0,
"start_line": 78
} | (*
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": [
"Rel.fst.checked",
"prims.fst.checked",
"label.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.IntStoreExcF... | [
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": "X"
},
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixedReader",
"short_module": "ISFR"
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 | env: IfcMonitor.label_fun -> e: IfcMonitor.exp
-> FStar.DM4F.IntStoreFixedReader.ISRNull (Prims.int * Label.label) | FStar.DM4F.IntStoreFixedReader.ISRNull | [] | [] | [
"IfcMonitor.label_fun",
"IfcMonitor.exp",
"Prims.int",
"FStar.Pervasives.Native.Mktuple2",
"Label.label",
"Label.Low",
"FStar.Pervasives.Native.tuple2",
"FStar.DM4F.Heap.IntStoreFixed.id",
"FStar.DM4F.IntStoreFixedReader.read",
"IfcMonitor.binop",
"IfcMonitor.interpret_binop",
"Label.join",
... | [
"recursion"
] | false | true | false | false | false | let rec interpret_exp_st (env: label_fun) (e: exp) : ISFR.ISRNull (int * label) =
| match e with
| AInt i -> i, Low
| AVar x -> ISFR.read x, env x
| AOp o e1 e2 ->
let a, l1 = interpret_exp_st env e1 in
let b, l2 = interpret_exp_st env e2 in
interpret_binop o a b, join l1 l2 | false |
IfcMonitor.fst | IfcMonitor.interpret_binop | val interpret_binop : o:binop -> a:int -> b:int -> Tot int | val interpret_binop : o:binop -> a:int -> b:int -> Tot int | let interpret_binop o a b =
match o with
| Plus -> a + b
| Minus -> a - b
| Times -> op_Multiply a b
| Max -> if b >= a then b else a | {
"file_name": "examples/rel/IfcMonitor.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 38,
"start_col": 0,
"start_line": 33
} | (*
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": [
"Rel.fst.checked",
"prims.fst.checked",
"label.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.IntStoreExcF... | [
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": "X"
},
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixedReader",
"short_module": "ISFR"
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 | o: IfcMonitor.binop -> a: Prims.int -> b: Prims.int -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"IfcMonitor.binop",
"Prims.int",
"Prims.op_Addition",
"Prims.op_Subtraction",
"Prims.op_Multiply",
"Prims.op_GreaterThanOrEqual",
"Prims.bool"
] | [] | false | false | false | true | false | let interpret_binop o a b =
| match o with
| Plus -> a + b
| Minus -> a - b
| Times -> op_Multiply a b
| Max -> if b >= a then b else a | false |
IfcMonitor.fst | IfcMonitor.interpret_exp' | val interpret_exp' (h: heap) (e: exp) : Tot nat | val interpret_exp' (h: heap) (e: exp) : Tot nat | let interpret_exp' (h:heap) (e:exp) : Tot nat =
let n,_ = interpret_exp h (fun _ -> Low) e in
if 0 > n then 0 else n | {
"file_name": "examples/rel/IfcMonitor.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 96,
"start_col": 0,
"start_line": 94
} | (*
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": [
"Rel.fst.checked",
"prims.fst.checked",
"label.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.IntStoreExcF... | [
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": "X"
},
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixedReader",
"short_module": "ISFR"
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 | h: FStar.DM4F.Heap.IntStoreFixed.heap -> e: IfcMonitor.exp -> Prims.nat | Prims.Tot | [
"total"
] | [] | [
"FStar.DM4F.Heap.IntStoreFixed.heap",
"IfcMonitor.exp",
"Prims.int",
"Label.label",
"Prims.op_GreaterThan",
"Prims.bool",
"Prims.nat",
"FStar.Pervasives.Native.tuple2",
"IfcMonitor.interpret_exp",
"FStar.DM4F.Heap.IntStoreFixed.id",
"Label.Low"
] | [] | false | false | false | true | false | let interpret_exp' (h: heap) (e: exp) : Tot nat =
| let n, _ = interpret_exp h (fun _ -> Low) e in
if 0 > n then 0 else n | false |
IfcMonitor.fst | IfcMonitor.interpret_com | val interpret_com (h0: heap) (c: com) (env: label_fun) (pc: label) : Tot (option heap) | val interpret_com (h0: heap) (c: com) (env: label_fun) (pc: label) : Tot (option heap) | let interpret_com (h0:heap) (c:com) (env:label_fun) (pc:label) : Tot (option heap)
=
match (* normalize_term *) (reify (interpret_com_st c h0 env pc) h0) with
| Some (), h -> Some h
| None, _ -> None | {
"file_name": "examples/rel/IfcMonitor.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 19,
"end_line": 166,
"start_col": 0,
"start_line": 162
} | (*
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": [
"Rel.fst.checked",
"prims.fst.checked",
"label.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.IntStoreExcF... | [
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": "X"
},
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixedReader",
"short_module": "ISFR"
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 |
h0: FStar.DM4F.Heap.IntStoreFixed.heap ->
c: IfcMonitor.com ->
env: IfcMonitor.label_fun ->
pc: Label.label
-> FStar.Pervasives.Native.option FStar.DM4F.Heap.IntStoreFixed.heap | Prims.Tot | [
"total"
] | [] | [
"FStar.DM4F.Heap.IntStoreFixed.heap",
"IfcMonitor.com",
"IfcMonitor.label_fun",
"Label.label",
"IfcMonitor.interpret_com_st",
"Prims.unit",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.option"
] | [] | false | false | false | true | false | let interpret_com (h0: heap) (c: com) (env: label_fun) (pc: label) : Tot (option heap) =
| match (reify (interpret_com_st c h0 env pc) h0) with
| Some (), h -> Some h
| None, _ -> None | false |
Benton2004.fst | Benton2004.d_lu2 | val d_lu2 (b: exp bool) (c: computation) (phi phi': sttype)
: Lemma (requires (exec_equiv phi phi' (while b c) (while b c)))
(ensures (exec_equiv phi phi' (while b c) (while b (seq c (ifthenelse b c skip))))) | val d_lu2 (b: exp bool) (c: computation) (phi phi': sttype)
: Lemma (requires (exec_equiv phi phi' (while b c) (while b c)))
(ensures (exec_equiv phi phi' (while b c) (while b (seq c (ifthenelse b c skip))))) | let d_lu2
(b: exp bool)
(c: computation)
(phi phi' : sttype)
: Lemma
(requires (exec_equiv phi phi' (while b c) (while b c)))
(ensures (exec_equiv phi phi' (while b c) (while b (seq c (ifthenelse b c skip)))))
= let fc = reify_computation c in
let fl = reify_computation (while b c) in
let fr = reify_compu... | {
"file_name": "examples/rel/Benton2004.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 813,
"start_col": 0,
"start_line": 749
} | (*
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",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.Heap.IntStoreFixed.fsti.checked",
"FStar.Classical.fsti.checked",
"Benton2004.Aux.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.DM4F.Heap.IntStoreFixed",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.Aux",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 8,
"no_plugins": false,
"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: Benton2004.exp Prims.bool ->
c: Benton2004.computation ->
phi: Benton2004.sttype ->
phi': Benton2004.sttype
-> FStar.Pervasives.Lemma
(requires Benton2004.exec_equiv phi phi' (Benton2004.while b c) (Benton2004.while b c))
(ensures
Benton2004.exec_equiv phi
phi'
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Benton2004.exp",
"Prims.bool",
"Benton2004.computation",
"Benton2004.sttype",
"FStar.Classical.forall_intro_2",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.nat",
"Prims.l_imp",
"Prims.eq2",
"FStar.Pervasives.Native.fst",
"FStar.Pervasives.Native.tuple2",
"Prims.op_Addition",
"Prims.unit",
... | [] | false | false | true | false | false | let d_lu2 (b: exp bool) (c: computation) (phi phi': sttype)
: Lemma (requires (exec_equiv phi phi' (while b c) (while b c)))
(ensures (exec_equiv phi phi' (while b c) (while b (seq c (ifthenelse b c skip))))) =
| let fc = reify_computation c in
let fl = reify_computation (while b c) in
let fr = reify_computation (while b (seq c (ifthenelse b c skip))) in
let eb = reify_exp b in
let rec prf1 (s0: heap) (fuel: nat)
: Lemma (requires (fst (fl fuel s0) == true))
(ensures (fr fuel s0 == fl fuel s0))
(decreases fuel) ... | false |
IfcMonitor.fst | IfcMonitor.interpret_com_st | val interpret_com_st : c:com -> h0:heap -> env:label_fun -> pc:label -> IntStoreExc unit
(requires (fun h -> h == h0))
(ensures (fun h _ ho -> h == h0))
(decreases %[c; decr_while h0 c]) | val interpret_com_st : c:com -> h0:heap -> env:label_fun -> pc:label -> IntStoreExc unit
(requires (fun h -> h == h0))
(ensures (fun h _ ho -> h == h0))
(decreases %[c; decr_while h0 c]) | let rec interpret_com_st c h0 env pc =
match c with
| Skip -> ()
| Assign x e ->
let v, le = interpret_exp_st env e in
let lx = env x in
if join le pc <= lx then
begin
write x v
end
else
raise_ () (* IfcViolation *)
| Seq c1 c2 ->
begin
let h1 = (X.get()) in
... | {
"file_name": "examples/rel/IfcMonitor.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 9,
"end_line": 156,
"start_col": 0,
"start_line": 112
} | (*
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": [
"Rel.fst.checked",
"prims.fst.checked",
"label.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.IntStoreExcF... | [
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": "X"
},
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixedReader",
"short_module": "ISFR"
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 |
c: IfcMonitor.com ->
h0: FStar.DM4F.Heap.IntStoreFixed.heap ->
env: IfcMonitor.label_fun ->
pc: Label.label
-> FStar.DM4F.IntStoreExcFixed.IntStoreExc Prims.unit | FStar.DM4F.IntStoreExcFixed.IntStoreExc | [
""
] | [] | [
"IfcMonitor.com",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"IfcMonitor.label_fun",
"Label.label",
"Prims.unit",
"FStar.DM4F.Heap.IntStoreFixed.id",
"IfcMonitor.exp",
"Prims.int",
"Label.op_Less_Equals",
"Label.join",
"FStar.DM4F.IntStoreExcFixed.write",
"Prims.bool",
"FStar.DM4F.IntStoreExcFixe... | [
"recursion"
] | false | true | false | false | false | let rec interpret_com_st c h0 env pc =
| match c with
| Skip -> ()
| Assign x e ->
let v, le = interpret_exp_st env e in
let lx = env x in
if join le pc <= lx then write x v else raise_ ()
| Seq c1 c2 ->
let h1 = (X.get ()) in
interpret_com_st c1 h1 env pc;
let h2 = (X.get ()) in
interpret_com_st c2 h2 env pc
| If e ct cf ->
let v, l = interpr... | false |
Hacl.HPKE.Interface.DH.fst | Hacl.HPKE.Interface.DH.change_error_code | val change_error_code (r: uint64)
: Pure UInt32.t
(requires v r = 0 \/ v r = pow2 64 - 1)
(ensures fun r' -> UInt32.v r' <= 1 /\ (UInt32.v r' = 0 <==> v r = 0)) | val change_error_code (r: uint64)
: Pure UInt32.t
(requires v r = 0 \/ v r = pow2 64 - 1)
(ensures fun r' -> UInt32.v r' <= 1 /\ (UInt32.v r' = 0 <==> v r = 0)) | let change_error_code (r:uint64) : Pure UInt32.t
(requires v r = 0 \/ v r = pow2 64 - 1)
(ensures fun r' -> UInt32.v r' <= 1 /\ (UInt32.v r' = 0 <==> v r = 0))
= let r' = logand r (u64 1) in
logand_mask r (u64 1) 1;
let r' = cast U32 SEC r' in
Lib.RawIntTypes.u32_to_UInt32 r' | {
"file_name": "code/hpke/Hacl.HPKE.Interface.DH.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 36,
"end_line": 107,
"start_col": 0,
"start_line": 101
} | module Hacl.HPKE.Interface.DH
open FStar.HyperStack
open FStar.HyperStack.All
module HST = FStar.HyperStack.ST
open Lib.Buffer
open Lib.IntTypes
open Lib.ByteBuffer
module DH = Spec.Agile.DH
module S = Spec.Agile.HPKE
#reset-options "--z3rlimit 20 --fuel 0 --ifuel 1"
unfold noextract
let nsize_key (a:DH.algorithm)... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.DH.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Agile.DH",
"short_module": "DH"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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 | r: Lib.IntTypes.uint64 -> Prims.Pure FStar.UInt32.t | Prims.Pure | [] | [] | [
"Lib.IntTypes.uint64",
"Lib.RawIntTypes.u32_to_UInt32",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U32",
"Lib.IntTypes.SEC",
"Prims.eq2",
"Prims.int",
"Lib.IntTypes.v",
"Lib.IntTypes.op_At_Percent_Dot",
"Lib.IntTypes.U64",
"Lib.IntTypes.cast",
"Prims.unit",
"Lib.IntTypes.logand_mask",
"Lib.IntTyp... | [] | false | false | false | false | false | let change_error_code (r: uint64)
: Pure UInt32.t
(requires v r = 0 \/ v r = pow2 64 - 1)
(ensures fun r' -> UInt32.v r' <= 1 /\ (UInt32.v r' = 0 <==> v r = 0)) =
| let r' = logand r (u64 1) in
logand_mask r (u64 1) 1;
let r' = cast U32 SEC r' in
Lib.RawIntTypes.u32_to_UInt32 r' | false |
IfcMonitor.fst | IfcMonitor.dyn_ifc_exp | val dyn_ifc_exp : (e:exp) -> (h:(rel heap)) -> (env:label_fun) ->
Lemma
(requires (low_equiv env h))
(ensures (
let vl,ll = interpret_exp (R?.l h) env e in
let vr,lr = interpret_exp (R?.r h) env e in
lr = ll /\ (Low? lr ==> vl = vr))) | val dyn_ifc_exp : (e:exp) -> (h:(rel heap)) -> (env:label_fun) ->
Lemma
(requires (low_equiv env h))
(ensures (
let vl,ll = interpret_exp (R?.l h) env e in
let vr,lr = interpret_exp (R?.r h) env e in
lr = ll /\ (Low? lr ==> vl = vr))) | let rec dyn_ifc_exp e h env =
match e with
| AInt _ -> ()
| AVar _ -> ()
| AOp _ e1 e2 -> dyn_ifc_exp e1 h env; dyn_ifc_exp e2 h env | {
"file_name": "examples/rel/IfcMonitor.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 333,
"start_col": 0,
"start_line": 329
} | (*
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": [
"Rel.fst.checked",
"prims.fst.checked",
"label.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.IntStoreExcF... | [
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": "X"
},
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixedReader",
"short_module": "ISFR"
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 | e: IfcMonitor.exp -> h: Rel.rel FStar.DM4F.Heap.IntStoreFixed.heap -> env: IfcMonitor.label_fun
-> FStar.Pervasives.Lemma (requires IfcMonitor.low_equiv env h)
(ensures
(let _ = IfcMonitor.interpret_exp (R?.l h) env e in
(let FStar.Pervasives.Native.Mktuple2 #_ #_ vl ll = _ in
let ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"IfcMonitor.exp",
"Rel.rel",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"IfcMonitor.label_fun",
"Prims.int",
"FStar.DM4F.Heap.IntStoreFixed.id",
"IfcMonitor.binop",
"IfcMonitor.dyn_ifc_exp",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec dyn_ifc_exp e h env =
| match e with
| AInt _ -> ()
| AVar _ -> ()
| AOp _ e1 e2 ->
dyn_ifc_exp e1 h env;
dyn_ifc_exp e2 h env | false |
IfcMonitor.fst | IfcMonitor.dyn_ifc_assign | val dyn_ifc_assign : (x:id) -> (e:exp) -> (env:label_fun) -> (pc:label) -> (h:rel heap) ->
Lemma
(requires (low_equiv env h))
(ensures (ifc_type (Assign x e) env pc h)) | val dyn_ifc_assign : (x:id) -> (e:exp) -> (env:label_fun) -> (pc:label) -> (h:rel heap) ->
Lemma
(requires (low_equiv env h))
(ensures (ifc_type (Assign x e) env pc h)) | let dyn_ifc_assign x e env pc h = dyn_ifc_exp e h env | {
"file_name": "examples/rel/IfcMonitor.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 355,
"start_col": 0,
"start_line": 355
} | (*
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": [
"Rel.fst.checked",
"prims.fst.checked",
"label.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.IntStoreExcF... | [
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": "X"
},
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixedReader",
"short_module": "ISFR"
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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: FStar.DM4F.Heap.IntStoreFixed.id ->
e: IfcMonitor.exp ->
env: IfcMonitor.label_fun ->
pc: Label.label ->
h: Rel.rel FStar.DM4F.Heap.IntStoreFixed.heap
-> FStar.Pervasives.Lemma (requires IfcMonitor.low_equiv env h)
(ensures IfcMonitor.ifc_type (IfcMonitor.Assign x e) env pc h) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.DM4F.Heap.IntStoreFixed.id",
"IfcMonitor.exp",
"IfcMonitor.label_fun",
"Label.label",
"Rel.rel",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"IfcMonitor.dyn_ifc_exp",
"Prims.unit"
] | [] | true | false | true | false | false | let dyn_ifc_assign x e env pc h =
| dyn_ifc_exp e h env | false |
IfcMonitor.fst | IfcMonitor.dyn_ifc | val dyn_ifc : (c:com) -> (env:label_fun) -> (pc:label) ->
(h:(rel heap)) ->
Lemma
(requires (low_equiv env h))
(ensures ((fun r1 r2 -> (Some? r1 /\ Some? r2) ==>
(fun hl hr -> (low_equiv env (R hl hr)))
(Some?.v r1) (Some?.v r2))
(interpret_com (R?.l h) c env pc)
(interpr... | val dyn_ifc : (c:com) -> (env:label_fun) -> (pc:label) ->
(h:(rel heap)) ->
Lemma
(requires (low_equiv env h))
(ensures ((fun r1 r2 -> (Some? r1 /\ Some? r2) ==>
(fun hl hr -> (low_equiv env (R hl hr)))
(Some?.v r1) (Some?.v r2))
(interpret_com (R?.l h) c env pc)
(interpr... | let dyn_ifc c env pc h =
dyn_ifc' c env pc h;
high_pc c (R?.l h) env pc | {
"file_name": "examples/rel/IfcMonitor.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 587,
"start_col": 0,
"start_line": 585
} | (*
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": [
"Rel.fst.checked",
"prims.fst.checked",
"label.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.IntStoreExcF... | [
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": "X"
},
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixedReader",
"short_module": "ISFR"
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"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 |
c: IfcMonitor.com ->
env: IfcMonitor.label_fun ->
pc: Label.label ->
h: Rel.rel FStar.DM4F.Heap.IntStoreFixed.heap
-> FStar.Pervasives.Lemma (requires IfcMonitor.low_equiv env h)
(ensures
Some? (IfcMonitor.interpret_com (R?.l h) c env pc) /\
Some? (IfcMonitor.interpret_com (R?.r... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"IfcMonitor.com",
"IfcMonitor.label_fun",
"Label.label",
"Rel.rel",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"IfcMonitor.high_pc",
"Rel.__proj__R__item__l",
"Prims.unit",
"IfcMonitor.dyn_ifc'"
] | [] | true | false | true | false | false | let dyn_ifc c env pc h =
| dyn_ifc' c env pc h;
high_pc c (R?.l h) env pc | false |
IfcMonitor.fst | IfcMonitor.high_pc_while | val high_pc_while : (e:exp) -> (body:com) -> (v:exp) -> (h:heap) -> (env:label_fun) -> (pc:label) ->
Lemma
(requires
(
let c = While e body v in
let v0,l = interpret_exp h env e in
if v0 <> 0 then
begin
let o = interpret_com h body env (join l pc)in
if Some? o th... | val high_pc_while : (e:exp) -> (body:com) -> (v:exp) -> (h:heap) -> (env:label_fun) -> (pc:label) ->
Lemma
(requires
(
let c = While e body v in
let v0,l = interpret_exp h env e in
if v0 <> 0 then
begin
let o = interpret_com h body env (join l pc)in
if Some? o th... | let high_pc_while e body v h env pc =
let c = While e body v in
let r = interpret_com h c env pc in
let v0,l = interpret_exp h env e in
if v0 <> 0 then
begin
let o = interpret_com h body env (join l pc) in
if Some? o then
begin
let h' = Some?.v o in
cut (high_pc_type body h env (join... | {
"file_name": "examples/rel/IfcMonitor.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 259,
"start_col": 0,
"start_line": 226
} | (*
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": [
"Rel.fst.checked",
"prims.fst.checked",
"label.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.IntStoreExcF... | [
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": "X"
},
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixedReader",
"short_module": "ISFR"
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"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 |
e: IfcMonitor.exp ->
body: IfcMonitor.com ->
v: IfcMonitor.exp ->
h: FStar.DM4F.Heap.IntStoreFixed.heap ->
env: IfcMonitor.label_fun ->
pc: Label.label
-> FStar.Pervasives.Lemma
(requires
(let c = IfcMonitor.While e body v in
let _ = IfcMonitor.interpret_exp h env e in... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"IfcMonitor.exp",
"IfcMonitor.com",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"IfcMonitor.label_fun",
"Label.label",
"Prims.int",
"Prims.op_disEquality",
"FStar.Pervasives.Native.uu___is_Some",
"Prims.op_GreaterThan",
"IfcMonitor.no_sens_trans",
"Label.join",
"Prims.unit",
"Prims.cut",
"Prims.... | [] | false | false | true | false | false | let high_pc_while e body v h env pc =
| let c = While e body v in
let r = interpret_com h c env pc in
let v0, l = interpret_exp h env e in
if v0 <> 0
then
let o = interpret_com h body env (join l pc) in
if Some? o
then
let h' = Some?.v o in
cut (high_pc_type body h env (join l pc));
let m0 = interpret_exp' h v in
let m1 = interpret_exp'... | false |
IfcMonitor.fst | IfcMonitor.high_pc | val high_pc : (c:com) -> (h:heap) -> (env:label_fun) -> (pc:label) ->
Lemma
(requires True)
(ensures high_pc_type c h env pc)
(decreases %[c; decr_while h c]) | val high_pc : (c:com) -> (h:heap) -> (env:label_fun) -> (pc:label) ->
Lemma
(requires True)
(ensures high_pc_type c h env pc)
(decreases %[c; decr_while h c]) | let rec high_pc c h env pc =
match c with
| Skip -> ()
| Assign x e -> high_pc_assign x e h env pc
| If e ct cf ->
let v0, l = interpret_exp h env e in
if v0 <> 0 then
high_pc ct h env (join l pc)
else
high_pc cf h env (join l pc);
if (Low? pc && High? l) then
no_... | {
"file_name": "examples/rel/IfcMonitor.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 316,
"start_col": 0,
"start_line": 269
} | (*
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": [
"Rel.fst.checked",
"prims.fst.checked",
"label.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.IntStoreExcF... | [
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": "X"
},
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixedReader",
"short_module": "ISFR"
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"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: IfcMonitor.com ->
h: FStar.DM4F.Heap.IntStoreFixed.heap ->
env: IfcMonitor.label_fun ->
pc: Label.label
-> FStar.Pervasives.Lemma (ensures IfcMonitor.high_pc_type c h env pc)
(decreases %[c;IfcMonitor.decr_while h c]) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"IfcMonitor.com",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"IfcMonitor.label_fun",
"Label.label",
"FStar.DM4F.Heap.IntStoreFixed.id",
"IfcMonitor.exp",
"IfcMonitor.high_pc_assign",
"Prims.int",
"Prims.op_AmpAmp",
"Label.uu___is_Low",
"Label.uu___is_High",
"IfcMonitor.no_sens_upd_pc",
"Prims.boo... | [
"recursion"
] | false | false | true | false | false | let rec high_pc c h env pc =
| match c with
| Skip -> ()
| Assign x e -> high_pc_assign x e h env pc
| If e ct cf ->
let v0, l = interpret_exp h env e in
if v0 <> 0 then high_pc ct h env (join l pc) else high_pc cf h env (join l pc);
if (Low? pc && High? l) then no_sens_upd_pc ()
| Seq c1 c2 ->
let o = interpret_com h c1 env pc in
if Some?... | false |
Hacl.HPKE.Interface.DH.fst | Hacl.HPKE.Interface.DH.secret_to_public_c64 | val secret_to_public_c64:secret_to_public_st (DH.DH_Curve25519) vale_p | val secret_to_public_c64:secret_to_public_st (DH.DH_Curve25519) vale_p | let secret_to_public_c64 : secret_to_public_st (DH.DH_Curve25519) vale_p = fun o i ->
Hacl.Curve25519_64.secret_to_public o i;
0ul | {
"file_name": "code/hpke/Hacl.HPKE.Interface.DH.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 5,
"end_line": 89,
"start_col": 0,
"start_line": 87
} | module Hacl.HPKE.Interface.DH
open FStar.HyperStack
open FStar.HyperStack.All
module HST = FStar.HyperStack.ST
open Lib.Buffer
open Lib.IntTypes
open Lib.ByteBuffer
module DH = Spec.Agile.DH
module S = Spec.Agile.HPKE
#reset-options "--z3rlimit 20 --fuel 0 --ifuel 1"
unfold noextract
let nsize_key (a:DH.algorithm)... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.DH.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Agile.DH",
"short_module": "DH"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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 | Hacl.HPKE.Interface.DH.secret_to_public_st Spec.Agile.DH.DH_Curve25519 Hacl.HPKE.Interface.DH.vale_p | Prims.Tot | [
"total"
] | [] | [
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Hacl.HPKE.Interface.DH.nsize_public",
"Spec.Agile.DH.DH_Curve25519",
"Hacl.HPKE.Interface.DH.nsize_key",
"FStar.UInt32.__uint_to_t",
"FStar.UInt32.t",
"Prims.unit",
"Hacl.Curve25519_64.secret_to_public"
] | [] | false | false | false | true | false | let secret_to_public_c64:secret_to_public_st (DH.DH_Curve25519) vale_p =
| fun o i ->
Hacl.Curve25519_64.secret_to_public o i;
0ul | false |
Hacl.HPKE.Interface.DH.fst | Hacl.HPKE.Interface.DH.nat_from_bytes_le_zero_is_zero | val nat_from_bytes_le_zero_is_zero (n: size_nat{n >= 1}) (s: Lib.ByteSequence.lbytes n)
: Lemma (requires s `Seq.equal` (Lib.Sequence.create n (u8 0)))
(ensures Lib.ByteSequence.nat_from_bytes_le s == 0) | val nat_from_bytes_le_zero_is_zero (n: size_nat{n >= 1}) (s: Lib.ByteSequence.lbytes n)
: Lemma (requires s `Seq.equal` (Lib.Sequence.create n (u8 0)))
(ensures Lib.ByteSequence.nat_from_bytes_le s == 0) | let rec nat_from_bytes_le_zero_is_zero (n:size_nat{n >= 1}) (s:Lib.ByteSequence.lbytes n)
: Lemma (requires s `Seq.equal` Lib.Sequence.create n (u8 0))
(ensures Lib.ByteSequence.nat_from_bytes_le s == 0)
= let open Lib.Sequence in
let open Lib.ByteSequence in
if n = 1 then nat_from_intseq_le_lemma... | {
"file_name": "code/hpke/Hacl.HPKE.Interface.DH.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 125,
"start_col": 0,
"start_line": 115
} | module Hacl.HPKE.Interface.DH
open FStar.HyperStack
open FStar.HyperStack.All
module HST = FStar.HyperStack.ST
open Lib.Buffer
open Lib.IntTypes
open Lib.ByteBuffer
module DH = Spec.Agile.DH
module S = Spec.Agile.HPKE
#reset-options "--z3rlimit 20 --fuel 0 --ifuel 1"
unfold noextract
let nsize_key (a:DH.algorithm)... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.DH.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Agile.DH",
"short_module": "DH"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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 | n: Lib.IntTypes.size_nat{n >= 1} -> s: Lib.ByteSequence.lbytes n
-> FStar.Pervasives.Lemma
(requires FStar.Seq.Base.equal s (Lib.Sequence.create n (Lib.IntTypes.u8 0)))
(ensures Lib.ByteSequence.nat_from_bytes_le s == 0) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Lib.IntTypes.size_nat",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"Lib.ByteSequence.lbytes",
"Prims.op_Equality",
"Prims.int",
"Lib.ByteSequence.nat_from_intseq_le_lemma0",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Prims.bool",
"Lib.Sequence.slice",
"Lib.IntTypes.uint_t",
"Prims.unit",
"H... | [
"recursion"
] | false | false | true | false | false | let rec nat_from_bytes_le_zero_is_zero (n: size_nat{n >= 1}) (s: Lib.ByteSequence.lbytes n)
: Lemma (requires s `Seq.equal` (Lib.Sequence.create n (u8 0)))
(ensures Lib.ByteSequence.nat_from_bytes_le s == 0) =
| let open Lib.Sequence in
let open Lib.ByteSequence in
if n = 1
then nat_from_intseq_le_lemma0 s
else
(nat_from_intseq_le_slice_lemma s 1;
nat_from_bytes_le_zero_is_zero (n - 1) (slice s 1 n);
nat_from_intseq_le_lemma0 (slice s 0 1)) | false |
Hacl.HPKE.Interface.DH.fst | Hacl.HPKE.Interface.DH.secret_to_public_p256 | val secret_to_public_p256:secret_to_public_st (DH.DH_P256) True | val secret_to_public_p256:secret_to_public_st (DH.DH_P256) True | let secret_to_public_p256 : secret_to_public_st (DH.DH_P256) True = fun o i ->
let res = Hacl.Impl.P256.DH.ecp256dh_i o i in
if res then 0ul else 1ul | {
"file_name": "code/hpke/Hacl.HPKE.Interface.DH.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 26,
"end_line": 112,
"start_col": 0,
"start_line": 110
} | module Hacl.HPKE.Interface.DH
open FStar.HyperStack
open FStar.HyperStack.All
module HST = FStar.HyperStack.ST
open Lib.Buffer
open Lib.IntTypes
open Lib.ByteBuffer
module DH = Spec.Agile.DH
module S = Spec.Agile.HPKE
#reset-options "--z3rlimit 20 --fuel 0 --ifuel 1"
unfold noextract
let nsize_key (a:DH.algorithm)... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.DH.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Agile.DH",
"short_module": "DH"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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 | Hacl.HPKE.Interface.DH.secret_to_public_st Spec.Agile.DH.DH_P256 Prims.l_True | Prims.Tot | [
"total"
] | [] | [
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Hacl.HPKE.Interface.DH.nsize_public",
"Spec.Agile.DH.DH_P256",
"Hacl.HPKE.Interface.DH.nsize_key",
"FStar.UInt32.__uint_to_t",
"Prims.bool",
"FStar.UInt32.t",
"Hacl.Impl.P256.DH.ecp256dh_i"
] | [] | false | false | false | true | false | let secret_to_public_p256:secret_to_public_st (DH.DH_P256) True =
| fun o i ->
let res = Hacl.Impl.P256.DH.ecp256dh_i o i in
if res then 0ul else 1ul | false |
IfcMonitor.fst | IfcMonitor.dyn_ifc' | val dyn_ifc' : (c:com) -> (env:label_fun) -> (pc:label) -> (h:(rel heap)) ->
Lemma
(requires (low_equiv env h))
(ensures (ifc_type c env pc h))
(decreases %[c; decr_while (R?.l h) c + decr_while (R?.r h) c]) | val dyn_ifc' : (c:com) -> (env:label_fun) -> (pc:label) -> (h:(rel heap)) ->
Lemma
(requires (low_equiv env h))
(ensures (ifc_type c env pc h))
(decreases %[c; decr_while (R?.l h) c + decr_while (R?.r h) c]) | let rec dyn_ifc' c env pc h =
let (R hl hr) = h in
if Low? pc then
begin
match c with
| Skip -> ()
| Assign x e -> dyn_ifc_assign x e env pc h
| If e ct cf ->
dyn_ifc_exp e h env;
(match interpret_exp hl env e, interpret_exp hr env e with
| (0, ll) , (0, lr) ->
... | {
"file_name": "examples/rel/IfcMonitor.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 571,
"start_col": 0,
"start_line": 485
} | (*
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": [
"Rel.fst.checked",
"prims.fst.checked",
"label.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.IntStoreExcF... | [
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": "X"
},
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixedReader",
"short_module": "ISFR"
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 1,
"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: IfcMonitor.com ->
env: IfcMonitor.label_fun ->
pc: Label.label ->
h: Rel.rel FStar.DM4F.Heap.IntStoreFixed.heap
-> FStar.Pervasives.Lemma (requires IfcMonitor.low_equiv env h)
(ensures IfcMonitor.ifc_type c env pc h)
(decreases %[c;IfcMonitor.decr_while (R?.l h) c + IfcMonitor.decr_whi... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"IfcMonitor.com",
"IfcMonitor.label_fun",
"Label.label",
"Rel.rel",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Label.uu___is_Low",
"FStar.DM4F.Heap.IntStoreFixed.id",
"IfcMonitor.exp",
"IfcMonitor.dyn_ifc_assign",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple2",
"Prims.int",
... | [
"recursion"
] | false | false | true | false | false | let rec dyn_ifc' c env pc h =
| let R hl hr = h in
if Low? pc
then
match c with
| Skip -> ()
| Assign x e -> dyn_ifc_assign x e env pc h
| If e ct cf ->
dyn_ifc_exp e h env;
(match interpret_exp hl env e, interpret_exp hr env e with
| (0, ll), (0, lr) -> dyn_ifc' cf env (join ll pc) h
| (0, ll), (_, lr) ->
cut (Hig... | false |
IfcMonitor.fst | IfcMonitor.dyn_ifc_while | val dyn_ifc_while : (e:exp) -> (body:com) -> (v:exp) -> (env:label_fun) -> (pc:label) -> (h:rel heap) ->
Lemma
(requires (low_equiv env h /\
begin
let R hl hr = h in
let c = While e body v in
let v0l,ll = interpret_exp hl env e in
let v0r,lr = interpret_exp ... | val dyn_ifc_while : (e:exp) -> (body:com) -> (v:exp) -> (env:label_fun) -> (pc:label) -> (h:rel heap) ->
Lemma
(requires (low_equiv env h /\
begin
let R hl hr = h in
let c = While e body v in
let v0l,ll = interpret_exp hl env e in
let v0r,lr = interpret_exp ... | let dyn_ifc_while e body v env pc h =
let R hl hr = h in
let c = While e body v in
let rl = interpret_com hl c env pc in
let rr = interpret_com hr c env pc in
let v0l,ll = interpret_exp hl env e in
let v0r,lr = interpret_exp hr env e in
dyn_ifc_exp e h env;
match v0l <> 0, v0r <> 0 with
| true... | {
"file_name": "examples/rel/IfcMonitor.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 21,
"end_line": 475,
"start_col": 0,
"start_line": 415
} | (*
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": [
"Rel.fst.checked",
"prims.fst.checked",
"label.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.DM4F.IntStoreFixedReader.fst.checked",
"FStar.DM4F.IntStoreFixed.fst.checked",
"FStar.DM4F.IntStoreExcF... | [
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixed",
"short_module": "X"
},
{
"abbrev": true,
"full_module": "FStar.DM4F.IntStoreFixedReader",
"short_module": "ISFR"
},
{
"abbrev": false,
"full_module": "FStar.DM4F.IntStoreExcFixed",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 1,
"max_fuel": 2,
"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 |
e: IfcMonitor.exp ->
body: IfcMonitor.com ->
v: IfcMonitor.exp ->
env: IfcMonitor.label_fun ->
pc: Label.label ->
h: Rel.rel FStar.DM4F.Heap.IntStoreFixed.heap
-> FStar.Pervasives.Lemma
(requires
IfcMonitor.low_equiv env h /\
(let _ = h in
(let Rel.R #_ hl hr =... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"IfcMonitor.exp",
"IfcMonitor.com",
"IfcMonitor.label_fun",
"Label.label",
"Rel.rel",
"FStar.DM4F.Heap.IntStoreFixed.heap",
"Prims.int",
"FStar.Pervasives.Native.Mktuple2",
"Prims.bool",
"Prims.op_disEquality",
"Prims.op_AmpAmp",
"FStar.Pervasives.Native.uu___is_Some",
"Prims.op_GreaterThan"... | [] | false | false | true | false | false | let dyn_ifc_while e body v env pc h =
| let R hl hr = h in
let c = While e body v in
let rl = interpret_com hl c env pc in
let rr = interpret_com hr c env pc in
let v0l, ll = interpret_exp hl env e in
let v0r, lr = interpret_exp hr env e in
dyn_ifc_exp e h env;
match v0l <> 0, v0r <> 0 with
| true, true ->
let ol = interpret_com hl body env (join ll pc) in... | false |
Hacl.Spec.Chacha20.Equiv.fst | Hacl.Spec.Chacha20.Equiv.chacha20_map_blocks_multi_vec_equiv_pre_k | val chacha20_map_blocks_multi_vec_equiv_pre_k:
#w:lanes
-> k:key
-> n:nonce
-> c0:counter{c0 + w <= max_size_t}
-> hi_fv:nat // n == hi_fv == len / (w * blocksize)
-> hi_f:size_nat{w * hi_fv <= hi_f}
-> i:nat{i < hi_fv}
-> b_v:lseq uint8 (w * blocksize)
-> j:nat{j < w * blocksize} ->
Lemma
(let... | val chacha20_map_blocks_multi_vec_equiv_pre_k:
#w:lanes
-> k:key
-> n:nonce
-> c0:counter{c0 + w <= max_size_t}
-> hi_fv:nat // n == hi_fv == len / (w * blocksize)
-> hi_f:size_nat{w * hi_fv <= hi_f}
-> i:nat{i < hi_fv}
-> b_v:lseq uint8 (w * blocksize)
-> j:nat{j < w * blocksize} ->
Lemma
(let... | let chacha20_map_blocks_multi_vec_equiv_pre_k #w k n c0 hi_fv hi_f i b_v j =
encrypt_block_lemma_bs_i #w k n c0 i b_v j | {
"file_name": "code/chacha20/Hacl.Spec.Chacha20.Equiv.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 44,
"end_line": 569,
"start_col": 0,
"start_line": 568
} | module Hacl.Spec.Chacha20.Equiv
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Lib.IntVector
module Scalar = Spec.Chacha20
module Lemmas = Hacl.Spec.Chacha20.Lemmas
module VecLemmas = Lib.Vec.Lemmas
module SeqLemmas = Lib.Sequence.Lemmas
open Hacl.Spec.Chacha20.Vec
#reset-options "--... | {
"checked_file": "/",
"dependencies": [
"Spec.Chacha20.fst.checked",
"prims.fst.checked",
"Lib.Vec.Lemmas.fsti.checked",
"Lib.Sequence.Lemmas.fsti.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntVector.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": false,
"full_module": "Hacl.Spec.Chacha20.Vec",
"short_module": null
},
{
"abbrev": true,
"full_module": "Lib.Sequence.Lemmas",
"short_module": "SeqLemmas"
},
{
"abbrev": true,
"full_module": "Lib.Vec.Lemmas",
"short_module": "VecLemmas"
},
{
"abbrev":... | {
"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 |
k: Hacl.Spec.Chacha20.Vec.key ->
n: Hacl.Spec.Chacha20.Vec.nonce ->
c0: Hacl.Spec.Chacha20.Vec.counter{c0 + w <= Lib.IntTypes.max_size_t} ->
hi_fv: Prims.nat ->
hi_f: Lib.IntTypes.size_nat{w * hi_fv <= hi_f} ->
i: Prims.nat{i < hi_fv} ->
b_v: Lib.Sequence.lseq Lib.IntTypes.uint8 (w * Hacl.S... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Hacl.Spec.Chacha20.Vec.lanes",
"Hacl.Spec.Chacha20.Vec.key",
"Hacl.Spec.Chacha20.Vec.nonce",
"Hacl.Spec.Chacha20.Vec.counter",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Lib.IntTypes.max_size_t",
"Prims.nat",
"Lib.IntTypes.size_nat",
"FStar.Mul.op_Star",
"Prims.op_LessThan... | [] | true | false | true | false | false | let chacha20_map_blocks_multi_vec_equiv_pre_k #w k n c0 hi_fv hi_f i b_v j =
| encrypt_block_lemma_bs_i #w k n c0 i b_v j | false |
Hacl.HPKE.Interface.DH.fst | Hacl.HPKE.Interface.DH.dh_c64 | val dh_c64:dh_st (DH.DH_Curve25519) vale_p | val dh_c64:dh_st (DH.DH_Curve25519) vale_p | let dh_c64 : dh_st (DH.DH_Curve25519) vale_p = fun o k i ->
push_frame();
let zeros = create 32ul (u8 0) in
Hacl.Curve25519_64.scalarmult o k i;
let res = if lbytes_eq o zeros then 1ul else 0ul in
pop_frame();
res | {
"file_name": "code/hpke/Hacl.HPKE.Interface.DH.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 5,
"end_line": 97,
"start_col": 0,
"start_line": 91
} | module Hacl.HPKE.Interface.DH
open FStar.HyperStack
open FStar.HyperStack.All
module HST = FStar.HyperStack.ST
open Lib.Buffer
open Lib.IntTypes
open Lib.ByteBuffer
module DH = Spec.Agile.DH
module S = Spec.Agile.HPKE
#reset-options "--z3rlimit 20 --fuel 0 --ifuel 1"
unfold noextract
let nsize_key (a:DH.algorithm)... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.DH.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Agile.DH",
"short_module": "DH"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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 | Hacl.HPKE.Interface.DH.dh_st Spec.Agile.DH.DH_Curve25519 Hacl.HPKE.Interface.DH.vale_p | Prims.Tot | [
"total"
] | [] | [
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Hacl.HPKE.Interface.DH.nsize_public",
"Spec.Agile.DH.DH_Curve25519",
"Hacl.HPKE.Interface.DH.nsize_key",
"FStar.UInt32.t",
"Prims.unit",
"FStar.HyperStack.ST.pop_frame",
"FStar.UInt32.__uint_to_t",
"Prims.bool",
"Lib.ByteBuffer.lbytes_eq",
"Hacl.Cur... | [] | false | false | false | true | false | let dh_c64:dh_st (DH.DH_Curve25519) vale_p =
| fun o k i ->
push_frame ();
let zeros = create 32ul (u8 0) in
Hacl.Curve25519_64.scalarmult o k i;
let res = if lbytes_eq o zeros then 1ul else 0ul in
pop_frame ();
res | false |
Hacl.HPKE.Interface.DH.fst | Hacl.HPKE.Interface.DH.dh_c51 | val dh_c51:dh_st (DH.DH_Curve25519) True | val dh_c51:dh_st (DH.DH_Curve25519) True | let dh_c51 : dh_st (DH.DH_Curve25519) True = fun o k i ->
push_frame();
let zeros = create 32ul (u8 0) in
Hacl.Curve25519_51.scalarmult o k i;
let res = if lbytes_eq o zeros then 1ul else 0ul in
pop_frame();
res | {
"file_name": "code/hpke/Hacl.HPKE.Interface.DH.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 5,
"end_line": 81,
"start_col": 0,
"start_line": 75
} | module Hacl.HPKE.Interface.DH
open FStar.HyperStack
open FStar.HyperStack.All
module HST = FStar.HyperStack.ST
open Lib.Buffer
open Lib.IntTypes
open Lib.ByteBuffer
module DH = Spec.Agile.DH
module S = Spec.Agile.HPKE
#reset-options "--z3rlimit 20 --fuel 0 --ifuel 1"
unfold noextract
let nsize_key (a:DH.algorithm)... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.CPU_Features_s.fst.checked",
"Spec.Agile.HPKE.fsti.checked",
"Spec.Agile.DH.fst.checked",
"prims.fst.checked",
"Meta.Attribute.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.IntTypes.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Spec.Agile.HPKE",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Spec.Agile.DH",
"short_module": "DH"
},
{
"abbrev": false,
"full_module": "Lib.ByteBuffer",
"short_module": null
},
{
"abbrev": false,
"full_module": "... | {
"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 | Hacl.HPKE.Interface.DH.dh_st Spec.Agile.DH.DH_Curve25519 Prims.l_True | Prims.Tot | [
"total"
] | [] | [
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Hacl.HPKE.Interface.DH.nsize_public",
"Spec.Agile.DH.DH_Curve25519",
"Hacl.HPKE.Interface.DH.nsize_key",
"FStar.UInt32.t",
"Prims.unit",
"FStar.HyperStack.ST.pop_frame",
"FStar.UInt32.__uint_to_t",
"Prims.bool",
"Lib.ByteBuffer.lbytes_eq",
"Hacl.Cur... | [] | false | false | false | true | false | let dh_c51:dh_st (DH.DH_Curve25519) True =
| fun o k i ->
push_frame ();
let zeros = create 32ul (u8 0) in
Hacl.Curve25519_51.scalarmult o k i;
let res = if lbytes_eq o zeros then 1ul else 0ul in
pop_frame ();
res | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.