Trie for information about paths #46
Merged
Conversation
This file contains 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
CaelmBleidd
force-pushed
the
caelmbleidd/trie_as_path
branch
2 times, most recently
from
0531bae
to
3889554
Compare
CaelmBleidd
force-pushed
the
caelmbleidd/trie_as_path
branch
from
e35d62e
to
95e78f1
Compare
CaelmBleidd
changed the title
CaelmBleidd
commented
Aug 11, 2023
usvm-core/src/main/kotlin/org/usvm/ps/RandomTreePathSelector.kt
Outdated
Show resolved
Hide resolved
Saloed
approved these changes
Aug 14, 2023
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
This request introduces a new way of representing paths of symbolic execution states. Earlier, we used persistent lists for this purpose, from now we will represent them as a node in a trie. It allows us to make other states visible for the state vie this structure (it might be suitable if the state is going to decide whether it should be forked or not), or to compare two paths in the symbolic execution tree in a constant time (just compare their location in the trie by reference).