A Survey on String Constraint Solving

01/31/2020
by   Roberto Amadini, et al.
0

String constraint solving refers to solving combinatorial problems involving constraints over string variables. String solving approaches have become popular over the last years given the massive use of strings in different application domains like formal analysis, automated testing, database query processing, and cybersecurity. This paper reports a comprehensive survey on string constraint solving by exploring the large number of approaches that have been proposed over the last decades to solve string constraints.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/21/2022

String Covering: A Survey

The study of strings is an important combinatorial field that precedes t...
research
05/01/2010

The Exact Closest String Problem as a Constraint Satisfaction Problem

We report (to our knowledge) the first evaluation of Constraint Satisfac...
research
08/07/2019

A Survey of Constrained Combinatorial Testing

Combinatorial Testing (CT) is a potentially powerful testing technique, ...
research
02/02/2022

Automated Detection of Doxing on Twitter

Doxing refers to the practice of disclosing sensitive personal informati...
research
12/29/2022

Matchertext: Towards Verbatim Interlanguage Embedding

Embedding text in one language within text of another is commonplace for...
research
11/29/2017

A critical analysis of string APIs: The case of Pharo

Most programming languages, besides C, provide a native abstraction for ...
research
11/08/2022

Comparing Two Counting Methods for Estimating the Probabilities of Strings

There are two methods for counting the number of occurrences of a string...

Please sign up or login with your details

Forgot password? Click here to reset