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

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.2.tbz
sha256=b758f3428b62a03103403196af99a5bb7df77a35afbcc5ce2d2b1fbe6d2ab36b
sha512=afa4fdf09ae0c2ab02530d674f9f2c1473d156e0438b4cb9c262ffea2d98c448251de55cd6fb176562edaae3897aeabe873ffa1ad47f861c75e1943792d90261

doc/binsec.base/Binsec_base/Hmap/Make/index.html

Module Hmap.MakeSource

Parameters

module H : sig ... end

Signature

Sourcetype key = H.t
Sourcetype !'a t
Sourceval empty : 'a t
Sourceval add : key -> 'a -> 'a t -> 'a t
Sourceval singleton : key -> 'a -> 'a t
Sourceval union_eq : (key -> 'a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t

union_eq f m m' is equivalent to merge (fun k d d' -> match d, d' with | None, _ -> d' | _, None -> d | Some a, Some a' -> if a == a' then d else Some (f k a a')) m m'

Sourceval union_map_eq : (key -> 'a -> 'a -> 'a) -> (key -> 'a -> 'a) -> 'a t -> 'a t -> 'a t

union_map_eq f g m m' is equivalent to merge (fun k d d' -> match d, d' with | None, None -> assert false | None, Some a' -> Some (g k a') | Some a, None -> Some (g k a) | Some a, Some a' -> if a == a' then d else Some (f k a a')) m m'

Sourceval freeze : 'a t -> unit
Sourceval bindings : 'a t -> (key * 'a) list
Sourceval choose : 'a t -> key * 'a
Sourceval mem : key -> 'a t -> bool
Sourceval find : key -> 'a t -> 'a
Sourceval iter : (key -> 'a -> unit) -> 'a t -> unit
Sourceval fold : (key -> 'a -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
Sourceval map : ('a -> 'b) -> 'a t -> 'b t
Sourceval mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
Sourceval is_empty : 'a t -> bool