package codex
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
The Codex library for building static analysers based on abstract interpretation
Install
dune-project
Dependency
Authors
Maintainers
Sources
1.0-rc4.tar.gz
md5=bc7266a140c6886add673ede90e335d3
sha512=8da42c0ff2c1098c5f9cb2b5b43b306faf7ac93b8f5ae00c176918cee761f249ff45b29309f31a05bbcf6312304f86a0d5a000eb3f1094d3d3c2b9b4c7f5c386
doc/src/codex.domains/assert_false_domain.ml.html
Source file assert_false_domain.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401(**************************************************************************) (* This file is part of the Codex semantics library. *) (* *) (* Copyright (C) 2013-2025 *) (* CEA (Commissariat à l'énergie atomique et aux énergies *) (* alternatives) *) (* *) (* you can redistribute it and/or modify it under the terms of the GNU *) (* Lesser General Public License as published by the Free Software *) (* Foundation, version 2.1. *) (* *) (* It is distributed in the hope that it will be useful, *) (* but WITHOUT ANY WARRANTY; without even the implied warranty of *) (* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *) (* GNU Lesser General Public License for more details. *) (* *) (* See the GNU Lesser General Public License version 2.1 *) (* for more details (enclosed in the file LICENSE). *) (* *) (**************************************************************************) (* TODO: The identifier for unimplemented should be an argument here too. *) (* ALso this should be renamed to unimplemented. *) module Dummy_Enum_Lattice = Lattices.Unimplemented.Enum_Lattice(struct let loc = __LOC__ end) open Units (* Used to create dummy types to fill the signatures, even when the abstract domain does not support the type. *) module Boolean = struct module Boolean_Backward = struct let (||) _ _ _ = assert false let (&&) _ _ _ = assert false let not _ _ = assert false let assume _cond _store _result = assert false end module Boolean_Forward = struct let (||) _ _ = assert false let (&&) _ _ = assert false let not _ = assert false let assume _cond _store = assert false let true_ _ = assert false let false_ _ = assert false let unknown ?level _ = assert false end end module Integer = struct module Integer_Forward = struct let one _ = assert false let zero _ = assert false let ile _ = assert false let ieq _ = assert false let isub _ = assert false let iconst _ = assert false let assume _ = assert false let iunknown _ = assert false let ixor _ = assert false let ior _ = assert false let iand _ = assert false let ishr _ = assert false let ishl _ = assert false let imod _ = assert false let idiv _ = assert false let imul _ = assert false let iadd _ = assert false let itimes _ = assert false end end module Binary = struct module Binary_Forward = struct let beq ~size _ _ = assert false let biule ~size _ _ = assert false let bisle ~size _ _ = assert false let bitimes ~size _ _ = assert false let biadd ~size ~flags _ _ = assert false let bisub ~size ~flags _ _ = assert false let bimul ~size ~flags _ _ = assert false let bxor ~size _ _ = assert false let band ~size _ _ = assert false let bor ~size _ _ = assert false let nondet ~size l = assert false let assume ~size _cond _store = assert false let bsext ~size ~oldsize _ = assert false let buext ~size ~oldsize _ = assert false let bofbool ~size _ = assert false let bchoose ~size _ _ = assert false let bashr ~size _ _ = assert false let blshr ~size _ _ = assert false let bshl ~size ~flags _ _ = assert false let bisdiv ~size _ _ = assert false let biudiv ~size _ _ = assert false let bconcat ~size1 ~size2 b1 b2 = assert false let bismod ~size _ _ = assert false let biumod ~size _ _ = assert false let bextract ~size ~index ~oldsize _ = assert false let valid ~size _ = assert false let valid_ptr_arith ~size _ = assert false let bunknown ~size _ = assert false let baddr ~size _ = assert false let biconst ~size _ = assert false let buninit ~size _ = assert false let bshift ~size ~offset ~max _ = assert false let bindex ~size _ = assert false end module Binary_Backward = struct let beq _ _ _ = assert false let biule _ _ _ = assert false let bisle _ _ _ = assert false let bitimes _ _ _ = assert false let biadd _ _ _ = assert false let bimul ~size _ _ _ = assert false let bxor ~size _ _ _ = assert false let band ~size _ _ _ = assert false let bor ~size _ _ _ = assert false let assume ~size _cond _store _result = assert false let bsext ~size _ _ = assert false let buext ~size _ _ = assert false let bashr ~size _ _ _ = assert false let blshr ~size _ _ _ = assert false let bshl ~size ~flags _ _ _ = assert false let bisdiv _ _ _ = assert false let bconcat ~size1 ~size2 b1 b2 result = assert false let bismod _ _ _ = assert false let bextract ~size ~index ~oldsize _ _ = assert false let valid ~size _ _ = assert false let bshift ~size _ = assert false let bindex ~size _ = assert false end end module Enum = struct module Enum_Forward = struct let caseof ~case:_ _ = assert false let enum_const ~case:_ = assert false end end (* A commodity to start implementing domains; start from here, then complete things as needed. *) module Domain: Sig.BASE = struct let name() = "assert false" let unique_id() = Sig.Fresh_id.fresh @@ name();; module Types = struct type binary = unit type enum = unit type integer = unit type boolean = unit end include Types (**************** Root context ****************) [@@@ocaml.warning "-69"] type mu_context = { mu_ctx: context; (* Context corresponding to this mu_context *) mu_parent_ctx: context; (* Parent of the current context. *) } and root_context = { root_ctx: context; (* Context corresponding to this root_context *) } and context_ = | Mu_context of mu_context | Root_context of root_context and context = { ctx:context_; level:int; } ;; [@@@ocaml.warning "+69"] let root_context() = let rec root_ctx = { root_ctx = ctx; } and ctx = { ctx = Root_context root_ctx; level = 0; } in ctx ;; let context_pretty _ = assert false (**************** Fixpoint computation ****************) let mu_context_fixpoint_step3 ctx ~arg_body = assert false let mu_context_upcast ctx = assert false let mu_context_open parent_ctx = let rec mu_ctx = { mu_ctx = ctx; mu_parent_ctx = parent_ctx} and ctx = { ctx = Mu_context mu_ctx; level = parent_ctx.level + 1; } in ctx module Serialize = struct module T = Types (* A lazy version of serialization functions. *) type 'a in_tuple = | InEmpty: unit in_tuple | InInteger: T.integer * T.integer * 'a in_tuple -> (T.integer * 'a) in_tuple | InBoolean: T.boolean * T.boolean * 'a in_tuple -> (T.boolean * 'a) in_tuple | InEnum: T.enum * T.enum * 'a in_tuple -> (T.enum * 'a) in_tuple | InBinary: In_bits.t * T.binary * T.binary * 'a in_tuple -> (T.binary * 'a) in_tuple type 'a in_acc = bool * 'a in_tuple type 'a out_tuple = | OutEmpty: unit out_tuple | OutInteger: T.integer * 'a out_tuple -> (T.integer * 'a) out_tuple | OutBoolean: T.boolean * 'a out_tuple -> (T.boolean * 'a) out_tuple | OutEnum: T.enum * 'a out_tuple -> (T.enum * 'a) out_tuple | OutBinary: int * T.binary * 'a out_tuple -> (T.binary * 'a) out_tuple type empty_tuple = unit let empty_tuple () = InEmpty let push_integers a b tup = InInteger(a,b,tup) let push_booleans a b tup = InBoolean(a,b,tup) let push_binaries ~size a b tup = InBinary(size,a,b,tup) let push_enumeration a b tup = InEnum(a,b,tup) [@@@warning "-8"] let pop_integer (OutInteger(x,tup)) = x,tup let pop_boolean (OutBoolean(x,tup)) = x,tup let pop_binary (OutBinary(_,x,tup)) = x,tup let pop_enumeration (OutEnum(x,tup)) = x,tup [@@@warning "+8"] module Context = struct type t = context let level x = x.level let copy x = x let assign _ = assert false type nonrec 'a in_tuple = 'a in_tuple type nonrec 'a out_tuple = 'a out_tuple type nonrec 'a in_acc = 'a in_acc type nonrec empty_tuple = empty_tuple let empty_tuple = empty_tuple type ('a,'b) result = Result: bool * 'some in_tuple * (t -> 'some out_tuple -> 'a * 'b out_tuple) -> ('a,'b) result end open Context (* On pourrait vouloir fournir ces fonctions a la place de celles que j'utilise (push_int,pop_int). Mais elles sont peut-etre moins pratiques pour le produit de domaines? *) let serialize_integer: widens:bool -> 'any -> T.integer -> 'any -> T.integer -> 'a in_acc -> (T.integer,'a) result = fun ~widens _ a _ b (included,old) -> let tup = push_integers a b old in Result(included, tup, fun _ctx x -> pop_integer x) ;; let serialize_enum: 'any -> T.enum -> 'any -> T.enum -> 'a in_acc -> (T.enum,'a) result = fun _ a _ b (inc,old) -> let tup = push_enumeration a b old in Result(inc, tup, fun _ctx x -> pop_enumeration x) ;; let serialize_boolean: 'any -> T.boolean -> 'any -> T.boolean -> 'a in_acc -> (T.boolean,'a) result = fun _ a _ b (included,old) -> (* Instead of using a default implementation, we should be immediately serializing to the domain below for instance. *) (* Codex_log.warning "avoid using the default implementation of serialize_* functions"; *) let tup = push_booleans a b old in Result(included, tup, fun _ctx x -> pop_boolean x) ;; let serialize_binary: widens:bool -> size:In_bits.t -> 'any -> T.binary -> 'any -> T.binary -> 'a in_acc -> (T.binary,'a) result = fun ~widens ~size _ a _ b (inc,old) -> let tup = push_binaries ~size a b old in Result(inc, tup, fun _ctx x -> pop_binary x) ;; let typed_nondet2 _ = assert false let nondet_same_context _ = assert false let typed_fixpoint_step _ = assert false let widened_fixpoint_step ~widening_id ~previous ~next _ = assert false end include Serialize module Boolean_Forward = Boolean.Boolean_Forward module Integer_Forward = Integer.Integer_Forward module Binary_Forward = Binary.Binary_Forward module Enum_Forward = Enum.Enum_Forward module Binary = Datatype_sig.Unit module Enum = Datatype_sig.Unit module Integer = Datatype_sig.Unit module Boolean = Datatype_sig.Unit let binary_is_bottom ~size ctx = assert false let boolean_is_bottom ctx = assert false (**************** Pretty printing ****************) let binary_pretty ~size ctx fmt = assert false let boolean_pretty ctx fmt = assert false let integer_pretty _ = assert false let enum_pretty _ = assert false (**************** Tuple fonctions ****************) let tuple_bottom _ = assert false let new_tuple_nondet2 _ = assert false let typed_fixpoint_step ~iteration:_ ~init:_ ~arg:_ ~body:_ = assert false let tuple_pretty _ = assert false let assume ctx bool = assert false let imperative_assume ctx bool = assert false (**************** Queries ****************) module Query = struct let reachable _ = assert false let boolean _ = assert false let binary ~size _ = assert false let integer _ = assert false let convert_to_ival _ = assert false let convert_to_quadrivalent _ = assert false let binary_to_ival ~signed ~size _ = assert false let binary_to_known_bits ~size _ = assert false let binary_is_empty ~size _ = assert false let binary_fold_crop ~size bin ~inf ~sup f acc = assert false let is_singleton_int _ = assert false let binary_is_singleton ~size _ = assert false module Boolean_Lattice = Lattices.Quadrivalent module Integer_Lattice = Lattices.Unit module Binary_Lattice = Lattices.Unimplemented.Bitvector_Lattice(struct type t = unit let loc = __LOC__ end) let enum _ = assert false let is_singleton_enum _ = assert false let enum_to_values _ = assert false module Enum_Lattice = Dummy_Enum_Lattice end let binary_is_empty ~size _ = assert false let integer_is_empty _ = assert false let boolean_is_empty _ = assert false let builtin _ = assert false let binary_empty ~size _ = assert false let integer_empty _ = assert false let boolean_empty _ = assert false let enum_empty _ = assert false let binary_unknown ~size _ = assert false let integer_unknown _ = assert false let boolean_unknown _ = assert false let enum_unknown ~enumsize:_ _ = assert false (* Assume. *) let assume_binary ~size _ _ = assert false let assume_boolean _ctx _ _ = assert false let assume_integer _ctx _ _ = assert false let reachable _ = assert false let satisfiable _ = assert false let unknown_condition _ ?level = assert false let unknown_choice _ ?level = assert false (* type binary_set = binary *) type choice = unit type condition = unit let union _ = assert false let choose_binary ~size _ = assert false let binary_unknown_typed ~size:_ _ = assert false let query_boolean = Query.boolean end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>