Results 221 to 230 of about 7,287,958 (273)
Some of the next articles are maybe not open access.
Revealer: Detecting and Exploiting Regular Expression Denial-of-Service Vulnerabilities
IEEE Symposium on Security and Privacy, 2021Yinxi Liu, Mingxue Zhang, W. Meng
semanticscholar +1 more source
Efficient Enumeration of Regular Expressions for Faster Regular Expression Synthesis
2021We study the problem of synthesizing regular expressions from a set of positive and negative strings. The previous synthesis algorithm proposed by Lee et al. [12] relies on the best-first enumeration of regular expressions. To improve the performance of the enumeration process, we define a new normal form of regular expressions called the concise ...
Hyeonseung Im, Sang-Ki Ko, Su-Hyeon Kim
openaire +2 more sources
Symbolic Solving of Extended Regular Expression Inequalities
Foundations of Software Technology and Theoretical Computer Science, 2014This paper presents a new solution to the containment problem for extended regular expressions that extends basic regular expressions with intersection and complement operators and consider regular expressions on infinite alphabets based on potentially ...
M. Keil, Peter Thiemann
semanticscholar +1 more source
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming, 2010
Cody, Hazel, and Theo, two experienced Haskell programmers and an expert in automata theory, develop an elegant Haskell program for matching regular expressions: (i) the program is purely functional; (ii) it is overloaded over arbitrary semirings, which not only allows to solve the ordinary matching problem but also supports other applications like ...
WilkeThomas, HuchFrank, FischerSebastian
openaire +3 more sources
Cody, Hazel, and Theo, two experienced Haskell programmers and an expert in automata theory, develop an elegant Haskell program for matching regular expressions: (i) the program is purely functional; (ii) it is overloaded over arbitrary semirings, which not only allows to solve the ordinary matching problem but also supports other applications like ...
WilkeThomas, HuchFrank, FischerSebastian
openaire +3 more sources
Introducing Regular Expressions
2016To get a head start on introducing regular expressions, I’ll start with an example. It’s one that you’ve experienced hundreds of times. When you enter customer data online, many web forms ask you for an email address. To avoid an incorrectly typed address, an immediate validation makes sense.
openaire +2 more sources
2019
Regular Expression are a very powerful way of processing text while looking for recurring patterns; they are often used with data held in plain text files (such as log files), CSV files as well as Excel files. This chapter introduces regular expressions, discusses the syntax used to define a regular expression pattern and presents the Python re module ...
openaire +2 more sources
Regular Expression are a very powerful way of processing text while looking for recurring patterns; they are often used with data held in plain text files (such as log files), CSV files as well as Excel files. This chapter introduces regular expressions, discusses the syntax used to define a regular expression pattern and presents the Python re module ...
openaire +2 more sources
2003
The concept of regular expressions was introduced for the purpose of representing the languages accepted by deterministic finite automata. This is necessary in the analysis and synthesis of finite automata since the languages accepted by finite automata are usually infinite.
John N. Mordeson +2 more
openaire +2 more sources
The concept of regular expressions was introduced for the purpose of representing the languages accepted by deterministic finite automata. This is necessary in the analysis and synthesis of finite automata since the languages accepted by finite automata are usually infinite.
John N. Mordeson +2 more
openaire +2 more sources
An Extensible, Regular-Expression-Based Tool for Multi-language Mutant Generation
2018 IEEE/ACM 40th International Conference on Software Engineering: Companion (ICSE-Companion), 2018Alex Groce +4 more
semanticscholar +1 more source
1968
Publisher Summary This chapter discusses the regular expressions. Every regular set can be represented by a regular expression and every regular expression represents a regular set. Algebraic manipulations with regular expressions, and transition graphs are discussed. Various theorems are proved in the chapter.
openaire +2 more sources
Publisher Summary This chapter discusses the regular expressions. Every regular set can be represented by a regular expression and every regular expression represents a regular set. Algebraic manipulations with regular expressions, and transition graphs are discussed. Various theorems are proved in the chapter.
openaire +2 more sources