Filters








35,734 Hits in 6.0 sec

Approximate regular expression matching with multi-strings

Djamal Belazzougui, Mathieu Raffinot
2013 Journal of Discrete Algorithms  
There also exists a solution for the case k = 0 (exact regular expression matching) which solves the problem in time O (dn), where d is the number of strings in the regular expression (a string is a sequence  ...  In this paper, we are interested in solving the approximate regular expression matching problem: we are given a regular expression R in advance and we wish to answer the following query: given a text T  ...  with ε (see Approximate regular expression matching We now describe more in detail the Myers and Miller's algorithm for approximate regular expression matching.  ... 
doi:10.1016/j.jda.2012.07.008 fatcat:m4ftintxgrasnnruxcg5yqybky

Regular Expression Filtering on Multiple q-Grams

Seon-Ho SHIN, HyunBong KIM, MyungKeun YOON
2018 IEICE transactions on information and systems  
The state-of-the-art schemes use a multi-pattern exact stringmatching algorithm as a filtering module placed before a heavy regular expression engine.  ...  Regular expression matching is essential in network and big-data applications; however, it still has a serious performance bottleneck.  ...  Conclusions This paper proposed a new multi-pattern approximate string-matching algorithm for accelerating regular expression matching.  ... 
doi:10.1587/transinf.2017edl8180 fatcat:kngeldioszch7o66gubbzb3c5m

Learning Regular Expressions from Noisy Sequences [chapter]

Ugo Galassi, Attilio Giordana
2005 Lecture Notes in Computer Science  
By interleaving the two operators, regular expressions in general form may be inferred. Both operators are based on string alignment algorithms taken from bio-informatics.  ...  Events are described by means of regular expressions, and the abstraction mechanism is based on the substitution property of regular languages.  ...  String Alignment and Flexible Matching A key role in the abstraction process is played by the approximate matching of strings and of regular expressions, which, in turn, is based on string alignment.  ... 
doi:10.1007/11527862_7 fatcat:csujqpbidzazlgiqd3q4jsbt6y

Patching vulnerabilities with sanitization synthesis

Fang Yu, Muath Alkhalaf, Tevfik Bultan
2011 Proceeding of the 33rd international conference on Software engineering - ICSE '11  
Our approach consists of three phases: Given an attack pattern we first conduct a vulnerability analysis to identify if strings that match the attack pattern can reach the security-sensitive functions.  ...  input does not match the vulnerability signature.  ...  Hence, we may end up with very large regular expressions.  ... 
doi:10.1145/1985793.1985828 dblp:conf/icse/YuAB11 fatcat:jfvsdoetnnggforntvukz2aefe

FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions [article]

Margarida Ferreira and Miguel Terra-Neves and Miguel Ventura and Inês Lynce and Ruben Martins
2020 arXiv   pre-print
FOREST produces a regular expression that matches the desired pattern for the input values and a set of conditions over capturing groups that ensure the validity of integer values in the input.  ...  We propose a novel representation for regular expressions synthesis, multi-tree, which induces patterns in the examples and uses them to split the problem through a divide-and-conquer approach.  ...  Aside from validating the format of form input strings, regular expressions can be coupled with capturing groups.  ... 
arXiv:2012.14235v1 fatcat:2rddq6wkingk7leopwsnknk2sq

Concurrent reading while writing II: The multi-writer case

Gary L. Peterson, James E. Burns
1987 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)  
Recommended Keywords and Synonyms Automata-based searching Problem Definition Given a text string T of length n and a regular expression R, the regular expression matching problem (REM) is to find  ...  Note that this problem is the opposite of the more traditional RE search problem where S Â˙ is a collection of strings and the task is to efficiently find all strings in S that match an input regular expression  ... 
doi:10.1109/sfcs.1987.15 dblp:conf/focs/PetersonB87 fatcat:iz2bxuxqajhqpju4fgyo47ehfe

FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions [chapter]

Margarida Ferreira, Miguel Terra-Neves, Miguel Ventura, Inês Lynce, Ruben Martins
2021 Lecture Notes in Computer Science  
Forest produces a regular expression that matches the desired pattern for the input values and a set of conditions over capturing groups that ensure the validity of integer values in the input.  ...  We propose a novel representation for regular expressions synthesis, multi-tree, which induces patterns in the examples and uses them to split the problem through a divide-and-conquer approach.  ...  Aside from validating the format of form input strings, regular expressions can be coupled with capturing groups.  ... 
doi:10.1007/978-3-030-72016-2_9 fatcat:obq2x2mo3baohemytw2metvale

Automata-based symbolic string analysis for vulnerability detection

Fang Yu, Muath Alkhalaf, Tevfik Bultan, Oscar H. Ibarra
2013 Formal methods in system design  
Using forward reachability analysis we compute an over-approximation of all possible values that string variables can take at each program point.  ...  Intersecting these with a given attack pattern yields the potential attack strings if the program is vulnerable.  ...  These functions provide mechanisms for scanning a string for matches to a given pattern, expressed as a regular expression, and replacing the matched text with a replacement string.  ... 
doi:10.1007/s10703-013-0189-1 fatcat:txsfncin5fcvfbivawkg6nibga

FPGA-Based Acceleration of Pattern Matching in YARA [chapter]

Shreyas G. Singapura, Yi-Hua E. Yang, Anand Panangadan, Tamas Nemeth, Peter Ng, Viktor K. Prasanna
2016 Lecture Notes in Computer Science  
String and regular expression pattern matching is an integral part of intrusion detection systems to detect potential threats.  ...  This is an improvement of 8.8× to 14.5× in comparison with the throughput of 1.45 Gbps for a software implementation on a state of the art multi-core platform.  ...  Since strings are a special case of regular expressions, we apply the REM approach to perform pattern matching of both strings and regular expressions in this paper.  ... 
doi:10.1007/978-3-319-30481-6_26 fatcat:3nr4i7twtfbr7fsw5h63eqift4

SigMatch

Ramakrishnan Kandhan, Nikhil Teletia, Jignesh M. Patel
2010 Proceedings of the VLDB Endowment  
Multi-pattern matching involves matching a data item against a large database of "signature" patterns.  ...  In this paper, we present sigMatch -a fast, versatile, and scalable technique for multi-pattern signature matching.  ...  In approximate multi-string matching, each entity is matched to a string (e.g.  ... 
doi:10.14778/1920841.1920987 fatcat:lntkce5agrajhmegvogqbbz7iq

Multi-modal Synthesis of Regular Expressions [article]

Qiaochu Chen, Xinyu Wang, Xi Ye, Greg Durrett, Isil Dillig
2020 arXiv   pre-print
In this paper, we propose a multi-modal synthesis technique for automatically constructing regular expressions (regexes) from a combination of examples and natural language.  ...  Finally, we conduct a user study involving 20 participants and show that users are twice as likely to successfully come up with the desired regex using Regel compared to without it.  ...  Consider the task of writing a regular expression to match strings that correspond to decimal numbers of the form x .y where x (resp. y) is an integer with at most 15 (resp. 3) digits.  ... 
arXiv:1908.03316v3 fatcat:dl4ixoxjlveyrdi65iqli5m2vu

Generating Vulnerability Signatures for String Manipulating Programs Using Automata-Based Forward and Backward Symbolic Analyses

Fang Yu, Muath Alkhalaf, Tevfik Bultan
2009 2009 IEEE/ACM International Conference on Automated Software Engineering  
Given a program and an attack pattern (specified as a regular expression), we automatically generate string-based vulnerability signatures, i.e., a characterization that includes all malicious inputs that  ...  Intersecting these with the attack pattern yields the potential attack strings if the program is vulnerable.  ...  not match the characters in the regular expression [A-Za-z0-9 .-@://] has been deleted.  ... 
doi:10.1109/ase.2009.20 dblp:conf/kbse/YuAB09 fatcat:w7xuv2xydrhonmgt3a5sio5axi

Practical Multi-pattern Matching Approach for Fast and Scalable Log Abstraction

Daniel Tovarňák
2016 Proceedings of the 11th International Joint Conference on Software Technologies  
Practical Multi-pattern Matching Approach for Fast and Scalable Log Abstraction.  ...  Although the area of multi-regex matching is well studied, there is a lack of suitable practical implementations available for common programming languages.  ...  The patterns have the form of valid regular expressions with named matching groups.  ... 
doi:10.5220/0006006603190329 dblp:conf/icsoft/Tovarnak16 fatcat:xj2ry66gebe5jd2ggtvifzn6hm

NFA Based Regular Expression Matching on FPGA

Kamil Sert, Cuneyt F. Bazlamacci
2021 2021 International Conference on Computer, Information and Telecommunication Systems (CITS)  
With our approach, the circuit for the NFA representation needs less number of states (hence flip-flops) and LUTs to perform the 2-character regular expression matching process.  ...  In this work, we are interested in solving regular expression and hence string matching problem targeting especially the network intrusion detection systems (NIDS) field.  ...  ACKNOWLEDGEMENTS I want to express my sincere gratitude to my supervisor Assoc. Prof. Dr. Cüneyt F. Bazlamaçcı for giving me the honor of working with him.  ... 
doi:10.1109/cits52676.2021.9618426 fatcat:dlppa5bfszhvzjm3zsv2lcty7m

Business Process Automation: A Workflow Incorporating Optical Character Recognition and Approximate String and Pattern Matching for Solving Practical Industry Problems

Coenrad de Jager, Marinda Nel
2019 Applied System Innovation  
The first step takes the raw OCR output and identifies field names using exact string matching and field-values using regular expressions from an externally maintained file.  ...  Finally, approximate string matching is introduced to the workflow, which increases accuracy.  ...  Regular Expressions Regular expressions are often used to help validate correctly formatted strings or to find strings that match the regular expression from a collection of strings [22] .  ... 
doi:10.3390/asi2040033 fatcat:tyv3zc6pc5fcphfczx3cnhvoka
« Previous Showing results 1 — 15 out of 35,734 results