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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Hacl.Spec.Karatsuba.Lemmas.fst | Hacl.Spec.Karatsuba.Lemmas.lemma_bn_halves | val lemma_bn_halves: pbits:pos -> aLen:nat{aLen % 2 = 0} -> a:nat{a < pow2 (pbits * aLen)} ->
Lemma (let p = pow2 (aLen / 2 * pbits) in a / p < p /\ a % p < p /\ a == a / p * p + a % p) | val lemma_bn_halves: pbits:pos -> aLen:nat{aLen % 2 = 0} -> a:nat{a < pow2 (pbits * aLen)} ->
Lemma (let p = pow2 (aLen / 2 * pbits) in a / p < p /\ a % p < p /\ a == a / p * p + a % p) | let lemma_bn_halves pbits aLen a = lemma_double_p pbits aLen | {
"file_name": "code/bignum/Hacl.Spec.Karatsuba.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 60,
"end_line": 42,
"start_col": 0,
"start_line": 42
} | module Hacl.Spec.Karatsuba.Lemmas
open FStar.Mul
open Lib.IntTypes
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
type sign =
| Positive
| Negative
let abs (a:nat) (b:nat) : nat =
if a < b then b - a else a - b
val sign_abs: a:nat -> b:nat ->
Pure (tuple2 sign nat)
(requires True)
(ensures fun (s, re... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source... | [
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Karatsuba",
"short_module": null
},
{
"abbrev": false,
"full_module": ... | {
"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 | pbits: Prims.pos -> aLen: Prims.nat{aLen % 2 = 0} -> a: Prims.nat{a < Prims.pow2 (pbits * aLen)}
-> FStar.Pervasives.Lemma
(ensures
(let p = Prims.pow2 ((aLen / 2) * pbits) in
a / p < p /\ a % p < p /\ a == (a / p) * p + a % p)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Prims.op_LessThan",
"Prims.pow2",
"FStar.Mul.op_Star",
"Hacl.Spec.Karatsuba.Lemmas.lemma_double_p",
"Prims.unit"
] | [] | true | false | true | false | false | let lemma_bn_halves pbits aLen a =
| lemma_double_p pbits aLen | false |
Vale.AES.GCM_s.fst | Vale.AES.GCM_s.gcm_decrypt_LE | val gcm_decrypt_LE : alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Types_s.nat8 ->
iv: Vale.AES.GCM_s.supported_iv_LE ->
cipher: FStar.Seq.Base.seq Vale.Def.Types_s.nat8 ->
auth: FStar.Seq.Base.seq Vale.Def.Types_s.nat8 ->
tag: FStar.Seq.Base.seq Vale.Def.Types_s.nat8
->... | let gcm_decrypt_LE = opaque_make gcm_decrypt_LE_def | {
"file_name": "vale/specs/crypto/Vale.AES.GCM_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 70,
"end_line": 95,
"start_col": 19,
"start_line": 95
} | module Vale.AES.GCM_s
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open Vale.Def.Types_s
open Vale.AES.AES_s
open Vale.AES.GCTR_s
open Vale.AES.GHash_s
open FStar.Seq
open FStar.Mul
unfold type gcm_plain_LE = gctr_plain_LE
unfold type gcm_auth_LE = gctr_plain_LE
#reset-options "--z3rlimit 3... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.AES.GHash_s.fst.checked",
"Vale.AES.GCTR_s.fst.checked",
"Vale.AES.AES_s.fst.checked",
"prims.fst.che... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Types_s.nat8 ->
iv: Vale.AES.GCM_s.supported_iv_LE ->
cipher: FStar.Seq.Base.seq Vale.Def.Types_s.nat8 ->
auth: FStar.Seq.Base.seq Vale.Def.Types_s.nat8 ->
tag: FStar.Seq.Base.seq Vale.Def.Types_s.nat8
-> Prims.Pure (FSt... | Prims.Pure | [] | [] | [
"Vale.Def.Opaque_s.opaque_make",
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat8",
"Vale.AES.GCM_s.supported_iv_LE",
"FStar.Pervasives.Native.tuple2",
"Prims.bool",
"Prims.l_and",
"Vale.AES.AES_common_s.is_aes_key",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.B... | [] | false | false | false | false | false | let gcm_decrypt_LE =
| opaque_make gcm_decrypt_LE_def | false | |
Pulse.Lib.BoundedIntegers.fst | Pulse.Lib.BoundedIntegers.safe_mod | val safe_mod (#t: eqtype) {| c: bounded_unsigned t |} (x y: t)
: Pure (option t) (requires v y > 0) (ensures fun o -> Some? o ==> v (Some?.v o) == v x % v y) | val safe_mod (#t: eqtype) {| c: bounded_unsigned t |} (x y: t)
: Pure (option t) (requires v y > 0) (ensures fun o -> Some? o ==> v (Some?.v o) == v x % v y) | let safe_mod (#t:eqtype) {| c: bounded_unsigned t |} (x : t) (y : t)
: Pure (option t)
(requires v y > 0)
(ensures fun o -> Some? o ==> v (Some?.v o) == v x % v y)
= if c.static_max_bound
then Some (x % y)
else (
if y <= max_bound
then (
assert (fits #t (v x % v y));
... | {
"file_name": "share/steel/examples/pulse/lib/Pulse.Lib.BoundedIntegers.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 5,
"end_line": 103,
"start_col": 0,
"start_line": 90
} | (*
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": [
"prims.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.SizeT.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Lib.BoundedInt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Typeclasses",
"short_module": "TC"
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | {| c: Pulse.Lib.BoundedIntegers.bounded_unsigned t |} -> x: t -> y: t
-> Prims.Pure (FStar.Pervasives.Native.option t) | Prims.Pure | [] | [] | [
"Prims.eqtype",
"Pulse.Lib.BoundedIntegers.bounded_unsigned",
"Pulse.Lib.BoundedIntegers.__proj__Mkbounded_unsigned__item__static_max_bound",
"FStar.Pervasives.Native.Some",
"Pulse.Lib.BoundedIntegers.op_Percent",
"Pulse.Lib.BoundedIntegers.bounded_from_bounded_unsigned",
"Prims.bool",
"Pulse.Lib.Boun... | [] | false | false | false | false | false | let safe_mod (#t: eqtype) {| c: bounded_unsigned t |} (x y: t)
: Pure (option t) (requires v y > 0) (ensures fun o -> Some? o ==> v (Some?.v o) == v x % v y) =
| if c.static_max_bound
then Some (x % y)
else
(if y <= max_bound
then
(assert (fits #t (v x % v y));
Some (x % y))
else None) | false |
Pulse.Lib.BoundedIntegers.fst | Pulse.Lib.BoundedIntegers.add_nat_1 | val add_nat_1 : x: Prims.nat -> Prims.int | let add_nat_1 (x:nat) = x + 1 | {
"file_name": "share/steel/examples/pulse/lib/Pulse.Lib.BoundedIntegers.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 29,
"end_line": 162,
"start_col": 0,
"start_line": 162
} | (*
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": [
"prims.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.SizeT.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Lib.BoundedInt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Typeclasses",
"short_module": "TC"
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.nat -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Pulse.Lib.BoundedIntegers.op_Plus",
"Prims.int",
"Pulse.Lib.BoundedIntegers.bounded_int_int"
] | [] | false | false | false | true | false | let add_nat_1 (x: nat) =
| x + 1 | false | |
Pulse.Lib.BoundedIntegers.fst | Pulse.Lib.BoundedIntegers.bounded_unsigned_u32 | [@@ FStar.Tactics.Typeclasses.tcinstance]
val bounded_unsigned_u32:bounded_unsigned FStar.UInt32.t | [@@ FStar.Tactics.Typeclasses.tcinstance]
val bounded_unsigned_u32:bounded_unsigned FStar.UInt32.t | instance bounded_unsigned_u32 : bounded_unsigned FStar.UInt32.t = {
base = TC.solve;
max_bound = 0xfffffffful;
static_max_bound = true;
properties = ()
} | {
"file_name": "share/steel/examples/pulse/lib/Pulse.Lib.BoundedIntegers.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 1,
"end_line": 133,
"start_col": 0,
"start_line": 128
} | (*
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": [
"prims.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.SizeT.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Lib.BoundedInt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Typeclasses",
"short_module": "TC"
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Pulse.Lib.BoundedIntegers.bounded_unsigned FStar.UInt32.t | Prims.Tot | [
"total"
] | [] | [
"Pulse.Lib.BoundedIntegers.Mkbounded_unsigned",
"FStar.UInt32.t",
"Pulse.Lib.BoundedIntegers.bounded_int_u32",
"Pulse.Lib.BoundedIntegers.bounded_int",
"FStar.UInt32.__uint_to_t"
] | [] | false | false | false | true | false | [@@ FStar.Tactics.Typeclasses.tcinstance]
let bounded_unsigned_u32:bounded_unsigned FStar.UInt32.t =
| { base = TC.solve; max_bound = 0xfffffffful; static_max_bound = true; properties = () } | false |
Vale.AES.GCM_s.fst | Vale.AES.GCM_s.gcm_decrypt_LE_reveal | val gcm_decrypt_LE_reveal : _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures Vale.AES.GCM_s.gcm_decrypt_LE == Vale.AES.GCM_s.gcm_decrypt_LE_def) | let gcm_decrypt_LE_reveal = opaque_revealer (`%gcm_decrypt_LE) gcm_decrypt_LE gcm_decrypt_LE_def | {
"file_name": "vale/specs/crypto/Vale.AES.GCM_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 108,
"end_line": 96,
"start_col": 12,
"start_line": 96
} | module Vale.AES.GCM_s
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open Vale.Def.Types_s
open Vale.AES.AES_s
open Vale.AES.GCTR_s
open Vale.AES.GHash_s
open FStar.Seq
open FStar.Mul
unfold type gcm_plain_LE = gctr_plain_LE
unfold type gcm_auth_LE = gctr_plain_LE
#reset-options "--z3rlimit 3... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.AES.GHash_s.fst.checked",
"Vale.AES.GCTR_s.fst.checked",
"Vale.AES.AES_s.fst.checked",
"prims.fst.che... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures Vale.AES.GCM_s.gcm_decrypt_LE == Vale.AES.GCM_s.gcm_decrypt_LE_def) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Def.Opaque_s.opaque_revealer",
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat8",
"Vale.AES.GCM_s.supported_iv_LE",
"FStar.Pervasives.Native.tuple2",
"Prims.bool",
"Prims.l_and",
"Vale.AES.AES_common_s.is_aes_key",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.S... | [] | true | false | true | false | false | let gcm_decrypt_LE_reveal =
| opaque_revealer (`%gcm_decrypt_LE) gcm_decrypt_LE gcm_decrypt_LE_def | false | |
Pulse.Lib.BoundedIntegers.fst | Pulse.Lib.BoundedIntegers.bounded_int_u32 | [@@ FStar.Tactics.Typeclasses.tcinstance]
val bounded_int_u32:bounded_int FStar.UInt32.t | [@@ FStar.Tactics.Typeclasses.tcinstance]
val bounded_int_u32:bounded_int FStar.UInt32.t | instance bounded_int_u32 : bounded_int FStar.UInt32.t = {
fits = (fun x -> 0 <= x /\ x < 4294967296);
v = (fun x -> FStar.UInt32.v x);
u = FStar.UInt32.uint_to_t;
( + ) = (fun x y -> FStar.UInt32.add x y);
op_Subtraction = (fun x y -> FStar.UInt32.sub x y);
( < ) = FStar.UInt32.(fun x y -> x <^ ... | {
"file_name": "share/steel/examples/pulse/lib/Pulse.Lib.BoundedIntegers.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 1,
"end_line": 126,
"start_col": 0,
"start_line": 116
} | (*
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": [
"prims.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.SizeT.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Lib.BoundedInt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Typeclasses",
"short_module": "TC"
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Pulse.Lib.BoundedIntegers.bounded_int FStar.UInt32.t | Prims.Tot | [
"total"
] | [] | [
"Pulse.Lib.BoundedIntegers.Mkbounded_int",
"FStar.UInt32.t",
"Prims.int",
"Prims.l_and",
"Prims.b2t",
"Pulse.Lib.BoundedIntegers.op_Less_Equals",
"Pulse.Lib.BoundedIntegers.bounded_int_int",
"Pulse.Lib.BoundedIntegers.op_Less",
"Prims.prop",
"FStar.UInt32.v",
"FStar.UInt32.uint_to_t",
"FStar.U... | [] | false | false | false | true | false | [@@ FStar.Tactics.Typeclasses.tcinstance]
let bounded_int_u32:bounded_int FStar.UInt32.t =
| {
fits = (fun x -> 0 <= x /\ x < 4294967296);
v = (fun x -> FStar.UInt32.v x);
u = FStar.UInt32.uint_to_t;
( + ) = (fun x y -> FStar.UInt32.add x y);
( - ) = (fun x y -> FStar.UInt32.sub x y);
( < ) = (let open FStar.UInt32 in fun x y -> x <^ y);
( <= ) = (let open FStar.UInt32 in fun x y -> x <=^ y);
(... | false |
Spec.Curve25519.fst | Spec.Curve25519.basepoint_lseq | val basepoint_lseq:Lib.Sequence.lseq byte_t 32 | val basepoint_lseq:Lib.Sequence.lseq byte_t 32 | let basepoint_lseq : Lib.Sequence.lseq byte_t 32 =
Lib.Sequence.of_list basepoint_list | {
"file_name": "specs/Spec.Curve25519.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 37,
"end_line": 137,
"start_col": 0,
"start_line": 136
} | module Spec.Curve25519
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Curve25519.Lemmas
#set-options "--z3rlimit 30 --ifuel 0 --fuel 0"
(* Field types and parameters *)
let prime : pos = pow2 255 - 19
type elem = x:nat{x < prime}
let zero : elem = 0
let one : elem = 1
let fadd... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.Lemmas.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked"... | [
{
"abbrev": false,
"full_module": "Spec.Curve25519.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full... | {
"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 | Lib.Sequence.lseq (Lib.IntTypes.int_t Lib.IntTypes.U8 Lib.IntTypes.PUB) 32 | Prims.Tot | [
"total"
] | [] | [
"Lib.Sequence.of_list",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.PUB",
"Spec.Curve25519.basepoint_list"
] | [] | false | false | false | false | false | let basepoint_lseq:Lib.Sequence.lseq byte_t 32 =
| Lib.Sequence.of_list basepoint_list | false |
Pulse.Lib.BoundedIntegers.fst | Pulse.Lib.BoundedIntegers.safe_add | val safe_add (#t: eqtype) {| c: bounded_unsigned t |} (x y: t)
: o: option t {Some? o ==> v (Some?.v o) == v x + v y} | val safe_add (#t: eqtype) {| c: bounded_unsigned t |} (x y: t)
: o: option t {Some? o ==> v (Some?.v o) == v x + v y} | let safe_add (#t:eqtype) {| c: bounded_unsigned t |} (x y : t)
: o:option t { Some? o ==> v (Some?.v o) == v x + v y }
= if c.static_max_bound
then (
assert ( x <= max_bound);
if (y <= max_bound - x)
then Some (x + y)
else None
)
else (
if x <= max_bound
then (
... | {
"file_name": "share/steel/examples/pulse/lib/Pulse.Lib.BoundedIntegers.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 5,
"end_line": 88,
"start_col": 0,
"start_line": 70
} | (*
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": [
"prims.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.SizeT.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Lib.BoundedInt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Typeclasses",
"short_module": "TC"
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | {| c: Pulse.Lib.BoundedIntegers.bounded_unsigned t |} -> x: t -> y: t
-> o:
FStar.Pervasives.Native.option t
{ Some? o ==>
Pulse.Lib.BoundedIntegers.v (Some?.v o) ==
Pulse.Lib.BoundedIntegers.v x + Pulse.Lib.BoundedIntegers.v y } | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"Pulse.Lib.BoundedIntegers.bounded_unsigned",
"Pulse.Lib.BoundedIntegers.__proj__Mkbounded_unsigned__item__static_max_bound",
"Pulse.Lib.BoundedIntegers.op_Less_Equals",
"Pulse.Lib.BoundedIntegers.bounded_from_bounded_unsigned",
"Pulse.Lib.BoundedIntegers.op_Subtraction",
"Pulse.Lib.Boun... | [] | false | false | false | false | false | let safe_add (#t: eqtype) {| c: bounded_unsigned t |} (x y: t)
: o: option t {Some? o ==> v (Some?.v o) == v x + v y} =
| if c.static_max_bound
then
(assert (x <= max_bound);
if (y <= max_bound - x) then Some (x + y) else None)
else
(if x <= max_bound
then
(assert (fits #t (v (max_bound #t) - v x));
if (y <= max_bound - x) then Some (x + y) else None)
else None) | false |
Spec.Curve25519.fst | Spec.Curve25519.scalarmult | val scalarmult (k: scalar) (u: serialized_point) : Tot serialized_point | val scalarmult (k: scalar) (u: serialized_point) : Tot serialized_point | let scalarmult (k:scalar) (u:serialized_point) : Tot serialized_point =
let u = decodePoint u in
let res = montgomery_ladder u k in
encodePoint res | {
"file_name": "specs/Spec.Curve25519.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 17,
"end_line": 123,
"start_col": 0,
"start_line": 120
} | module Spec.Curve25519
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Curve25519.Lemmas
#set-options "--z3rlimit 30 --ifuel 0 --fuel 0"
(* Field types and parameters *)
let prime : pos = pow2 255 - 19
type elem = x:nat{x < prime}
let zero : elem = 0
let one : elem = 1
let fadd... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.Lemmas.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked"... | [
{
"abbrev": false,
"full_module": "Spec.Curve25519.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full... | {
"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 | k: Spec.Curve25519.scalar -> u81: Spec.Curve25519.serialized_point
-> Spec.Curve25519.serialized_point | Prims.Tot | [
"total"
] | [] | [
"Spec.Curve25519.scalar",
"Spec.Curve25519.serialized_point",
"Spec.Curve25519.encodePoint",
"Spec.Curve25519.proj_point",
"Spec.Curve25519.montgomery_ladder",
"Prims.int",
"Spec.Curve25519.decodePoint"
] | [] | false | false | false | true | false | let scalarmult (k: scalar) (u: serialized_point) : Tot serialized_point =
| let u = decodePoint u in
let res = montgomery_ladder u k in
encodePoint res | false |
Pulse.Lib.BoundedIntegers.fst | Pulse.Lib.BoundedIntegers.bounded_unsigned_u64 | [@@ FStar.Tactics.Typeclasses.tcinstance]
val bounded_unsigned_u64:bounded_unsigned FStar.UInt64.t | [@@ FStar.Tactics.Typeclasses.tcinstance]
val bounded_unsigned_u64:bounded_unsigned FStar.UInt64.t | instance bounded_unsigned_u64 : bounded_unsigned FStar.UInt64.t = {
base = TC.solve;
max_bound = 0xffffffffffffffffuL;
static_max_bound = true;
properties = ()
} | {
"file_name": "share/steel/examples/pulse/lib/Pulse.Lib.BoundedIntegers.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 1,
"end_line": 152,
"start_col": 0,
"start_line": 147
} | (*
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": [
"prims.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.SizeT.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Lib.BoundedInt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Typeclasses",
"short_module": "TC"
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Pulse.Lib.BoundedIntegers.bounded_unsigned FStar.UInt64.t | Prims.Tot | [
"total"
] | [] | [
"Pulse.Lib.BoundedIntegers.Mkbounded_unsigned",
"FStar.UInt64.t",
"Pulse.Lib.BoundedIntegers.bounded_int_u64",
"Pulse.Lib.BoundedIntegers.bounded_int",
"FStar.UInt64.__uint_to_t"
] | [] | false | false | false | true | false | [@@ FStar.Tactics.Typeclasses.tcinstance]
let bounded_unsigned_u64:bounded_unsigned FStar.UInt64.t =
| { base = TC.solve; max_bound = 0xffffffffffffffffuL; static_max_bound = true; properties = () } | false |
Pulse.Lib.BoundedIntegers.fst | Pulse.Lib.BoundedIntegers.bounded_int_pos | [@@ FStar.Tactics.Typeclasses.tcinstance]
val bounded_int_pos:bounded_int pos | [@@ FStar.Tactics.Typeclasses.tcinstance]
val bounded_int_pos:bounded_int pos | instance bounded_int_pos : bounded_int pos = {
fits = (fun x -> x > 0);
v = pos_as_int;
u = (fun x -> x);
( + ) = (fun x y -> Prims.op_Addition x y);
op_Subtraction = (fun x y -> Prims.op_Subtraction x y); //can't write ( - ), it doesn't parse
( < ) = (fun x y -> Prims.op_LessThan x y);
( <=... | {
"file_name": "share/steel/examples/pulse/lib/Pulse.Lib.BoundedIntegers.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 1,
"end_line": 197,
"start_col": 0,
"start_line": 187
} | (*
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": [
"prims.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.SizeT.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Lib.BoundedInt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Typeclasses",
"short_module": "TC"
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Pulse.Lib.BoundedIntegers.bounded_int Prims.pos | Prims.Tot | [
"total"
] | [] | [
"Pulse.Lib.BoundedIntegers.Mkbounded_int",
"Pulse.Lib.BoundedIntegers.fits_t",
"Prims.int",
"Prims.b2t",
"Prims.op_GreaterThan",
"Prims.prop",
"Pulse.Lib.BoundedIntegers.pos_as_int",
"Prims.op_Addition",
"Prims.op_Subtraction",
"Prims.op_LessThan",
"Prims.bool",
"Prims.op_Equality",
"Prims.o... | [] | false | false | false | true | false | [@@ FStar.Tactics.Typeclasses.tcinstance]
let bounded_int_pos:bounded_int pos =
| {
fits = (fun x -> x > 0);
v = pos_as_int;
u = (fun x -> x);
( + ) = (fun x y -> Prims.op_Addition x y);
( - ) = (fun x y -> Prims.op_Subtraction x y);
( < ) = (fun x y -> Prims.op_LessThan x y);
( <= ) = (fun x y -> Prims.op_LessThanOrEqual x y);
( % ) = (fun x y -> Prims.op_Modulus x y);
properties ... | false |
Pulse.Lib.BoundedIntegers.fst | Pulse.Lib.BoundedIntegers.bounded_int_u64 | [@@ FStar.Tactics.Typeclasses.tcinstance]
val bounded_int_u64:bounded_int FStar.UInt64.t | [@@ FStar.Tactics.Typeclasses.tcinstance]
val bounded_int_u64:bounded_int FStar.UInt64.t | instance bounded_int_u64 : bounded_int FStar.UInt64.t = {
fits = (fun x -> 0 <= x /\ x <= 0xffffffffffffffff);
v = (fun x -> FStar.UInt64.v x);
u = FStar.UInt64.uint_to_t;
( + ) = (fun x y -> FStar.UInt64.add x y);
op_Subtraction = (fun x y -> FStar.UInt64.sub x y);
( < ) = FStar.UInt64.(fun x y... | {
"file_name": "share/steel/examples/pulse/lib/Pulse.Lib.BoundedIntegers.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 1,
"end_line": 145,
"start_col": 0,
"start_line": 135
} | (*
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": [
"prims.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.SizeT.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Lib.BoundedInt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Typeclasses",
"short_module": "TC"
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Pulse.Lib.BoundedIntegers.bounded_int FStar.UInt64.t | Prims.Tot | [
"total"
] | [] | [
"Pulse.Lib.BoundedIntegers.Mkbounded_int",
"FStar.UInt64.t",
"Prims.int",
"Prims.l_and",
"Prims.b2t",
"Pulse.Lib.BoundedIntegers.op_Less_Equals",
"Pulse.Lib.BoundedIntegers.bounded_int_int",
"Prims.prop",
"FStar.UInt64.v",
"FStar.UInt64.uint_to_t",
"FStar.UInt64.add",
"FStar.UInt64.sub",
"FS... | [] | false | false | false | true | false | [@@ FStar.Tactics.Typeclasses.tcinstance]
let bounded_int_u64:bounded_int FStar.UInt64.t =
| {
fits = (fun x -> 0 <= x /\ x <= 0xffffffffffffffff);
v = (fun x -> FStar.UInt64.v x);
u = FStar.UInt64.uint_to_t;
( + ) = (fun x y -> FStar.UInt64.add x y);
( - ) = (fun x y -> FStar.UInt64.sub x y);
( < ) = (let open FStar.UInt64 in fun x y -> x <^ y);
( <= ) = (let open FStar.UInt64 in fun x y -> x <=... | false |
Pulse.Lib.BoundedIntegers.fst | Pulse.Lib.BoundedIntegers.sub_u32 | val sub_u32 : x: FStar.UInt32.t ->
y: FStar.UInt32.t{Pulse.Lib.BoundedIntegers.ok Pulse.Lib.BoundedIntegers.op_Subtraction x y}
-> FStar.UInt32.t | let sub_u32 (x:FStar.UInt32.t) (y:FStar.UInt32.t { ok op_Subtraction x y}) = x - y | {
"file_name": "share/steel/examples/pulse/lib/Pulse.Lib.BoundedIntegers.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 82,
"end_line": 159,
"start_col": 0,
"start_line": 159
} | (*
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": [
"prims.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.SizeT.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Lib.BoundedInt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Typeclasses",
"short_module": "TC"
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
x: FStar.UInt32.t ->
y: FStar.UInt32.t{Pulse.Lib.BoundedIntegers.ok Pulse.Lib.BoundedIntegers.op_Subtraction x y}
-> FStar.UInt32.t | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt32.t",
"Pulse.Lib.BoundedIntegers.ok",
"Pulse.Lib.BoundedIntegers.bounded_int_u32",
"Pulse.Lib.BoundedIntegers.op_Subtraction",
"Prims.int",
"Pulse.Lib.BoundedIntegers.bounded_int_int"
] | [] | false | false | false | false | false | let sub_u32 (x: FStar.UInt32.t) (y: FStar.UInt32.t{ok op_Subtraction x y}) =
| x - y | false | |
Pulse.Lib.BoundedIntegers.fst | Pulse.Lib.BoundedIntegers.bounded_unsigned_size_t | [@@ FStar.Tactics.Typeclasses.tcinstance]
val bounded_unsigned_size_t:bounded_unsigned FStar.SizeT.t | [@@ FStar.Tactics.Typeclasses.tcinstance]
val bounded_unsigned_size_t:bounded_unsigned FStar.SizeT.t | instance bounded_unsigned_size_t : bounded_unsigned FStar.SizeT.t = {
base = TC.solve;
max_bound = 0xffffsz;
static_max_bound = false;
properties = ()
} | {
"file_name": "share/steel/examples/pulse/lib/Pulse.Lib.BoundedIntegers.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 1,
"end_line": 219,
"start_col": 0,
"start_line": 214
} | (*
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": [
"prims.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.SizeT.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Lib.BoundedInt... | [
{
"abbrev": false,
"full_module": "FStar.SizeT",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Tactics.Typeclasses",
"short_module": "TC"
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Pulse.Lib.BoundedIntegers.bounded_unsigned FStar.SizeT.t | Prims.Tot | [
"total"
] | [] | [
"Pulse.Lib.BoundedIntegers.Mkbounded_unsigned",
"FStar.SizeT.t",
"Pulse.Lib.BoundedIntegers.bounded_int_size_t",
"Pulse.Lib.BoundedIntegers.bounded_int",
"FStar.SizeT.__uint_to_t"
] | [] | false | false | false | true | false | [@@ FStar.Tactics.Typeclasses.tcinstance]
let bounded_unsigned_size_t:bounded_unsigned FStar.SizeT.t =
| { base = TC.solve; max_bound = 0xffffsz; static_max_bound = false; properties = () } | false |
Hacl.Spec.Karatsuba.Lemmas.fst | Hacl.Spec.Karatsuba.Lemmas.lemma_middle_karatsuba | val lemma_middle_karatsuba: a0:nat -> a1:nat -> b0:nat -> b1:nat ->
Lemma
(let s0, t0 = sign_abs a0 a1 in
let s1, t1 = sign_abs b0 b1 in
let t23 = t0 * t1 in
let t01 = a0 * b0 + a1 * b1 in
let t45 = if s0 = s1 then t01 - t23 else t01 + t23 in
t45 == a0 * b1 + a1 * b0) | val lemma_middle_karatsuba: a0:nat -> a1:nat -> b0:nat -> b1:nat ->
Lemma
(let s0, t0 = sign_abs a0 a1 in
let s1, t1 = sign_abs b0 b1 in
let t23 = t0 * t1 in
let t01 = a0 * b0 + a1 * b1 in
let t45 = if s0 = s1 then t01 - t23 else t01 + t23 in
t45 == a0 * b1 + a1 * b0) | let lemma_middle_karatsuba a0 a1 b0 b1 =
let s0, t0 = sign_abs a0 a1 in
let s1, t1 = sign_abs b0 b1 in
let t23 = t0 * t1 in
let t01 = a0 * b0 + a1 * b1 in
let t45 = if s0 = s1 then t01 - t23 else t01 + t23 in
match (s0, s1) with
| (Positive, Positive) ->
calc (==) { //t45
t01 - t23;
(==) { }... | {
"file_name": "code/bignum/Hacl.Spec.Karatsuba.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 6,
"end_line": 111,
"start_col": 0,
"start_line": 54
} | module Hacl.Spec.Karatsuba.Lemmas
open FStar.Mul
open Lib.IntTypes
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
type sign =
| Positive
| Negative
let abs (a:nat) (b:nat) : nat =
if a < b then b - a else a - b
val sign_abs: a:nat -> b:nat ->
Pure (tuple2 sign nat)
(requires True)
(ensures fun (s, re... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source... | [
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Karatsuba",
"short_module": null
},
{
"abbrev": false,
"full_module": ... | {
"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 | a0: Prims.nat -> a1: Prims.nat -> b0: Prims.nat -> b1: Prims.nat
-> FStar.Pervasives.Lemma
(ensures
(let _ = Hacl.Spec.Karatsuba.Lemmas.sign_abs a0 a1 in
(let FStar.Pervasives.Native.Mktuple2 #_ #_ s0 t0 = _ in
let _ = Hacl.Spec.Karatsuba.Lemmas.sign_abs b0 b1 in
(let FStar.Perva... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Hacl.Spec.Karatsuba.Lemmas.sign",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Calc.calc_finish",
"Prims.int",
"Prims.eq2",
"Prims.op_Subtraction",
"Prims.op_Addition",
"FStar.Mul.op_Star",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_ste... | [] | false | false | true | false | false | let lemma_middle_karatsuba a0 a1 b0 b1 =
| let s0, t0 = sign_abs a0 a1 in
let s1, t1 = sign_abs b0 b1 in
let t23 = t0 * t1 in
let t01 = a0 * b0 + a1 * b1 in
let t45 = if s0 = s1 then t01 - t23 else t01 + t23 in
match (s0, s1) with
| Positive, Positive ->
calc ( == ) {
t01 - t23;
( == ) { () }
a0 * b0 + a1 * b1 - (a0 - a1) * (b0 - b1);
( == ) {... | false |
Pulse.Lib.BoundedIntegers.fst | Pulse.Lib.BoundedIntegers.size_t_plus_one | val size_t_plus_one : x: FStar.SizeT.t{x < 1024sz} -> FStar.SizeT.t | let size_t_plus_one (x:FStar.SizeT.t { x < 1024sz }) = x + 1sz | {
"file_name": "share/steel/examples/pulse/lib/Pulse.Lib.BoundedIntegers.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 62,
"end_line": 222,
"start_col": 0,
"start_line": 222
} | (*
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": [
"prims.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.SizeT.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Lib.BoundedInt... | [
{
"abbrev": false,
"full_module": "FStar.SizeT",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Tactics.Typeclasses",
"short_module": "TC"
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: FStar.SizeT.t{x < 1024sz} -> FStar.SizeT.t | Prims.Tot | [
"total"
] | [] | [
"FStar.SizeT.t",
"Prims.b2t",
"Pulse.Lib.BoundedIntegers.op_Less",
"Pulse.Lib.BoundedIntegers.bounded_int_size_t",
"FStar.SizeT.__uint_to_t",
"Pulse.Lib.BoundedIntegers.op_Plus"
] | [] | false | false | false | false | false | let size_t_plus_one (x: FStar.SizeT.t{x < 1024sz}) =
| x + 1sz | false | |
Vale.AES.GCM_s.fst | Vale.AES.GCM_s.compute_iv_BE_def | val compute_iv_BE_def (h_LE: quad32) (iv: supported_iv_LE) : quad32 | val compute_iv_BE_def (h_LE: quad32) (iv: supported_iv_LE) : quad32 | let compute_iv_BE_def (h_LE:quad32) (iv:supported_iv_LE) : quad32
=
if 8 * (length iv) = 96 then (
let iv_LE = le_bytes_to_quad32 (pad_to_128_bits iv) in
let iv_BE = reverse_bytes_quad32 iv_LE in
let j0_BE = Mkfour 1 iv_BE.lo1 iv_BE.hi2 iv_BE.hi3 in
j0_BE
) else (
let padded_iv_quads = le_byte... | {
"file_name": "vale/specs/crypto/Vale.AES.GCM_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 34,
"start_col": 0,
"start_line": 20
} | module Vale.AES.GCM_s
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open Vale.Def.Types_s
open Vale.AES.AES_s
open Vale.AES.GCTR_s
open Vale.AES.GHash_s
open FStar.Seq
open FStar.Mul
unfold type gcm_plain_LE = gctr_plain_LE
unfold type gcm_auth_LE = gctr_plain_LE
#reset-options "--z3rlimit 3... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.AES.GHash_s.fst.checked",
"Vale.AES.GCTR_s.fst.checked",
"Vale.AES.AES_s.fst.checked",
"prims.fst.che... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | h_LE: Vale.Def.Types_s.quad32 -> iv: Vale.AES.GCM_s.supported_iv_LE -> Vale.Def.Types_s.quad32 | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Types_s.quad32",
"Vale.AES.GCM_s.supported_iv_LE",
"Prims.op_Equality",
"Prims.int",
"FStar.Mul.op_Star",
"FStar.Seq.Base.length",
"Vale.Def.Types_s.nat8",
"Vale.Def.Words_s.four",
"Vale.Def.Words_s.nat32",
"Vale.Def.Words_s.Mkfour",
"Vale.Def.Types_s.nat32",
"Vale.Def.Words_s.__proj... | [] | false | false | false | true | false | let compute_iv_BE_def (h_LE: quad32) (iv: supported_iv_LE) : quad32 =
| if 8 * (length iv) = 96
then
(let iv_LE = le_bytes_to_quad32 (pad_to_128_bits iv) in
let iv_BE = reverse_bytes_quad32 iv_LE in
let j0_BE = Mkfour 1 iv_BE.lo1 iv_BE.hi2 iv_BE.hi3 in
j0_BE)
else
(let padded_iv_quads = le_bytes_to_seq_quad32 (pad_to_128_bits iv) in
let length_BE = insert_nat64_def (Mkf... | false |
Pulse.Lib.BoundedIntegers.fst | Pulse.Lib.BoundedIntegers.bounded_int_nat | [@@ FStar.Tactics.Typeclasses.tcinstance]
val bounded_int_nat:bounded_int nat | [@@ FStar.Tactics.Typeclasses.tcinstance]
val bounded_int_nat:bounded_int nat | instance bounded_int_nat : bounded_int nat = {
fits = (fun x -> x >= 0);
v = nat_as_int;
u = (fun x -> x);
( + ) = (fun x y -> Prims.op_Addition x y);
op_Subtraction = (fun x y -> Prims.op_Subtraction x y); //can't write ( - ), it doesn't parse
( < ) = (fun x y -> Prims.op_LessThan x y);
( <... | {
"file_name": "share/steel/examples/pulse/lib/Pulse.Lib.BoundedIntegers.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 1,
"end_line": 180,
"start_col": 0,
"start_line": 170
} | (*
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": [
"prims.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.SizeT.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Lib.BoundedInt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Typeclasses",
"short_module": "TC"
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Pulse.Lib.BoundedIntegers.bounded_int Prims.nat | Prims.Tot | [
"total"
] | [] | [
"Pulse.Lib.BoundedIntegers.Mkbounded_int",
"Pulse.Lib.BoundedIntegers.fits_t",
"Prims.int",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"Prims.prop",
"Pulse.Lib.BoundedIntegers.nat_as_int",
"Prims.op_Addition",
"Prims.op_Subtraction",
"Prims.op_LessThan",
"Prims.bool",
"Prims.op_Equality",
"... | [] | false | false | false | true | false | [@@ FStar.Tactics.Typeclasses.tcinstance]
let bounded_int_nat:bounded_int nat =
| {
fits = (fun x -> x >= 0);
v = nat_as_int;
u = (fun x -> x);
( + ) = (fun x y -> Prims.op_Addition x y);
( - ) = (fun x y -> Prims.op_Subtraction x y);
( < ) = (fun x y -> Prims.op_LessThan x y);
( <= ) = (fun x y -> Prims.op_LessThanOrEqual x y);
( % ) = (fun x y -> Prims.op_Modulus x y);
properties... | false |
Spec.Curve25519.fst | Spec.Curve25519.secret_to_public | val secret_to_public: lbytes 32 -> lbytes 32 | val secret_to_public: lbytes 32 -> lbytes 32 | let secret_to_public kpriv =
let basepoint = map secret basepoint_lseq in
scalarmult kpriv basepoint | {
"file_name": "specs/Spec.Curve25519.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 28,
"end_line": 142,
"start_col": 0,
"start_line": 140
} | module Spec.Curve25519
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Lib.ByteSequence
open Spec.Curve25519.Lemmas
#set-options "--z3rlimit 30 --ifuel 0 --fuel 0"
(* Field types and parameters *)
let prime : pos = pow2 255 - 19
type elem = x:nat{x < prime}
let zero : elem = 0
let one : elem = 1
let fadd... | {
"checked_file": "/",
"dependencies": [
"Spec.Curve25519.Lemmas.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.RawIntTypes.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked"... | [
{
"abbrev": false,
"full_module": "Spec.Curve25519.Lemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.ByteSequence",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Sequence",
"short_module": null
},
{
"abbrev": false,
"full... | {
"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 | kpriv: Lib.ByteSequence.lbytes 32 -> Lib.ByteSequence.lbytes 32 | Prims.Tot | [
"total"
] | [] | [
"Lib.ByteSequence.lbytes",
"Spec.Curve25519.scalarmult",
"Lib.Sequence.lseq",
"Lib.IntTypes.int_t",
"Lib.IntTypes.U8",
"Lib.IntTypes.SEC",
"Prims.l_Forall",
"Prims.nat",
"Prims.l_imp",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.eq2",
"Lib.Sequence.index",
"Lib.IntTypes.secret",
"Lib.IntTyp... | [] | false | false | false | false | false | let secret_to_public kpriv =
| let basepoint = map secret basepoint_lseq in
scalarmult kpriv basepoint | false |
Hacl.Spec.Karatsuba.Lemmas.fst | Hacl.Spec.Karatsuba.Lemmas.karatsuba | val karatsuba:
pbits:pos // pbits = bits t
-> aLen:nat
-> a:nat{a < pow2 (pbits * aLen)}
-> b:nat{b < pow2 (pbits * aLen)} ->
Tot (res:nat{res == a * b}) (decreases aLen) | val karatsuba:
pbits:pos // pbits = bits t
-> aLen:nat
-> a:nat{a < pow2 (pbits * aLen)}
-> b:nat{b < pow2 (pbits * aLen)} ->
Tot (res:nat{res == a * b}) (decreases aLen) | let rec karatsuba pbits aLen a b =
if aLen < 16 || aLen % 2 = 1 then a * b
else begin
let aLen2 = aLen / 2 in
let p = pow2 (aLen2 * pbits) in
let a0 = a % p in let a1 = a / p in
let b0 = b % p in let b1 = b / p in
lemma_bn_halves pbits aLen a;
lemma_bn_halves pbits aLen b;
let s0, t0 =... | {
"file_name": "code/bignum/Hacl.Spec.Karatsuba.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 11,
"end_line": 185,
"start_col": 0,
"start_line": 160
} | module Hacl.Spec.Karatsuba.Lemmas
open FStar.Mul
open Lib.IntTypes
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
type sign =
| Positive
| Negative
let abs (a:nat) (b:nat) : nat =
if a < b then b - a else a - b
val sign_abs: a:nat -> b:nat ->
Pure (tuple2 sign nat)
(requires True)
(ensures fun (s, re... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source... | [
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Karatsuba",
"short_module": null
},
{
"abbrev": false,
"full_module": ... | {
"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 |
pbits: Prims.pos ->
aLen: Prims.nat ->
a: Prims.nat{a < Prims.pow2 (pbits * aLen)} ->
b: Prims.nat{b < Prims.pow2 (pbits * aLen)}
-> Prims.Tot (res: Prims.nat{res == a * b}) | Prims.Tot | [
"total",
""
] | [] | [
"Prims.pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"FStar.Mul.op_Star",
"Prims.op_BarBar",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"Prims.bool",
"Hacl.Spec.Karatsuba.Lemmas.sign",
"Prims.unit",
"Hacl.Spec.Karatsuba.Lemmas.lemma_karatsuba",
"Prims.op_A... | [
"recursion"
] | false | false | false | false | false | let rec karatsuba pbits aLen a b =
| if aLen < 16 || aLen % 2 = 1
then a * b
else
let aLen2 = aLen / 2 in
let p = pow2 (aLen2 * pbits) in
let a0 = a % p in
let a1 = a / p in
let b0 = b % p in
let b1 = b / p in
lemma_bn_halves pbits aLen a;
lemma_bn_halves pbits aLen b;
let s0, t0 = sign_abs a0 a1 in
let s1, t1 = sign_abs b0 b1 in
let... | false |
Pulse.Lib.BoundedIntegers.fst | Pulse.Lib.BoundedIntegers.add_u32 | val add_u32 : x: FStar.UInt32.t ->
y: FStar.UInt32.t{Pulse.Lib.BoundedIntegers.ok Pulse.Lib.BoundedIntegers.op_Plus x y}
-> FStar.UInt32.t | let add_u32 (x:FStar.UInt32.t) (y:FStar.UInt32.t { ok (+) x y }) = x + y | {
"file_name": "share/steel/examples/pulse/lib/Pulse.Lib.BoundedIntegers.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 72,
"end_line": 156,
"start_col": 0,
"start_line": 156
} | (*
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": [
"prims.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.SizeT.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.Lib.BoundedInt... | [
{
"abbrev": true,
"full_module": "FStar.Tactics.Typeclasses",
"short_module": "TC"
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.Lib",
"short_module": null
},
{
"abbrev": false,
"full_module"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
x: FStar.UInt32.t ->
y: FStar.UInt32.t{Pulse.Lib.BoundedIntegers.ok Pulse.Lib.BoundedIntegers.op_Plus x y}
-> FStar.UInt32.t | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt32.t",
"Pulse.Lib.BoundedIntegers.ok",
"Pulse.Lib.BoundedIntegers.bounded_int_u32",
"Pulse.Lib.BoundedIntegers.op_Plus",
"Prims.int",
"Pulse.Lib.BoundedIntegers.bounded_int_int"
] | [] | false | false | false | false | false | let add_u32 (x: FStar.UInt32.t) (y: FStar.UInt32.t{ok ( + ) x y}) =
| x + y | false | |
Hacl.Spec.Karatsuba.Lemmas.fst | Hacl.Spec.Karatsuba.Lemmas.lemma_karatsuba | val lemma_karatsuba: pbits:pos -> aLen:nat{aLen % 2 = 0} -> a0:nat -> a1:nat -> b0:nat -> b1:nat -> Lemma
(let aLen2 = aLen / 2 in
let p = pow2 (pbits * aLen2) in
let a = a1 * p + a0 in
let b = b1 * p + b0 in
a1 * b1 * pow2 (pbits * aLen) + (a0 * b1 + a1 * b0) * p + a0 * b0 == a * b) | val lemma_karatsuba: pbits:pos -> aLen:nat{aLen % 2 = 0} -> a0:nat -> a1:nat -> b0:nat -> b1:nat -> Lemma
(let aLen2 = aLen / 2 in
let p = pow2 (pbits * aLen2) in
let a = a1 * p + a0 in
let b = b1 * p + b0 in
a1 * b1 * pow2 (pbits * aLen) + (a0 * b1 + a1 * b0) * p + a0 * b0 == a * b) | let lemma_karatsuba pbits aLen a0 a1 b0 b1 =
let aLen2 = aLen / 2 in
let p = pow2 (pbits * aLen2) in
let a = a1 * p + a0 in
let b = b1 * p + b0 in
calc (==) {
a * b;
(==) { }
(a1 * p + a0) * (b1 * p + b0);
(==) { Math.Lemmas.distributivity_add_left (a1 * p) a0 (b1 * p + b0) }
a1 * p * (b1... | {
"file_name": "code/bignum/Hacl.Spec.Karatsuba.Lemmas.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 150,
"start_col": 0,
"start_line": 122
} | module Hacl.Spec.Karatsuba.Lemmas
open FStar.Mul
open Lib.IntTypes
#set-options "--z3rlimit 50 --fuel 0 --ifuel 0"
type sign =
| Positive
| Negative
let abs (a:nat) (b:nat) : nat =
if a < b then b - a else a - b
val sign_abs: a:nat -> b:nat ->
Pure (tuple2 sign nat)
(requires True)
(ensures fun (s, re... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source... | [
{
"abbrev": false,
"full_module": "Lib.IntTypes",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Spec.Karatsuba",
"short_module": null
},
{
"abbrev": false,
"full_module": ... | {
"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 |
pbits: Prims.pos ->
aLen: Prims.nat{aLen % 2 = 0} ->
a0: Prims.nat ->
a1: Prims.nat ->
b0: Prims.nat ->
b1: Prims.nat
-> FStar.Pervasives.Lemma
(ensures
(let aLen2 = aLen / 2 in
let p = Prims.pow2 (pbits * aLen2) in
let a = a1 * p + a0 in
let b = b1 * p + b0 ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"Prims.nat",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"Prims.op_Modulus",
"FStar.Calc.calc_finish",
"Prims.eq2",
"FStar.Mul.op_Star",
"Prims.op_Addition",
"Prims.pow2",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"Prims.unit",
"FStar.Calc.calc_step",
"FSt... | [] | false | false | true | false | false | let lemma_karatsuba pbits aLen a0 a1 b0 b1 =
| let aLen2 = aLen / 2 in
let p = pow2 (pbits * aLen2) in
let a = a1 * p + a0 in
let b = b1 * p + b0 in
calc ( == ) {
a * b;
( == ) { () }
(a1 * p + a0) * (b1 * p + b0);
( == ) { Math.Lemmas.distributivity_add_left (a1 * p) a0 (b1 * p + b0) }
(a1 * p) * (b1 * p + b0) + a0 * (b1 * p + b0);
( == ) { (Math.Lemma... | false |
Vale.AES.GCM_s.fst | Vale.AES.GCM_s.gcm_encrypt_LE_def | val gcm_encrypt_LE_def (alg: algorithm) (key: seq nat8) (iv: supported_iv_LE) (plain auth: seq nat8)
: Pure (seq nat8 & seq nat8)
(requires is_aes_key alg key /\ length plain < pow2_32 /\ length auth < pow2_32)
(ensures fun (c, t) -> True) | val gcm_encrypt_LE_def (alg: algorithm) (key: seq nat8) (iv: supported_iv_LE) (plain auth: seq nat8)
: Pure (seq nat8 & seq nat8)
(requires is_aes_key alg key /\ length plain < pow2_32 /\ length auth < pow2_32)
(ensures fun (c, t) -> True) | let gcm_encrypt_LE_def (alg:algorithm) (key:seq nat8) (iv:supported_iv_LE) (plain:seq nat8) (auth:seq nat8) :
Pure (seq nat8 & seq nat8)
(requires
is_aes_key alg key /\
length plain < pow2_32 /\
length auth < pow2_32
)
(ensures fun (c, t) -> True)
=
let key_LE = seq_nat8_to_seq_nat32... | {
"file_name": "vale/specs/crypto/Vale.AES.GCM_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 8,
"end_line": 65,
"start_col": 0,
"start_line": 39
} | module Vale.AES.GCM_s
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open Vale.Def.Types_s
open Vale.AES.AES_s
open Vale.AES.GCTR_s
open Vale.AES.GHash_s
open FStar.Seq
open FStar.Mul
unfold type gcm_plain_LE = gctr_plain_LE
unfold type gcm_auth_LE = gctr_plain_LE
#reset-options "--z3rlimit 3... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.AES.GHash_s.fst.checked",
"Vale.AES.GCTR_s.fst.checked",
"Vale.AES.AES_s.fst.checked",
"prims.fst.che... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Types_s.nat8 ->
iv: Vale.AES.GCM_s.supported_iv_LE ->
plain: FStar.Seq.Base.seq Vale.Def.Types_s.nat8 ->
auth: FStar.Seq.Base.seq Vale.Def.Types_s.nat8
-> Prims.Pure
(FStar.Seq.Base.seq Vale.Def.Types_s.nat8 * FStar.Seq.... | Prims.Pure | [] | [] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat8",
"Vale.AES.GCM_s.supported_iv_LE",
"FStar.Pervasives.Native.Mktuple2",
"Vale.Def.Words_s.nat8",
"Vale.AES.GCTR_s.gctr_encrypt_LE",
"Vale.Def.Types_s.le_quad32_to_bytes",
"Vale.Def.Types_s.quad32",
"Vale.AES.GHash_s.gh... | [] | false | false | false | false | false | let gcm_encrypt_LE_def (alg: algorithm) (key: seq nat8) (iv: supported_iv_LE) (plain auth: seq nat8)
: Pure (seq nat8 & seq nat8)
(requires is_aes_key alg key /\ length plain < pow2_32 /\ length auth < pow2_32)
(ensures fun (c, t) -> True) =
| let key_LE = seq_nat8_to_seq_nat32_LE key in
let h_LE = aes_encrypt_LE alg key_LE (Mkfour 0 0 0 0) in
let j0_BE = compute_iv_BE h_LE iv in
let c = gctr_encrypt_LE (inc32 j0_BE 1) plain alg key_LE in
let lengths_BE =
insert_nat64_def (insert_nat64_def (Mkfour 0 0 0 0) (8 * length auth) 1) (8 * length plain) 0
in
let l... | false |
Vale.AES.GCM_s.fst | Vale.AES.GCM_s.gcm_decrypt_LE_def | val gcm_decrypt_LE_def
(alg: algorithm)
(key: seq nat8)
(iv: supported_iv_LE)
(cipher auth tag: seq nat8)
: Pure (seq nat8 & bool)
(requires is_aes_key alg key /\ length cipher < pow2_32 /\ length auth < pow2_32)
(ensures fun (p, t) -> True) | val gcm_decrypt_LE_def
(alg: algorithm)
(key: seq nat8)
(iv: supported_iv_LE)
(cipher auth tag: seq nat8)
: Pure (seq nat8 & bool)
(requires is_aes_key alg key /\ length cipher < pow2_32 /\ length auth < pow2_32)
(ensures fun (p, t) -> True) | let gcm_decrypt_LE_def (alg:algorithm) (key:seq nat8) (iv:supported_iv_LE) (cipher:seq nat8) (auth:seq nat8) (tag:seq nat8) :
Pure (seq nat8 & bool)
(requires
is_aes_key alg key /\
length cipher < pow2_32 /\
length auth < pow2_32
)
(ensures fun (p, t) -> True)
=
let key_LE = seq_nat8... | {
"file_name": "vale/specs/crypto/Vale.AES.GCM_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 14,
"end_line": 94,
"start_col": 0,
"start_line": 69
} | module Vale.AES.GCM_s
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open Vale.Def.Types_s
open Vale.AES.AES_s
open Vale.AES.GCTR_s
open Vale.AES.GHash_s
open FStar.Seq
open FStar.Mul
unfold type gcm_plain_LE = gctr_plain_LE
unfold type gcm_auth_LE = gctr_plain_LE
#reset-options "--z3rlimit 3... | {
"checked_file": "/",
"dependencies": [
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.AES.GHash_s.fst.checked",
"Vale.AES.GCTR_s.fst.checked",
"Vale.AES.AES_s.fst.checked",
"prims.fst.che... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Types_s.nat8 ->
iv: Vale.AES.GCM_s.supported_iv_LE ->
cipher: FStar.Seq.Base.seq Vale.Def.Types_s.nat8 ->
auth: FStar.Seq.Base.seq Vale.Def.Types_s.nat8 ->
tag: FStar.Seq.Base.seq Vale.Def.Types_s.nat8
-> Prims.Pure (FSt... | Prims.Pure | [] | [] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.nat8",
"Vale.AES.GCM_s.supported_iv_LE",
"FStar.Pervasives.Native.Mktuple2",
"Prims.bool",
"Prims.op_Equality",
"Vale.Def.Words_s.nat8",
"Vale.AES.GCTR_s.gctr_encrypt_LE",
"Vale.Def.Types_s.le_quad32_to_bytes",
"Vale.Def.... | [] | false | false | false | false | false | let gcm_decrypt_LE_def
(alg: algorithm)
(key: seq nat8)
(iv: supported_iv_LE)
(cipher auth tag: seq nat8)
: Pure (seq nat8 & bool)
(requires is_aes_key alg key /\ length cipher < pow2_32 /\ length auth < pow2_32)
(ensures fun (p, t) -> True) =
| let key_LE = seq_nat8_to_seq_nat32_LE key in
let h_LE = aes_encrypt_LE alg key_LE (Mkfour 0 0 0 0) in
let j0_BE = compute_iv_BE h_LE iv in
let p = gctr_encrypt_LE (inc32 j0_BE 1) cipher alg key_LE in
let lengths_BE =
insert_nat64_def (insert_nat64_def (Mkfour 0 0 0 0) (8 * length auth) 1) (8 * length cipher) 0
in
let... | false |
Hacl.Spec.K256.Field52.Lemmas4.fst | Hacl.Spec.K256.Field52.Lemmas4.lemma_mul_ab | val lemma_mul_ab (a0 a1 a2 a3 a4 b0 b1 b2 b3 b4:nat) :
Lemma
(let sum0 = a0 * b0 in
let sum1 = a0 * b1 + a1 * b0 in
let sum2 = a0 * b2 + a1 * b1 + a2 * b0 in
let sum3 = a0 * b3 + a1 * b2 + a2 * b1 + a3 * b0 in
let sum4 = a0 * b4 + a1 * b3 + a2 * b2 + a3 * b1 + a4 * b0 in
let sum5 = a1 * b4 + a2... | val lemma_mul_ab (a0 a1 a2 a3 a4 b0 b1 b2 b3 b4:nat) :
Lemma
(let sum0 = a0 * b0 in
let sum1 = a0 * b1 + a1 * b0 in
let sum2 = a0 * b2 + a1 * b1 + a2 * b0 in
let sum3 = a0 * b3 + a1 * b2 + a2 * b1 + a3 * b0 in
let sum4 = a0 * b4 + a1 * b3 + a2 * b2 + a3 * b1 + a4 * b0 in
let sum5 = a1 * b4 + a2... | let lemma_mul_ab a0 a1 a2 a3 a4 b0 b1 b2 b3 b4 =
let sum0 = a0 * b0 in
let sum1 = a0 * b1 + a1 * b0 in
let sum2 = a0 * b2 + a1 * b1 + a2 * b0 in
let sum3 = a0 * b3 + a1 * b2 + a2 * b1 + a3 * b0 in
let sum4 = a0 * b4 + a1 * b3 + a2 * b2 + a3 * b1 + a4 * b0 in
let sum5 = a1 * b4 + a2 * b3 + a3 * b2 + a4 * b1 ... | {
"file_name": "code/k256/Hacl.Spec.K256.Field52.Lemmas4.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 5,
"end_line": 294,
"start_col": 0,
"start_line": 215
} | module Hacl.Spec.K256.Field52.Lemmas4
open FStar.Mul
open Lib.IntTypes
module S = Spec.K256
include Hacl.Spec.K256.Field52.Definitions
include Hacl.Spec.K256.Field52
module ML = Hacl.Spec.K256.MathLemmas
module LD = Hacl.Spec.K256.Field52.Definitions.Lemmas
#set-options "--z3rlimit 100 --fuel 0 --ifuel 0"
val lem... | {
"checked_file": "/",
"dependencies": [
"Spec.K256.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Hacl.Spec.K256.MathLemmas.fst.checked",
"Hacl.Spec.K256.Field52.Definitions.Lemmas.fst.checked",
"Hacl.Spec.K256.Field52.Definitions.fst.checked",
"Hacl.Spec.K256.Field52.... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.K256.Field52.Definitions.Lemmas",
"short_module": "LD"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.K256.MathLemmas",
"short_module": "ML"
},
{
"abbrev": false,
"full_module": "Hacl.Spec.K256.Field52",
"short_module": null
}... | {
"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 |
a0: Prims.nat ->
a1: Prims.nat ->
a2: Prims.nat ->
a3: Prims.nat ->
a4: Prims.nat ->
b0: Prims.nat ->
b1: Prims.nat ->
b2: Prims.nat ->
b3: Prims.nat ->
b4: Prims.nat
-> FStar.Pervasives.Lemma
(ensures
(let sum0 = a0 * b0 in
let sum1 = a0 * b1 + a1 * b0 in
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"FStar.Calc.calc_finish",
"Prims.int",
"Prims.eq2",
"FStar.Mul.op_Star",
"Prims.op_Addition",
"Hacl.Spec.K256.Field52.Definitions.pow52",
"Hacl.Spec.K256.Field52.Definitions.pow104",
"Hacl.Spec.K256.Field52.Definitions.pow156",
"Hacl.Spec.K256.Field52.Definitions.pow208",
"Prims.pow... | [] | false | false | true | false | false | let lemma_mul_ab a0 a1 a2 a3 a4 b0 b1 b2 b3 b4 =
| let sum0 = a0 * b0 in
let sum1 = a0 * b1 + a1 * b0 in
let sum2 = a0 * b2 + a1 * b1 + a2 * b0 in
let sum3 = a0 * b3 + a1 * b2 + a2 * b1 + a3 * b0 in
let sum4 = a0 * b4 + a1 * b3 + a2 * b2 + a3 * b1 + a4 * b0 in
let sum5 = a1 * b4 + a2 * b3 + a3 * b2 + a4 * b1 in
let sum6 = a2 * b4 + a3 * b3 + a4 * b2 in
let sum7 = a3 * ... | false |
Steel.ST.C.Types.Base.fsti | Steel.ST.C.Types.Base.assert_null | val assert_null (#t: Type) (#opened: _) (#td: typedef t) (#v: Ghost.erased t) (p: ptr td)
: STGhost unit opened (pts_to_or_null p v) (fun _ -> emp) (p == null _) (fun _ -> True) | val assert_null (#t: Type) (#opened: _) (#td: typedef t) (#v: Ghost.erased t) (p: ptr td)
: STGhost unit opened (pts_to_or_null p v) (fun _ -> emp) (p == null _) (fun _ -> True) | let assert_null
(#t: Type)
(#opened: _)
(#td: typedef t)
(#v: Ghost.erased t)
(p: ptr td)
: STGhost unit opened
(pts_to_or_null p v)
(fun _ -> emp)
(p == null _)
(fun _ -> True)
= rewrite (pts_to_or_null p v) emp | {
"file_name": "lib/steel/c/Steel.ST.C.Types.Base.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 34,
"end_line": 135,
"start_col": 0,
"start_line": 124
} | module Steel.ST.C.Types.Base
open Steel.ST.Util
module P = Steel.FractionalPermission
/// Helper to compose two permissions into one
val prod_perm (p1 p2: P.perm) : Pure P.perm
(requires True)
(ensures (fun p ->
((p1 `P.lesser_equal_perm` P.full_perm /\ p2 `P.lesser_equal_perm` P.full_perm) ==>
p `P.lesse... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.Util.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": ... | [
{
"abbrev": true,
"full_module": "Steel.FractionalPermission",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Steel.ST.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.ST.C.Types",
"short_module": null
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: Steel.ST.C.Types.Base.ptr td -> Steel.ST.Effect.Ghost.STGhost Prims.unit | Steel.ST.Effect.Ghost.STGhost | [] | [] | [
"Steel.Memory.inames",
"Steel.ST.C.Types.Base.typedef",
"FStar.Ghost.erased",
"Steel.ST.C.Types.Base.ptr",
"Steel.ST.Util.rewrite",
"Steel.ST.C.Types.Base.pts_to_or_null",
"Steel.Effect.Common.emp",
"Prims.unit",
"Steel.Effect.Common.vprop",
"Prims.eq2",
"Steel.ST.C.Types.Base.null",
"Prims.l_... | [] | false | true | false | false | false | let assert_null (#t: Type) (#opened: _) (#td: typedef t) (#v: Ghost.erased t) (p: ptr td)
: STGhost unit opened (pts_to_or_null p v) (fun _ -> emp) (p == null _) (fun _ -> True) =
| rewrite (pts_to_or_null p v) emp | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_code_ShiftKey1_128 | val va_code_ShiftKey1_128 : va_dummy:unit -> Tot va_code | val va_code_ShiftKey1_128 : va_dummy:unit -> Tot va_code | let va_code_ShiftKey1_128 () =
(va_Block (va_CCons (va_code_Vmr (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3)) (va_CCons
(va_code_ShiftLeft128_1 ()) (va_CCons (va_code_VPolyAnd (va_op_vec_opr_vec 3)
(va_op_vec_opr_vec 3) (va_op_vec_opr_vec 5)) (va_CCons (va_code_Vcmpequw (va_op_vec_opr_vec 3)
(va_op_vec_opr... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 50,
"end_line": 42,
"start_col": 0,
"start_line": 35
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | va_dummy: Prims.unit -> Vale.PPC64LE.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"Vale.PPC64LE.Decls.va_Block",
"Vale.PPC64LE.Decls.va_CCons",
"Vale.PPC64LE.InsVector.va_code_Vmr",
"Vale.PPC64LE.Decls.va_op_vec_opr_vec",
"Vale.AES.PPC64LE.GF128_Mul.va_code_ShiftLeft128_1",
"Vale.AES.PPC64LE.PolyOps.va_code_VPolyAnd",
"Vale.PPC64LE.InsVector.va_code_Vcmpequw",
"Vale... | [] | false | false | false | true | false | let va_code_ShiftKey1_128 () =
| (va_Block (va_CCons (va_code_Vmr (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3))
(va_CCons (va_code_ShiftLeft128_1 ())
(va_CCons (va_code_VPolyAnd (va_op_vec_opr_vec 3)
(va_op_vec_opr_vec 3)
(va_op_vec_opr_vec 5))
(va_CCons (va_code_Vcmpequw (va_o... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_codegen_success_ShiftKey1_gf128_power | val va_codegen_success_ShiftKey1_gf128_power : va_dummy:unit -> Tot va_pbool | val va_codegen_success_ShiftKey1_gf128_power : va_dummy:unit -> Tot va_pbool | let va_codegen_success_ShiftKey1_gf128_power () =
(va_pbool_and (va_codegen_success_Vspltisw (va_op_vec_opr_vec 1) 0) (va_pbool_and
(va_codegen_success_Vspltisw (va_op_vec_opr_vec 2) 1) (va_pbool_and
(va_codegen_success_LoadImmShl64 (va_op_reg_opr_reg 10) (-15872)) (va_pbool_and
(va_codegen_success_Mtvsrw... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 31,
"end_line": 195,
"start_col": 0,
"start_line": 184
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | va_dummy: Prims.unit -> Vale.PPC64LE.Decls.va_pbool | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"Vale.PPC64LE.Decls.va_pbool_and",
"Vale.PPC64LE.InsVector.va_codegen_success_Vspltisw",
"Vale.PPC64LE.Decls.va_op_vec_opr_vec",
"Vale.PPC64LE.InsBasic.va_codegen_success_LoadImmShl64",
"Vale.PPC64LE.Decls.va_op_reg_opr_reg",
"Prims.op_Minus",
"Vale.PPC64LE.InsVector.va_codegen_success_M... | [] | false | false | false | true | false | let va_codegen_success_ShiftKey1_gf128_power () =
| (va_pbool_and (va_codegen_success_Vspltisw (va_op_vec_opr_vec 1) 0)
(va_pbool_and (va_codegen_success_Vspltisw (va_op_vec_opr_vec 2) 1)
(va_pbool_and (va_codegen_success_LoadImmShl64 (va_op_reg_opr_reg 10) (- 15872))
(va_pbool_and (va_codegen_success_Mtvsrws (va_op_vec_opr_vec 4) (va_op_reg_opr_... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_wp_ShiftKey1_128 | val va_wp_ShiftKey1_128 (f: poly) (va_s0: va_state) (va_k: (va_state -> unit -> Type0)) : Type0 | val va_wp_ShiftKey1_128 (f: poly) (va_s0: va_state) (va_k: (va_state -> unit -> Type0)) : Type0 | let va_wp_ShiftKey1_128 (f:poly) (va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ (let (h:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32
(va_get_vec 3 va_s0) in let (h1:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2_s.shift h 1 in let
(offset:Vale.Math.Poly2_s.poly) = V... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 85,
"end_line": 144,
"start_col": 0,
"start_line": 132
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
f: Vale.Math.Poly2_s.poly ->
va_s0: Vale.PPC64LE.Decls.va_state ->
va_k: (_: Vale.PPC64LE.Decls.va_state -> _: Prims.unit -> Type0)
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.Math.Poly2_s.poly",
"Vale.PPC64LE.Decls.va_state",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"Vale.PPC64LE.Decls.va_get_ok",
"Prims.eq2",
"Vale.Math.Poly2.Bits_s.of_quad32",
"Vale.PPC64LE.Decls.va_get_vec",
"Vale.Math.Poly2_s.monomial",
"Vale.Math.Poly2_s.reverse",
"Vale.Math.Poly2_s.shi... | [] | false | false | false | true | true | let va_wp_ShiftKey1_128 (f: poly) (va_s0: va_state) (va_k: (va_state -> unit -> Type0)) : Type0 =
| (va_get_ok va_s0 /\
(let h:Vale.Math.Poly2_s.poly = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 3 va_s0) in
let h1:Vale.Math.Poly2_s.poly = Vale.Math.Poly2_s.shift h 1 in
let offset:Vale.Math.Poly2_s.poly = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 4 va_s0) in
Vale.Math.Poly2.Bits_s.of_quad32 (va_get_... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_codegen_success_ShiftKey1_128 | val va_codegen_success_ShiftKey1_128 : va_dummy:unit -> Tot va_pbool | val va_codegen_success_ShiftKey1_128 : va_dummy:unit -> Tot va_pbool | let va_codegen_success_ShiftKey1_128 () =
(va_pbool_and (va_codegen_success_Vmr (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3)) (va_pbool_and
(va_codegen_success_ShiftLeft128_1 ()) (va_pbool_and (va_codegen_success_VPolyAnd
(va_op_vec_opr_vec 3) (va_op_vec_opr_vec 3) (va_op_vec_opr_vec 5)) (va_pbool_and
(va_... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 69,
"end_line": 54,
"start_col": 0,
"start_line": 46
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | va_dummy: Prims.unit -> Vale.PPC64LE.Decls.va_pbool | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"Vale.PPC64LE.Decls.va_pbool_and",
"Vale.PPC64LE.InsVector.va_codegen_success_Vmr",
"Vale.PPC64LE.Decls.va_op_vec_opr_vec",
"Vale.AES.PPC64LE.GF128_Mul.va_codegen_success_ShiftLeft128_1",
"Vale.AES.PPC64LE.PolyOps.va_codegen_success_VPolyAnd",
"Vale.PPC64LE.InsVector.va_codegen_success_Vcm... | [] | false | false | false | true | false | let va_codegen_success_ShiftKey1_128 () =
| (va_pbool_and (va_codegen_success_Vmr (va_op_vec_opr_vec 1) (va_op_vec_opr_vec 3))
(va_pbool_and (va_codegen_success_ShiftLeft128_1 ())
(va_pbool_and (va_codegen_success_VPolyAnd (va_op_vec_opr_vec 3)
(va_op_vec_opr_vec 3)
(va_op_vec_opr_vec 5))
(va_pbool_and (va_... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_wp_ShiftKey1_gf128_power | val va_wp_ShiftKey1_gf128_power
(h: poly)
(n: nat)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 | val va_wp_ShiftKey1_gf128_power
(h: poly)
(n: nat)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 | let va_wp_ShiftKey1_gf128_power (h:poly) (n:nat) (va_s0:va_state) (va_k:(va_state -> unit ->
Type0)) : Type0 =
(va_get_ok va_s0 /\ (let (hn:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32
(va_get_vec 3 va_s0) in hn == Vale.AES.GHash_BE.g_power h n) /\ (forall (va_x_r10:nat64)
(va_x_v1:quad32) (va... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 21,
"end_line": 281,
"start_col": 0,
"start_line": 272
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h: Vale.Math.Poly2_s.poly ->
n: Prims.nat ->
va_s0: Vale.PPC64LE.Decls.va_state ->
va_k: (_: Vale.PPC64LE.Decls.va_state -> _: Prims.unit -> Type0)
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.Math.Poly2_s.poly",
"Prims.nat",
"Vale.PPC64LE.Decls.va_state",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"Vale.PPC64LE.Decls.va_get_ok",
"Prims.eq2",
"Vale.AES.GHash_BE.g_power",
"Vale.Math.Poly2.Bits_s.of_quad32",
"Vale.PPC64LE.Decls.va_get_vec",
"Prims.l_Forall",
"Vale.PPC64LE.Memor... | [] | false | false | false | true | true | let va_wp_ShiftKey1_gf128_power
(h: poly)
(n: nat)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 =
| (va_get_ok va_s0 /\
(let hn:Vale.Math.Poly2_s.poly = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 3 va_s0) in
hn == Vale.AES.GHash_BE.g_power h n) /\
(forall (va_x_r10: nat64)
(va_x_v1: quad32)
(va_x_v2: quad32)
(va_x_v3: quad32)
(va_x_v4: quad32)
(va_x_v5: quad32).
let va_sM... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_code_Gf128_powers | val va_code_Gf128_powers : va_dummy:unit -> Tot va_code | val va_code_Gf128_powers : va_dummy:unit -> Tot va_code | let va_code_Gf128_powers () =
(va_Block (va_CCons (va_code_LoadImm64 (va_op_reg_opr_reg 10) 32) (va_CCons
(va_code_Load128_byte16_buffer_index (va_op_heaplet_mem_heaplet 1) (va_op_vec_opr_vec 1)
(va_op_reg_opr_reg 3) (va_op_reg_opr_reg 10) Secret) (va_CCons (va_code_Vmr (va_op_vec_opr_vec
6) (va_op_vec_op... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 21,
"end_line": 328,
"start_col": 0,
"start_line": 315
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | va_dummy: Prims.unit -> Vale.PPC64LE.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"Vale.PPC64LE.Decls.va_Block",
"Vale.PPC64LE.Decls.va_CCons",
"Vale.PPC64LE.InsBasic.va_code_LoadImm64",
"Vale.PPC64LE.Decls.va_op_reg_opr_reg",
"Vale.PPC64LE.InsVector.va_code_Load128_byte16_buffer_index",
"Vale.PPC64LE.Decls.va_op_heaplet_mem_heaplet",
"Vale.PPC64LE.Decls.va_op_vec_opr... | [] | false | false | false | true | false | let va_code_Gf128_powers () =
| (va_Block (va_CCons (va_code_LoadImm64 (va_op_reg_opr_reg 10) 32)
(va_CCons (va_code_Load128_byte16_buffer_index (va_op_heaplet_mem_heaplet 1)
(va_op_vec_opr_vec 1)
(va_op_reg_opr_reg 3)
(va_op_reg_opr_reg 10)
Secret)
(va_CCons (va_code... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_code_ShiftKey1_gf128_power | val va_code_ShiftKey1_gf128_power : va_dummy:unit -> Tot va_code | val va_code_ShiftKey1_gf128_power : va_dummy:unit -> Tot va_code | let va_code_ShiftKey1_gf128_power () =
(va_Block (va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 1) 0) (va_CCons (va_code_Vspltisw
(va_op_vec_opr_vec 2) 1) (va_CCons (va_code_LoadImmShl64 (va_op_reg_opr_reg 10) (-15872))
(va_CCons (va_code_Mtvsrws (va_op_vec_opr_vec 4) (va_op_reg_opr_reg 10)) (va_CCons
(va... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 18,
"end_line": 180,
"start_col": 0,
"start_line": 171
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | va_dummy: Prims.unit -> Vale.PPC64LE.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"Vale.PPC64LE.Decls.va_Block",
"Vale.PPC64LE.Decls.va_CCons",
"Vale.PPC64LE.InsVector.va_code_Vspltisw",
"Vale.PPC64LE.Decls.va_op_vec_opr_vec",
"Vale.PPC64LE.InsBasic.va_code_LoadImmShl64",
"Vale.PPC64LE.Decls.va_op_reg_opr_reg",
"Prims.op_Minus",
"Vale.PPC64LE.InsVector.va_code_Mtvsr... | [] | false | false | false | true | false | let va_code_ShiftKey1_gf128_power () =
| (va_Block (va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 1) 0)
(va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 2) 1)
(va_CCons (va_code_LoadImmShl64 (va_op_reg_opr_reg 10) (- 15872))
(va_CCons (va_code_Mtvsrws (va_op_vec_opr_vec 4) (va_op_reg_opr_reg 10))
(va_CCons... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_codegen_success_Gf128_powers | val va_codegen_success_Gf128_powers : va_dummy:unit -> Tot va_pbool | val va_codegen_success_Gf128_powers : va_dummy:unit -> Tot va_pbool | let va_codegen_success_Gf128_powers () =
(va_pbool_and (va_codegen_success_LoadImm64 (va_op_reg_opr_reg 10) 32) (va_pbool_and
(va_codegen_success_Load128_byte16_buffer_index (va_op_heaplet_mem_heaplet 1)
(va_op_vec_opr_vec 1) (va_op_reg_opr_reg 3) (va_op_reg_opr_reg 10) Secret) (va_pbool_and
(va_codegen_s... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 42,
"end_line": 347,
"start_col": 0,
"start_line": 332
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | va_dummy: Prims.unit -> Vale.PPC64LE.Decls.va_pbool | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"Vale.PPC64LE.Decls.va_pbool_and",
"Vale.PPC64LE.InsBasic.va_codegen_success_LoadImm64",
"Vale.PPC64LE.Decls.va_op_reg_opr_reg",
"Vale.PPC64LE.InsVector.va_codegen_success_Load128_byte16_buffer_index",
"Vale.PPC64LE.Decls.va_op_heaplet_mem_heaplet",
"Vale.PPC64LE.Decls.va_op_vec_opr_vec",
... | [] | false | false | false | true | false | let va_codegen_success_Gf128_powers () =
| (va_pbool_and (va_codegen_success_LoadImm64 (va_op_reg_opr_reg 10) 32)
(va_pbool_and (va_codegen_success_Load128_byte16_buffer_index (va_op_heaplet_mem_heaplet 1)
(va_op_vec_opr_vec 1)
(va_op_reg_opr_reg 3)
(va_op_reg_opr_reg 10)
Secret)
(va_pbool_and (va_code... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_codegen_success_Keyhash_init | val va_codegen_success_Keyhash_init : alg:algorithm -> Tot va_pbool | val va_codegen_success_Keyhash_init : alg:algorithm -> Tot va_pbool | let va_codegen_success_Keyhash_init alg =
(va_pbool_and (va_codegen_success_CreateHeaplets ()) (va_pbool_and (va_codegen_success_Vspltisw
(va_op_vec_opr_vec 0) 0) (va_pbool_and (va_codegen_success_AESEncryptBlock alg) (va_pbool_and
(va_codegen_success_LoadImm64 (va_op_reg_opr_reg 10) 32) (va_pbool_and
(va... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 24,
"end_line": 508,
"start_col": 0,
"start_line": 501
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | alg: Vale.AES.AES_common_s.algorithm -> Vale.PPC64LE.Decls.va_pbool | Prims.Tot | [
"total"
] | [] | [
"Vale.AES.AES_common_s.algorithm",
"Vale.PPC64LE.Decls.va_pbool_and",
"Vale.PPC64LE.InsMem.va_codegen_success_CreateHeaplets",
"Vale.PPC64LE.InsVector.va_codegen_success_Vspltisw",
"Vale.PPC64LE.Decls.va_op_vec_opr_vec",
"Vale.AES.PPC64LE.AES.va_codegen_success_AESEncryptBlock",
"Vale.PPC64LE.InsBasic.v... | [] | false | false | false | true | false | let va_codegen_success_Keyhash_init alg =
| (va_pbool_and (va_codegen_success_CreateHeaplets ())
(va_pbool_and (va_codegen_success_Vspltisw (va_op_vec_opr_vec 0) 0)
(va_pbool_and (va_codegen_success_AESEncryptBlock alg)
(va_pbool_and (va_codegen_success_LoadImm64 (va_op_reg_opr_reg 10) 32)
(va_pbool_and (va_codegen_success... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_code_Keyhash_init | val va_code_Keyhash_init : alg:algorithm -> Tot va_code | val va_code_Keyhash_init : alg:algorithm -> Tot va_code | let va_code_Keyhash_init alg =
(va_Block (va_CCons (va_code_CreateHeaplets ()) (va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 0)
0) (va_CCons (va_code_AESEncryptBlock alg) (va_CCons (va_code_LoadImm64 (va_op_reg_opr_reg 10)
32) (va_CCons (va_code_Store128_byte16_buffer_index (va_op_heaplet_mem_heaplet 1)
... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 29,
"end_line": 498,
"start_col": 0,
"start_line": 492
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | alg: Vale.AES.AES_common_s.algorithm -> Vale.PPC64LE.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Vale.AES.AES_common_s.algorithm",
"Vale.PPC64LE.Decls.va_Block",
"Vale.PPC64LE.Decls.va_CCons",
"Vale.PPC64LE.InsMem.va_code_CreateHeaplets",
"Vale.PPC64LE.InsVector.va_code_Vspltisw",
"Vale.PPC64LE.Decls.va_op_vec_opr_vec",
"Vale.AES.PPC64LE.AES.va_code_AESEncryptBlock",
"Vale.PPC64LE.InsBasic.va_co... | [] | false | false | false | true | false | let va_code_Keyhash_init alg =
| (va_Block (va_CCons (va_code_CreateHeaplets ())
(va_CCons (va_code_Vspltisw (va_op_vec_opr_vec 0) 0)
(va_CCons (va_code_AESEncryptBlock alg)
(va_CCons (va_code_LoadImm64 (va_op_reg_opr_reg 10) 32)
(va_CCons (va_code_Store128_byte16_buffer_index (va_op_heaplet_mem_... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_wp_Gf128_powers | val va_wp_Gf128_powers
(h: poly)
(hkeys_b: buffer128)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 | val va_wp_Gf128_powers
(h: poly)
(hkeys_b: buffer128)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 | let va_wp_Gf128_powers (h:poly) (hkeys_b:buffer128) (va_s0:va_state) (va_k:(va_state -> unit ->
Type0)) : Type0 =
(va_get_ok va_s0 /\ Vale.PPC64LE.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg
3 va_s0) hkeys_b 3 (va_get_mem_layout va_s0) Secret /\ Vale.Math.Poly2.Bits_s.of_quad32
(Vale.Def... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 98,
"end_line": 459,
"start_col": 0,
"start_line": 440
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h: Vale.Math.Poly2_s.poly ->
hkeys_b: Vale.PPC64LE.Memory.buffer128 ->
va_s0: Vale.PPC64LE.Decls.va_state ->
va_k: (_: Vale.PPC64LE.Decls.va_state -> _: Prims.unit -> Type0)
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.Math.Poly2_s.poly",
"Vale.PPC64LE.Memory.buffer128",
"Vale.PPC64LE.Decls.va_state",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"Vale.PPC64LE.Decls.va_get_ok",
"Vale.PPC64LE.Decls.validDstAddrs128",
"Vale.PPC64LE.Decls.va_get_mem_heaplet",
"Vale.PPC64LE.Decls.va_get_reg",
"Vale.PPC64LE.Decls... | [] | false | false | false | true | true | let va_wp_Gf128_powers
(h: poly)
(hkeys_b: buffer128)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 =
| (va_get_ok va_s0 /\
Vale.PPC64LE.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0)
(va_get_reg 3 va_s0)
hkeys_b
3
(va_get_mem_layout va_s0)
Secret /\
Vale.Math.Poly2.Bits_s.of_quad32 (Vale.Def.Types_s.reverse_bytes_quad32 (Vale.PPC64LE.Decls.buffer128_read
hkeys_b
2
... | false |
Steel.GhostMonotonicHigherReference.fst | Steel.GhostMonotonicHigherReference.intro_pure_full | val intro_pure_full (#opened #a #p #f: _) (r: ref a p) (v: a) (h: history a p {history_val h v f})
: SteelGhostT unit opened (PR.pts_to r h) (fun _ -> pts_to r f v) | val intro_pure_full (#opened #a #p #f: _) (r: ref a p) (v: a) (h: history a p {history_val h v f})
: SteelGhostT unit opened (PR.pts_to r h) (fun _ -> pts_to r f v) | let intro_pure_full #opened #a #p #f
(r:ref a p)
(v:a)
(h:history a p { history_val h v f })
: SteelGhostT unit opened
(PR.pts_to r h)
(fun _ -> pts_to r f v)
= intro_pure #_ #a #p #f r v h;
intro_exists h (pts_to_body r f v) | {
"file_name": "lib/steel/Steel.GhostMonotonicHigherReference.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 38,
"end_line": 66,
"start_col": 0,
"start_line": 58
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.Preorder.fst.checked",
"Steel.Memory.fsti.checked",
"Steel.GhostPCMReference.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Real.fsti... | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": true,
"full_module": "Steel.Effect.Atomic",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "Steel.GhostPCMReference",
"short_module": "PR"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
r: Steel.GhostMonotonicHigherReference.ref a p ->
v: a ->
h: Steel.Preorder.history a p {Steel.Preorder.history_val h (FStar.Ghost.hide v) f}
-> Steel.Effect.Atomic.SteelGhostT Prims.unit | Steel.Effect.Atomic.SteelGhostT | [] | [] | [
"Steel.Memory.inames",
"FStar.Preorder.preorder",
"Steel.FractionalPermission.perm",
"Steel.GhostMonotonicHigherReference.ref",
"Steel.Preorder.history",
"Steel.Preorder.history_val",
"FStar.Ghost.hide",
"Steel.Effect.Atomic.intro_exists",
"Steel.GhostMonotonicHigherReference.pts_to_body",
"Prims.... | [] | false | true | false | false | false | let intro_pure_full #opened #a #p #f (r: ref a p) (v: a) (h: history a p {history_val h v f})
: SteelGhostT unit opened (PR.pts_to r h) (fun _ -> pts_to r f v) =
| intro_pure #_ #a #p #f r v h;
intro_exists h (pts_to_body r f v) | false |
Steel.ST.Array.fst | Steel.ST.Array.pts_to_range_index | val pts_to_range_index
(#elt: Type0)
(#p: P.perm)
(#s: Ghost.erased (Seq.seq elt))
(a: array elt)
(i: Ghost.erased nat)
(m: US.t)
(j: Ghost.erased nat)
: ST elt
(pts_to_range a i j p s)
(fun _ -> pts_to_range a i j p s)
(i <= US.v m /\ US.v m < j)
(fun res ->
i <= US.v m /\ US.v m < ... | val pts_to_range_index
(#elt: Type0)
(#p: P.perm)
(#s: Ghost.erased (Seq.seq elt))
(a: array elt)
(i: Ghost.erased nat)
(m: US.t)
(j: Ghost.erased nat)
: ST elt
(pts_to_range a i j p s)
(fun _ -> pts_to_range a i j p s)
(i <= US.v m /\ US.v m < j)
(fun res ->
i <= US.v m /\ US.v m < ... | let pts_to_range_index
#elt #p #s a i m j
= pts_to_range_split a i (US.v m) j;
let s1 = elim_exists () in
let s2 = elim_exists () in
elim_pure _;
let ga' = pts_to_range_elim' a (US.v m) j p s2 in
let a' = array_slice_impl a m j () in
vpattern_rewrite #_ #(array elt) #ga' (fun ga' -> pts_to ga' _ _) a';
... | {
"file_name": "lib/steel/Steel.ST.Array.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 12,
"end_line": 684,
"start_col": 0,
"start_line": 671
} | (*
Copyright 2020, 2021, 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law ... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.Reference.fsti.checked",
"Steel.ST.Loops.fsti.checked",
"Steel.ST.HigherArray.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.SizeT.fsti.checked",
"FStar.Seq.fst.che... | [
{
"abbrev": true,
"full_module": "Steel.ST.Reference",
"short_module": "R"
},
{
"abbrev": true,
"full_module": "Steel.ST.HigherArray",
"short_module": "H"
},
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "US"
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
a: Steel.ST.Array.array elt ->
i: FStar.Ghost.erased Prims.nat ->
m: FStar.SizeT.t ->
j: FStar.Ghost.erased Prims.nat
-> Steel.ST.Effect.ST elt | Steel.ST.Effect.ST | [] | [] | [
"Steel.FractionalPermission.perm",
"FStar.Ghost.erased",
"FStar.Seq.Base.seq",
"Steel.ST.Array.array",
"Prims.nat",
"FStar.SizeT.t",
"Steel.ST.Util.return",
"FStar.Ghost.hide",
"FStar.Set.set",
"Steel.Memory.iname",
"FStar.Set.empty",
"Steel.ST.Array.pts_to_range",
"FStar.Ghost.reveal",
"S... | [] | false | true | false | false | false | let pts_to_range_index #elt #p #s a i m j =
| pts_to_range_split a i (US.v m) j;
let s1 = elim_exists () in
let s2 = elim_exists () in
elim_pure _;
let ga' = pts_to_range_elim' a (US.v m) j p s2 in
let a' = array_slice_impl a m j () in
vpattern_rewrite #_ #(array elt) #ga' (fun ga' -> pts_to ga' _ _) a';
let res = index a' 0sz in
pts_to_range_intro' a (US.v m) j p... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_quick_ShiftKey1_128 | val va_quick_ShiftKey1_128 (f: poly) : (va_quickCode unit (va_code_ShiftKey1_128 ())) | val va_quick_ShiftKey1_128 (f: poly) : (va_quickCode unit (va_code_ShiftKey1_128 ())) | let va_quick_ShiftKey1_128 (f:poly) : (va_quickCode unit (va_code_ShiftKey1_128 ())) =
(va_QProc (va_code_ShiftKey1_128 ()) ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1])
(va_wp_ShiftKey1_128 f) (va_wpProof_ShiftKey1_128 f)) | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 57,
"end_line": 165,
"start_col": 0,
"start_line": 163
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | f: Vale.Math.Poly2_s.poly
-> Vale.PPC64LE.QuickCode.va_quickCode Prims.unit
(Vale.AES.PPC64LE.GF128_Init.va_code_ShiftKey1_128 ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.Math.Poly2_s.poly",
"Vale.PPC64LE.QuickCode.va_QProc",
"Prims.unit",
"Vale.AES.PPC64LE.GF128_Init.va_code_ShiftKey1_128",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.mod_t",
"Vale.PPC64LE.QuickCode.va_Mod_vec",
"Prims.Nil",
"Vale.AES.PPC64LE.GF128_Init.va_wp_ShiftKey1_128",
"Vale.AES.PPC64LE.GF128... | [] | false | false | false | false | false | let va_quick_ShiftKey1_128 (f: poly) : (va_quickCode unit (va_code_ShiftKey1_128 ())) =
| (va_QProc (va_code_ShiftKey1_128 ())
([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1])
(va_wp_ShiftKey1_128 f)
(va_wpProof_ShiftKey1_128 f)) | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_quick_Gf128_powers | val va_quick_Gf128_powers (h: poly) (hkeys_b: buffer128)
: (va_quickCode unit (va_code_Gf128_powers ())) | val va_quick_Gf128_powers (h: poly) (hkeys_b: buffer128)
: (va_quickCode unit (va_code_Gf128_powers ())) | let va_quick_Gf128_powers (h:poly) (hkeys_b:buffer128) : (va_quickCode unit (va_code_Gf128_powers
())) =
(va_QProc (va_code_Gf128_powers ()) ([va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3;
va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_mem_heaplet 1; va_Mod_mem])
(va_wp_Gf128_powe... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 71,
"end_line": 487,
"start_col": 0,
"start_line": 483
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | h: Vale.Math.Poly2_s.poly -> hkeys_b: Vale.PPC64LE.Memory.buffer128
-> Vale.PPC64LE.QuickCode.va_quickCode Prims.unit
(Vale.AES.PPC64LE.GF128_Init.va_code_Gf128_powers ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.Math.Poly2_s.poly",
"Vale.PPC64LE.Memory.buffer128",
"Vale.PPC64LE.QuickCode.va_QProc",
"Prims.unit",
"Vale.AES.PPC64LE.GF128_Init.va_code_Gf128_powers",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.mod_t",
"Vale.PPC64LE.QuickCode.va_Mod_vec",
"Vale.PPC64LE.QuickCode.va_Mod_reg",
"Vale.PPC64LE.Quic... | [] | false | false | false | false | false | let va_quick_Gf128_powers (h: poly) (hkeys_b: buffer128)
: (va_quickCode unit (va_code_Gf128_powers ())) =
| (va_QProc (va_code_Gf128_powers ())
([
va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_vec 0; va_Mod_reg 10; va_Mod_mem_heaplet 1; va_Mod_mem
])
(va_wp_Gf128_powers h hkeys_b)
(va_wpProof_Gf128_powers h hkeys_b)) | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_qcode_ShiftKey1_128 | val va_qcode_ShiftKey1_128 (va_mods: va_mods_t) (f: poly)
: (va_quickCode unit (va_code_ShiftKey1_128 ())) | val va_qcode_ShiftKey1_128 (va_mods: va_mods_t) (f: poly)
: (va_quickCode unit (va_code_ShiftKey1_128 ())) | let va_qcode_ShiftKey1_128 (va_mods:va_mods_t) (f:poly) : (va_quickCode unit (va_code_ShiftKey1_128
())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(h:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 3 va_s) in let
(h1:Vale.Math.Poly2_s.poly) = Vale... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 34,
"end_line": 94,
"start_col": 0,
"start_line": 57
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | va_mods: Vale.PPC64LE.QuickCode.va_mods_t -> f: Vale.Math.Poly2_s.poly
-> Vale.PPC64LE.QuickCode.va_quickCode Prims.unit
(Vale.AES.PPC64LE.GF128_Init.va_code_ShiftKey1_128 ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.QuickCode.va_mods_t",
"Vale.Math.Poly2_s.poly",
"Vale.PPC64LE.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.PPC64LE.Decls.va_code",
"Vale.PPC64LE.InsVector.va_code_Vmr",
"Vale.PPC64LE.Decls.va_op_vec_opr_vec",
"Vale.AES.PPC64LE.GF128_Mul.va_code_ShiftLeft128_1",
"Vale.AES.PPC... | [] | false | false | false | false | false | let va_qcode_ShiftKey1_128 (va_mods: va_mods_t) (f: poly)
: (va_quickCode unit (va_code_ShiftKey1_128 ())) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
let h:Vale.Math.Poly2_s.poly = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 3 va_s) in
let h1:Vale.Math.Poly2_s.poly = Vale.Math.Poly2_s.shift h 1 in
let offset:Vale.Math.Poly2_s.poly = Vale.Math.Poly2.Bits_s.of... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_quick_ShiftKey1_gf128_power | val va_quick_ShiftKey1_gf128_power (h: poly) (n: nat)
: (va_quickCode unit (va_code_ShiftKey1_gf128_power ())) | val va_quick_ShiftKey1_gf128_power (h: poly) (n: nat)
: (va_quickCode unit (va_code_ShiftKey1_gf128_power ())) | let va_quick_ShiftKey1_gf128_power (h:poly) (n:nat) : (va_quickCode unit
(va_code_ShiftKey1_gf128_power ())) =
(va_QProc (va_code_ShiftKey1_gf128_power ()) ([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3;
va_Mod_vec 2; va_Mod_vec 1; va_Mod_reg 10]) (va_wp_ShiftKey1_gf128_power h n)
(va_wpProof_ShiftKey1_gf128_po... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 43,
"end_line": 309,
"start_col": 0,
"start_line": 305
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | h: Vale.Math.Poly2_s.poly -> n: Prims.nat
-> Vale.PPC64LE.QuickCode.va_quickCode Prims.unit
(Vale.AES.PPC64LE.GF128_Init.va_code_ShiftKey1_gf128_power ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.Math.Poly2_s.poly",
"Prims.nat",
"Vale.PPC64LE.QuickCode.va_QProc",
"Prims.unit",
"Vale.AES.PPC64LE.GF128_Init.va_code_ShiftKey1_gf128_power",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.mod_t",
"Vale.PPC64LE.QuickCode.va_Mod_vec",
"Vale.PPC64LE.QuickCode.va_Mod_reg",
"Prims.Nil",
"Vale.AES.PPC6... | [] | false | false | false | false | false | let va_quick_ShiftKey1_gf128_power (h: poly) (n: nat)
: (va_quickCode unit (va_code_ShiftKey1_gf128_power ())) =
| (va_QProc (va_code_ShiftKey1_gf128_power ())
([va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_reg 10])
(va_wp_ShiftKey1_gf128_power h n)
(va_wpProof_ShiftKey1_gf128_power h n)) | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_wpProof_ShiftKey1_gf128_power | val va_wpProof_ShiftKey1_gf128_power : h:poly -> n:nat -> va_s0:va_state -> va_k:(va_state -> unit
-> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ShiftKey1_gf128_power h n va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ShiftKey1_gf128_power ()) ([v... | val va_wpProof_ShiftKey1_gf128_power : h:poly -> n:nat -> va_s0:va_state -> va_k:(va_state -> unit
-> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ShiftKey1_gf128_power h n va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ShiftKey1_gf128_power ()) ([v... | let va_wpProof_ShiftKey1_gf128_power h n va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ShiftKey1_gf128_power (va_code_ShiftKey1_gf128_power ()) va_s0 h n
in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM (va_update_vec 3 va_sM
(va_update_vec 2 va_sM (va_upd... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 302,
"start_col": 0,
"start_line": 292
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h: Vale.Math.Poly2_s.poly ->
n: Prims.nat ->
va_s0: Vale.PPC64LE.Decls.va_state ->
va_k: (_: Vale.PPC64LE.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.PPC64LE.Decls.va_state * Vale.PPC64LE.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.Math.Poly2_s.poly",
"Prims.nat",
"Vale.PPC64LE.Decls.va_state",
"Prims.unit",
"Vale.PPC64LE.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.PPC64LE.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.mod_t",
"Vale.PPC64LE.QuickCode.va_Mod_vec",
"Vale.PPC64LE.Quic... | [] | false | false | false | false | false | let va_wpProof_ShiftKey1_gf128_power h n va_s0 va_k =
| let va_sM, va_f0 = va_lemma_ShiftKey1_gf128_power (va_code_ShiftKey1_gf128_power ()) va_s0 h n in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_vec 5
va_sM
(va_update_vec 4
va_sM
(va_update_vec 3
va_sM
(va_update... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_wpProof_Gf128_powers | val va_wpProof_Gf128_powers : h:poly -> hkeys_b:buffer128 -> va_s0:va_state -> va_k:(va_state ->
unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Gf128_powers h hkeys_b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Gf128_powers ()) ([va_Mod_vec... | val va_wpProof_Gf128_powers : h:poly -> hkeys_b:buffer128 -> va_s0:va_state -> va_k:(va_state ->
unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Gf128_powers h hkeys_b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Gf128_powers ()) ([va_Mod_vec... | let va_wpProof_Gf128_powers h hkeys_b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Gf128_powers (va_code_Gf128_powers ()) va_s0 h hkeys_b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 6 va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM
(va_update_vec 3 va_sM (va_update_vec 2 va_sM (va... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 480,
"start_col": 0,
"start_line": 470
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h: Vale.Math.Poly2_s.poly ->
hkeys_b: Vale.PPC64LE.Memory.buffer128 ->
va_s0: Vale.PPC64LE.Decls.va_state ->
va_k: (_: Vale.PPC64LE.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.PPC64LE.Decls.va_state * Vale.PPC64LE.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.Math.Poly2_s.poly",
"Vale.PPC64LE.Memory.buffer128",
"Vale.PPC64LE.Decls.va_state",
"Prims.unit",
"Vale.PPC64LE.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.PPC64LE.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.mod_t",
"Vale.PPC64LE.QuickCode.va_Mod_vec",
... | [] | false | false | false | false | false | let va_wpProof_Gf128_powers h hkeys_b va_s0 va_k =
| let va_sM, va_f0 = va_lemma_Gf128_powers (va_code_Gf128_powers ()) va_s0 h hkeys_b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_vec 6
va_sM
(va_update_vec 5
va_sM
(va_update_vec 4
va_sM
(va_update_vec 3
... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_qcode_Keyhash_init | val va_qcode_Keyhash_init
(va_mods: va_mods_t)
(alg: algorithm)
(key: (seq nat32))
(roundkeys_b hkeys_b: buffer128)
: (va_quickCode unit (va_code_Keyhash_init alg)) | val va_qcode_Keyhash_init
(va_mods: va_mods_t)
(alg: algorithm)
(key: (seq nat32))
(roundkeys_b hkeys_b: buffer128)
: (va_quickCode unit (va_code_Keyhash_init alg)) | let va_qcode_Keyhash_init (va_mods:va_mods_t) (alg:algorithm) (key:(seq nat32))
(roundkeys_b:buffer128) (hkeys_b:buffer128) : (va_quickCode unit (va_code_Keyhash_init alg)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 192 colum... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 60,
"end_line": 545,
"start_col": 0,
"start_line": 511
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_mods: Vale.PPC64LE.QuickCode.va_mods_t ->
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.PPC64LE.Memory.nat32 ->
roundkeys_b: Vale.PPC64LE.Memory.buffer128 ->
hkeys_b: Vale.PPC64LE.Memory.buffer128
-> Vale.PPC64LE.QuickCode.va_quickCode Prims.unit
(Vale.AES.PPC64LE.... | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.QuickCode.va_mods_t",
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.PPC64LE.Memory.nat32",
"Vale.PPC64LE.Memory.buffer128",
"Vale.PPC64LE.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.PPC64LE.Decls.va_code",
"Vale.PPC64LE.InsMem.va_code_CreateHeaplets",
"Va... | [] | false | false | false | false | false | let va_qcode_Keyhash_init
(va_mods: va_mods_t)
(alg: algorithm)
(key: (seq nat32))
(roundkeys_b hkeys_b: buffer128)
: (va_quickCode unit (va_code_Keyhash_init alg)) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 192 column 19 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Init.vaf *****"
(va_quick_CreateH... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_wpProof_ShiftKey1_128 | val va_wpProof_ShiftKey1_128 : f:poly -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ShiftKey1_128 f va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ShiftKey1_128 ()) ([va_Mod_vec 3;
va_Mod_vec 2; va_Mod... | val va_wpProof_ShiftKey1_128 : f:poly -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_ShiftKey1_128 f va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_ShiftKey1_128 ()) ([va_Mod_vec 3;
va_Mod_vec 2; va_Mod... | let va_wpProof_ShiftKey1_128 f va_s0 va_k =
let (va_sM, va_f0) = va_lemma_ShiftKey1_128 (va_code_ShiftKey1_128 ()) va_s0 f in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 3 va_sM (va_update_vec 2 va_sM (va_update_vec 1 va_sM
(va_update_ok va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 160,
"start_col": 0,
"start_line": 153
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
f: Vale.Math.Poly2_s.poly ->
va_s0: Vale.PPC64LE.Decls.va_state ->
va_k: (_: Vale.PPC64LE.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.PPC64LE.Decls.va_state * Vale.PPC64LE.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.Math.Poly2_s.poly",
"Vale.PPC64LE.Decls.va_state",
"Prims.unit",
"Vale.PPC64LE.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.PPC64LE.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.mod_t",
"Vale.PPC64LE.QuickCode.va_Mod_vec",
"Prims.Nil",
"Prims._assert",
... | [] | false | false | false | false | false | let va_wpProof_ShiftKey1_128 f va_s0 va_k =
| let va_sM, va_f0 = va_lemma_ShiftKey1_128 (va_code_ShiftKey1_128 ()) va_s0 f in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_vec 3
va_sM
(va_update_vec 2 va_sM (va_update_vec 1 va_sM (va_update_ok va_sM va_s0)))));
va_lemma_norm_mods ([va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec ... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_qcode_ShiftKey1_gf128_power | val va_qcode_ShiftKey1_gf128_power (va_mods: va_mods_t) (h: poly) (n: nat)
: (va_quickCode unit (va_code_ShiftKey1_gf128_power ())) | val va_qcode_ShiftKey1_gf128_power (va_mods: va_mods_t) (h: poly) (n: nat)
: (va_quickCode unit (va_code_ShiftKey1_gf128_power ())) | let va_qcode_ShiftKey1_gf128_power (va_mods:va_mods_t) (h:poly) (n:nat) : (va_quickCode unit
(va_code_ShiftKey1_gf128_power ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(hn:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 3 va_s) in va_QSeq
va_ra... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 25,
"end_line": 239,
"start_col": 0,
"start_line": 198
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | va_mods: Vale.PPC64LE.QuickCode.va_mods_t -> h: Vale.Math.Poly2_s.poly -> n: Prims.nat
-> Vale.PPC64LE.QuickCode.va_quickCode Prims.unit
(Vale.AES.PPC64LE.GF128_Init.va_code_ShiftKey1_gf128_power ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.QuickCode.va_mods_t",
"Vale.Math.Poly2_s.poly",
"Prims.nat",
"Vale.PPC64LE.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.PPC64LE.Decls.va_code",
"Vale.PPC64LE.InsVector.va_code_Vspltisw",
"Vale.PPC64LE.Decls.va_op_vec_opr_vec",
"Vale.PPC64LE.InsBasic.va_code_LoadImmShl64",
... | [] | false | false | false | false | false | let va_qcode_ShiftKey1_gf128_power (va_mods: va_mods_t) (h: poly) (n: nat)
: (va_quickCode unit (va_code_ShiftKey1_gf128_power ())) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
let hn:Vale.Math.Poly2_s.poly = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 3 va_s) in
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 110 column 13 of file /home/gebner/fstar_dataset/projects/hacl-star... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_qcode_Gf128_powers | val va_qcode_Gf128_powers (va_mods: va_mods_t) (h: poly) (hkeys_b: buffer128)
: (va_quickCode unit (va_code_Gf128_powers ())) | val va_qcode_Gf128_powers (va_mods: va_mods_t) (h: poly) (hkeys_b: buffer128)
: (va_quickCode unit (va_code_Gf128_powers ())) | let va_qcode_Gf128_powers (va_mods:va_mods_t) (h:poly) (hkeys_b:buffer128) : (va_quickCode unit
(va_code_Gf128_powers ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 147 column 14 of file /home/gebner/fstar_dataset/projects/h... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 99,
"end_line": 387,
"start_col": 0,
"start_line": 350
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_mods: Vale.PPC64LE.QuickCode.va_mods_t ->
h: Vale.Math.Poly2_s.poly ->
hkeys_b: Vale.PPC64LE.Memory.buffer128
-> Vale.PPC64LE.QuickCode.va_quickCode Prims.unit
(Vale.AES.PPC64LE.GF128_Init.va_code_Gf128_powers ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.PPC64LE.QuickCode.va_mods_t",
"Vale.Math.Poly2_s.poly",
"Vale.PPC64LE.Memory.buffer128",
"Vale.PPC64LE.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.PPC64LE.Decls.va_code",
"Vale.PPC64LE.InsBasic.va_code_LoadImm64",
"Vale.PPC64LE.Decls.va_op_reg_opr_reg",
"Vale.PPC64LE.InsVector.va_c... | [] | false | false | false | false | false | let va_qcode_Gf128_powers (va_mods: va_mods_t) (h: poly) (hkeys_b: buffer128)
: (va_quickCode unit (va_code_Gf128_powers ())) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
va_QSeq va_range1
"***** PRECONDITION NOT MET AT line 147 column 14 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/crypto/aes/ppc64le/Vale.AES.PPC64LE.GF128_Init.vaf *****"
(va_quick_LoadImm... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_lemma_ShiftKey1_128 | val va_lemma_ShiftKey1_128 : va_b0:va_code -> va_s0:va_state -> f:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ShiftKey1_128 ()) va_s0 /\ va_get_ok va_s0 /\ (let
(h:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 3 va_s0) in let
(h1:Vale.Math.Poly2_s.p... | val va_lemma_ShiftKey1_128 : va_b0:va_code -> va_s0:va_state -> f:poly
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ShiftKey1_128 ()) va_s0 /\ va_get_ok va_s0 /\ (let
(h:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 3 va_s0) in let
(h1:Vale.Math.Poly2_s.p... | let va_lemma_ShiftKey1_128 va_b0 va_s0 f =
let (va_mods:va_mods_t) = [va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok] in
let va_qc = va_qcode_ShiftKey1_128 va_mods f in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ShiftKey1_128 ()) va_qc va_s0 (fun
va_s0 va_sM va_g -> let () = va_g in label ... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 129,
"start_col": 0,
"start_line": 114
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | va_b0: Vale.PPC64LE.Decls.va_code -> va_s0: Vale.PPC64LE.Decls.va_state -> f: Vale.Math.Poly2_s.poly
-> Prims.Ghost (Vale.PPC64LE.Decls.va_state * Vale.PPC64LE.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.PPC64LE.Decls.va_code",
"Vale.PPC64LE.Decls.va_state",
"Vale.Math.Poly2_s.poly",
"Vale.PPC64LE.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.PPC64LE.Decls.va_fuel",
"Vale.PPC64LE.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.mod_t",
"Vale.... | [] | false | false | false | false | false | let va_lemma_ShiftKey1_128 va_b0 va_s0 f =
| let va_mods:va_mods_t = [va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_ok] in
let va_qc = va_qcode_ShiftKey1_128 va_mods f in
let va_sM, va_fM, va_g =
va_wp_sound_code_norm (va_code_ShiftKey1_128 ())
va_qc
va_s0
(fun va_s0 va_sM va_g ->
let () = va_g in
label va_range1
"***** ... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_wpProof_Keyhash_init | val va_wpProof_Keyhash_init : alg:algorithm -> key:(seq nat32) -> roundkeys_b:buffer128 ->
hkeys_b:buffer128 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Keyhash_init alg key roundkeys_b hkeys_b va_s0 va_k))
(ensures (fun (va_s... | val va_wpProof_Keyhash_init : alg:algorithm -> key:(seq nat32) -> roundkeys_b:buffer128 ->
hkeys_b:buffer128 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Keyhash_init alg key roundkeys_b hkeys_b va_s0 va_k))
(ensures (fun (va_s... | let va_wpProof_Keyhash_init alg key roundkeys_b hkeys_b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Keyhash_init (va_code_Keyhash_init alg) va_s0 alg key roundkeys_b
hkeys_b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_vec 6 va_sM (va_update_vec 5 va_sM (va_update_vec 4 va_sM
(va_upda... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 586,
"start_col": 0,
"start_line": 574
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.PPC64LE.Memory.nat32 ->
roundkeys_b: Vale.PPC64LE.Memory.buffer128 ->
hkeys_b: Vale.PPC64LE.Memory.buffer128 ->
va_s0: Vale.PPC64LE.Decls.va_state ->
va_k: (_: Vale.PPC64LE.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.... | Prims.Ghost | [] | [] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.PPC64LE.Memory.nat32",
"Vale.PPC64LE.Memory.buffer128",
"Vale.PPC64LE.Decls.va_state",
"Prims.unit",
"Vale.PPC64LE.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.PPC64LE.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.P... | [] | false | false | false | false | false | let va_wpProof_Keyhash_init alg key roundkeys_b hkeys_b va_s0 va_k =
| let va_sM, va_f0 =
va_lemma_Keyhash_init (va_code_Keyhash_init alg) va_s0 alg key roundkeys_b hkeys_b
in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_vec 6
va_sM
(va_update_vec 5
va_sM
(va_update_vec 4
va_sM
(... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_lemma_ShiftKey1_gf128_power | val va_lemma_ShiftKey1_gf128_power : va_b0:va_code -> va_s0:va_state -> h:poly -> n:nat
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ShiftKey1_gf128_power ()) va_s0 /\ va_get_ok va_s0 /\
(let (hn:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 3 va_s0) in hn
... | val va_lemma_ShiftKey1_gf128_power : va_b0:va_code -> va_s0:va_state -> h:poly -> n:nat
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_ShiftKey1_gf128_power ()) va_s0 /\ va_get_ok va_s0 /\
(let (hn:Vale.Math.Poly2_s.poly) = Vale.Math.Poly2.Bits_s.of_quad32 (va_get_vec 3 va_s0) in hn
... | let va_lemma_ShiftKey1_gf128_power va_b0 va_s0 h n =
let (va_mods:va_mods_t) = [va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1;
va_Mod_reg 10; va_Mod_ok] in
let va_qc = va_qcode_ShiftKey1_gf128_power va_mods h n in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_ShiftKey1_gf128... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 269,
"start_col": 0,
"start_line": 254
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.PPC64LE.Decls.va_code ->
va_s0: Vale.PPC64LE.Decls.va_state ->
h: Vale.Math.Poly2_s.poly ->
n: Prims.nat
-> Prims.Ghost (Vale.PPC64LE.Decls.va_state * Vale.PPC64LE.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.PPC64LE.Decls.va_code",
"Vale.PPC64LE.Decls.va_state",
"Vale.Math.Poly2_s.poly",
"Prims.nat",
"Vale.PPC64LE.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.PPC64LE.Decls.va_fuel",
"Vale.PPC64LE.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.PPC64LE.QuickCode.m... | [] | false | false | false | false | false | let va_lemma_ShiftKey1_gf128_power va_b0 va_s0 h n =
| let va_mods:va_mods_t =
[va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_reg 10; va_Mod_ok]
in
let va_qc = va_qcode_ShiftKey1_gf128_power va_mods h n in
let va_sM, va_fM, va_g =
va_wp_sound_code_norm (va_code_ShiftKey1_gf128_power ())
va_qc
va_s0
(fun va_s0 va_sM va_g ->
... | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_lemma_Gf128_powers | val va_lemma_Gf128_powers : va_b0:va_code -> va_s0:va_state -> h:poly -> hkeys_b:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Gf128_powers ()) va_s0 /\ va_get_ok va_s0 /\
Vale.PPC64LE.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg 3 va_s0) hkeys_b 3
(va... | val va_lemma_Gf128_powers : va_b0:va_code -> va_s0:va_state -> h:poly -> hkeys_b:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Gf128_powers ()) va_s0 /\ va_get_ok va_s0 /\
Vale.PPC64LE.Decls.validDstAddrs128 (va_get_mem_heaplet 1 va_s0) (va_get_reg 3 va_s0) hkeys_b 3
(va... | let va_lemma_Gf128_powers va_b0 va_s0 h hkeys_b =
let (va_mods:va_mods_t) = [va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_Gf128_powers va_mods h hkeys_b in
let (va_sM, va_fM... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 437,
"start_col": 0,
"start_line": 411
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.PPC64LE.Decls.va_code ->
va_s0: Vale.PPC64LE.Decls.va_state ->
h: Vale.Math.Poly2_s.poly ->
hkeys_b: Vale.PPC64LE.Memory.buffer128
-> Prims.Ghost (Vale.PPC64LE.Decls.va_state * Vale.PPC64LE.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.PPC64LE.Decls.va_code",
"Vale.PPC64LE.Decls.va_state",
"Vale.Math.Poly2_s.poly",
"Vale.PPC64LE.Memory.buffer128",
"Vale.PPC64LE.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.PPC64LE.Decls.va_fuel",
"Vale.PPC64LE.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale... | [] | false | false | false | false | false | let va_lemma_Gf128_powers va_b0 va_s0 h hkeys_b =
| let va_mods:va_mods_t =
[
va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0;
va_Mod_reg 10; va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem
]
in
let va_qc = va_qcode_Gf128_powers va_mods h hkeys_b in
let va_sM, va_fM, va_g =
va_wp_sound_code_norm (va_code_Gf128_p... | false |
Steel.ST.C.Types.UserStruct.fsti | Steel.ST.C.Types.UserStruct.unstruct_field_alt | val unstruct_field_alt
(#opened: _)
(#t: Type)
(#sd: struct_def t)
(#v: Ghost.erased t)
(r: ref (struct_typedef sd))
(field: field_t sd.fields)
(#v': Ghost.erased (sd.field_desc.fd_type field))
(r': ref (sd.field_desc.fd_typedef field))
: STGhost (Ghost.erased t)
... | val unstruct_field_alt
(#opened: _)
(#t: Type)
(#sd: struct_def t)
(#v: Ghost.erased t)
(r: ref (struct_typedef sd))
(field: field_t sd.fields)
(#v': Ghost.erased (sd.field_desc.fd_type field))
(r': ref (sd.field_desc.fd_typedef field))
: STGhost (Ghost.erased t)
... | let unstruct_field_alt
(#opened: _)
(#t: Type)
(#sd: struct_def t)
(#v: Ghost.erased t)
(r: ref (struct_typedef sd))
(field: field_t sd.fields)
(#v': Ghost.erased (sd.field_desc.fd_type field))
(r': ref (sd.field_desc.fd_typedef field))
: STGhost (Ghost.erased t) opened
(has_struct_field r field r' ... | {
"file_name": "lib/steel/c/Steel.ST.C.Types.UserStruct.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 3,
"end_line": 216,
"start_col": 0,
"start_line": 199
} | module Steel.ST.C.Types.UserStruct
open Steel.ST.Util
open Steel.ST.C.Types.Struct.Aux
module Set = FStar.Set
(* This library allows the user to define their own struct type, with
a constructor from field values, and a destructor to field values for
each field. This may be necessary for recursive structs *)
let set_... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.Util.fsti.checked",
"Steel.ST.C.Types.Struct.Aux.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fs... | [
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "Set"
},
{
"abbrev": false,
"full_module": "Steel.ST.C.Types.Struct.Aux",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.ST.Util",
"short_module": null
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
r: Steel.ST.C.Types.Base.ref (Steel.ST.C.Types.UserStruct.struct_typedef sd) ->
field: Steel.ST.C.Types.UserStruct.field_t (Mkstruct_def?.fields sd) ->
r':
Steel.ST.C.Types.Base.ref (Mkfield_description_gen_t?.fd_typedef (Mkstruct_def?.field_desc sd)
field)
-> Steel.ST.Effect.Ghost.STGh... | Steel.ST.Effect.Ghost.STGhost | [] | [] | [
"Steel.Memory.inames",
"Steel.ST.C.Types.UserStruct.struct_def",
"FStar.Ghost.erased",
"Steel.ST.C.Types.Base.ref",
"Steel.ST.C.Types.UserStruct.struct_typedef",
"Steel.ST.C.Types.UserStruct.field_t",
"Steel.ST.C.Types.UserStruct.__proj__Mkstruct_def__item__fields",
"Steel.ST.C.Types.Struct.Aux.__proj... | [] | false | true | false | false | false | let unstruct_field_alt
(#opened: _)
(#t: Type)
(#sd: struct_def t)
(#v: Ghost.erased t)
(r: ref (struct_typedef sd))
(field: field_t sd.fields)
(#v': Ghost.erased (sd.field_desc.fd_type field))
(r': ref (sd.field_desc.fd_typedef field))
: STGhost (Ghost.erased t)
... | unstruct_field r field r';
_ | false |
Steel.GhostMonotonicHigherReference.fst | Steel.GhostMonotonicHigherReference.alloc | val alloc (#opened: _) (#a:Type) (p:Preorder.preorder a) (v:a)
: SteelGhostT (ref a p) opened emp (fun r -> pts_to r full_perm v) | val alloc (#opened: _) (#a:Type) (p:Preorder.preorder a) (v:a)
: SteelGhostT (ref a p) opened emp (fun r -> pts_to r full_perm v) | let alloc #_ (#a:Type) (p:Preorder.preorder a) (v:a)
= let h = Current [v] full_perm in
assert (compatible pcm_history h h);
let x : ref a p = alloc h in
intro_pure_full x v h;
x | {
"file_name": "lib/steel/Steel.GhostMonotonicHigherReference.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 5,
"end_line": 73,
"start_col": 0,
"start_line": 68
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.Preorder.fst.checked",
"Steel.Memory.fsti.checked",
"Steel.GhostPCMReference.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Real.fsti... | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": true,
"full_module": "Steel.Effect.Atomic",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "Steel.GhostPCMReference",
"short_module": "PR"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: FStar.Preorder.preorder a -> v: a
-> Steel.Effect.Atomic.SteelGhostT (Steel.GhostMonotonicHigherReference.ref a p) | Steel.Effect.Atomic.SteelGhostT | [] | [] | [
"Steel.Memory.inames",
"FStar.Preorder.preorder",
"Steel.GhostMonotonicHigherReference.ref",
"Prims.unit",
"Steel.GhostMonotonicHigherReference.intro_pure_full",
"Steel.FractionalPermission.full_perm",
"Steel.GhostPCMReference.alloc",
"Steel.Preorder.history",
"Steel.Preorder.pcm_history",
"Steel.... | [] | false | true | false | false | false | let alloc #_ (#a: Type) (p: Preorder.preorder a) (v: a) =
| let h = Current [v] full_perm in
assert (compatible pcm_history h h);
let x:ref a p = alloc h in
intro_pure_full x v h;
x | false |
Vale.AES.PPC64LE.GF128_Init.fst | Vale.AES.PPC64LE.GF128_Init.va_lemma_Keyhash_init | val va_lemma_Keyhash_init : va_b0:va_code -> va_s0:va_state -> alg:algorithm -> key:(seq nat32) ->
roundkeys_b:buffer128 -> hkeys_b:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Keyhash_init alg) va_s0 /\ va_get_ok va_s0 /\
Vale.PPC64LE.Memory.is_initial_heap (va_get_mem_l... | val va_lemma_Keyhash_init : va_b0:va_code -> va_s0:va_state -> alg:algorithm -> key:(seq nat32) ->
roundkeys_b:buffer128 -> hkeys_b:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Keyhash_init alg) va_s0 /\ va_get_ok va_s0 /\
Vale.PPC64LE.Memory.is_initial_heap (va_get_mem_l... | let va_lemma_Keyhash_init va_b0 va_s0 alg key roundkeys_b hkeys_b =
let (va_mods:va_mods_t) = [va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2;
va_Mod_vec 1; va_Mod_vec 0; va_Mod_reg 10; va_Mod_mem_layout; va_Mod_mem_heaplet 1; va_Mod_ok;
va_Mod_mem] in
let va_qc = va_qcode_Keyhash_init... | {
"file_name": "obj/Vale.AES.PPC64LE.GF128_Init.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 570,
"start_col": 0,
"start_line": 550
} | module Vale.AES.PPC64LE.GF128_Init
open Vale.Def.Words_s
open Vale.Def.Words.Four_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.Math.Poly2_s
open Vale.Math.Poly2
open Vale.Math.Poly2.Bits_s
open Vale.Math.Poly2.Bits
open Vale.Math.Poly2.Lemmas
open Vale.AES.GF128_s
open V... | {
"checked_file": "/",
"dependencies": [
"Vale.PPC64LE.State.fsti.checked",
"Vale.PPC64LE.QuickCodes.fsti.checked",
"Vale.PPC64LE.QuickCode.fst.checked",
"Vale.PPC64LE.Memory.fsti.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.PPC64LE.InsVector.fsti.checked",
"Vale.PPC64LE.InsMem.... | [
{
"abbrev": false,
"full_module": "Vale.AES.OptPublic_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.GF128_Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.PPC64LE.PolyOps",
"short_module": null
},
{
"abbr... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.PPC64LE.Decls.va_code ->
va_s0: Vale.PPC64LE.Decls.va_state ->
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.PPC64LE.Memory.nat32 ->
roundkeys_b: Vale.PPC64LE.Memory.buffer128 ->
hkeys_b: Vale.PPC64LE.Memory.buffer128
-> Prims.Ghost (Vale.PPC64LE.Decls.va_st... | Prims.Ghost | [] | [] | [
"Vale.PPC64LE.Decls.va_code",
"Vale.PPC64LE.Decls.va_state",
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.PPC64LE.Memory.nat32",
"Vale.PPC64LE.Memory.buffer128",
"Vale.PPC64LE.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.PPC64LE.Decls.va_fuel",
"Val... | [] | false | false | false | false | false | let va_lemma_Keyhash_init va_b0 va_s0 alg key roundkeys_b hkeys_b =
| let va_mods:va_mods_t =
[
va_Mod_vec 6; va_Mod_vec 5; va_Mod_vec 4; va_Mod_vec 3; va_Mod_vec 2; va_Mod_vec 1; va_Mod_vec 0;
va_Mod_reg 10; va_Mod_mem_layout; va_Mod_mem_heaplet 1; va_Mod_ok; va_Mod_mem
]
in
let va_qc = va_qcode_Keyhash_init va_mods alg key roundkeys_b hkeys_b in
let va_sM, va_fM, va_g =
v... | false |
Steel.ST.C.Types.UserStruct.fsti | Steel.ST.C.Types.UserStruct.struct_field | val struct_field
(#t: Type)
(#sd: struct_def t)
(#v: Ghost.erased t)
(r: ref (struct_typedef sd))
(field: field_t sd.fields)
: STT
(ref #(norm norm_field_steps (sd.field_desc.fd_type field)) (sd.field_desc.fd_typedef field))
(pts_to r v)
(fun r' ->
((pts_to ... | val struct_field
(#t: Type)
(#sd: struct_def t)
(#v: Ghost.erased t)
(r: ref (struct_typedef sd))
(field: field_t sd.fields)
: STT
(ref #(norm norm_field_steps (sd.field_desc.fd_type field)) (sd.field_desc.fd_typedef field))
(pts_to r v)
(fun r' ->
((pts_to ... | let struct_field
(#t: Type)
(#sd: struct_def t)
(#v: Ghost.erased t)
(r: ref (struct_typedef sd))
(field: field_t sd.fields)
: STT (ref #(norm norm_field_steps (sd.field_desc.fd_type field)) (sd.field_desc.fd_typedef field))
(pts_to r v)
(fun r' -> pts_to r (set sd v field (unknown (sd.field_desc.fd_t... | {
"file_name": "lib/steel/c/Steel.ST.C.Types.UserStruct.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 36,
"end_line": 180,
"start_col": 0,
"start_line": 167
} | module Steel.ST.C.Types.UserStruct
open Steel.ST.Util
open Steel.ST.C.Types.Struct.Aux
module Set = FStar.Set
(* This library allows the user to define their own struct type, with
a constructor from field values, and a destructor to field values for
each field. This may be necessary for recursive structs *)
let set_... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.Util.fsti.checked",
"Steel.ST.C.Types.Struct.Aux.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fs... | [
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "Set"
},
{
"abbrev": false,
"full_module": "Steel.ST.C.Types.Struct.Aux",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.ST.Util",
"short_module": null
},
{
"abbrev": false,
"full_... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
r: Steel.ST.C.Types.Base.ref (Steel.ST.C.Types.UserStruct.struct_typedef sd) ->
field: Steel.ST.C.Types.UserStruct.field_t (Mkstruct_def?.fields sd)
-> Steel.ST.Effect.STT
(Steel.ST.C.Types.Base.ref (Mkfield_description_gen_t?.fd_typedef (Mkstruct_def?.field_desc sd)
field)) | Steel.ST.Effect.STT | [] | [] | [
"Steel.ST.C.Types.UserStruct.struct_def",
"FStar.Ghost.erased",
"Steel.ST.C.Types.Base.ref",
"Steel.ST.C.Types.UserStruct.struct_typedef",
"Steel.ST.C.Types.UserStruct.field_t",
"Steel.ST.C.Types.UserStruct.__proj__Mkstruct_def__item__fields",
"Steel.ST.C.Types.UserStruct.struct_field0",
"FStar.Pervas... | [] | false | true | false | false | false | let struct_field
(#t: Type)
(#sd: struct_def t)
(#v: Ghost.erased t)
(r: ref (struct_typedef sd))
(field: field_t sd.fields)
: STT
(ref #(norm norm_field_steps (sd.field_desc.fd_type field)) (sd.field_desc.fd_typedef field))
(pts_to r v)
(fun r' ->
((pts_to ... | struct_field0 (norm norm_field_steps (sd.field_desc.fd_type field))
r
field
(sd.field_desc.fd_typedef field) | false |
BinomialQueue.fst | BinomialQueue.is_priq | val is_priq : l: BinomialQueue.forest -> Prims.logical | let is_priq (l:forest) = is_binomial_queue 1 l /\ is_compact l | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 84,
"start_col": 0,
"start_line": 84
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: BinomialQueue.forest -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"BinomialQueue.forest",
"Prims.l_and",
"BinomialQueue.is_binomial_queue",
"BinomialQueue.is_compact",
"Prims.logical"
] | [] | false | false | false | true | true | let is_priq (l: forest) =
| is_binomial_queue 1 l /\ is_compact l | false | |
BinomialQueue.fst | BinomialQueue.priq | val priq : Type0 | val priq : Type0 | let priq = l:forest{is_priq l} | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 30,
"end_line": 88,
"start_col": 0,
"start_line": 88
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"BinomialQueue.forest",
"BinomialQueue.is_priq"
] | [] | false | false | false | true | true | let priq =
| l: forest{is_priq l} | false |
BinomialQueue.fst | BinomialQueue.is_compact | val is_compact : l: BinomialQueue.forest -> Prims.logical | let is_compact (l:forest) = l == [] \/ Internal? (L.last l) | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 59,
"end_line": 82,
"start_col": 0,
"start_line": 82
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: BinomialQueue.forest -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"BinomialQueue.forest",
"Prims.l_or",
"Prims.eq2",
"Prims.list",
"BinomialQueue.tree",
"Prims.Nil",
"Prims.b2t",
"BinomialQueue.uu___is_Internal",
"FStar.List.Tot.Base.last",
"Prims.logical"
] | [] | false | false | false | true | true | let is_compact (l: forest) =
| l == [] \/ Internal? (L.last l) | false | |
BinomialQueue.fst | BinomialQueue.last_cons | val last_cons (#a: Type) (x: a) (l: list a)
: Lemma (requires Cons? l) (ensures L.last (x :: l) == L.last l) [SMTPat (L.last (x :: l))] | val last_cons (#a: Type) (x: a) (l: list a)
: Lemma (requires Cons? l) (ensures L.last (x :: l) == L.last l) [SMTPat (L.last (x :: l))] | let rec last_cons (#a:Type) (x:a) (l:list a)
: Lemma
(requires Cons? l)
(ensures L.last (x::l) == L.last l)
[SMTPat (L.last (x::l))] =
match l with
| [_] -> ()
| _::tl -> last_cons x tl | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 33,
"start_col": 0,
"start_line": 25
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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 -> l: Prims.list a
-> FStar.Pervasives.Lemma (requires Cons? l)
(ensures FStar.List.Tot.Base.last (x :: l) == FStar.List.Tot.Base.last l)
[SMTPat (FStar.List.Tot.Base.last (x :: l))] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"BinomialQueue.last_cons",
"Prims.unit",
"Prims.b2t",
"Prims.uu___is_Cons",
"Prims.squash",
"Prims.eq2",
"FStar.List.Tot.Base.last",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.Nil"
] | [
"recursion"
] | false | false | true | false | false | let rec last_cons (#a: Type) (x: a) (l: list a)
: Lemma (requires Cons? l) (ensures L.last (x :: l) == L.last l) [SMTPat (L.last (x :: l))] =
| match l with
| [_] -> ()
| _ :: tl -> last_cons x tl | false |
BinomialQueue.fst | BinomialQueue.pow2heap_pred | val pow2heap_pred (d: nat) (upper_bound: key_t) (t: tree) : prop | val pow2heap_pred (d: nat) (upper_bound: key_t) (t: tree) : prop | let rec pow2heap_pred (d:nat) (upper_bound:key_t) (t:tree) : prop =
match t with
| Leaf -> d == 0
| Internal left k right ->
0 < d /\
k <= upper_bound /\
pow2heap_pred (d - 1) k left /\
pow2heap_pred (d - 1) upper_bound right | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 43,
"end_line": 56,
"start_col": 0,
"start_line": 49
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: Prims.nat -> upper_bound: BinomialQueue.key_t -> t: BinomialQueue.tree -> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"BinomialQueue.key_t",
"BinomialQueue.tree",
"Prims.eq2",
"Prims.int",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.op_LessThanOrEqual",
"BinomialQueue.pow2heap_pred",
"Prims.op_Subtraction",
"Prims.prop"
] | [
"recursion"
] | false | false | false | true | true | let rec pow2heap_pred (d: nat) (upper_bound: key_t) (t: tree) : prop =
| match t with
| Leaf -> d == 0
| Internal left k right ->
0 < d /\ k <= upper_bound /\ pow2heap_pred (d - 1) k left /\
pow2heap_pred (d - 1) upper_bound right | false |
BinomialQueue.fst | BinomialQueue.is_pow2heap | val is_pow2heap (d: pos) (t: tree) : prop | val is_pow2heap (d: pos) (t: tree) : prop | let is_pow2heap (d:pos) (t:tree) : prop =
match t with
| Internal left k Leaf -> pow2heap_pred (d - 1) k left
| _ -> False | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 14,
"end_line": 65,
"start_col": 0,
"start_line": 62
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: Prims.pos -> t: BinomialQueue.tree -> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"Prims.pos",
"BinomialQueue.tree",
"BinomialQueue.key_t",
"BinomialQueue.pow2heap_pred",
"Prims.op_Subtraction",
"Prims.l_False",
"Prims.prop"
] | [] | false | false | false | true | true | let is_pow2heap (d: pos) (t: tree) : prop =
| match t with
| Internal left k Leaf -> pow2heap_pred (d - 1) k left
| _ -> False | false |
Steel.GhostMonotonicHigherReference.fst | Steel.GhostMonotonicHigherReference.elim_pure | val elim_pure (#a #uses #p #f: _) (r: ref a p) (v: a) (h: (history a p))
: SteelGhostT (_: unit{history_val h v f}) uses (pts_to_body r f v h) (fun _ -> PR.pts_to r h) | val elim_pure (#a #uses #p #f: _) (r: ref a p) (v: a) (h: (history a p))
: SteelGhostT (_: unit{history_val h v f}) uses (pts_to_body r f v h) (fun _ -> PR.pts_to r h) | let elim_pure #a #uses #p #f
(r:ref a p)
(v:a)
(h:(history a p))
: SteelGhostT (_:unit{history_val h v f})
uses
(pts_to_body r f v h)
(fun _ -> PR.pts_to r h)
= let _ = extract_pure r v h in
drop (pure (history_val h v f)) | {
"file_name": "lib/steel/Steel.GhostMonotonicHigherReference.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 35,
"end_line": 95,
"start_col": 0,
"start_line": 86
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.Preorder.fst.checked",
"Steel.Memory.fsti.checked",
"Steel.GhostPCMReference.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Real.fsti... | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": true,
"full_module": "Steel.Effect.Atomic",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "Steel.GhostPCMReference",
"short_module": "PR"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: Steel.GhostMonotonicHigherReference.ref a p -> v: a -> h: Steel.Preorder.history a p
-> Steel.Effect.Atomic.SteelGhostT
(_: Prims.unit{Steel.Preorder.history_val h (FStar.Ghost.hide v) f}) | Steel.Effect.Atomic.SteelGhostT | [] | [] | [
"Steel.Memory.inames",
"FStar.Preorder.preorder",
"Steel.FractionalPermission.perm",
"Steel.GhostMonotonicHigherReference.ref",
"Steel.Preorder.history",
"Steel.Effect.Atomic.drop",
"Steel.Effect.Common.pure",
"Steel.Preorder.history_val",
"FStar.Ghost.hide",
"Prims.unit",
"Steel.GhostMonotonicH... | [] | false | true | false | false | false | let elim_pure #a #uses #p #f (r: ref a p) (v: a) (h: (history a p))
: SteelGhostT (_: unit{history_val h v f}) uses (pts_to_body r f v h) (fun _ -> PR.pts_to r h) =
| let _ = extract_pure r v h in
drop (pure (history_val h v f)) | false |
BinomialQueue.fst | BinomialQueue.empty | val empty : priq | val empty : priq | let empty = [] | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 14,
"end_line": 90,
"start_col": 0,
"start_line": 90
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | BinomialQueue.priq | Prims.Tot | [
"total"
] | [] | [
"Prims.Nil",
"BinomialQueue.tree"
] | [] | false | false | false | true | false | let empty =
| [] | false |
BinomialQueue.fst | BinomialQueue.is_binomial_queue | val is_binomial_queue (d: pos) (l: forest) : Tot prop (decreases l) | val is_binomial_queue (d: pos) (l: forest) : Tot prop (decreases l) | let rec is_binomial_queue (d:pos) (l:forest)
: Tot prop (decreases l) =
match l with
| [] -> True
| hd::tl ->
(Leaf? hd \/ is_pow2heap d hd) /\ is_binomial_queue (d + 1) tl | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 66,
"end_line": 77,
"start_col": 0,
"start_line": 71
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: Prims.pos -> l: BinomialQueue.forest -> Prims.Tot Prims.prop | Prims.Tot | [
"total",
""
] | [] | [
"Prims.pos",
"BinomialQueue.forest",
"Prims.l_True",
"BinomialQueue.tree",
"Prims.list",
"Prims.l_and",
"Prims.l_or",
"Prims.b2t",
"BinomialQueue.uu___is_Leaf",
"BinomialQueue.is_pow2heap",
"BinomialQueue.is_binomial_queue",
"Prims.op_Addition",
"Prims.prop"
] | [
"recursion"
] | false | false | false | true | true | let rec is_binomial_queue (d: pos) (l: forest) : Tot prop (decreases l) =
| match l with
| [] -> True
| hd :: tl -> (Leaf? hd \/ is_pow2heap d hd) /\ is_binomial_queue (d + 1) tl | false |
BinomialQueue.fst | BinomialQueue.mk_compact | val mk_compact (l: forest) : forest | val mk_compact (l: forest) : forest | let rec mk_compact (l:forest) : forest =
match l with
| [] -> []
| _ ->
if all_leaf l then []
else let hd::tl = l in
hd::(mk_compact tl) | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 28,
"end_line": 106,
"start_col": 0,
"start_line": 100
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: BinomialQueue.forest -> BinomialQueue.forest | Prims.Tot | [
"total"
] | [] | [
"BinomialQueue.forest",
"Prims.Nil",
"BinomialQueue.tree",
"Prims.list",
"BinomialQueue.all_leaf",
"Prims.bool",
"Prims.Cons",
"BinomialQueue.mk_compact"
] | [
"recursion"
] | false | false | false | true | false | let rec mk_compact (l: forest) : forest =
| match l with
| [] -> []
| _ ->
if all_leaf l
then []
else
let hd :: tl = l in
hd :: (mk_compact tl) | false |
BinomialQueue.fst | BinomialQueue.all_leaf | val all_leaf (l: forest{Cons? l}) : bool | val all_leaf (l: forest{Cons? l}) : bool | let rec all_leaf (l:forest{Cons? l}) : bool =
match l with
| [Leaf] -> true
| Leaf::tl -> all_leaf tl
| _ -> false | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 14,
"end_line": 98,
"start_col": 0,
"start_line": 94
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: BinomialQueue.forest{Cons? l} -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"BinomialQueue.forest",
"Prims.b2t",
"Prims.uu___is_Cons",
"BinomialQueue.tree",
"Prims.list",
"BinomialQueue.all_leaf",
"Prims.bool"
] | [
"recursion"
] | false | false | false | false | false | let rec all_leaf (l: forest{Cons? l}) : bool =
| match l with
| [Leaf] -> true
| Leaf :: tl -> all_leaf tl
| _ -> false | false |
BinomialQueue.fst | BinomialQueue.mk_compact_preserves_binomial_queue | val mk_compact_preserves_binomial_queue (d: pos) (l: forest)
: Lemma (requires is_binomial_queue d l)
(ensures is_binomial_queue d (mk_compact l))
(decreases l)
[SMTPat (is_binomial_queue d (mk_compact l))] | val mk_compact_preserves_binomial_queue (d: pos) (l: forest)
: Lemma (requires is_binomial_queue d l)
(ensures is_binomial_queue d (mk_compact l))
(decreases l)
[SMTPat (is_binomial_queue d (mk_compact l))] | let rec mk_compact_preserves_binomial_queue (d:pos) (l:forest)
: Lemma
(requires is_binomial_queue d l)
(ensures is_binomial_queue d (mk_compact l))
(decreases l)
[SMTPat (is_binomial_queue d (mk_compact l))] =
match l with
| [] -> ()
| _ ->
if all_leaf l then ()
else mk_compact_... | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 130,
"start_col": 0,
"start_line": 120
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: Prims.pos -> l: BinomialQueue.forest
-> FStar.Pervasives.Lemma (requires BinomialQueue.is_binomial_queue d l)
(ensures BinomialQueue.is_binomial_queue d (BinomialQueue.mk_compact l))
(decreases l)
[SMTPat (BinomialQueue.is_binomial_queue d (BinomialQueue.mk_compact l))] | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.pos",
"BinomialQueue.forest",
"Prims.list",
"BinomialQueue.tree",
"BinomialQueue.all_leaf",
"Prims.bool",
"BinomialQueue.mk_compact_preserves_binomial_queue",
"Prims.op_Addition",
"FStar.List.Tot.Base.tl",
"Prims.unit",
"BinomialQueue.is_binomial_queue",
"Prims.squash",
"BinomialQueue... | [
"recursion"
] | false | false | true | false | false | let rec mk_compact_preserves_binomial_queue (d: pos) (l: forest)
: Lemma (requires is_binomial_queue d l)
(ensures is_binomial_queue d (mk_compact l))
(decreases l)
[SMTPat (is_binomial_queue d (mk_compact l))] =
| match l with
| [] -> ()
| _ -> if all_leaf l then () else mk_compact_preserves_binomial_queue (d + 1) (L.tl l) | false |
BinomialQueue.fst | BinomialQueue.mk_compact_correctness | val mk_compact_correctness (l: forest)
: Lemma (is_compact (mk_compact l)) [SMTPat (is_compact (mk_compact l))] | val mk_compact_correctness (l: forest)
: Lemma (is_compact (mk_compact l)) [SMTPat (is_compact (mk_compact l))] | let rec mk_compact_correctness (l:forest)
: Lemma (is_compact (mk_compact l))
[SMTPat (is_compact (mk_compact l))] =
match l with
| [] -> ()
| _ ->
if all_leaf l then ()
else mk_compact_correctness (L.tl l) | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 118,
"start_col": 0,
"start_line": 110
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: BinomialQueue.forest
-> FStar.Pervasives.Lemma (ensures BinomialQueue.is_compact (BinomialQueue.mk_compact l))
[SMTPat (BinomialQueue.is_compact (BinomialQueue.mk_compact l))] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"BinomialQueue.forest",
"Prims.list",
"BinomialQueue.tree",
"BinomialQueue.all_leaf",
"Prims.bool",
"BinomialQueue.mk_compact_correctness",
"FStar.List.Tot.Base.tl",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"BinomialQueue.is_compact",
"BinomialQueue.mk_compact",
"Prims.Cons",
"FStar.P... | [
"recursion"
] | false | false | true | false | false | let rec mk_compact_correctness (l: forest)
: Lemma (is_compact (mk_compact l)) [SMTPat (is_compact (mk_compact l))] =
| match l with
| [] -> ()
| _ -> if all_leaf l then () else mk_compact_correctness (L.tl l) | false |
Duplex.PingPong.fst | Duplex.PingPong.pingpong | val pingpong:dprot | val pingpong:dprot | let pingpong : dprot =
x <-- send int;
y <-- recv (y:int{y > x});
done | {
"file_name": "share/steel/examples/steel/Duplex.PingPong.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 6,
"end_line": 16,
"start_col": 0,
"start_line": 13
} | module Duplex.PingPong
open FStar.PCM
open Steel.Memory
open Steel.Effect.Atomic
open Steel.Effect
open Steel.Channel.Protocol
open Duplex.PCM
////////////////////////////////////////////////////////////////////////////////
// An example
//////////////////////////////////////////////////////////////////////////////// | {
"checked_file": "/",
"dependencies": [
"Steel.Memory.fsti.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"Steel.Channel.Protocol.fst.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"Duplex.PCM.fsti.checked"
],
... | [
{
"abbrev": false,
"full_module": "Duplex.PCM",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Channel.Protocol",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.Effect",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Duplex.PCM.dprot | Prims.Tot | [
"total"
] | [] | [
"Duplex.PCM.bind",
"Prims.int",
"Prims.unit",
"Duplex.PCM.send",
"Prims.b2t",
"Prims.op_GreaterThan",
"Duplex.PCM.recv",
"Duplex.PCM.done",
"Duplex.PCM.nl_protocol"
] | [] | false | false | false | true | false | let pingpong:dprot =
| x <-- send int ;
y <-- recv (y: int{y > x}) ;
done | false |
BinomialQueue.fst | BinomialQueue.smash | val smash (d: pos) (t1 t2: tree)
: Pure tree
(requires is_pow2heap d t1 /\ is_pow2heap d t2)
(ensures fun t -> is_pow2heap (d + 1) t) | val smash (d: pos) (t1 t2: tree)
: Pure tree
(requires is_pow2heap d t1 /\ is_pow2heap d t2)
(ensures fun t -> is_pow2heap (d + 1) t) | let smash (d:pos) (t1:tree) (t2:tree)
: Pure tree
(requires is_pow2heap d t1 /\ is_pow2heap d t2)
(ensures fun t -> is_pow2heap (d + 1) t) =
match t1, t2 with
| Internal left1 k1 Leaf, Internal left2 k2 Leaf ->
if k1 <= k2
then Internal (Internal left1 k1 left2) k2 Leaf
else Interna... | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 144,
"start_col": 0,
"start_line": 135
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: Prims.pos -> t1: BinomialQueue.tree -> t2: BinomialQueue.tree -> Prims.Pure BinomialQueue.tree | Prims.Pure | [] | [] | [
"Prims.pos",
"BinomialQueue.tree",
"FStar.Pervasives.Native.Mktuple2",
"BinomialQueue.key_t",
"Prims.op_LessThanOrEqual",
"BinomialQueue.Internal",
"BinomialQueue.Leaf",
"Prims.bool",
"Prims.l_and",
"BinomialQueue.is_pow2heap",
"Prims.op_Addition"
] | [] | false | false | false | false | false | let smash (d: pos) (t1 t2: tree)
: Pure tree
(requires is_pow2heap d t1 /\ is_pow2heap d t2)
(ensures fun t -> is_pow2heap (d + 1) t) =
| match t1, t2 with
| Internal left1 k1 Leaf, Internal left2 k2 Leaf ->
if k1 <= k2
then Internal (Internal left1 k1 left2) k2 Leaf
else Internal (Internal left2 k2 left1) k1 Leaf | false |
BinomialQueue.fst | BinomialQueue.carry | val carry (d: pos) (q: forest) (t: tree)
: Pure forest
(requires is_binomial_queue d q /\ is_pow2heap d t)
(ensures fun q -> is_binomial_queue d q)
(decreases q) | val carry (d: pos) (q: forest) (t: tree)
: Pure forest
(requires is_binomial_queue d q /\ is_pow2heap d t)
(ensures fun q -> is_binomial_queue d q)
(decreases q) | let rec carry (d:pos) (q:forest) (t:tree)
: Pure forest
(requires is_binomial_queue d q /\ is_pow2heap d t)
(ensures fun q -> is_binomial_queue d q)
(decreases q) =
match q with
| [] -> [t]
| Leaf::tl -> t::tl
| hd::tl ->
let q = carry (d + 1) tl (smash d hd t) in
Leaf::q | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 160,
"start_col": 0,
"start_line": 150
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: Prims.pos -> q: BinomialQueue.forest -> t: BinomialQueue.tree -> Prims.Pure BinomialQueue.forest | Prims.Pure | [
""
] | [] | [
"Prims.pos",
"BinomialQueue.forest",
"BinomialQueue.tree",
"Prims.Cons",
"Prims.Nil",
"Prims.list",
"BinomialQueue.Leaf",
"BinomialQueue.carry",
"Prims.op_Addition",
"BinomialQueue.smash",
"Prims.l_and",
"BinomialQueue.is_binomial_queue",
"BinomialQueue.is_pow2heap"
] | [
"recursion"
] | false | false | false | false | false | let rec carry (d: pos) (q: forest) (t: tree)
: Pure forest
(requires is_binomial_queue d q /\ is_pow2heap d t)
(ensures fun q -> is_binomial_queue d q)
(decreases q) =
| match q with
| [] -> [t]
| Leaf :: tl -> t :: tl
| hd :: tl ->
let q = carry (d + 1) tl (smash d hd t) in
Leaf :: q | false |
BinomialQueue.fst | BinomialQueue.insert | val insert : key_t -> priq -> priq | val insert : key_t -> priq -> priq | let insert x q =
let l = carry 1 q (Internal Leaf x Leaf) in
mk_compact l | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 14,
"end_line": 198,
"start_col": 0,
"start_line": 196
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: BinomialQueue.key_t -> q: BinomialQueue.priq -> BinomialQueue.priq | Prims.Tot | [
"total"
] | [] | [
"BinomialQueue.key_t",
"BinomialQueue.priq",
"BinomialQueue.mk_compact",
"BinomialQueue.forest",
"BinomialQueue.carry",
"BinomialQueue.Internal",
"BinomialQueue.Leaf"
] | [] | false | false | false | true | false | let insert x q =
| let l = carry 1 q (Internal Leaf x Leaf) in
mk_compact l | false |
LListReverse.fst | LListReverse.llist_nil_is_null | val llist_nil_is_null (#opened: _) (l: Ghost.erased (list U64.t)) (p: ref llist_cell)
: STGhost unit opened (llist l p) (fun _ -> llist l p) True (fun _ -> (p == null <==> Nil? l)) | val llist_nil_is_null (#opened: _) (l: Ghost.erased (list U64.t)) (p: ref llist_cell)
: STGhost unit opened (llist l p) (fun _ -> llist l p) True (fun _ -> (p == null <==> Nil? l)) | let llist_nil_is_null
(#opened: _)
(l: Ghost.erased (list U64.t))
(p: ref llist_cell)
: STGhost unit opened
(llist l p)
(fun _ -> llist l p)
True
(fun _ -> (p == null <==> Nil? l))
= if Nil? l
then begin
rewrite (llist l p) (llist_nil p);
let _ = gen_elim () in
rewrite (llist_nil p) ... | {
"file_name": "share/steel/tests/krml/LListReverse.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 5,
"end_line": 62,
"start_col": 0,
"start_line": 42
} | module LListReverse
open Steel.ST.GenElim
open Steel.ST.Reference
open Steel.ST.Loops
module U64 = FStar.UInt64
let main () = C.EXIT_SUCCESS // dummy for compilation
noeq
type llist_cell = {
value: U64.t;
next: ref llist_cell;
}
[@@__reduce__]
let llist_nil
(p: ref llist_cell)
: Tot vprop
= pure (p == null)
... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.Reference.fsti.checked",
"Steel.ST.Loops.fsti.checked",
"Steel.ST.GenElim.fsti.checked",
"prims.fst.checked",
"FStar.UInt64.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"FStar.Ghost.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": false,
"full_module": "Steel.ST.Loops",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.ST.Reference",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
l: FStar.Ghost.erased (Prims.list FStar.UInt64.t) ->
p: Steel.ST.Reference.ref LListReverse.llist_cell
-> Steel.ST.Effect.Ghost.STGhost Prims.unit | Steel.ST.Effect.Ghost.STGhost | [] | [] | [
"Steel.Memory.inames",
"FStar.Ghost.erased",
"Prims.list",
"FStar.UInt64.t",
"Steel.ST.Reference.ref",
"LListReverse.llist_cell",
"Prims.uu___is_Nil",
"FStar.Ghost.reveal",
"Steel.ST.Util.rewrite",
"LListReverse.llist_nil",
"LListReverse.llist",
"Prims.unit",
"Steel.ST.GenElim.gen_elim",
"... | [] | false | true | false | false | false | let llist_nil_is_null (#opened: _) (l: Ghost.erased (list U64.t)) (p: ref llist_cell)
: STGhost unit opened (llist l p) (fun _ -> llist l p) True (fun _ -> (p == null <==> Nil? l)) =
| if Nil? l
then
(rewrite (llist l p) (llist_nil p);
let _ = gen_elim () in
rewrite (llist_nil p) (llist l p))
else
let a :: q = Ghost.reveal l in
rewrite (llist l p) (llist_cons a (llist q) p);
let _ = gen_elim () in
pts_to_not_null p;
rewrite (llist_cons a (llist q) p) (llist l p) | false |
BinomialQueue.fst | BinomialQueue.join | val join (d: pos) (p q: forest) (c: tree)
: Pure forest
(requires is_binomial_queue d p /\ is_binomial_queue d q /\ (Leaf? c \/ is_pow2heap d c))
(ensures fun q -> is_binomial_queue d q)
(decreases L.length p) | val join (d: pos) (p q: forest) (c: tree)
: Pure forest
(requires is_binomial_queue d p /\ is_binomial_queue d q /\ (Leaf? c \/ is_pow2heap d c))
(ensures fun q -> is_binomial_queue d q)
(decreases L.length p) | let rec join (d:pos) (p q:forest) (c:tree)
: Pure forest
(requires
is_binomial_queue d p /\
is_binomial_queue d q /\
(Leaf? c \/ is_pow2heap d c))
(ensures fun q -> is_binomial_queue d q)
(decreases L.length p) =
match p, q, c with
| [], _, Leaf -> q... | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 192,
"start_col": 0,
"start_line": 167
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: Prims.pos -> p: BinomialQueue.forest -> q: BinomialQueue.forest -> c: BinomialQueue.tree
-> Prims.Pure BinomialQueue.forest | Prims.Pure | [
""
] | [] | [
"Prims.pos",
"BinomialQueue.forest",
"BinomialQueue.tree",
"FStar.Pervasives.Native.Mktuple3",
"Prims.list",
"BinomialQueue.carry",
"Prims.Cons",
"BinomialQueue.join",
"Prims.op_Addition",
"BinomialQueue.Leaf",
"BinomialQueue.smash",
"Prims.l_and",
"BinomialQueue.is_binomial_queue",
"Prims... | [
"recursion"
] | false | false | false | false | false | let rec join (d: pos) (p q: forest) (c: tree)
: Pure forest
(requires is_binomial_queue d p /\ is_binomial_queue d q /\ (Leaf? c \/ is_pow2heap d c))
(ensures fun q -> is_binomial_queue d q)
(decreases L.length p) =
| match p, q, c with
| [], _, Leaf -> q
| _, [], Leaf -> p
| [], _, _ -> carry d q c
| _, [], _ -> carry d p c
| Leaf :: tl_p, Leaf :: tl_q, _ -> c :: (join (d + 1) tl_p tl_q Leaf)
| hd_p :: tl_p, Leaf :: tl_q, Leaf -> hd_p :: (join (d + 1) tl_p tl_q Leaf)
| Leaf :: tl_p, hd_q :: tl_q, Leaf -> hd_q :: (join (d + 1) tl_p ... | false |
BinomialQueue.fst | BinomialQueue.repr | val repr (q:priq) (s:ms) : prop | val repr (q:priq) (s:ms) : prop | let repr q s = repr_l q s | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 25,
"end_line": 327,
"start_col": 0,
"start_line": 327
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | q: BinomialQueue.priq -> s: BinomialQueue.ms -> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"BinomialQueue.priq",
"BinomialQueue.ms",
"BinomialQueue.repr_l",
"Prims.prop"
] | [] | false | false | false | true | true | let repr q s =
| repr_l q s | false |
BinomialQueue.fst | BinomialQueue.heap_delete_max | val heap_delete_max (d: pos) (t: tree)
: Pure priq (requires is_pow2heap d t) (ensures fun q -> L.length q == d - 1) | val heap_delete_max (d: pos) (t: tree)
: Pure priq (requires is_pow2heap d t) (ensures fun q -> L.length q == d - 1) | let heap_delete_max (d:pos) (t:tree)
: Pure priq
(requires is_pow2heap d t)
(ensures fun q -> L.length q == d - 1) =
match t with
| Internal left k Leaf -> unzip (d - 1) k left | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 48,
"end_line": 262,
"start_col": 0,
"start_line": 256
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: Prims.pos -> t: BinomialQueue.tree -> Prims.Pure BinomialQueue.priq | Prims.Pure | [] | [] | [
"Prims.pos",
"BinomialQueue.tree",
"BinomialQueue.key_t",
"BinomialQueue.unzip",
"Prims.op_Subtraction",
"BinomialQueue.priq",
"BinomialQueue.is_pow2heap",
"Prims.eq2",
"Prims.int",
"FStar.List.Tot.Base.length"
] | [] | false | false | false | false | false | let heap_delete_max (d: pos) (t: tree)
: Pure priq (requires is_pow2heap d t) (ensures fun q -> L.length q == d - 1) =
| match t with | Internal left k Leaf -> unzip (d - 1) k left | false |
BinomialQueue.fst | BinomialQueue.keys_of_tree | val keys_of_tree (t: tree) : ms | val keys_of_tree (t: tree) : ms | let rec keys_of_tree (t:tree) : ms =
match t with
| Leaf -> ms_empty
| Internal left k right ->
ms_append (keys_of_tree left)
(ms_cons k (keys_of_tree right)) | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 312,
"start_col": 0,
"start_line": 307
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: BinomialQueue.tree -> BinomialQueue.ms | Prims.Tot | [
"total"
] | [] | [
"BinomialQueue.tree",
"BinomialQueue.ms_empty",
"BinomialQueue.key_t",
"BinomialQueue.ms_append",
"BinomialQueue.keys_of_tree",
"BinomialQueue.ms_cons",
"BinomialQueue.ms"
] | [
"recursion"
] | false | false | false | true | false | let rec keys_of_tree (t: tree) : ms =
| match t with
| Leaf -> ms_empty
| Internal left k right -> ms_append (keys_of_tree left) (ms_cons k (keys_of_tree right)) | false |
BinomialQueue.fst | BinomialQueue.merge | val merge : priq -> priq -> priq | val merge : priq -> priq -> priq | let merge p q =
let l = join 1 p q Leaf in
mk_compact l | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 14,
"end_line": 303,
"start_col": 0,
"start_line": 301
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: BinomialQueue.priq -> q: BinomialQueue.priq -> BinomialQueue.priq | Prims.Tot | [
"total"
] | [] | [
"BinomialQueue.priq",
"BinomialQueue.mk_compact",
"BinomialQueue.forest",
"BinomialQueue.join",
"BinomialQueue.Leaf"
] | [] | false | false | false | true | false | let merge p q =
| let l = join 1 p q Leaf in
mk_compact l | false |
BinomialQueue.fst | BinomialQueue.find_max | val find_max (max: option key_t) (q: forest) : Tot (option key_t) (decreases q) | val find_max (max: option key_t) (q: forest) : Tot (option key_t) (decreases q) | let rec find_max (max:option key_t) (q:forest)
: Tot (option key_t) (decreases q) =
match q with
| [] -> max
| Leaf::q -> find_max max q
| (Internal _ k _)::q ->
match max with
| None -> find_max (Some k) q
| Some max -> find_max (if max < k then Some k else Some max) q | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 67,
"end_line": 214,
"start_col": 0,
"start_line": 206
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | max: FStar.Pervasives.Native.option BinomialQueue.key_t -> q: BinomialQueue.forest
-> Prims.Tot (FStar.Pervasives.Native.option BinomialQueue.key_t) | Prims.Tot | [
"total",
""
] | [] | [
"FStar.Pervasives.Native.option",
"BinomialQueue.key_t",
"BinomialQueue.forest",
"Prims.list",
"BinomialQueue.tree",
"BinomialQueue.find_max",
"FStar.Pervasives.Native.Some",
"Prims.op_LessThan",
"Prims.bool"
] | [
"recursion"
] | false | false | false | true | false | let rec find_max (max: option key_t) (q: forest) : Tot (option key_t) (decreases q) =
| match q with
| [] -> max
| Leaf :: q -> find_max max q
| Internal _ k _ :: q ->
match max with
| None -> find_max (Some k) q
| Some max -> find_max (if max < k then Some k else Some max) q | false |
BinomialQueue.fst | BinomialQueue.binomial_queue_append | val binomial_queue_append (d: pos) (q: forest) (t: tree)
: Lemma (requires is_binomial_queue d q /\ is_pow2heap (L.length q + d) t)
(ensures is_binomial_queue d (L.append q [t]))
(decreases q) | val binomial_queue_append (d: pos) (q: forest) (t: tree)
: Lemma (requires is_binomial_queue d q /\ is_pow2heap (L.length q + d) t)
(ensures is_binomial_queue d (L.append q [t]))
(decreases q) | let rec binomial_queue_append (d:pos) (q:forest) (t:tree)
: Lemma
(requires
is_binomial_queue d q /\ is_pow2heap (L.length q + d) t)
(ensures is_binomial_queue d (L.append q [t]))
(decreases q) =
match q with
| [] -> ()
| _::q -> binomial_queue_append (d + 1) q t | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 45,
"end_line": 230,
"start_col": 0,
"start_line": 222
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: Prims.pos -> q: BinomialQueue.forest -> t: BinomialQueue.tree
-> FStar.Pervasives.Lemma
(requires
BinomialQueue.is_binomial_queue d q /\
BinomialQueue.is_pow2heap (FStar.List.Tot.Base.length q + d) t)
(ensures BinomialQueue.is_binomial_queue d (q @ [t]))
(decreases q) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.pos",
"BinomialQueue.forest",
"BinomialQueue.tree",
"Prims.list",
"BinomialQueue.binomial_queue_append",
"Prims.op_Addition",
"Prims.unit",
"Prims.l_and",
"BinomialQueue.is_binomial_queue",
"BinomialQueue.is_pow2heap",
"FStar.List.Tot.Base.length",
"Prims.squash",
"FStar.List.Tot.Base... | [
"recursion"
] | false | false | true | false | false | let rec binomial_queue_append (d: pos) (q: forest) (t: tree)
: Lemma (requires is_binomial_queue d q /\ is_pow2heap (L.length q + d) t)
(ensures is_binomial_queue d (L.append q [t]))
(decreases q) =
| match q with
| [] -> ()
| _ :: q -> binomial_queue_append (d + 1) q t | false |
BinomialQueue.fst | BinomialQueue.keys | val keys (q: forest) : ms | val keys (q: forest) : ms | let rec keys (q:forest) : ms =
match q with
| [] -> ms_empty
| hd::tl -> ms_append (keys_of_tree hd) (keys tl) | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 317,
"start_col": 0,
"start_line": 314
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | q: BinomialQueue.forest -> BinomialQueue.ms | Prims.Tot | [
"total"
] | [] | [
"BinomialQueue.forest",
"BinomialQueue.ms_empty",
"BinomialQueue.tree",
"Prims.list",
"BinomialQueue.ms_append",
"BinomialQueue.keys_of_tree",
"BinomialQueue.keys",
"BinomialQueue.ms"
] | [
"recursion"
] | false | false | false | true | false | let rec keys (q: forest) : ms =
| match q with
| [] -> ms_empty
| hd :: tl -> ms_append (keys_of_tree hd) (keys tl) | false |
BinomialQueue.fst | BinomialQueue.unzip | val unzip (d: nat) (upper_bound: key_t) (t: tree)
: Pure priq (requires pow2heap_pred d upper_bound t) (ensures fun q -> L.length q == d) | val unzip (d: nat) (upper_bound: key_t) (t: tree)
: Pure priq (requires pow2heap_pred d upper_bound t) (ensures fun q -> L.length q == d) | let rec unzip (d:nat) (upper_bound:key_t) (t:tree)
: Pure priq
(requires pow2heap_pred d upper_bound t)
(ensures fun q -> L.length q == d) =
match t with
| Leaf -> []
| Internal left k right ->
let q = unzip (d - 1) upper_bound right in
binomial_queue_append 1 q (Internal left k Leaf)... | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 252,
"start_col": 0,
"start_line": 240
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: Prims.nat -> upper_bound: BinomialQueue.key_t -> t: BinomialQueue.tree
-> Prims.Pure BinomialQueue.priq | Prims.Pure | [] | [] | [
"Prims.nat",
"BinomialQueue.key_t",
"BinomialQueue.tree",
"Prims.Nil",
"FStar.List.Tot.Base.append",
"Prims.Cons",
"BinomialQueue.Internal",
"BinomialQueue.Leaf",
"Prims.unit",
"FStar.List.Tot.Properties.lemma_append_last",
"FStar.List.Tot.Properties.append_length",
"BinomialQueue.binomial_que... | [
"recursion"
] | false | false | false | false | false | let rec unzip (d: nat) (upper_bound: key_t) (t: tree)
: Pure priq (requires pow2heap_pred d upper_bound t) (ensures fun q -> L.length q == d) =
| match t with
| Leaf -> []
| Internal left k right ->
let q = unzip (d - 1) upper_bound right in
binomial_queue_append 1 q (Internal left k Leaf);
L.append_length q [Internal left k Leaf];
L.lemma_append_last q [Internal left k Leaf];
L.append q [Internal left k Leaf] | false |
BinomialQueue.fst | BinomialQueue.repr_t | val repr_t (t: tree) (l: ms) : prop | val repr_t (t: tree) (l: ms) : prop | let repr_t (t:tree) (l:ms) : prop =
permutation (keys_of_tree t) l | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 320,
"start_col": 0,
"start_line": 319
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: BinomialQueue.tree -> l: BinomialQueue.ms -> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"BinomialQueue.tree",
"BinomialQueue.ms",
"BinomialQueue.permutation",
"BinomialQueue.keys_of_tree",
"Prims.prop"
] | [] | false | false | false | true | true | let repr_t (t: tree) (l: ms) : prop =
| permutation (keys_of_tree t) l | false |
BinomialQueue.fst | BinomialQueue.delete_max | val delete_max : priq -> option (key_t & priq) | val delete_max : priq -> option (key_t & priq) | let delete_max q =
match find_max None q with
| None -> None
| Some m ->
let x, q, new_q = delete_max_aux m 1 q in
let r = join 1 q new_q Leaf in
mk_compact_correctness r;
Some (x, mk_compact r) | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 297,
"start_col": 0,
"start_line": 290
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | q: BinomialQueue.priq -> FStar.Pervasives.Native.option (BinomialQueue.key_t * BinomialQueue.priq) | Prims.Tot | [
"total"
] | [] | [
"BinomialQueue.priq",
"BinomialQueue.find_max",
"FStar.Pervasives.Native.None",
"BinomialQueue.key_t",
"FStar.Pervasives.Native.tuple2",
"BinomialQueue.forest",
"FStar.Pervasives.Native.Some",
"FStar.Pervasives.Native.Mktuple2",
"BinomialQueue.mk_compact",
"Prims.unit",
"BinomialQueue.mk_compact... | [] | false | false | false | true | false | let delete_max q =
| match find_max None q with
| None -> None
| Some m ->
let x, q, new_q = delete_max_aux m 1 q in
let r = join 1 q new_q Leaf in
mk_compact_correctness r;
Some (x, mk_compact r) | false |
BinomialQueue.fst | BinomialQueue.repr_l | val repr_l (q: forest) (s: ms) : prop | val repr_l (q: forest) (s: ms) : prop | let repr_l (q:forest) (s:ms) : prop =
permutation (keys q) s | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 24,
"end_line": 323,
"start_col": 0,
"start_line": 322
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | q: BinomialQueue.forest -> s: BinomialQueue.ms -> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"BinomialQueue.forest",
"BinomialQueue.ms",
"BinomialQueue.permutation",
"BinomialQueue.keys",
"Prims.prop"
] | [] | false | false | false | true | true | let repr_l (q: forest) (s: ms) : prop =
| permutation (keys q) s | false |
BinomialQueue.fst | BinomialQueue.delete_max_aux | val delete_max_aux (m: key_t) (d: pos) (q: forest)
: Pure (key_t & forest & priq)
(requires is_binomial_queue d q)
(ensures fun (x, q, _) -> m <= x /\ is_binomial_queue d q)
(decreases q) | val delete_max_aux (m: key_t) (d: pos) (q: forest)
: Pure (key_t & forest & priq)
(requires is_binomial_queue d q)
(ensures fun (x, q, _) -> m <= x /\ is_binomial_queue d q)
(decreases q) | let rec delete_max_aux (m:key_t) (d:pos) (q:forest)
: Pure (key_t & forest & priq)
(requires is_binomial_queue d q)
(ensures fun (x, q, _) -> m <= x /\ is_binomial_queue d q)
(decreases q) =
match q with
| [] -> m + 1, [], [] // this case won't arise
// we cou... | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 62,
"end_line": 285,
"start_col": 0,
"start_line": 269
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | m: BinomialQueue.key_t -> d: Prims.pos -> q: BinomialQueue.forest
-> Prims.Pure ((BinomialQueue.key_t * BinomialQueue.forest) * BinomialQueue.priq) | Prims.Pure | [
""
] | [] | [
"BinomialQueue.key_t",
"Prims.pos",
"BinomialQueue.forest",
"FStar.Pervasives.Native.Mktuple3",
"BinomialQueue.priq",
"Prims.op_Addition",
"Prims.Nil",
"BinomialQueue.tree",
"Prims.list",
"Prims.Cons",
"BinomialQueue.Leaf",
"FStar.Pervasives.Native.tuple3",
"BinomialQueue.delete_max_aux",
... | [
"recursion"
] | false | false | false | false | false | let rec delete_max_aux (m: key_t) (d: pos) (q: forest)
: Pure (key_t & forest & priq)
(requires is_binomial_queue d q)
(ensures fun (x, q, _) -> m <= x /\ is_binomial_queue d q)
(decreases q) =
| match q with
| [] -> m + 1, [], []
| Leaf :: q ->
let x, q, new_q = delete_max_aux m (d + 1) q in
x, Leaf :: q, new_q
| Internal left x right :: q ->
if x < m
then
let y, q, new_q = delete_max_aux m (d + 1) q in
y, (Internal left x right) :: q, new_q
else x, Leaf :: q, heap_delete_max d (Internal left... | false |
Steel.ST.C.Types.Base.fsti | Steel.ST.C.Types.Base.assert_not_null | val assert_not_null (#t: Type) (#opened: _) (#td: typedef t) (#v: Ghost.erased t) (p: ptr td)
: STGhost (squash (~(p == null _)))
opened
(pts_to_or_null p v)
(fun _ -> pts_to p v)
(~(p == null _))
(fun _ -> True) | val assert_not_null (#t: Type) (#opened: _) (#td: typedef t) (#v: Ghost.erased t) (p: ptr td)
: STGhost (squash (~(p == null _)))
opened
(pts_to_or_null p v)
(fun _ -> pts_to p v)
(~(p == null _))
(fun _ -> True) | let assert_not_null
(#t: Type)
(#opened: _)
(#td: typedef t)
(#v: Ghost.erased t)
(p: ptr td)
: STGhost (squash (~ (p == null _))) opened
(pts_to_or_null p v)
(fun _ -> pts_to p v)
(~ (p == null _))
(fun _ -> True)
= rewrite (pts_to_or_null p v) (pts_to p v) | {
"file_name": "lib/steel/c/Steel.ST.C.Types.Base.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 43,
"end_line": 148,
"start_col": 0,
"start_line": 137
} | module Steel.ST.C.Types.Base
open Steel.ST.Util
module P = Steel.FractionalPermission
/// Helper to compose two permissions into one
val prod_perm (p1 p2: P.perm) : Pure P.perm
(requires True)
(ensures (fun p ->
((p1 `P.lesser_equal_perm` P.full_perm /\ p2 `P.lesser_equal_perm` P.full_perm) ==>
p `P.lesse... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.Util.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": ... | [
{
"abbrev": true,
"full_module": "Steel.FractionalPermission",
"short_module": "P"
},
{
"abbrev": false,
"full_module": "Steel.ST.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.ST.C.Types",
"short_module": null
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: Steel.ST.C.Types.Base.ptr td
-> Steel.ST.Effect.Ghost.STGhost (Prims.squash (~(p == Steel.ST.C.Types.Base.null td))) | Steel.ST.Effect.Ghost.STGhost | [] | [] | [
"Steel.Memory.inames",
"Steel.ST.C.Types.Base.typedef",
"FStar.Ghost.erased",
"Steel.ST.C.Types.Base.ptr",
"Steel.ST.Util.rewrite",
"Steel.ST.C.Types.Base.pts_to_or_null",
"Steel.ST.C.Types.Base.pts_to",
"Prims.unit",
"Prims.squash",
"Prims.l_not",
"Prims.eq2",
"Steel.ST.C.Types.Base.null",
... | [] | false | true | true | false | false | let assert_not_null (#t: Type) (#opened: _) (#td: typedef t) (#v: Ghost.erased t) (p: ptr td)
: STGhost (squash (~(p == null _)))
opened
(pts_to_or_null p v)
(fun _ -> pts_to p v)
(~(p == null _))
(fun _ -> True) =
| rewrite (pts_to_or_null p v) (pts_to p v) | false |
BinomialQueue.fst | BinomialQueue.all_leaf_keys | val all_leaf_keys (l: forest{Cons? l})
: Lemma (requires Cons? l /\ all_leaf l) (ensures permutation (keys l) ms_empty) | val all_leaf_keys (l: forest{Cons? l})
: Lemma (requires Cons? l /\ all_leaf l) (ensures permutation (keys l) ms_empty) | let rec all_leaf_keys (l:forest{Cons? l})
: Lemma
(requires Cons? l /\ all_leaf l)
(ensures permutation (keys l) ms_empty) =
match l with
| [Leaf] -> ()
| Leaf::tl -> all_leaf_keys tl | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 418,
"start_col": 0,
"start_line": 412
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: BinomialQueue.forest{Cons? l}
-> FStar.Pervasives.Lemma (requires Cons? l /\ BinomialQueue.all_leaf l)
(ensures BinomialQueue.permutation (BinomialQueue.keys l) BinomialQueue.ms_empty) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"BinomialQueue.forest",
"Prims.b2t",
"Prims.uu___is_Cons",
"BinomialQueue.tree",
"Prims.list",
"BinomialQueue.all_leaf_keys",
"Prims.unit",
"Prims.l_and",
"BinomialQueue.all_leaf",
"Prims.squash",
"BinomialQueue.permutation",
"BinomialQueue.keys",
"BinomialQueue.ms_empty",
"Prims.Nil",
"... | [
"recursion"
] | false | false | true | false | false | let rec all_leaf_keys (l: forest{Cons? l})
: Lemma (requires Cons? l /\ all_leaf l) (ensures permutation (keys l) ms_empty) =
| match l with
| [Leaf] -> ()
| Leaf :: tl -> all_leaf_keys tl | false |
BinomialQueue.fst | BinomialQueue.compact_preserves_keys | val compact_preserves_keys (q: forest)
: Lemma (permutation (keys q) (keys (mk_compact q))) [SMTPat (keys (mk_compact q))] | val compact_preserves_keys (q: forest)
: Lemma (permutation (keys q) (keys (mk_compact q))) [SMTPat (keys (mk_compact q))] | let rec compact_preserves_keys (q:forest)
: Lemma (permutation (keys q) (keys (mk_compact q)))
[SMTPat (keys (mk_compact q))] =
match q with
| [] -> ()
| _ ->
if all_leaf q
then all_leaf_keys q
else compact_preserves_keys (L.tl q) | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 429,
"start_col": 0,
"start_line": 420
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | q: BinomialQueue.forest
-> FStar.Pervasives.Lemma
(ensures
BinomialQueue.permutation (BinomialQueue.keys q)
(BinomialQueue.keys (BinomialQueue.mk_compact q)))
[SMTPat (BinomialQueue.keys (BinomialQueue.mk_compact q))] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"BinomialQueue.forest",
"Prims.list",
"BinomialQueue.tree",
"BinomialQueue.all_leaf",
"BinomialQueue.all_leaf_keys",
"Prims.bool",
"BinomialQueue.compact_preserves_keys",
"FStar.List.Tot.Base.tl",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"BinomialQueue.permutation",
"BinomialQueue.keys"... | [
"recursion"
] | false | false | true | false | false | let rec compact_preserves_keys (q: forest)
: Lemma (permutation (keys q) (keys (mk_compact q))) [SMTPat (keys (mk_compact q))] =
| match q with
| [] -> ()
| _ -> if all_leaf q then all_leaf_keys q else compact_preserves_keys (L.tl q) | false |
Steel.GhostMonotonicHigherReference.fst | Steel.GhostMonotonicHigherReference.extract_pure | val extract_pure (#a #uses #p #f: _) (r: ref a p) (v: a) (h: (history a p))
: SteelGhostT (_: unit{history_val h v f})
uses
(pts_to_body r f v h)
(fun _ -> pts_to_body r f v h) | val extract_pure (#a #uses #p #f: _) (r: ref a p) (v: a) (h: (history a p))
: SteelGhostT (_: unit{history_val h v f})
uses
(pts_to_body r f v h)
(fun _ -> pts_to_body r f v h) | let extract_pure #a #uses #p #f
(r:ref a p)
(v:a)
(h:(history a p))
: SteelGhostT (_:unit{history_val h v f})
uses
(pts_to_body r f v h)
(fun _ -> pts_to_body r f v h)
= elim_pure (history_val h v f);
A.intro_pure (history_val h... | {
"file_name": "lib/steel/Steel.GhostMonotonicHigherReference.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 36,
"end_line": 84,
"start_col": 0,
"start_line": 75
} | (*
Copyright 2020 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.Preorder.fst.checked",
"Steel.Memory.fsti.checked",
"Steel.GhostPCMReference.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Real.fsti... | [
{
"abbrev": false,
"full_module": "FStar.Real",
"short_module": null
},
{
"abbrev": true,
"full_module": "Steel.Effect.Atomic",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "Steel.GhostPCMReference",
"short_module": "PR"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: Steel.GhostMonotonicHigherReference.ref a p -> v: a -> h: Steel.Preorder.history a p
-> Steel.Effect.Atomic.SteelGhostT
(_: Prims.unit{Steel.Preorder.history_val h (FStar.Ghost.hide v) f}) | Steel.Effect.Atomic.SteelGhostT | [] | [] | [
"Steel.Memory.inames",
"FStar.Preorder.preorder",
"Steel.FractionalPermission.perm",
"Steel.GhostMonotonicHigherReference.ref",
"Steel.Preorder.history",
"Steel.Effect.Atomic.intro_pure",
"Steel.Preorder.history_val",
"FStar.Ghost.hide",
"Prims.unit",
"Steel.Effect.Atomic.elim_pure",
"Steel.Ghos... | [] | false | true | false | false | false | let extract_pure #a #uses #p #f (r: ref a p) (v: a) (h: (history a p))
: SteelGhostT (_: unit{history_val h v f})
uses
(pts_to_body r f v h)
(fun _ -> pts_to_body r f v h) =
| elim_pure (history_val h v f);
A.intro_pure (history_val h v f) | false |
BinomialQueue.fst | BinomialQueue.find_max_emp_repr_r | val find_max_emp_repr_r (l: forest)
: Lemma (requires find_max None l == None) (ensures permutation (keys l) ms_empty) | val find_max_emp_repr_r (l: forest)
: Lemma (requires find_max None l == None) (ensures permutation (keys l) ms_empty) | let rec find_max_emp_repr_r (l:forest)
: Lemma
(requires find_max None l == None)
(ensures permutation (keys l) ms_empty) =
match l with
| [] -> ()
| Leaf::tl -> find_max_emp_repr_r tl
| (Internal _ k _)::tl -> find_max_some_is_some k tl | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 478,
"start_col": 0,
"start_line": 471
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: BinomialQueue.forest
-> FStar.Pervasives.Lemma
(requires
BinomialQueue.find_max FStar.Pervasives.Native.None l == FStar.Pervasives.Native.None)
(ensures BinomialQueue.permutation (BinomialQueue.keys l) BinomialQueue.ms_empty) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"BinomialQueue.forest",
"Prims.list",
"BinomialQueue.tree",
"BinomialQueue.find_max_emp_repr_r",
"BinomialQueue.key_t",
"BinomialQueue.find_max_some_is_some",
"Prims.unit",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"BinomialQueue.find_max",
"FStar.Pervasives.Native.None",
"Prims.squash",
... | [
"recursion"
] | false | false | true | false | false | let rec find_max_emp_repr_r (l: forest)
: Lemma (requires find_max None l == None) (ensures permutation (keys l) ms_empty) =
| match l with
| [] -> ()
| Leaf :: tl -> find_max_emp_repr_r tl
| Internal _ k _ :: tl -> find_max_some_is_some k tl | false |
BinomialQueue.fst | BinomialQueue.find_max_emp_repr_l | val find_max_emp_repr_l (l: priq)
: Lemma (requires l `repr_l` ms_empty) (ensures find_max None l == None) | val find_max_emp_repr_l (l: priq)
: Lemma (requires l `repr_l` ms_empty) (ensures find_max None l == None) | let find_max_emp_repr_l (l:priq)
: Lemma
(requires l `repr_l` ms_empty)
(ensures find_max None l == None) =
match l with
| [] -> ()
| _ -> last_key_in_keys l | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 469,
"start_col": 0,
"start_line": 463
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: BinomialQueue.priq
-> FStar.Pervasives.Lemma (requires BinomialQueue.repr_l l BinomialQueue.ms_empty)
(ensures BinomialQueue.find_max FStar.Pervasives.Native.None l == FStar.Pervasives.Native.None
) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"BinomialQueue.priq",
"Prims.list",
"BinomialQueue.tree",
"BinomialQueue.last_key_in_keys",
"Prims.unit",
"BinomialQueue.repr_l",
"BinomialQueue.ms_empty",
"Prims.squash",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"BinomialQueue.key_t",
"BinomialQueue.find_max",
"FStar.Pervasives.Native... | [] | false | false | true | false | false | let find_max_emp_repr_l (l: priq)
: Lemma (requires l `repr_l` ms_empty) (ensures find_max None l == None) =
| match l with
| [] -> ()
| _ -> last_key_in_keys l | false |
BinomialQueue.fst | BinomialQueue.find_max_some_is_some | val find_max_some_is_some (k: key_t) (l: forest)
: Lemma (ensures Some? (find_max (Some k) l) /\ k <= Some?.v (find_max (Some k) l))
(decreases l) | val find_max_some_is_some (k: key_t) (l: forest)
: Lemma (ensures Some? (find_max (Some k) l) /\ k <= Some?.v (find_max (Some k) l))
(decreases l) | let rec find_max_some_is_some (k:key_t) (l:forest)
: Lemma (ensures Some? (find_max (Some k) l) /\
k <= Some?.v (find_max (Some k) l))
(decreases l) =
match l with
| [] -> ()
| Leaf::tl -> find_max_some_is_some k tl
| (Internal _ k' _)::tl ->
let k = if k < k' then k' else k i... | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 30,
"end_line": 461,
"start_col": 0,
"start_line": 452
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: BinomialQueue.key_t -> l: BinomialQueue.forest
-> FStar.Pervasives.Lemma
(ensures
Some? (BinomialQueue.find_max (FStar.Pervasives.Native.Some k) l) /\
k <= Some?.v (BinomialQueue.find_max (FStar.Pervasives.Native.Some k) l)) (decreases l) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"BinomialQueue.key_t",
"BinomialQueue.forest",
"Prims.list",
"BinomialQueue.tree",
"BinomialQueue.find_max_some_is_some",
"Prims.op_LessThan",
"Prims.bool",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_and",
"Prims.b2t",
"FStar.Pervasives.Native.uu___is_Some",
"BinomialQueue.find... | [
"recursion"
] | false | false | true | false | false | let rec find_max_some_is_some (k: key_t) (l: forest)
: Lemma (ensures Some? (find_max (Some k) l) /\ k <= Some?.v (find_max (Some k) l))
(decreases l) =
| match l with
| [] -> ()
| Leaf :: tl -> find_max_some_is_some k tl
| Internal _ k' _ :: tl ->
let k = if k < k' then k' else k in
find_max_some_is_some k tl | false |
BinomialQueue.fst | BinomialQueue.tree_root_is_max | val tree_root_is_max (d: pos) (t: tree)
: Lemma (requires is_pow2heap d t)
(ensures
(let Internal left k Leaf = t in
max k (keys_of_tree left).ms_elems)) | val tree_root_is_max (d: pos) (t: tree)
: Lemma (requires is_pow2heap d t)
(ensures
(let Internal left k Leaf = t in
max k (keys_of_tree left).ms_elems)) | let tree_root_is_max (d:pos) (t:tree)
: Lemma
(requires is_pow2heap d t)
(ensures
(let Internal left k Leaf = t in
max k (keys_of_tree left).ms_elems)) =
let Internal left k Leaf = t in
tree_root_is_max_aux (d - 1) k left | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 555,
"start_col": 0,
"start_line": 548
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: Prims.pos -> t: BinomialQueue.tree
-> FStar.Pervasives.Lemma (requires BinomialQueue.is_pow2heap d t)
(ensures
(let _ = t in
(let BinomialQueue.Internal left k BinomialQueue.Leaf = _ in
BinomialQueue.max k (Mkms?.ms_elems (BinomialQueue.keys_of_tree left)))
<:
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"BinomialQueue.tree",
"BinomialQueue.key_t",
"BinomialQueue.tree_root_is_max_aux",
"Prims.op_Subtraction",
"Prims.unit",
"BinomialQueue.is_pow2heap",
"Prims.squash",
"BinomialQueue.max",
"BinomialQueue.__proj__Mkms__item__ms_elems",
"BinomialQueue.keys_of_tree",
"Prims.Nil",
"FS... | [] | false | false | true | false | false | let tree_root_is_max (d: pos) (t: tree)
: Lemma (requires is_pow2heap d t)
(ensures
(let Internal left k Leaf = t in
max k (keys_of_tree left).ms_elems)) =
| let Internal left k Leaf = t in
tree_root_is_max_aux (d - 1) k left | false |
BinomialQueue.fst | BinomialQueue.max | val max : k: BinomialQueue.key_t -> s: FStar.Set.set BinomialQueue.key_t -> Prims.logical | let max (k:key_t) (s:S.set key_t) =
forall (x:key_t). Set.mem x s ==> x <= k | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 42,
"end_line": 534,
"start_col": 0,
"start_line": 533
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: BinomialQueue.key_t -> s: FStar.Set.set BinomialQueue.key_t -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"BinomialQueue.key_t",
"FStar.Set.set",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.b2t",
"FStar.Set.mem",
"Prims.op_LessThanOrEqual",
"Prims.logical"
] | [] | false | false | false | true | true | let max (k: key_t) (s: S.set key_t) =
| forall (x: key_t). Set.mem x s ==> x <= k | false | |
BinomialQueue.fst | BinomialQueue.insert_repr | val insert_repr (x:key_t) (q:priq) (s:ms)
: Lemma (requires q `repr` s)
(ensures insert x q `repr` (ms_cons x s)) | val insert_repr (x:key_t) (q:priq) (s:ms)
: Lemma (requires q `repr` s)
(ensures insert x q `repr` (ms_cons x s)) | let insert_repr x q s =
carry_repr 1 q (Internal Leaf x Leaf) s (ms_singleton x) | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 434,
"start_col": 0,
"start_line": 433
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"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: BinomialQueue.key_t -> q: BinomialQueue.priq -> s: BinomialQueue.ms
-> FStar.Pervasives.Lemma (requires BinomialQueue.repr q s)
(ensures BinomialQueue.repr (BinomialQueue.insert x q) (BinomialQueue.ms_cons x s)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"BinomialQueue.key_t",
"BinomialQueue.priq",
"BinomialQueue.ms",
"BinomialQueue.carry_repr",
"BinomialQueue.Internal",
"BinomialQueue.Leaf",
"BinomialQueue.ms_singleton",
"Prims.unit"
] | [] | true | false | true | false | false | let insert_repr x q s =
| carry_repr 1 q (Internal Leaf x Leaf) s (ms_singleton x) | false |
BinomialQueue.fst | BinomialQueue.find_max_mem_keys | val find_max_mem_keys (kopt: option key_t) (q: forest)
: Lemma
(ensures
find_max kopt q == kopt \/
(let kopt = find_max kopt q in
Some? kopt /\ S.mem (Some?.v kopt) (keys q).ms_elems)) (decreases q) | val find_max_mem_keys (kopt: option key_t) (q: forest)
: Lemma
(ensures
find_max kopt q == kopt \/
(let kopt = find_max kopt q in
Some? kopt /\ S.mem (Some?.v kopt) (keys q).ms_elems)) (decreases q) | let rec find_max_mem_keys (kopt:option key_t) (q:forest)
: Lemma
(ensures
find_max kopt q == kopt \/
(let kopt = find_max kopt q in
Some? kopt /\ S.mem (Some?.v kopt) (keys q).ms_elems))
(decreases q) =
match q with
| [] -> ()
| Leaf::q -> find_max_mem_keys kopt q
| (In... | {
"file_name": "examples/data_structures/BinomialQueue.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 605,
"start_col": 0,
"start_line": 589
} | (*
Copyright 2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": true,
"source_file": "BinomialQueue.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": true,
"full_module": "FStar.Set",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prim... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | kopt: FStar.Pervasives.Native.option BinomialQueue.key_t -> q: BinomialQueue.forest
-> FStar.Pervasives.Lemma
(ensures
BinomialQueue.find_max kopt q == kopt \/
(let kopt = BinomialQueue.find_max kopt q in
Some? kopt /\ FStar.Set.mem (Some?.v kopt) (Mkms?.ms_elems (BinomialQueue.keys q)... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"FStar.Pervasives.Native.option",
"BinomialQueue.key_t",
"BinomialQueue.forest",
"Prims.list",
"BinomialQueue.tree",
"BinomialQueue.find_max_mem_keys",
"FStar.Pervasives.Native.Some",
"Prims.op_LessThan",
"Prims.bool",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_or",
"Prims.eq2"... | [
"recursion"
] | false | false | true | false | false | let rec find_max_mem_keys (kopt: option key_t) (q: forest)
: Lemma
(ensures
find_max kopt q == kopt \/
(let kopt = find_max kopt q in
Some? kopt /\ S.mem (Some?.v kopt) (keys q).ms_elems)) (decreases q) =
| match q with
| [] -> ()
| Leaf :: q -> find_max_mem_keys kopt q
| Internal _ k _ :: q ->
match kopt with
| None -> find_max_mem_keys (Some k) q
| Some k' ->
let k = if k' < k then k else k' in
find_max_mem_keys (Some k) q | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.