Search Results for "open solver"

The Carnegie Mellon University Binary Analysis Platform (CMU BAP) is a suite of utilities and libraries that enables analysis of programs in the machine code representation. BAP supports x86, x86-64, ARM, MIPS, PowerPC and new architectures can be added as plugins. BAP includes various analyses, standard interpreter, microexecution interpreter, and symbolic executor. BAP features its own domain-specific language, Primus Lisp, that is used for implementing analyses, specifying verification...

Triton is a dynamic binary analysis library. It provides internal components that allow you to build your program analysis tools, automate reverse engineering, perform software verification or just emulate code. Linux, Windows and OS X compatible. You can directly compile source code from our Github repository. The Triton library is Linux, Windows and OS X compatible. A potential way to getting started is to see our Python examples already bootstrapped.

gdeptrace sorts an input dependancy list or table and prints it, and can do other actions. It's default operation is to act like tsort (1) except that it sorts by pure pkg / make dependancy (tsort sorts by grapical topology: see notes about differences). EXAMPLE: $ echo -e "b e\ne\nc b" | sort -k1,1 | gdeptrace [opts] e b c (b depends on e, c depends on b, e has no depends) (also: e has more items depending on it and is below anything it depends on; in this case...

DisChoco is a Distributed Constraint Reasoning Solver. Several Distributed Constraint Reasoning algorithms are implemented (like ABT, AFC, Adopt, ...). Users may easily implement and test their algorithms with DisChoco. contact: wahbi[at]users[dot]sourceforge[dot]net

JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance,...

Pydusa is a package for parallel programming using Python. It contains a module for doing MPI programming in Python. We have added parallel solver packages such as Parallel SuperLU for solving sparse linear systems.

HOMB is a simple benchmark based on a parallel iterative Laplace solver aimed at comparing the performance of MPI, OpenMP, and hybrid codes on SMP and multi-core based machines.