带查找功能的扩展正则表达式匹配的精益形式化

Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs Pub Date : 2024-01-09 DOI:10.1145/3636501.3636959

Ekaterina Zhuchko, Margus Veanes, Gabriel Ebner

{"title":"带查找功能的扩展正则表达式匹配的精益形式化","authors":"Ekaterina Zhuchko, Margus Veanes, Gabriel Ebner","doi":"10.1145/3636501.3636959","DOIUrl":null,"url":null,"abstract":"We present a formalization of a matching algorithm for extended regular expression matching based on locations and symbolic derivatives which supports intersection, complement and lookarounds and whose implementation mirrors an extension of the recent .NET NonBacktracking regular expression engine. The formalization of the algorithm and its semantics uses the Lean 4 proof assistant. The proof of its correctness is with respect to standard matching semantics.","PeriodicalId":516581,"journal":{"name":"Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs","volume":"63 11","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Lean Formalization of Extended Regular Expression Matching with Lookarounds\",\"authors\":\"Ekaterina Zhuchko, Margus Veanes, Gabriel Ebner\",\"doi\":\"10.1145/3636501.3636959\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a formalization of a matching algorithm for extended regular expression matching based on locations and symbolic derivatives which supports intersection, complement and lookarounds and whose implementation mirrors an extension of the recent .NET NonBacktracking regular expression engine. The formalization of the algorithm and its semantics uses the Lean 4 proof assistant. The proof of its correctness is with respect to standard matching semantics.\",\"PeriodicalId\":516581,\"journal\":{\"name\":\"Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs\",\"volume\":\"63 11\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-01-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3636501.3636959\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3636501.3636959","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们介绍了基于位置和符号导数的扩展正则表达式匹配算法的形式化，该算法支持交集、补码和查找，其实现反映了最近的 .NET NonBacktracking 正则表达式引擎的扩展。该算法及其语义的形式化使用了 Lean 4 证明助手。其正确性的证明与标准匹配语义有关。

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

查看原文本刊更多论文

Lean Formalization of Extended Regular Expression Matching with Lookarounds

We present a formalization of a matching algorithm for extended regular expression matching based on locations and symbolic derivatives which supports intersection, complement and lookarounds and whose implementation mirrors an extension of the recent .NET NonBacktracking regular expression engine. The formalization of the algorithm and its semantics uses the Lean 4 proof assistant. The proof of its correctness is with respect to standard matching semantics.

求助全文

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

来源期刊

Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs

自引率

0.00%

发文量