1* quebex-syntax:2 * Complete the literate Haskell specification3* quebex:4 * Expand support for arithmetic operations5 * Include 2-3 additional benchmark programs6 * Allow interception of function calls (see `make_symbolic` To-Do below)7* quebex-symex:8 * Align performance of quebex-symex execution with quebex execution9 * Cleanup the symbolic expression language implementation10 * Expand golden tests based on additional arithmetic operations (see above)11 * Consider a closer integration of the Store/Explorer and the Simulator12 * Implement address concretization using the abstract monad13 * Intercept function calls to allow the application to make memory symbolic through `make_symbolic`14 * Implement a custom memory based on the theory of arrays (how do other engines do this?!)15 * Ideally make the store pure by creating unconstrained symbolic values from Atoms later16 * Revise handling of state in: Store, ExecTree, Tracer, Explorer (maybe use a State Monad or smth.)17 * Presupposes refactor of the modular interpreter (see quebex To-Do above)