GaloisInc/macaw
1
1
Fork 0
mirror of https://github.com/GaloisInc/macaw.git synced 2024-12-18 03:21:49 +03:00
Code Issues Projects Releases Wiki Activity
0d66b159e1
macaw/refinement
History
Andrei Stefanescu 0d66b159e1 [refinement] Map model pointers back to addresses.
2019-02-07 01:09:59 -08:00
..
src/Data/Macaw [refinement] Map model pointers back to addresses. 2019-02-07 01:09:59 -08:00
tests [refinement][first version] Get successor candidates for classification failure blocks. 2019-02-05 21:08:13 -08:00
tools [refinement] Update run-refinement for Refinement use of loaded elf info. 2019-02-06 20:10:11 -08: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 [refinement] updates for merge of Some removal and updateDiscovery. 2019-02-06 17:58:21 -08:00
README.md Add README and Changelog and update cabal synopsis/description. 2019-01-07 15:13:50 -08:00

README.md

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.