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 (22)

Authors

  1. A
    Adel Djoudi
  2. B
    Benoit Boero
  3. B
    Benjamin Farinier
  4. C
    Chakib Foulani
  5. D
    Dorian Lesbre
  6. F
    Frédéric Recoules
  7. G
    Guillaume Girol
  8. J
    Josselin Feist
  9. L
    Lesly-Ann Daniel
  10. M
    Mahmudul Faisal Al Ameen
  11. M
    Manh-Dung Nguyen
  12. M
    Mathéo Vergnolle
  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.3.tbz
sha256=93f6fe439d486b166062ef6dd92c4ce3aa0947b5e18b1c3aa7de2fc3003aa6d9
sha512=98feb2b0a3f0a33fe912e9885311dd1c051768c707437f8ef038a8489fec019960142b588c6973eb8f726a14d9b2a1b4c765d915539911cb9f6ed6da9f1e51f2

doc/binsec.domains/Binsec_domains/Domains/Interval/index.html

Module Domains.Interval

type t = private {
  1. min : Z.t;
  2. max : Z.t;
  3. stride : int;
}

Represents the unsigned fixed-width integer interval between min and max, with stride fixed bits.

include S with type t := t
type id +=
  1. | T : t id
val pp : Format.formatter -> t -> unit
val included : size:int -> t -> t -> bool

included ~size t t' tests if all values in t are in t'.

val disjoint : size:int -> t -> t -> bool

disjoint ~size t t' returns true if the intersection between t and t' is empty.

val union : size:int -> t -> t -> t
val inter : size:int -> t -> t -> t

inter ~size t t' returns the intersection of the intervals t and t'.

  • raises Empty

    If there is no intersection.

val is_point : size:int -> t -> bool

is_point ~size t checks if t has a unique value

val is_zero : t -> trilean

is_zero t checks if t is the least significant bit is 0

val cardinal : size:int -> t -> Z.t
val iter : (Z.t -> unit) -> size:int -> t -> unit
val fold : (Z.t -> 'a -> 'a) -> 'a -> size:int -> t -> 'a
val project : size:int -> t -> projection
val top : int -> t
val constant : size:int -> Z.t -> t
val zero : t
val one : t
val uminus : size:int -> t -> t
val uminus_feedback : size:int -> t -> t -> t
val add : size:int -> t -> t -> t
val add_feedback : size:int -> t -> t -> t -> t * t
val sub : size:int -> t -> t -> t
val sub_feedback : size:int -> t -> t -> t -> t * t
val mul : size:int -> t -> t -> t
val mul_feedback : size:int -> t -> t -> t -> t * t
val srem : size:int -> t -> t -> t
val srem_feedback : size:int -> t -> t -> t -> t * t
val urem : size:int -> t -> t -> t
val urem_feedback : size:int -> t -> t -> t -> t * t
val udiv : size:int -> t -> t -> t
val udiv_feedback : size:int -> t -> t -> t -> t * t
val sdiv : size:int -> t -> t -> t
val sdiv_feedback : size:int -> t -> t -> t -> t * t
val append : size1:int -> t -> size2:int -> t -> t
val append_feedback : size1:int -> t -> size2:int -> t -> t -> t * t
val equal : size:int -> t -> t -> t
val equal_feedback : size:int -> t -> t -> t -> t * t
val diff : size:int -> t -> t -> t
val diff_feedback : size:int -> t -> t -> t -> t * t
val ule : size:int -> t -> t -> t
val ule_feedback : size:int -> t -> t -> t -> t * t
val uge : size:int -> t -> t -> t
val uge_feedback : size:int -> t -> t -> t -> t * t
val ult : size:int -> t -> t -> t
val ult_feedback : size:int -> t -> t -> t -> t * t
val ugt : size:int -> t -> t -> t
val ugt_feedback : size:int -> t -> t -> t -> t * t
val sle : size:int -> t -> t -> t
val sle_feedback : size:int -> t -> t -> t -> t * t
val sge : size:int -> t -> t -> t
val sge_feedback : size:int -> t -> t -> t -> t * t
val slt : size:int -> t -> t -> t
val slt_feedback : size:int -> t -> t -> t -> t * t
val sgt : size:int -> t -> t -> t
val sgt_feedback : size:int -> t -> t -> t -> t * t
val logand : size:int -> t -> t -> t
val logand_feedback : size:int -> t -> t -> t -> t * t
val logor : size:int -> t -> t -> t
val logor_feedback : size:int -> t -> t -> t -> t * t
val lognot : size:int -> t -> t
val lognot_feedback : size:int -> t -> t -> t
val logxor : size:int -> t -> t -> t
val logxor_feedback : size:int -> t -> t -> t -> t * t
val shift_left : size:int -> t -> t -> t
val shift_left_feedback : size:int -> t -> t -> t -> t * t
val shift_right : size:int -> t -> t -> t
val shift_right_feedback : size:int -> t -> t -> t -> t * t
val shift_right_signed : size:int -> t -> t -> t
val shift_right_signed_feedback : size:int -> t -> t -> t -> t * t
val rotate_left : size:int -> t -> t -> t
val rotate_left_feedback : size:int -> t -> t -> t -> t * t
val rotate_right : size:int -> t -> t -> t
val rotate_right_feedback : size:int -> t -> t -> t -> t * t
val uext : int -> size:int -> t -> t
val uext_feedback : int -> size:int -> t -> t -> t
val sext : int -> size:int -> t -> t
val sext_feedback : int -> size:int -> t -> t -> t
val restrict : lo:int -> hi:int -> size:int -> t -> t
val restrict_feedback : lo:int -> hi:int -> size:int -> t -> t -> t
val zeros : int -> t
val ones : int -> t
val create : size:int -> min:Z.t -> max:Z.t -> stride:int -> t
val mem : Z.t -> size:int -> t -> bool
val for_all : (Z.t -> bool) -> size:int -> t -> bool
val sum : size:int -> t -> Z.t