This repository was archived by the owner on Nov 14, 2019. It is now read-only.
Open
Conversation
Owner
|
Cool! Is it ready to merge? Did you measure performance boost? |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
One set-back from the original symbolic search engine is that the constraint solving task only occurs at the end of program exploration (when the engine needs an different input to explore an alternative path). we realized that the constraint solving can be parallelized from program exploration as they do not conflict.
Goal: Whenever the search engine discovers a branch point and take one direction with its path constraint, the constraint will be queued for SMT solving immediately. The actual solving task is performed in a background worker thread so that it does not block the program exploration. After the engine finishes the current execution and queries for the next input, the solved constraint will provide the input value that leads to a different program path.