Sciweavers

WIA
1999
Springer
13 years 8 months ago
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
Finite-state techniques are widely used in various areas of Natural Language Processing (NLP). As Kaplan and Kay [12] have argular expressions are the appropriate level of abstract...
Gertjan van Noord, Dale Gerdemann
ICS
2010
Tsinghua U.
13 years 9 months ago
Small-ruleset regular expression matching on GPGPUs: quantitative performance analysis and optimization
We explore the intersection between an emerging class of architectures and a prominent workload: GPGPUs (General-Purpose Graphics Processing Units) and regular expression matching...
Jamin Naghmouchi, Daniele Paolo Scarpazza, Mladen ...
LATA
2010
Springer
13 years 9 months ago
Simplifying Regular Expressions. A Quantitative Perspective
Abstract. We consider the efficient simplification of regular expressions and suggest a quantitative comparison of heuristics for simplifying regular expressions. To this end, we...
Hermann Gruber and Stefan Gulan
WCRE
2003
IEEE
13 years 9 months ago
RegReg: a Lightweight Generator of Robust Parsers for Irregular Languages
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
Mario Latendresse
ISOLA
2004
Springer
13 years 9 months ago
Embedding Finite Automata within regular Expressions
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...
Shoham Ben-David, Dana Fisman, Sitvanit Ruah
CALCO
2005
Springer
85views Mathematics» more  CALCO 2005»
13 years 10 months ago
Using Proofs by Coinduction to Find "Traditional" Proofs
In the specific situation of formal reasoning concerned with “regular expression equivalence” we address instances of more general questions such as: how can coinductive argum...
Clemens Grabmayer
DATE
2006
IEEE
140views Hardware» more  DATE 2006»
13 years 10 months ago
Optimization of regular expression pattern matching circuits on FPGA
Regular expressions are widely used in Network Intrusion Detection System (NIDS) to represent patterns of network attacks. Since traditional software-only NIDS cannot catch up to ...
Cheng-Hung Lin, Chih-Tsun Huang, Chang-Ping Jiang,...
TASE
2008
IEEE
13 years 10 months ago
PDL over Accelerated Labeled Transition Systems
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...
Taolue Chen, Jaco van de Pol, Yanjing Wang
RECONFIG
2008
IEEE
224views VLSI» more  RECONFIG 2008»
13 years 10 months ago
Automatic Construction of Large-Scale Regular Expression Matching Engines on FPGA
—We present algorithms for implementing large-scale regular expression matching (REM) on FPGA. Based on the proposed algorithms, we develop tools that first transform regular ex...
Yi-Hua E. Yang, Viktor K. Prasanna
IISWC
2008
IEEE
13 years 10 months ago
A workload for evaluating deep packet inspection architectures
—High-speed content inspection of network traffic is an important new application area for programmable networking systems, and has recently led to several proposals for high-per...
Michela Becchi, Mark A. Franklin, Patrick Crowley