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 (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
    Manh-Dung Nguyen
  10. M
    Mathéo Vergnolle
  11. M
    Mathilde Ollivier
  12. M
    Matthieu Lemerre
  13. O
    Olivier Nicole
  14. R
    Richard Bonichon
  15. R
    Robin David
  16. S
    Sébastien Bardin
  17. S
    Soline Ducousso
  18. T
    Ta Thanh Dinh
  19. Y
    Yaëlle Vinçont

Maintainers

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

Sources

binsec-0.7.1.tbz
sha256=2f990f80ebd06b71af4fde46c6a248eb74d52c6f46be63bdf97d99f72589db13
sha512=38d93ae20ae58e10027eb0f7669d3ab960ddc640526018fc94008ccd6cb63ec99030d0ee39dfb9cbd0d5e144db4615c9027bd2adcb197fc75676c45dbb54f836

doc/binsec/Binsec/Dhunk/index.html

Module Binsec.Dhunk

DBA hunks, aka dhunk

DBA blocks
type t

A DBA block represents a set of DBA instructions with explicit links to the next one. The first instruction of the block always has id 0. Typically, DBA a block is the translation of one binary/assembly instruction.

val empty : t

The one and only empty DBA hunk. Get it here!

val stop : t

A simple dhunk of one instruction stopping with an OK Dba.state

val is_empty : t -> bool
val init : int -> (int -> Dba.Instr.t) -> t
val singleton : Dba.Instr.t -> t
val goto : Virtual_address.t -> t

A simple dhunk of one instruction jumping to the virtual address.

val length : t -> int
val inst : t -> int -> Dba.Instr.t option
val inst_exn : t -> int -> Dba.Instr.t
val start : t -> int

start b is the first index of block b

val exits : t -> int list

exits b are the instruction indexes which end the block b

val copy : t -> t
val iter : f:(Dba.Instr.t -> unit) -> t -> unit
val iteri : f:(int -> Dba.Instr.t -> unit) -> t -> unit
val of_list : Dba.Instr.t list -> t

of_list l assumes the list is sorted in increasing order inside the block

val of_labelled_list : (int * Dba.Instr.t) list -> t

of_list l assumes the list is sorted in increasing order inside the block, i.e. the labels are contiguous starting from 0.

val mapi : f:(int -> Dba.Instr.t -> Dba.Instr.t) -> t -> t
val flatten : t -> (int * Dba.Instr.t) list
val to_list : t -> Dba.Instr.t list
val fold : ('a -> Dba.Instr.t -> 'a) -> 'a -> t -> 'a
val for_all : (Dba.Instr.t -> bool) -> t -> bool

unlink dh i skips the ith instruction. Its predecessors go to its successor.

  • raises [Invalid_argument]

    if inst dh i has not exactly one successor.

val export_and_view : ?cmd:string -> t -> unit

view dh Visualize dot-rendered DBA hunk dh using cmd.

Default value for cmd is firefox.

val pred : t -> int -> int list
val succ : t -> int -> int list
val optimize : ?inplace:bool -> t -> t

optimize dh Performs some "compiler" optimizations and return the simplified block.

  • parameter inplace

    Directly modify the block without making a copy. Default: false.

include Sigs.PRINTABLE with type t := t
val pp : Format.formatter -> t -> unit
Dhunk properties
module Check : sig ... end
val to_stmts : t -> Virtual_address.t -> Dba_types.Statement.t list
val outer_jumps : t -> Virtual_address.Set.t

outer_jumps b computes the set of jumps to external addresses in hunk b. Due to dynamic jumps, this represents a syntactic under-approximation of the possible jumps from this block.

val callees : t -> Virtual_address.Set.t

callees b computes the set of addresses this block may call

val is_return : t -> bool

is_return d check if dhunk d encodes a return

val has_indirect_jump : t -> bool

has_indirect_jump d returns true if the hunk contains an indirect jump instruction

type conditional = {
  1. condition : Dba.Expr.t;
  2. consequent : Virtual_address.t;
  3. alternative : Virtual_address.t;
}
val conditional : t -> conditional option