.png){kind=icon}
返回
Dashed strings for string constraint solving
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2020.103368.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Artificial intelligence
Constraint programming
String solving
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
引用论文
.png){kind=icon}
分享收藏Directional interaction of midbrain and hypothalamus in the control of carbachol-induced aggression
PREAI
分享收藏HAMPI: A Solver for Word Equations over Strings, Regular Expressions, and Context-Free Grammars
PREAI
分享收藏 没有更多内容
没有更多内容