检索结果-南通市图书馆

Ensuring the Correctness of regular expressions: A Review

International Journal of Automation and computing 2021年第4期18卷 521-535页

作者： Li-Xiao Zheng Shuai Ma Zu-Xi Chen Xiang-Yu Luo College of Computer Science and Technology Huaqiao UniversityXiamen 361021China State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China

regular expressions are widely used within and even outside of computer science due to their expressiveness and ***, regular expressions have a quite compact and rather tolerant syntax that makes them hard to understand, hard to compose,and error-prone. Faulty regular expressions may cause failures of the applications that use them. Therefore, ensuring the correctness of regular expressions is a vital prerequisite for their use in practical applications. The importance and necessity of ensuring correct definitions of regular expressions have attracted extensive attention from researchers and practitioners, especially in recent years. In this study, we provide a review of the recent works for ensuring the correct usage of regular expressions. We classify those works into different categories, including the empirical study, test string generation, automatic synthesis and learning, static checking and verification,visual representation and explanation, and repairing. For each category, we review the main results, compare different approaches, and discuss their advantages and disadvantages. We also discuss some potential future research directions.

关键词： regular expressions correctness string generation learning static checking verification visualization repairing

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

BSPM:A NEW MECHANISM FOR “OVERLAP-MATCHING expressions”IN DPI

引用

Journal of Electronics(China) 2010年第3期27卷 289-297页

作者： Li Zheng Yu Nenghai Li Yang MOE-Microsoft Key Lab of Multimedia Computing and Communication University of Science and Technology of China Hefei 230027 China

Nowadays, using Deterministic Finite Automata (DFA) or Non-deterministic Finite Automata (NFA) to parse regular expressions is the most popular way for Deep Packet Inspection (DPI), and the research about DPI focuses on the improvement of DFA to reduce memory. However, most of the existing literature ignores a special kind of "overlap-matching expression", which causes states explosion and takes quite a large part in the DPI rules. To solve this problem, in this paper a new mechanism is proposed based on bitmap. We start with a simple regular expression to describe "overlap-matching expressions" and state the problem. Then, after calculating the terrible number of exploded states for this kind of expressions, the procedure of Bitmap-based Soft Parallel Mechanism (BSPM) is described. Based on BSPM, we discuss all the different types of "overlap-matching ex- pressions" and give optimization suggestions of them separately. Finally, experiment results prove that BSPM can give an excellent performance on solving the problem stated above, and the optimization suggestions are also effective for the memory reduction on all types of "overlap-matching expressions".

关键词： Intrusion detection Deep Packet Inspection (DPI) regular expressions Bitmap-based Deterministic Finite Automata (DFA)

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

On Some Systems of Word Equations for Automata

引用

Journal of Applied Mathematics and Physics 2024年第12期12卷 4322-4332页

作者： Nikolai I. Krainukov Mikhail E. Abramyan Boris F. Melnikov Faculty of Computational Mathematics and Cybernetics Shenzhen MSU-BIT University Shenzhen China Algebra and Discrete Mathematics Department Southern Federal University Rostov-on-Don Russian Federation

In this paper, we use some programing tools and algorithms for solving system of word equation for regular languages. There are many possibilities for presentation of regular languages such as grammars, finite automata, rewriting systems and so on. Some of these systems is presented by system of computational discrete algebra GAP and the possibilities of presentation now in some systems interactive theorem provers (Isabelle, Coq). This computer system can give to detailed understanding of solution of system of word equation, compared the languages and regular expressions of the languages.

关键词： Finite Automata Word Equation Free Algebra regular expressions Normal Forms

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Semantic Recognition of a Data Structure in Big-Data

引用

Journal of Computer and Communications 2014年第9期2卷 93-102页

作者： Aicha Ben Salem Faouzi Boufares Sebastiao Correia Laboratory LIPN-UMR 7030-CNRS University Paris 13Sorbonne Paris CitéVilletaneuseFrance Company Talend SuresnesFrance

Data governance is a subject that is becoming increasingly important in business and government. In fact, good governance data allows improved interactions between employees of one or more organizations. Data quality represents a great challenge because the cost of non-quality can be very high. Therefore the use of data quality becomes an absolute necessity within an organization. To improve the data quality in a Big-Data source, our purpose, in this paper, is to add semantics to data and help user to recognize the Big-Data schema. The originality of this approach lies in the semantic aspect it offers. It detects issues in data and proposes a data schema by applying a semantic data profiling.

关键词： Data Quality Big-Data Semantic Data Profiling Data Dictionary regular expressions Ontology

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

构造正则表达式的几种NFA算法的分析和比较

构造正则表达式的几种NFA算法的分析和比较

引用

2006年全国理论计算机科学学术年会

作者：袁真合肥工业大学计算机与信息学院

＜正＞1 引言正则表达式有着重要的实际应用价值,而大多数情况是通过不确定有限自动机NFA实现的。正则表达式的实际应用的效率及运算速度取决于所得 NFA算法的尺寸大小。根据这一原则,对某一正规则表达式选择何种NFA算法,有着重要的实... 详细信息

＜正＞1 引言正则表达式有着重要的实际应用价值,而大多数情况是通过不确定有限自动机NFA实现的。正则表达式的实际应用的效率及运算速度取决于所得 NFA算法的尺寸大小。根据这一原则,对某一正规则表达式选择何种NFA算法,有着重要的实用价值。

关键词： regular expressions Nondeterministic finite automata (NFA) Algorithms

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：