package binsec
Semantic analysis of binary executables
Install
Dune Dependency
Authors
-
AAdel Djoudi
-
BBenjamin Farinier
-
CChakib Foulani
-
DDorian Lesbre
-
FFrédéric Recoules
-
GGuillaume Girol
-
JJosselin Feist
-
LLesly-Ann Daniel
-
MManh-Dung Nguyen
-
MMathéo Vergnolle
-
MMathilde Ollivier
-
MMatthieu Lemerre
-
OOlivier Nicole
-
RRichard Bonichon
-
RRobin David
-
SSébastien Bardin
-
SSoline Ducousso
-
TTa Thanh Dinh
-
YYaëlle Vinçont
Maintainers
Sources
binsec-0.7.4.tbz
sha256=ee45b9a6d54aebfb2b860c8fa7548ad85afbf1da3fe65cee10529c8a0934b8d6
sha512=493658d337a96bf6ac7b54b162717aeb31c527348a50552bad8f9b0f3f08791295e89c09b02b3f1c8cfa3913d57625c791e4e80322477e2a5f974ca7d85d57ae
doc/src/binsec.sse/types.ml.html
Source file types.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
(**************************************************************************) (* This file is part of BINSEC. *) (* *) (* Copyright (C) 2016-2023 *) (* 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 licenses/LGPLv2.1). *) (* *) (**************************************************************************) module S = Basic_types.String module I = Basic_types.Int module A = struct type t = string option let equal t t' = match (t, t') with | None, None -> true | Some name, Some name' -> String.equal name name' | (None | Some _), (None | Some _) -> false let compare t t' = match (t, t') with | None, None -> 0 | Some name, Some name' -> String.compare name name' | None, Some _ -> -1 | Some _, None -> 1 let hash = function None -> 129913994 | Some name -> Hashtbl.hash name let default = None end module Expr = Dba.Expr module Var = Dba.Var module Output = struct type format = Bin | Dec | Hex | Ascii type t = | Model | Formula | Slice of (Expr.t * string) list | Value of format * Expr.t | Stream of string | String of string end exception Unknown exception Undef of Var.t exception Uninterp of string exception Non_unique exception Non_mergeable type 'a test = True of 'a | False of 'a | Both of { t : 'a; f : 'a } type target = (Expr.t * string) list option type size = Term.size and 'a interval = 'a Term.interval and unary = Term.unary and binary = Term.binary and 'a operator = 'a Term.operator = | Not : unary operator | Sext : size -> unary operator | Uext : size -> unary operator | Restrict : int interval -> unary operator | Plus : binary operator | Minus : _ operator | Mul : binary operator | Udiv : binary operator (* Corresponds to *) | Umod : binary operator (* the truncated division *) | Sdiv : binary operator (* of C99 and most *) | Smod : binary operator (* processors *) | Or : binary operator | And : binary operator | Xor : binary operator | Concat : binary operator | Lsl : binary operator | Lsr : binary operator | Asr : binary operator | Rol : binary operator | Ror : binary operator | Eq : binary operator | Diff : binary operator | Ule : binary operator | Ult : binary operator | Uge : binary operator | Ugt : binary operator | Sle : binary operator | Slt : binary operator | Sge : binary operator | Sgt : binary operator module type VALUE = sig type t (** Symbolic value *) type state val constant : Bitvector.t -> t val lookup : Var.t -> state -> t val read : addr:t -> int -> Machine.endianness -> state -> t * state val select : string -> addr:t -> int -> Machine.endianness -> state -> t * state val unary : unary operator -> t -> t val binary : binary operator -> t -> t -> t val ite : t -> t -> t -> t val eval : Expr.t -> state -> t end module type STATE = sig type t (** Symbolic state *) module Value : VALUE with type state := t val empty : unit -> t val assume : Value.t -> t -> t option val test : Value.t -> t -> t test val get_value : Value.t -> t -> Bitvector.t val enumerate : Value.t -> ?n:int -> ?except:Bitvector.t list -> t -> (Bitvector.t * t) list val fresh : Var.t -> t -> t val alloc : array:string -> t -> t val assign : Var.t -> Value.t -> t -> t val write : addr:Value.t -> Value.t -> Machine.endianness -> t -> t val store : string -> addr:Value.t -> Value.t -> Machine.endianness -> t -> t val memcpy : addr:Bitvector.t -> int -> Loader_buf.t -> t -> t val merge : t -> t -> t val pp : Format.formatter -> t -> unit val pp_smt : target -> Format.formatter -> t -> unit val as_ascii : name:string -> t -> string val as_c_string : name:string -> t -> string val to_formula : t -> Formula.formula end module type EXPLORATION_STATISTICS = sig val get_paths : unit -> int val get_completed_paths : unit -> int val get_unknown_paths : unit -> int val get_pending_paths : unit -> int val get_total_asserts : unit -> int val get_failed_asserts : unit -> int val get_branches : unit -> int val get_max_depth : unit -> int val get_instructions : unit -> int val get_unique_insts : unit -> int val get_time : unit -> float val reset : unit -> unit val add_path : unit -> unit val terminate_path : unit -> unit val interrupt_path : unit -> unit val add_assert : unit -> unit val add_failed_assert : unit -> unit val add_branch : unit -> unit val update_depth : int -> unit val add_instructions : int -> unit val register_address : Virtual_address.t -> unit val pp : Format.formatter -> unit -> unit val to_toml : unit -> Toml.Types.table end module type QUERY_STATISTICS = sig module Preprocess : sig val get_sat : unit -> int val get_unsat : unit -> int val get_const : unit -> int val incr_sat : unit -> unit val incr_unsat : unit -> unit val incr_const : unit -> unit val pp : Format.formatter -> unit -> unit val to_toml : unit -> Toml.Types.table end module Solver : sig val get_sat : unit -> int val get_unsat : unit -> int val get_err : unit -> int val get_time : unit -> float val incr_sat : unit -> unit val incr_unsat : unit -> unit val incr_err : unit -> unit val start_timer : unit -> unit val stop_timer : unit -> unit val pp : Format.formatter -> unit -> unit val to_toml : unit -> Toml.Types.table end val reset : unit -> unit val pp : Format.formatter -> unit -> unit end module type STATE_FACTORY = functor (QS : QUERY_STATISTICS) -> STATE module type WORKLIST = sig type 'a t val push : 'a -> 'a t -> 'a t val pop : 'a t -> 'a * 'a t val singleton : 'a -> 'a t val length : 'a t -> int val is_empty : 'a t -> bool val empty : 'a t end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>