Dashed strings for string constraint solving
AuthorAmadini, R; Gange, G; Stuckey, PJ
Source TitleArtificial Intelligence
AffiliationComputing and Information Systems
Document TypeJournal Article
CitationsAmadini, R., Gange, G. & Stuckey, P. J. (2020). Dashed strings for string constraint solving. Artificial Intelligence, 289, https://doi.org/10.1016/j.artint.2020.103368.
Access StatusThis item is embargoed and will be available on 2022-12-01
String processing is ubiquitous across computer science, and arguably more so in web programming — where it is also a critical part of security issues such as injection attacks. In recent years, a number of string solvers have been developed to solve combinatorial problems involving string variables and constraints. We examine the dashed string approach to string constraint solving, which represents an unknown string as a sequence of blocks of characters with bounds on their cardinalities. The solving approach relies on propagation of information about the blocks of characters that arise from reasoning about the constraints in which they occur. This approach shows promising performance on many benchmarks involving constraints like string length, equality, concatenation, and regular expression membership. In this paper, we formally review the definition, the properties and the use of dashed strings for string constraint solving, and we provide an empirical validation that confirms the effectiveness of this approach.
- Click on "Export Reference in RIS Format" and choose "open with... Endnote".
- Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References