package binsec

  1. Overview
  2. Docs
Semantic analysis of binary executables

Install 

dune-project
 Dependency

binsec.github.io Readme Changelog LGPL-2.1-or-later License Edit opam file Versions (19)

Authors

  1. A
    Adel Djoudi
  2. B
    Benjamin Farinier
  3. C
    Chakib Foulani
  4. D
    Dorian Lesbre
  5. F
    Frédéric Recoules
  6. G
    Guillaume Girol
  7. J
    Josselin Feist
  8. L
    Lesly-Ann Daniel
  9. M
    Mahmudul Faisal Al Ameen
  10. M
    Manh-Dung Nguyen
  11. M
    Mathéo Vergnolle
  12. M
    Mathilde Ollivier
  13. M
    Matthieu Lemerre
  14. N
    Nicolas Bellec
  15. O
    Olivier Nicole
  16. R
    Richard Bonichon
  17. R
    Robin David
  18. S
    Sébastien Bardin
  19. S
    Soline Ducousso
  20. T
    Ta Thanh Dinh
  21. Y
    Yaëlle Vinçont
  22. Y
    Yanis Sellami

Maintainers

  1. B
    BINSEC <binsec@saxifrage.saclay.cea.fr>

Sources

binsec-0.11.0.tbz
sha256=4cf70a0367fef6f33ee3165f05255914513ea0539b94ddfef0bd46fc9b42fa8a
sha512=cd67a5b7617f661a7786bef0c828ee55307cef5260dfecbb700a618be795d81b1ac49fc1a18c4904fd2eb8a182dc862b0159093028651e78e7dc743f5babf9e3

doc/binsec.symbolic/Binsec_symbolic/Default/Expr/index.html

Module Default.Expr

include Binsec_kernel.Term.S with type a := string and type b := [ `Some ] Binsec_symbolic__Default__.Types.Memory.node
type nonrec size = Binsec_base.Term.size
type nonrec 'a interval = 'a Binsec_base.Term.interval = {
  1. lo : 'a;
  2. hi : 'a;
}
type nonrec endianness = Binsec_base.Term.endianness =
  1. | LittleEndian
  2. | BigEndian
type ('k, 'a, 'b) term = private ('k, 'a, 'b) Binsec_base.Term.t =
  1. | Var : {
    1. hash : int;
    2. size : size;
    3. name : string;
    4. label : 'a;
    } -> ([< `Var | `Loc | `Exp ], 'a, _) term
  2. | Load : {
    1. hash : int;
    2. len : size;
    3. dir : endianness;
    4. mutable addr : ([ `Exp ], 'a, 'b) term;
    5. label : 'b;
    } -> ([< `Mem | `Loc | `Exp ], 'a, 'b) term
  3. | Cst : Binsec_base.Bitvector.t -> ([< `Cst | `Exp ], _, _) term
  4. | Unary : {
    1. hash : int;
    2. size : size;
    3. f : Binsec_base.Term.unary Binsec_base.Term.operator;
    4. mutable x : ([ `Exp ], 'a, 'b) term;
    } -> ([< `Unary | `Exp ], 'a, 'b) term
  5. | Binary : {
    1. hash : int;
    2. size : size;
    3. f : Binsec_base.Term.binary Binsec_base.Term.operator;
    4. mutable x : ([ `Exp ], 'a, 'b) term;
    5. mutable y : ([ `Exp ], 'a, 'b) term;
    } -> ([< `Binary | `Exp ], 'a, 'b) term
  6. | Ite : {
    1. hash : int;
    2. size : size;
    3. mutable c : ([ `Exp ], 'a, 'b) term;
    4. mutable t : ([ `Exp ], 'a, 'b) term;
    5. mutable e : ([ `Exp ], 'a, 'b) term;
    } -> ([< `Ite | `Exp ], 'a, 'b) term
type t = ([ `Exp ], string, [ `Some ] Binsec_symbolic__Default__.Types.Memory.node) term

Smart constructors

val var : string -> size -> string -> t

var name bitsize label

val load : size -> endianness -> t -> [ `Some ] Binsec_symbolic__Default__.Types.Memory.node -> t

load nbytes endianness addr label

val constant : Binsec_base.Bitvector.t -> t

constant bv creates a constant expression from the bitvector bv.

val unary : Binsec_base.Term.unary op -> t -> t

unary f x creates a unary application of f on x.

val binary : Binsec_base.Term.binary op -> t -> t -> t

binary f x y creates a binary application of f on x and y.

val ite : t -> t -> t -> t

ite c t e creates an if-then-else expression c ? t : e.

val uminus : t -> t
val add : t -> t -> t
val sub : t -> t -> t
val mul : t -> t -> t
val srem : t -> t -> t
val urem : t -> t -> t
val udiv : t -> t -> t
val sdiv : t -> t -> t
val append : t -> t -> t
val equal : t -> t -> t
val diff : t -> t -> t
val ule : t -> t -> t
val uge : t -> t -> t
val ult : t -> t -> t
val ugt : t -> t -> t
val sle : t -> t -> t
val sge : t -> t -> t
val slt : t -> t -> t
val sgt : t -> t -> t
val logand : t -> t -> t
val logor : t -> t -> t
val lognot : t -> t
val logxor : t -> t -> t
val shift_left : t -> t -> t
val shift_right : t -> t -> t
val shift_right_signed : t -> t -> t

shift_(left|right) e q shifts expression e by quantity q, padding with zeroes

val rotate_left : t -> t -> t
val rotate_right : t -> t -> t

rotate_(left|right) e q rotates expression e by quantity q

val sext : size -> t -> t

sext sz e performs a signed extension of expression e to size sz

val uext : size -> t -> t

uext sz e performs an unsigned extension expression e to size sz

val restrict : lo:int -> hi:int -> t -> t

restrict lo hi e creates Dba.ExprUnary(Restrict(lo, hi), e) if hi >= lo && lo >=0.

val bit_restrict : int -> t -> t

bit_restrict o e is restrict o o e

val byte_swap : t -> t

byte_swap e reverses the byte order of the expression e

Specific constants

val zeros : int -> t

zeros n creates a constant expression of value 0 with length n

val ones : int -> t

ones n creates a constant expression of value 1 with length n. I.e.; it has (n - 1) zeros in binary.

val one : t
val zero : t
val addi : t -> int -> t
val addz : t -> Z.t -> t
Utils
val hash : t -> int

hash t returns the hash of t in constant time.

val is_equal : t -> t -> bool
val compare : t -> t -> int
val sizeof : t -> size

sizeof t returns the bit size of t in constant time.

val map : (string -> int -> 'a -> t) -> (int -> Binsec_base.Machine.endianness -> t -> 'b -> t) -> (_, 'a, 'b) term -> t
val _unary : Binsec_base.Term.unary op -> t -> t

Raw constructors

_unary f x creates a unary application of f on x.

val _binary : Binsec_base.Term.binary op -> t -> t -> t

_binary f x y creates a binary application of f on x and y.

val _ite : t -> t -> t -> t

_ite c t e creates an if-then-else expression c ? t : e.

module Set : sig ... end
module Map : sig ... end
module Hmap : sig ... end
module Tbl : sig ... end