The Power of String Solving: Simplicity of Comparison

Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

9 Citations (Scopus)

Abstract

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 solving, 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 ZaligVinder to address this purpose.
Original languageEnglish
Title of host publicationAST '20: Proceedings of the IEEE/ACM 1st International Conference on Automation of Software Test
Number of pages4
PublisherAssociation for Computing Machinery
Publication date2020
Pages85–88
ISBN (Print)978-1-4503-7957-1
ISBN (Electronic)9781450379571
DOIs
Publication statusPublished - 2020
Event IEEE/ACM: International Conference on Automation of Software Test - Seoul, Korea, Republic of
Duration: 1 Oct 202031 Oct 2020
Conference number: 1st

Conference

Conference IEEE/ACM: International Conference on Automation of Software Test
Number1st
Country/TerritoryKorea, Republic of
CitySeoul
Period01/10/202031/10/2020

Cite this