Premium
ZaligVinder: A generic test framework for string solvers
Author(s) -
Kulczynski Mitja,
Manea Florin,
Nowotka Dirk,
Poulsen Danny Bøgsted
Publication year - 2023
Publication title -
journal of software: evolution and process
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.371
H-Index - 29
eISSN - 2047-7481
pISSN - 2047-7473
DOI - 10.1002/smr.2400
Subject(s) - benchmarking , string (physics) , computer science , set (abstract data type) , multitude , theoretical computer science , programming language , mathematics , philosophy , epistemology , marketing , business , mathematical physics
The increased interest in string solving in the recent years has made it very hard to identify the right tool to address a particular user's purpose. Firstly, there is a multitude of string solvers, each addressing essentially some subset of the general problem. Generally, the addressed fragments are relevant and well motivated, but the lack of comparisons between the existing tools on an equal set of benchmarks cannot go unnoticed, especially as a common framework to compare solvers seems to be missing. In this paper, we gather a set of relevant benchmarks and introduce our new benchmarking framework to address this purpose.