macaw/refinement
Stanislav Lyakhov 616b266559 Fix refinement panic caused by duplicate cfg edges
Refinement frequently tried to add duplicate edges to the cfg
when encountering jump tables, since jump tables often have common targets
(e.g. because of a `default` case).

Instead of panicking, this is now handled as a benign case where no edge
insertion is needed.
2024-05-10 15:40:11 -07:00
..
src/Data/Macaw Fix refinement panic caused by duplicate cfg edges 2024-05-10 15:40:11 -07:00
tests Bundle more options into MemModelConfig 2023-03-14 13:27:07 -04:00
tools Fix -Wincomplete-uni-patterns warnings 2022-05-31 15:50:48 -04: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 Support building with GHC 9.6 2023-08-21 08:16:10 -04: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.