GaloisInc/macaw
1
1
Fork 0
mirror of https://github.com/GaloisInc/macaw.git synced 2024-11-25 21:54:51 +03:00
Code Issues Projects Releases Wiki Activity
ce10bc9243
macaw/refinement/macaw-refinement.cabal

168 lines
5.4 KiB
Plaintext
Raw Normal View History

Add refinement library. 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.
2019-01-08 01:16:03 +03:00
name: macaw-refinement
version: 0.0.1
Add README and Changelog and update cabal synopsis/description.
2019-01-08 02:13:50 +03:00
synopsis: Additional refinement operations for binary code discovery to improve coverage
Add refinement library. 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.
2019-01-08 01:16:03 +03:00
author: Galois, Inc.
maintainer: kquick@galois.com
Add README and Changelog and update cabal synopsis/description.
2019-01-08 02:13:50 +03:00
homepage: https://github.com/GaloisInc/macaw/refinement
Add refinement library. 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.
2019-01-08 01:16:03 +03:00
license: BSD3
license-file: LICENSE
Add README and Changelog and update cabal synopsis/description.
2019-01-08 02:13:50 +03:00
build-type: Simple
cabal-version: >= 2.0
Adapt to GaloisInc/crucible#794 (#224) GaloisInc/crucible#794 increases the number of functions that use implicit `MemOptions`, including a handful of key LLVM memory model–related functions. As a result, many parts of `macaw` need to add implicit `?memOpts` parameters to accommodate to this change.
2021-08-24 03:39:08 +03:00
Add README and Changelog and update cabal synopsis/description.
2019-01-08 02:13:50 +03:00
description:
The refinement library provides supplemental functionality for
macaw-refinement (#114) This commit updates macaw-refinement to work with the latest macaw/crucible and makes a few improvements along the way. The major changes involved in this are: * Block labels were removed from macaw, so we had to come up with an alternative approach to making synthetic blocks to represent dispatch resolved by macaw-refinement that is not really a jump table. We considered adding a new terminator that encoded "computed IP-based dispatch", but there was concern about the impact on client code. Instead, we added a field to the `DiscoveryFunInfo` that records "external" resolutions to indirect control flow (e.g., as by an SMT solver in macaw-refinement). The hook by which we feed SMT-based resolutions back into macaw was modified accordingly (`addDiscoveredFunctionBlockTargets`). * Solver invocation changed to allow solver selection and parallel solver application. * Logging is now done via the `lumberjack` library. * macaw-symbolic now uses the "external" resolutions in `DiscoveryFunInfo` while building crucible CFGs. * The path creation code in macaw-refinement was simplified significantly and the approach to path creation has been documented. * The run-refinement tool is now more featureful. * The test suite is a bit more structured and no longer depends on the printed output of the discovery process.
2020-03-13 03:15:08 +03:00
discovery of elements that macaw-base is not able to discover
Add README and Changelog and update cabal synopsis/description.
2019-01-08 02:13:50 +03:00
via pattern matching. This library will use crucible symbolic
analysis to attempt to determine elements that could not be
macaw-refinement (#114) This commit updates macaw-refinement to work with the latest macaw/crucible and makes a few improvements along the way. The major changes involved in this are: * Block labels were removed from macaw, so we had to come up with an alternative approach to making synthetic blocks to represent dispatch resolved by macaw-refinement that is not really a jump table. We considered adding a new terminator that encoded "computed IP-based dispatch", but there was concern about the impact on client code. Instead, we added a field to the `DiscoveryFunInfo` that records "external" resolutions to indirect control flow (e.g., as by an SMT solver in macaw-refinement). The hook by which we feed SMT-based resolutions back into macaw was modified accordingly (`addDiscoveredFunctionBlockTargets`). * Solver invocation changed to allow solver selection and parallel solver application. * Logging is now done via the `lumberjack` library. * macaw-symbolic now uses the "external" resolutions in `DiscoveryFunInfo` while building crucible CFGs. * The path creation code in macaw-refinement was simplified significantly and the approach to path creation has been documented. * The run-refinement tool is now more featureful. * The test suite is a bit more structured and no longer depends on the printed output of the discovery process.
2020-03-13 03:15:08 +03:00
identified by macaw-base. The identification provided by
macaw-base is incomplete, and so is the identification by this
Add README and Changelog and update cabal synopsis/description.
2019-01-08 02:13:50 +03:00
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.
extra-source-files: Changelog.md
README.md
source-repository head
type: git
location: git://github.com/GaloisInc/macaw.git
Add refinement library. 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.
2019-01-08 01:16:03 +03:00
library
build-depends: base >= 4
updates what4, crucible, etc. (#146) * update to bv-sized branch of what4 and other things * removed parameterized-utils submodule completely * Updates submodules * Fixes macaw-symbolic w.r.t. crucible-llvm changes Co-authored-by: Ben Selfridge <ben@000548-benselfridge.local>
2020-06-17 02:49:55 +03:00
, bv-sized >= 1.0.0
Add refinement library. 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.
2019-01-08 01:16:03 +03:00
, containers
, crucible >= 0.4
, crucible-llvm
, lens
, macaw-base
[refinement] updates for merge of Some removal and updateDiscovery.
2019-02-07 04:58:21 +03:00
, macaw-loader
[refinement] Enable PPC testing.
2019-02-09 01:10:08 +03:00
, macaw-loader-ppc
, macaw-loader-x86
, macaw-ppc
Add refinement library. 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.
2019-01-08 01:16:03 +03:00
, macaw-symbolic
[refinement] Enable PPC testing.
2019-02-09 01:10:08 +03:00
, macaw-ppc-symbolic
Add refinement library. 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.
2019-01-08 01:16:03 +03:00
, mtl
, parameterized-utils
[refinement] Add pretty printer for FuncBlockPath.
2019-01-29 02:04:21 +03:00
, prettyprinter
Add refinement library. 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.
2019-01-08 01:16:03 +03:00
, text
, what4 >= 0.4.0
Bump upper bound for scheduler in refinement.
2020-12-06 21:54:47 +03:00
, scheduler >= 1.4 && < 1.6
macaw-refinement (#114) This commit updates macaw-refinement to work with the latest macaw/crucible and makes a few improvements along the way. The major changes involved in this are: * Block labels were removed from macaw, so we had to come up with an alternative approach to making synthetic blocks to represent dispatch resolved by macaw-refinement that is not really a jump table. We considered adding a new terminator that encoded "computed IP-based dispatch", but there was concern about the impact on client code. Instead, we added a field to the `DiscoveryFunInfo` that records "external" resolutions to indirect control flow (e.g., as by an SMT solver in macaw-refinement). The hook by which we feed SMT-based resolutions back into macaw was modified accordingly (`addDiscoveredFunctionBlockTargets`). * Solver invocation changed to allow solver selection and parallel solver application. * Logging is now done via the `lumberjack` library. * macaw-symbolic now uses the "external" resolutions in `DiscoveryFunInfo` while building crucible CFGs. * The path creation code in macaw-refinement was simplified significantly and the approach to path creation has been documented. * The run-refinement tool is now more featureful. * The test suite is a bit more structured and no longer depends on the printed output of the discovery process.
2020-03-13 03:15:08 +03:00
, async
Lift the version bound on the lumberjack dependency (#194)
2021-03-20 04:38:58 +03:00
, lumberjack >= 0.1.0.2 && < 1.1
macaw-refinement (#114) This commit updates macaw-refinement to work with the latest macaw/crucible and makes a few improvements along the way. The major changes involved in this are: * Block labels were removed from macaw, so we had to come up with an alternative approach to making synthetic blocks to represent dispatch resolved by macaw-refinement that is not really a jump table. We considered adding a new terminator that encoded "computed IP-based dispatch", but there was concern about the impact on client code. Instead, we added a field to the `DiscoveryFunInfo` that records "external" resolutions to indirect control flow (e.g., as by an SMT solver in macaw-refinement). The hook by which we feed SMT-based resolutions back into macaw was modified accordingly (`addDiscoveredFunctionBlockTargets`). * Solver invocation changed to allow solver selection and parallel solver application. * Logging is now done via the `lumberjack` library. * macaw-symbolic now uses the "external" resolutions in `DiscoveryFunInfo` while building crucible CFGs. * The path creation code in macaw-refinement was simplified significantly and the approach to path creation has been documented. * The run-refinement tool is now more featureful. * The test suite is a bit more structured and no longer depends on the printed output of the discovery process.
2020-03-13 03:15:08 +03:00
, unliftio-core >= 0.2 && < 0.3
, exceptions >= 0.10 && < 0.11
, haggle
Add refinement library. 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.
2019-01-08 01:16:03 +03:00
hs-source-dirs: src
[refinement] Add initial refinement framework.
2019-01-25 01:48:55 +03:00
exposed-modules: Data.Macaw.Refinement
[refinement] Split out modules for Path handling, Function/Block utilities.
2019-01-28 21:50:35 +03:00
other-modules: Data.Macaw.Refinement.FuncBlockUtils
macaw-refinement (#114) This commit updates macaw-refinement to work with the latest macaw/crucible and makes a few improvements along the way. The major changes involved in this are: * Block labels were removed from macaw, so we had to come up with an alternative approach to making synthetic blocks to represent dispatch resolved by macaw-refinement that is not really a jump table. We considered adding a new terminator that encoded "computed IP-based dispatch", but there was concern about the impact on client code. Instead, we added a field to the `DiscoveryFunInfo` that records "external" resolutions to indirect control flow (e.g., as by an SMT solver in macaw-refinement). The hook by which we feed SMT-based resolutions back into macaw was modified accordingly (`addDiscoveredFunctionBlockTargets`). * Solver invocation changed to allow solver selection and parallel solver application. * Logging is now done via the `lumberjack` library. * macaw-symbolic now uses the "external" resolutions in `DiscoveryFunInfo` while building crucible CFGs. * The path creation code in macaw-refinement was simplified significantly and the approach to path creation has been documented. * The run-refinement tool is now more featureful. * The test suite is a bit more structured and no longer depends on the printed output of the discovery process.
2020-03-13 03:15:08 +03:00
Data.Macaw.Refinement.Logging
[refinement] Split out modules for Path handling, Function/Block utilities.
2019-01-28 21:50:35 +03:00
Data.Macaw.Refinement.Path
macaw-refinement (#114) This commit updates macaw-refinement to work with the latest macaw/crucible and makes a few improvements along the way. The major changes involved in this are: * Block labels were removed from macaw, so we had to come up with an alternative approach to making synthetic blocks to represent dispatch resolved by macaw-refinement that is not really a jump table. We considered adding a new terminator that encoded "computed IP-based dispatch", but there was concern about the impact on client code. Instead, we added a field to the `DiscoveryFunInfo` that records "external" resolutions to indirect control flow (e.g., as by an SMT solver in macaw-refinement). The hook by which we feed SMT-based resolutions back into macaw was modified accordingly (`addDiscoveredFunctionBlockTargets`). * Solver invocation changed to allow solver selection and parallel solver application. * Logging is now done via the `lumberjack` library. * macaw-symbolic now uses the "external" resolutions in `DiscoveryFunInfo` while building crucible CFGs. * The path creation code in macaw-refinement was simplified significantly and the approach to path creation has been documented. * The run-refinement tool is now more featureful. * The test suite is a bit more structured and no longer depends on the printed output of the discovery process.
2020-03-13 03:15:08 +03:00
Data.Macaw.Refinement.Solver
[refinement] Split out modules for Path handling, Function/Block utilities.
2019-01-28 21:50:35 +03:00
Data.Macaw.Refinement.Target
[refinement] Move symbolic execution code in its own module.
2019-02-08 06:43:58 +03:00
Data.Macaw.Refinement.SymbolicExecution
[refinement] Add initial refinement framework.
2019-01-25 01:48:55 +03:00
Data.Macaw.Refinement.UnknownTransfer
Add refinement library. 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.
2019-01-08 01:16:03 +03:00
Add README and Changelog and update cabal synopsis/description.
2019-01-08 02:13:50 +03:00
default-language: Haskell2010
Enable warnings for future compatibility issues.
2019-01-11 01:41:44 +03:00
ghc-options: -Wall -Wcompat
Add refinement library. 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.
2019-01-08 01:16:03 +03:00
ghc-prof-options: -O2 -fprof-auto-top
Add run-refinement tool for cmdline dumping of exe file info. This tool is similar to run-refurbish but it is intended to dump information about additional refinements provided by this library.
2019-01-11 01:53:12 +03:00
executable run-refinement
hs-source-dirs: tools
main-is: run-refinement.hs
macaw-refinement (#114) This commit updates macaw-refinement to work with the latest macaw/crucible and makes a few improvements along the way. The major changes involved in this are: * Block labels were removed from macaw, so we had to come up with an alternative approach to making synthetic blocks to represent dispatch resolved by macaw-refinement that is not really a jump table. We considered adding a new terminator that encoded "computed IP-based dispatch", but there was concern about the impact on client code. Instead, we added a field to the `DiscoveryFunInfo` that records "external" resolutions to indirect control flow (e.g., as by an SMT solver in macaw-refinement). The hook by which we feed SMT-based resolutions back into macaw was modified accordingly (`addDiscoveredFunctionBlockTargets`). * Solver invocation changed to allow solver selection and parallel solver application. * Logging is now done via the `lumberjack` library. * macaw-symbolic now uses the "external" resolutions in `DiscoveryFunInfo` while building crucible CFGs. * The path creation code in macaw-refinement was simplified significantly and the approach to path creation has been documented. * The run-refinement tool is now more featureful. * The test suite is a bit more structured and no longer depends on the printed output of the discovery process.
2020-03-13 03:15:08 +03:00
other-modules: Summary, Options, Initialization
Add run-refinement tool for cmdline dumping of exe file info. This tool is similar to run-refurbish but it is intended to dump information about additional refinements provided by this library.
2019-01-11 01:53:12 +03:00
default-language: Haskell2010
macaw-refinement (#114) This commit updates macaw-refinement to work with the latest macaw/crucible and makes a few improvements along the way. The major changes involved in this are: * Block labels were removed from macaw, so we had to come up with an alternative approach to making synthetic blocks to represent dispatch resolved by macaw-refinement that is not really a jump table. We considered adding a new terminator that encoded "computed IP-based dispatch", but there was concern about the impact on client code. Instead, we added a field to the `DiscoveryFunInfo` that records "external" resolutions to indirect control flow (e.g., as by an SMT solver in macaw-refinement). The hook by which we feed SMT-based resolutions back into macaw was modified accordingly (`addDiscoveredFunctionBlockTargets`). * Solver invocation changed to allow solver selection and parallel solver application. * Logging is now done via the `lumberjack` library. * macaw-symbolic now uses the "external" resolutions in `DiscoveryFunInfo` while building crucible CFGs. * The path creation code in macaw-refinement was simplified significantly and the approach to path creation has been documented. * The run-refinement tool is now more featureful. * The test suite is a bit more structured and no longer depends on the printed output of the discovery process.
2020-03-13 03:15:08 +03:00
ghc-options: -Wall -Wcompat -rtsopts -threaded
Add run-refinement tool for cmdline dumping of exe file info. This tool is similar to run-refurbish but it is intended to dump information about additional refinements provided by this library.
2019-01-11 01:53:12 +03:00
build-depends: base >= 4
, bytestring
, containers
, elf-edit
, exceptions
, lens
, macaw-base
, macaw-loader
, macaw-loader-x86
, macaw-loader-ppc
, macaw-ppc
[refinement] Enable PPC testing.
2019-02-09 01:10:08 +03:00
, macaw-ppc-symbolic
Add run-refinement tool for cmdline dumping of exe file info. This tool is similar to run-refurbish but it is intended to dump information about additional refinements provided by this library.
2019-01-11 01:53:12 +03:00
, macaw-refinement
, macaw-symbolic
, macaw-x86
[refinement] update run-refinement tool for changes in library. Additional constraints and the refinement operations are now run in a MonadIO context.
2019-02-01 01:55:26 +03:00
, macaw-x86-symbolic
Add run-refinement --unrefined flag to show pre- and post- refinement.
2019-01-11 04:25:12 +03:00
, optparse-applicative
Add run-refinement tool for cmdline dumping of exe file info. This tool is similar to run-refurbish but it is intended to dump information about additional refinements provided by this library.
2019-01-11 01:53:12 +03:00
, parameterized-utils
[refinement] update run-refinement for summary and verbose modes.
2019-02-08 04:15:00 +03:00
, prettyprinter
Add run-refinement tool for cmdline dumping of exe file info. This tool is similar to run-refurbish but it is intended to dump information about additional refinements provided by this library.
2019-01-11 01:53:12 +03:00
, semmc-ppc
[refinement] Add test framework to compare output to expected output.
2019-01-23 07:04:26 +03:00
, text
macaw-refinement (#114) This commit updates macaw-refinement to work with the latest macaw/crucible and makes a few improvements along the way. The major changes involved in this are: * Block labels were removed from macaw, so we had to come up with an alternative approach to making synthetic blocks to represent dispatch resolved by macaw-refinement that is not really a jump table. We considered adding a new terminator that encoded "computed IP-based dispatch", but there was concern about the impact on client code. Instead, we added a field to the `DiscoveryFunInfo` that records "external" resolutions to indirect control flow (e.g., as by an SMT solver in macaw-refinement). The hook by which we feed SMT-based resolutions back into macaw was modified accordingly (`addDiscoveredFunctionBlockTargets`). * Solver invocation changed to allow solver selection and parallel solver application. * Logging is now done via the `lumberjack` library. * macaw-symbolic now uses the "external" resolutions in `DiscoveryFunInfo` while building crucible CFGs. * The path creation code in macaw-refinement was simplified significantly and the approach to path creation has been documented. * The run-refinement tool is now more featureful. * The test suite is a bit more structured and no longer depends on the printed output of the discovery process.
2020-03-13 03:15:08 +03:00
, what4
, crucible
Adapt to GaloisInc/crucible#794 (#224) GaloisInc/crucible#794 increases the number of functions that use implicit `MemOptions`, including a handful of key LLVM memory model–related functions. As a result, many parts of `macaw` need to add implicit `?memOpts` parameters to accommodate to this change.
2021-08-24 03:39:08 +03:00
, crucible-llvm
macaw-refinement (#114) This commit updates macaw-refinement to work with the latest macaw/crucible and makes a few improvements along the way. The major changes involved in this are: * Block labels were removed from macaw, so we had to come up with an alternative approach to making synthetic blocks to represent dispatch resolved by macaw-refinement that is not really a jump table. We considered adding a new terminator that encoded "computed IP-based dispatch", but there was concern about the impact on client code. Instead, we added a field to the `DiscoveryFunInfo` that records "external" resolutions to indirect control flow (e.g., as by an SMT solver in macaw-refinement). The hook by which we feed SMT-based resolutions back into macaw was modified accordingly (`addDiscoveredFunctionBlockTargets`). * Solver invocation changed to allow solver selection and parallel solver application. * Logging is now done via the `lumberjack` library. * macaw-symbolic now uses the "external" resolutions in `DiscoveryFunInfo` while building crucible CFGs. * The path creation code in macaw-refinement was simplified significantly and the approach to path creation has been documented. * The run-refinement tool is now more featureful. * The test suite is a bit more structured and no longer depends on the printed output of the discovery process.
2020-03-13 03:15:08 +03:00
, mtl
, lumberjack
, unliftio-core
[refinement] Add test framework to compare output to expected output.
2019-01-23 07:04:26 +03:00
test-suite test-refinements
type: exitcode-stdio-1.0
[refinement] update run-refinement for summary and verbose modes.
2019-02-08 04:15:00 +03:00
buildable: True
[refinement] Add test framework to compare output to expected output.
2019-01-23 07:04:26 +03:00
default-language: Haskell2010
macaw-refinement (#114) This commit updates macaw-refinement to work with the latest macaw/crucible and makes a few improvements along the way. The major changes involved in this are: * Block labels were removed from macaw, so we had to come up with an alternative approach to making synthetic blocks to represent dispatch resolved by macaw-refinement that is not really a jump table. We considered adding a new terminator that encoded "computed IP-based dispatch", but there was concern about the impact on client code. Instead, we added a field to the `DiscoveryFunInfo` that records "external" resolutions to indirect control flow (e.g., as by an SMT solver in macaw-refinement). The hook by which we feed SMT-based resolutions back into macaw was modified accordingly (`addDiscoveredFunctionBlockTargets`). * Solver invocation changed to allow solver selection and parallel solver application. * Logging is now done via the `lumberjack` library. * macaw-symbolic now uses the "external" resolutions in `DiscoveryFunInfo` while building crucible CFGs. * The path creation code in macaw-refinement was simplified significantly and the approach to path creation has been documented. * The run-refinement tool is now more featureful. * The test suite is a bit more structured and no longer depends on the printed output of the discovery process.
2020-03-13 03:15:08 +03:00
GHC-options: -Wall -Wcompat
hs-source-dirs: tests, tools
[refinement] Add test framework to compare output to expected output.
2019-01-23 07:04:26 +03:00
main-is: RefinementTests.hs
macaw-refinement (#114) This commit updates macaw-refinement to work with the latest macaw/crucible and makes a few improvements along the way. The major changes involved in this are: * Block labels were removed from macaw, so we had to come up with an alternative approach to making synthetic blocks to represent dispatch resolved by macaw-refinement that is not really a jump table. We considered adding a new terminator that encoded "computed IP-based dispatch", but there was concern about the impact on client code. Instead, we added a field to the `DiscoveryFunInfo` that records "external" resolutions to indirect control flow (e.g., as by an SMT solver in macaw-refinement). The hook by which we feed SMT-based resolutions back into macaw was modified accordingly (`addDiscoveredFunctionBlockTargets`). * Solver invocation changed to allow solver selection and parallel solver application. * Logging is now done via the `lumberjack` library. * macaw-symbolic now uses the "external" resolutions in `DiscoveryFunInfo` while building crucible CFGs. * The path creation code in macaw-refinement was simplified significantly and the approach to path creation has been documented. * The run-refinement tool is now more featureful. * The test suite is a bit more structured and no longer depends on the printed output of the discovery process.
2020-03-13 03:15:08 +03:00
other-modules: Summary, Initialization, Options
[refinement] Add test framework to compare output to expected output.
2019-01-23 07:04:26 +03:00
build-depends: base >= 4
, bytestring
, containers
, directory
, elf-edit
, exceptions
, filepath
, filemanip
, lens
, macaw-base
, macaw-loader
, macaw-loader-x86
, macaw-loader-ppc
, macaw-ppc
[refinement] Enable PPC testing.
2019-02-09 01:10:08 +03:00
, macaw-ppc-symbolic
[refinement] update test generation and add refinement tests.
2019-01-23 23:04:41 +03:00
, macaw-refinement
Fixes.
2019-01-30 03:29:54 +03:00
, macaw-symbolic
[refinement] Add test framework to compare output to expected output.
2019-01-23 07:04:26 +03:00
, macaw-x86
Fixes.
2019-01-30 03:29:54 +03:00
, macaw-x86-symbolic
macaw-refinement (#114) This commit updates macaw-refinement to work with the latest macaw/crucible and makes a few improvements along the way. The major changes involved in this are: * Block labels were removed from macaw, so we had to come up with an alternative approach to making synthetic blocks to represent dispatch resolved by macaw-refinement that is not really a jump table. We considered adding a new terminator that encoded "computed IP-based dispatch", but there was concern about the impact on client code. Instead, we added a field to the `DiscoveryFunInfo` that records "external" resolutions to indirect control flow (e.g., as by an SMT solver in macaw-refinement). The hook by which we feed SMT-based resolutions back into macaw was modified accordingly (`addDiscoveredFunctionBlockTargets`). * Solver invocation changed to allow solver selection and parallel solver application. * Logging is now done via the `lumberjack` library. * macaw-symbolic now uses the "external" resolutions in `DiscoveryFunInfo` while building crucible CFGs. * The path creation code in macaw-refinement was simplified significantly and the approach to path creation has been documented. * The run-refinement tool is now more featureful. * The test suite is a bit more structured and no longer depends on the printed output of the discovery process.
2020-03-13 03:15:08 +03:00
, crucible
, crucible-llvm
, what4
Raise the upper bound on the optparse dependency (#195)
2021-03-20 19:17:54 +03:00
, optparse-applicative >= 0.13 && < 0.17
[refinement] Add test framework to compare output to expected output.
2019-01-23 07:04:26 +03:00
, parameterized-utils
, QuickCheck >= 2.7
, semmc-ppc
macaw-refinement (#114) This commit updates macaw-refinement to work with the latest macaw/crucible and makes a few improvements along the way. The major changes involved in this are: * Block labels were removed from macaw, so we had to come up with an alternative approach to making synthetic blocks to represent dispatch resolved by macaw-refinement that is not really a jump table. We considered adding a new terminator that encoded "computed IP-based dispatch", but there was concern about the impact on client code. Instead, we added a field to the `DiscoveryFunInfo` that records "external" resolutions to indirect control flow (e.g., as by an SMT solver in macaw-refinement). The hook by which we feed SMT-based resolutions back into macaw was modified accordingly (`addDiscoveredFunctionBlockTargets`). * Solver invocation changed to allow solver selection and parallel solver application. * Logging is now done via the `lumberjack` library. * macaw-symbolic now uses the "external" resolutions in `DiscoveryFunInfo` while building crucible CFGs. * The path creation code in macaw-refinement was simplified significantly and the approach to path creation has been documented. * The run-refinement tool is now more featureful. * The test suite is a bit more structured and no longer depends on the printed output of the discovery process.
2020-03-13 03:15:08 +03:00
, text
[refinement] Add test framework to compare output to expected output.
2019-01-23 07:04:26 +03:00
, tagged
, tasty
, tasty-hspec
, tasty-hunit
macaw-refinement (#114) This commit updates macaw-refinement to work with the latest macaw/crucible and makes a few improvements along the way. The major changes involved in this are: * Block labels were removed from macaw, so we had to come up with an alternative approach to making synthetic blocks to represent dispatch resolved by macaw-refinement that is not really a jump table. We considered adding a new terminator that encoded "computed IP-based dispatch", but there was concern about the impact on client code. Instead, we added a field to the `DiscoveryFunInfo` that records "external" resolutions to indirect control flow (e.g., as by an SMT solver in macaw-refinement). The hook by which we feed SMT-based resolutions back into macaw was modified accordingly (`addDiscoveredFunctionBlockTargets`). * Solver invocation changed to allow solver selection and parallel solver application. * Logging is now done via the `lumberjack` library. * macaw-symbolic now uses the "external" resolutions in `DiscoveryFunInfo` while building crucible CFGs. * The path creation code in macaw-refinement was simplified significantly and the approach to path creation has been documented. * The run-refinement tool is now more featureful. * The test suite is a bit more structured and no longer depends on the printed output of the discovery process.
2020-03-13 03:15:08 +03:00
, prettyprinter
, mtl
, lumberjack
, unliftio-core
Reference in New Issue Copy Permalink