Add 240+16 instances of the string matching problems. #10
Conversation
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
|
Thank you for the submission. |
|
I have removed the |
|
Thank you again for the submission. This looks like an interesting hard benchmark set. We will likely do some more tests (like running SMT solvers on the benchmarks), but they will be likely included in the upcoming release. |
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.
Instances include substring matching problems and string matching problems with wildcards.
The former determines whether the pattern string exists in the text string. Compared with randomly generated instances, the benchmark includes more complex instances(100+16 instances).
The latter determines whether two strings with wildcards match. It uses
re.allcharand(re.* re.allchar)to represent wildcards, and compares the result ofre.interwithre.noneto determine whether they match. Modern SMT2 solvers are not able to solve this type of problem well(130 instances).