Proof-directed program transformation: A functional account of efficient regular expression matching

IF 1.1 3区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Journal of Functional Programming Pub Date : 2021-05-24 DOI:10.1017/S0956796820000295

Andrzej Filinski

引用次数: 0

Abstract

Abstract We show how to systematically derive an efficient regular expression (regex) matcher using a variety of program transformation techniques, but very little specialized formal language and automata theory. Starting from the standard specification of the set-theoretic semantics of regular expressions, we proceed via a continuation-based backtracking matcher, to a classical, table-driven state machine. All steps of the development are supported by self-contained (and machine-verified) equational correctness proofs.

查看原文本刊更多论文

指向证明的程序转换:高效正则表达式匹配的功能描述

摘要我们展示了如何使用各种程序转换技术，但很少使用专门的形式语言和自动机理论，系统地导出高效的正则表达式（regex）匹配器。从正则表达式的集合论语义的标准规范开始，我们通过一个基于连续的回溯匹配器，进入一个经典的表驱动状态机。开发的所有步骤都有独立的（经过机器验证的）等式正确性证明。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Functional Programming 工程技术-计算机：软件工程

CiteScore

1.70

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： Journal of Functional Programming is the only journal devoted solely to the design, implementation, and application of functional programming languages, spanning the range from mathematical theory to industrial practice. Topics covered include functional languages and extensions, implementation techniques, reasoning and proof, program transformation and synthesis, type systems, type theory, language-based security, memory management, parallelism and applications. The journal is of interest to computer scientists, software engineers, programming language researchers and mathematicians interested in the logical foundations of programming.