Searched refs:check (Results 176 - 200 of 382) sorted by relevance

1234567891011>>

/seL4-l4v-10.1.1/HOL4/src/simp/src/
H A DCache.sml266 fun RCACHE (dpfvs, check, conv) = let
281 val _ = if check t then ()
/seL4-l4v-10.1.1/isabelle/src/Pure/Thy/
H A Dpresent.scala281 root_bash(document_format) + " " + File.bash_path(document_target) + "; fi").check
/seL4-l4v-10.1.1/HOL4/polyml/basis/
H A DString.sml54 (* Since we've covered the full range from 0 to 255 we don't need a bounds check. *)
141 to check the argument and then convert it. *)
256 we still check it here in unsignedShortOrRaiseSize. *)
340 else if p (sub(s, i)) (* TODO: We don't need sub to do the range check here *)
991 as integers and convert and check when we've finished. *)
1488 QUESTION: The check i'+n' >= i does not guarantee that ss is to the left of ss',
1493 (* First check with pointer equality and only if that fails do we use the
1556 (* Because m and n are word values n-m is UNSIGNED so we have to check
/seL4-l4v-10.1.1/l4v/isabelle/src/Pure/Thy/
H A Dpresent.scala281 root_bash(document_format) + " " + File.bash_path(document_target) + "; fi").check
/seL4-l4v-10.1.1/HOL4/examples/dev/AES/curried/
H A DaesScript.sml183 (* Sanity check *)
/seL4-l4v-10.1.1/HOL4/examples/dev/AES/tupled/
H A DaesScript.sml184 (* Sanity check *)
/seL4-l4v-10.1.1/HOL4/examples/dev/AES/word8/
H A DaesScript.sml192 (* Sanity check *)
/seL4-l4v-10.1.1/HOL4/examples/dev/sw/examples/
H A Dsimple_examples.sml126 (*equivalence proof does not terminate, therefore use false for equivalence check parameter
/seL4-l4v-10.1.1/HOL4/examples/dev/sw/
H A DpreARMSyntax.sml50 (* check whether the pc is in the destination list *)
/seL4-l4v-10.1.1/HOL4/examples/dev/sw/working/0.1/
H A DpreARMSyntax.sml50 (* check whether the pc is in the destination list *)
/seL4-l4v-10.1.1/HOL4/examples/dev/sw/working/0.2/
H A DpreARMSyntax.sml50 (* check whether the pc is in the destination list *)
/seL4-l4v-10.1.1/HOL4/examples/l3-machine-code/arm8/model/
H A Darm8AssemblerLib.sml12 (* Validity check for EncodeBitMask
/seL4-l4v-10.1.1/HOL4/src/0/
H A DNet.sml51 * the bound variable with a free one. Therefore we make a separate check *
/seL4-l4v-10.1.1/HOL4/src/1/
H A DPmatch.sml495 let fun check [] = true function
496 | check (v::rst) =
502 else check rst
503 in check (FV_multiset pat)
H A DSanity.sml3 (* Sanity checks for theorems stored in DB. This is intended to check for *)
/seL4-l4v-10.1.1/HOL4/src/HolSat/sat_solvers/minisat/
H A DSolver.C130 check(enqueue((*c)[0], c));
723 check(assume(~Lit(next)));
/seL4-l4v-10.1.1/HOL4/src/HolSmt/
H A DSmtLib_Logics.sml82 check that the input satisfies the linearity constraints that are
/seL4-l4v-10.1.1/HOL4/src/coretypes/
H A DpairScript.sml795 S "local fun check [] = true", NL,
796 S " | check (h::t) = is_var h andalso not(mem h t) andalso check t", NL,
798 S "fun is_vstruct M = check (strip_pair M)",
H A Dselftest.sml43 (* check LET_INTRO *)
/seL4-l4v-10.1.1/HOL4/src/new-datatype/
H A DWitness.sml155 (* 4: emptiness check *)
/seL4-l4v-10.1.1/HOL4/src/parse/
H A Dterm_pp_utils.sml85 We might vary this. In particular, in 2., we could check to see
/seL4-l4v-10.1.1/HOL4/src/pattern_matches/
H A DconstrFamiliesLib.sig18 (* check whether a constructor has no arguments *)
H A DpatternMatchesLib.sml591 (* For removing redundant rows we want to check whether
2076 (* check whether it got simpler, if not try full simp including propagating
2122 (* check whether it got simpler *)
2176 (* check whether it got simpler *)
3079 (* Sanity check *)
3324 (* check whether we should really process tm *)
3371 (* get rid of exhaustiveness check *)
3496 (* check whether we should really process tm *)
3742 (* check whether they can be *)
3907 (* check guar
[all...]
/seL4-l4v-10.1.1/HOL4/src/res_quan/Manual/
H A Dsummacs.tex25 % check to see if this macro file has already been loaded
/seL4-l4v-10.1.1/HOL4/src/res_quan/src/
H A Dres_quanScript.sml378 (* Sanity check for RES_ABSTRACT definition suggested by Lockwood Morris *)

Completed in 361 milliseconds

1234567891011>>