Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 120 for “"regular expression"”.
-
POSIX Regular Expression Matching and Lexing
… the most widely used disambiguation strategy for regular expression matching. There are some difficulties associated with the POSIX strategy and according to tests conducted by Kulkewitz, many regular expression matchers implementing this strategy produce incorrect results. This thesis is …
-
XHaskell - Adding regular expression types to haskell
… which integrates XDuce features such as regular expression types, subtyping and regular expression pattern matching into Haskell. In addition, we also support the combination of regular expression types parametric polymorphism and type classes which to the best of our knowledge has not …
-
Regular Expression Synthesis for BLAST Two-Hit Filtering
Genomic databases are exhibiting a growth rate that is outpacing Moore's Law, which has made database search algorithms a popular application for use on emerging processor technologies. NCBI BLAST is the standard tool for performing searches against these databases, which operates by transforming …
-
Semantics, analysis and security of backtracking regular expression matchers
Regular expressions are ubiquitous in computer science. Originally defined by Kleene in 1956, they have become a staple of the computer science undergraduate curriculum. Practical applications of regular expressions are numerous, ranging from compiler construction through smart text editors to …
-
Techniques for efficient regular expression matching across hardware architectures
Regular expression matching is a central task for many networking and bioinformatics applications. For example, network intrusion detection systems, which perform deep packet inspection to detect malicious network activities, often encode signatures of malicious traffic through regular expressions. …
-
Internet data extraction based on automatic regular expression inference
<p>Modern biologists face greater challenges for dealing with the enormous amount of biological data generated by a variety of modern biological studying methods. It becomes very important to extract and analyze specific information from these data efficiently. Nowaday, with the advantage of the …
-
Resilient regular expression matching on FPGAs with fast error repair
… infrastructure which aims at high flexibility. Regular expression matching is an important and compute intensive mechanism used to perform Deep Packet Inspection, which can be FPGA-accelerated to meet performance constraints. This solution, however, introduces new challenges regarding …
-
Developing a Compiler for a Regular Expression Based Policy Specification Language
… policy specification language that uses signed regular expressions to return sets of allowed and denied actions as output from its policies, allowing policies to be combined with standard set operations in an algebraic way. This thesis covers my contribution to the PoCo project in creating a …
-
On the Impact and Defeat of Regular Expression Denial of Service
Regular expressions (regexes) are a widely-used yet little-studied software component. Engineers use regexes to match domain-specific languages of strings. Unfortunately, many regex engine implementations perform these matches with worst-case polynomial or exponential time complexity in the length …
-
Improving Software Quality for Regular Expression Matching Tools Using Automated Combinatorial Testing
Regular expression matching tools (grep) match regular expressions to lines of text. However, because of the complexity that regular expressions can reach, it is challenging to apply state of the art automated testing frameworks to grep tools. Combinatorial testing has shown to be an effective …
-
FPGA-based High Throughput Regular Expression Pattern Matching for Network Intrusion Detection Systems
… is defined as the concurrent throughput of a regular expression matching engine circuit divided by the average number of look up tables (LUTs) utilised by each state of the engine"s automata. The implemented FPGA-based design was built upon the concept of equivalence classification. The …
-
PERG-Rx : an FPGA-based pattern-matching engine with limited regular expression support for large pattern databases
… hardware, PERG is the first to integrate limited regular-expression support. In ClamAV, this feature is needed for polymorphic virus detection. Finally among hash-based hardware pattern-matching engines, PERG is the first to implement Bloomier filters. With Bloomier filters, the process of exact …
-
Deep packet inspection on large datasets : algorithmic and parallelization techniques for accelerating regular expression matching on many-core processors
Regular expression matching is a central task in several networking (and search) applications and has been accelerated on a variety of parallel architectures, including general purpose multi-core processors, network processors, field programmable gate arrays, ASIC- and TCAM-based systems. All of …
-
Approximate string matching with pumping
… a string and a class of strings represented by a regular expression. The result allows arbitrary pumping of symbols and substrings. The extended algorithm has the same complexity as the original-O(mn) where m and n are the lengths of the regular expression and the string.</p>
-
Approximate matching of complex structures
… matching of a string with a special type of regular expression where the kleene closure (*) is only allowed to be bound to a single character in a worst case execution time of O(|S|^3) for a given string S . Our performance evaluation indicates that our proposed techniques indeed outperform …
-
Rapid Detection of Conserved Biological Motifs
… motifs are naturally represented using regular expressions; however, despite decades of theoretical development and mature software implementations, existing regular expression search approaches remain insufficient for efficiently interrogating large biological sequence databases. In …
-
Approximate pattern matching and its applications.
… The pattern can be a fixed string, a limited expression, or a regular expression. The problem has different variations with different levels of difficulties depending on the types of the pattern as well as the constraint imposed on the matching. We present new results both of theoretical …
-
A genetic programming approach to finding discrepancies in log files
… a set of error-free reference logs, a set of regular expression patterns describing the logs’ general structure is generated using genetic programming. The patterns can then be checked against logs containing errors, with the goal being that added, removed and reordered lines are detected. …
-
Specification mining frameworks for complex software systems
… perform template-based mining for a quantitative regular expression and timed quantitative regular expression with linear time complexity respectively. We propose a novel formalism of timed-quantitative regular expressions that incorporate both events, quantitative values, and time constraints all …
Page 1 of 6