package binsec

  1. Overview
  2. Docs
Semantic analysis of binary executables

Install

Dune Dependency

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

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.9.0.tbz
sha256=d959c2351b6cac10ffbdaf112769a676c9ad84bf6bc7fefa5cb1daa8d086cc97
sha512=1a3951896f05fb3a4cb05e81830373c75409a69c49323dc82e97c94889927b5f9561e704565a22c2a608842f67063d6c89a330477165b197a40d6ac231c09a7e

doc/binsec.domains/Domains/module-type-S/index.html

Module type Domains.SSource

Sourcetype t
Sourceval pp : Format.formatter -> t -> unit
Sourceval included : size:int -> t -> t -> bool

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

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

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

Sourceval union : size:int -> t -> t -> t
Sourceval 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.

Sourceval is_zero : t -> trilean

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

Sourceval project : size:int -> t -> projection
Sourceval top : int -> t
Sourceval constant : size:int -> Z.t -> t
Sourceval zero : t
Sourceval one : t
Sourceval uminus : size:int -> t -> t
Sourceval uminus_feedback : size:int -> t -> t -> t
Sourceval add : size:int -> t -> t -> t
Sourceval add_feedback : size:int -> t -> t -> t -> t * t
Sourceval sub : size:int -> t -> t -> t
Sourceval sub_feedback : size:int -> t -> t -> t -> t * t
Sourceval mul : size:int -> t -> t -> t
Sourceval mul_feedback : size:int -> t -> t -> t -> t * t
Sourceval smod : size:int -> t -> t -> t
Sourceval smod_feedback : size:int -> t -> t -> t -> t * t
Sourceval umod : size:int -> t -> t -> t
Sourceval umod_feedback : size:int -> t -> t -> t -> t * t
Sourceval udiv : size:int -> t -> t -> t
Sourceval udiv_feedback : size:int -> t -> t -> t -> t * t
Sourceval sdiv : size:int -> t -> t -> t
Sourceval sdiv_feedback : size:int -> t -> t -> t -> t * t
Sourceval append : size1:int -> t -> size2:int -> t -> t
Sourceval append_feedback : size1:int -> t -> size2:int -> t -> t -> t * t
Sourceval equal : size:int -> t -> t -> t
Sourceval equal_feedback : size:int -> t -> t -> t -> t * t
Sourceval diff : size:int -> t -> t -> t
Sourceval diff_feedback : size:int -> t -> t -> t -> t * t
Sourceval ule : size:int -> t -> t -> t
Sourceval ule_feedback : size:int -> t -> t -> t -> t * t
Sourceval uge : size:int -> t -> t -> t
Sourceval uge_feedback : size:int -> t -> t -> t -> t * t
Sourceval ult : size:int -> t -> t -> t
Sourceval ult_feedback : size:int -> t -> t -> t -> t * t
Sourceval ugt : size:int -> t -> t -> t
Sourceval ugt_feedback : size:int -> t -> t -> t -> t * t
Sourceval sle : size:int -> t -> t -> t
Sourceval sle_feedback : size:int -> t -> t -> t -> t * t
Sourceval sge : size:int -> t -> t -> t
Sourceval sge_feedback : size:int -> t -> t -> t -> t * t
Sourceval slt : size:int -> t -> t -> t
Sourceval slt_feedback : size:int -> t -> t -> t -> t * t
Sourceval sgt : size:int -> t -> t -> t
Sourceval sgt_feedback : size:int -> t -> t -> t -> t * t
Sourceval logand : size:int -> t -> t -> t
Sourceval logand_feedback : size:int -> t -> t -> t -> t * t
Sourceval logor : size:int -> t -> t -> t
Sourceval logor_feedback : size:int -> t -> t -> t -> t * t
Sourceval lognot : size:int -> t -> t
Sourceval lognot_feedback : size:int -> t -> t -> t
Sourceval logxor : size:int -> t -> t -> t
Sourceval logxor_feedback : size:int -> t -> t -> t -> t * t
Sourceval shift_left : size:int -> t -> t -> t
Sourceval shift_left_feedback : size:int -> t -> t -> t -> t * t
Sourceval shift_right : size:int -> t -> t -> t
Sourceval shift_right_feedback : size:int -> t -> t -> t -> t * t
Sourceval shift_right_signed : size:int -> t -> t -> t
Sourceval shift_right_signed_feedback : size:int -> t -> t -> t -> t * t
Sourceval rotate_left : size:int -> t -> t -> t
Sourceval rotate_left_feedback : size:int -> t -> t -> t -> t * t
Sourceval rotate_right : size:int -> t -> t -> t
Sourceval rotate_right_feedback : size:int -> t -> t -> t -> t * t
Sourceval uext : int -> size:int -> t -> t
Sourceval uext_feedback : int -> size:int -> t -> t -> t
Sourceval sext : int -> size:int -> t -> t
Sourceval sext_feedback : int -> size:int -> t -> t -> t
Sourceval restrict : lo:int -> hi:int -> size:int -> t -> t
Sourceval restrict_feedback : lo:int -> hi:int -> size:int -> t -> t -> t
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct