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.smtlib/Binsec_smtlib/Formula/Solver/Make_binding/argument-1-_/index.html

Parameter Make_binding._

An incremental solver instance.

Parameters

Signature

val pp : Format.formatter -> unit -> unit

pp ppf () pretty-print the session solver.

include Binsec_smtlib_bindings.TERM
module Bl : sig ... end
module Bv : sig ... end
module Ax : sig ... end
val assert_formula : Bl.t -> unit

assert_formula bl assert the boolean entry in the solver instance.

  • parameter bl

    The boolean entry to assert.

val push : unit -> unit

push () creates a backup point of the current solver context.

val pop : unit -> unit

pop () discard all the assertions since the last backup point, restoring the solver context in the same state as before the push (). Invalid uses may fail in an unpredictable fashion.

val check_sat : ?timeout:float -> unit -> Binsec_smtlib_bindings.status

check_sat () checks if the current formula is satisfiable.

  • returns

    Sat, Unsat or Unknown.

val check_sat_assuming : ?timeout:float -> Bl.t -> Binsec_smtlib_bindings.status

check_sat_assuming e checks if the current formula is satisfiable with the assumtion e.

  • returns

    Sat, Unsat or Unknown.

val get_bl_value : Bl.t -> bool

get_bl_value expr returns the assignment of the expression expr if check_sat returned Sat. Invalid uses may fail in an unpredictable fashion.

  • parameter expr

    The expression to get the assignment.

  • returns

    The boolean assignment of expr.

val get_bv_value : Bv.t -> Z.t

get_bv_value expr returns the assignment of the expression expr if check_sat returned Sat. Invalid uses may fail in an unpredictable fashion.

  • parameter expr

    The expression to get the assignment.

  • returns

    The bitvector assignment of expr.

val fold_ax_values : (Z.t -> Z.t -> 'a -> 'a) -> Ax.t -> 'a -> 'a

fold_ax_values f ax v iter through the assignment of the array ax if check_sat returned Sat. Invalid uses may fail in an unpredictable fashion.

  • parameter ax

    The expression to get the assignment.

val close : unit -> unit

close () will destroy the solver instance and release its ressources. Calling any function on this instance afterward is invalid and may fail in an unpredictable fashion.