实用正则表达式匹配中的灾难性回溯行为分析
Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching
摘要:
我们开发了一个正式的角度如何正则表达式匹配在Java中,一个受欢迎的代表类别的正则表达式定向匹配引擎的工作原理。特别是,我们定义了一个自动机模型,它捕获了以正式的方式研究这种匹配引擎所需的所有方面。在此基础上,我们提出了两种类型的静态分析,这需要一个正则表达式,并告诉是否存在一个家庭的字符串,使Java风格的匹配运行在指数时间。
英文摘要:
We develop a formal perspective on how regular expression matching works in Java, a popular representative of the category of regex-directed matching engines. In particular, we define an automata model which captures all the aspects needed to study such matching engines in a formal way. Based on this, we propose two types of static analysis, which take a regular expression and tell whether there exists a family of strings which makes Java-style matching run in exponential time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。