Tags: clayne/bap
Tags
allows bypassing checks when storing memory, uses it for relocations (B… …inaryAnalysisPlatform#1567) When we perform relocations on object files, we do the linker work not the loader, therefore we do not need to check if the memory is writable or even loadable. The easiest option is to extend the Primus memory interface with primitives that perform writing without any checks.
prevents knowledge conflicts on mangled names (BinaryAnalysisPlatform… …#1535) This change prevents knowledge base conflicts that happen when we apply name mangling on subroutines.
updates versions and changelog for 2.3.0 (BinaryAnalysisPlatform#1316)
bumps version and updates the changelog (BinaryAnalysisPlatform#1259)
bumps version and updates the changelog (BinaryAnalysisPlatform#1259)
fixes trivial assertions (BinaryAnalysisPlatform#1108) If an assertion doesn't contain a symbolic value then we were having an empty set of constraints, which trivially were true. In other words, `assert true` doesn't hold. This PR fixes this by treating non-symbolic values as symbolic constants.
BAP 2.0.0 release (candidate) (BinaryAnalysisPlatform#1017) * BAP 2.0.0 release (candidate) Polishes documentation as well as fixes the theory declaration function. And finally bumps the version to 2.0.0. Whle revising the documentation I've noticed that the interface of theory declaration is not allowing references to other theories as it isn't wrapped in the knowledge monad as it should be. I fixed it, but immediately fell into the trap of a recursive instantiation. Indeed, a theory may require itself as a base, which will lead to an infinite recursion and runtime failure. Since it is so easy to fall into this trap, the implementation has to be robust enough and either forbid this, with an appropriate error message, or allow it, with an appropriate semantics. We chose the latter, since our theories are domains we have a sane semantics for recursive theories (well, this is what denotational semantics was invented on the first hand). We employed the same technique for recursive module instantiation as OCaml does, i.e., first initialize the theory with an empty structure, then overwrite it with the result. * updates testsuites commit
updates bap version (BinaryAnalysisPlatform#943) * updates bap version * updates changelog
PreviousNext