将邪恶转化为无害

Research Conference of the South African Institute of Computer Scientists and Information Technologists Pub Date : 2017-09-26 DOI:10.1145/3129416.3129440

Brink van der Merwe, Nicolaas Weideman, Martin Berglund

{"title":"将邪恶转化为无害","authors":"Brink van der Merwe, Nicolaas Weideman, Martin Berglund","doi":"10.1145/3129416.3129440","DOIUrl":null,"url":null,"abstract":"We explore the relationship between ambiguity in automata and regular expressions on the one hand, and the matching time of backtracking regular expression matchers on the other. We focus in particular on the extreme cases where we have either an exponential amount of ambiguity or no ambiguity at all. We also investigate techniques to reduce or remove ambiguity from regular expressions, which can then be used to transform regular expressions which might be exploited by using algorithmic complexity, into harmless equivalent expressions.","PeriodicalId":269578,"journal":{"name":"Research Conference of the South African Institute of Computer Scientists and Information Technologists","volume":"110 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Turning evil regexes harmless\",\"authors\":\"Brink van der Merwe, Nicolaas Weideman, Martin Berglund\",\"doi\":\"10.1145/3129416.3129440\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We explore the relationship between ambiguity in automata and regular expressions on the one hand, and the matching time of backtracking regular expression matchers on the other. We focus in particular on the extreme cases where we have either an exponential amount of ambiguity or no ambiguity at all. We also investigate techniques to reduce or remove ambiguity from regular expressions, which can then be used to transform regular expressions which might be exploited by using algorithmic complexity, into harmless equivalent expressions.\",\"PeriodicalId\":269578,\"journal\":{\"name\":\"Research Conference of the South African Institute of Computer Scientists and Information Technologists\",\"volume\":\"110 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Research Conference of the South African Institute of Computer Scientists and Information Technologists\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3129416.3129440\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Research Conference of the South African Institute of Computer Scientists and Information Technologists","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3129416.3129440","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 19

摘要

我们一方面探讨了自动机和正则表达式歧义之间的关系，另一方面探讨了回溯正则表达式匹配器的匹配时间。我们特别关注极端的情况，在这种情况下，我们要么有指数级的模糊性，要么根本没有模糊性。我们还研究了减少或消除正则表达式歧义的技术，这些技术可以用来将正则表达式转换为无害的等效表达式，而正则表达式可能会被算法复杂性所利用。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Turning evil regexes harmless

We explore the relationship between ambiguity in automata and regular expressions on the one hand, and the matching time of backtracking regular expression matchers on the other. We focus in particular on the extreme cases where we have either an exponential amount of ambiguity or no ambiguity at all. We also investigate techniques to reduce or remove ambiguity from regular expressions, which can then be used to transform regular expressions which might be exploited by using algorithmic complexity, into harmless equivalent expressions.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Research Conference of the South African Institute of Computer Scientists and Information Technologists

自引率

0.00%

发文量