Towards Constraint Logic Programming over Strings for Test Data Generation

Krings, Sebastian; Schmidt, Joshua; Skowronek, Patrick; Dunkelau, Jannik; Ehmke, Dierk

doi:10.1007/978-3-030-46714-2_10

Cited by 4 publications

(4 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact, although CP provides the regular(𝑋, 𝑀) constraint-stating that 𝑋 must belong to the language denoted by the FSA 𝑀-it is also true that the string variable (or the array of integer variables) 𝑋 must have a fixed [124] or bounded [15] length. The C(L)P proposals we are aware handling unbounded-length strings via regular sets are [75,99,172].…”

Section: Scs and Cp/smt Solvingmentioning

confidence: 99%

“…More recently, in [99] Krings et al implemented ConString, a CLP system over strings relying on constraint handling rules (CHR) [64] in order to generate test data. The domains of the string variables of ConString are represented with FSA as done in [75].…”

Section: Automata-based Approachesmentioning

confidence: 99%

“…We excluded from the count the self-comparisons (i.e., comparisons between different variants of the solver presented in the paper) and the approaches based on model counters, because they only compare to each others. Also, we did not report the approaches in [42,99,147] because they did not compare against any other approach in Table 2. We grouped together "families" of solvers: Z3str* indicates all the Z3str-based solvers seen in Section 4.2, S3* denotes both S3 and S3P, Trau* refers to both Trau and Z3-Trau.…”

Section: Comparisonmentioning

confidence: 99%

See 2 more Smart Citations

A Survey on String Constraint Solving

AmadiniRoberto

2021

ACM Comput. Surv.

View full text Add to dashboard Cite

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

show abstract

Section: Scs and Cp/smt Solvingmentioning

confidence: 99%

Section: Automata-based Approachesmentioning

confidence: 99%

Section: Comparisonmentioning

confidence: 99%

See 1 more Smart Citation

A Survey on String Constraint Solving

AmadiniRoberto

2021

ACM Comput. Surv.

View full text Add to dashboard Cite

show abstract

“…Moreover, special kinds of objects, namely strings and lists, have been investigated, but the results are limited to data encapsulation. Krings et al translate string operations into constraints using a Prolog-based constraint-handling rules system [Kri+20]. Since even the resulting strings are formulated only in Prolog, the applicability in an integrated language is limited.…”

Section: Related Workmentioning

confidence: 99%

Free Objects in Constraint-logic Object-oriented Programming

Dageförde

Winkelmann

Kuchen

2021

23rd International Symposium on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

Constraint-logic object-oriented programming is useful in the integrated development of business software that occasionally solves constraint-logic problems. So far, work in constraint-logic objectoriented programming was limited to considering constraints that only involve logic variables of primitive types; in particular, boolean, integer, and floating-point numbers. However, the availability of object-oriented features calls for the option to use logic variables in lieu of objects as well. Therefore, support for reference-type logic variables (or free objects) is required. With the present work, we add support for reference-type logic variables to a Java-based constraint-logic objectoriented language. Allowing free objects in statements and expressions results in novel interactions with objects at runtime, for instance, non-deterministic execution of invocations on free objects (taking arbitrary class hierarchies and overriding into account). In order to achieve this, we also propose a dynamic type constraint that restricts the types of free objects at runtime.

show abstract