macaw/refinement
Tristan Ravitch 6b712c6280
Fix the default ppc32 ABI (#222)
None of the common default ppc32 ABIs use a Table of Contents (TOC), so default
our code to not assume it either. This has accompanying changes in
macaw-loader-ppc, which also made incorrect assumptions about ppc32.

Note that we may eventually need to support rarely-used ABIs that do use a
TOC (or similar dedicated registers, e.g., the Small Data Area mode). When we
do, we will probably want that to be a data-oriented decision rather than a
type-level one, as each architecture supports multiple ABIs. We may also need to
modify ppc64 to support ABIs without TOCs, but we'll do it when we need to.
2021-08-19 07:41:29 -07:00
..
src/Data/Macaw Update submodules 2021-07-15 21:22:30 -07:00
tests Update to follow changes in What4. Nat is no longer a base type (#190) 2021-02-19 15:44:56 -08:00
tools Fix the default ppc32 ABI (#222) 2021-08-19 07:41:29 -07:00
Changelog.md Add README and Changelog and update cabal synopsis/description. 2019-01-07 15:13:50 -08:00
LICENSE Add refinement library. 2019-01-07 14:16:03 -08:00
macaw-refinement.cabal Raise the upper bound on the optparse dependency (#195) 2021-03-20 09:17:54 -07:00
README.md Add README and Changelog and update cabal synopsis/description. 2019-01-07 15:13:50 -08:00

Macaw Refinement Libary

The refinement library provides supplemental functionality for discovery of elements that macaw-symbolic is not able to discover via pattern matching. This library will use crucible symbolic analysis to attempt to determine elements that could not be identified by macaw-symbolic. The identification provided by macaw-symbolic is incomplete, and so is the identification by this macaw-refinement, but macaw-refinement attempts to additionally "refine" the analysis to achieve even more information which can then be provided back to the macaw analysis.

  • Terminator effects for incomplete blocks. For example, the target IP address by symbolic evaluation (e.g. of jump tables). If the current block does not provide sufficient information to symbolically identify the target, previous blocks can be added to the analysis (back to the entry block or a loop point).

  • Argument liveness (determining which registers and memory locations are used/live by a block allows determination of ABI compliance (for transformations) and specific block requirements (which currently start with a full register state and blank memory).

  • Call graphs. Determination of targets of call instructions that cannot be identified by pattern matching via symbolic evaluation, using techniques similar to those for identifying incomplete blocks.