horn_string_benchnchmarks#8
Conversation
|
Thank you for the submission. It seems like some benchmarks are duplicates of others. You can find them by running: |
|
Hi, I remove the duplicated files now, thanks. |
|
Ah there are leftover |
|
I think there are still some left ^^ |
|
I think there a bunch of edit tasks to do. |
|
I've added the missing headers and removed incremental benchmarks with only 1 (check-sat). I believe the benchmarks should be in the right format now |
|
Thank you again for the benchmarks! I will merge the pull request. We will run some solvers on them to see if anything odd comes up, but most likely they will be included in this years release. |
HornStr is a solver for invariant synthesis forRegular Model Checking (RMC) with the specification provided in the SMT-LIB 2.6 theory of strings.
This is a set of benchmarks derived from the verification of distributed systems and
string rewriting systems.
Benchmarks are extracted by running HornStr https://arg-git.informatik.uni-kl.de/pub/string-chc-lib on all benchmarks
provided in the repository and gathering the string queries sent to the string solvers.
The benchmarks are divided in incremental and non-incremental queries. We derive the non-incremental benchmarks from the incremental ones. The whole set of non-incremental benchmarks is too big (30000), so we submit only a subset of ~700.