Filters








18 Hits in 5.9 sec

Regular Expression Matching on Graphics Hardware for Intrusion Detection [chapter]

Giorgos Vasiliadis, Michalis Polychronakis, Spiros Antonatos, Evangelos P. Markatos, Sotiris Ioannidis
2009 Lecture Notes in Computer Science  
However, the flexible pattern matching functionality of regular expressions in these systems comes with significant overheads in terms of both memory and CPU cycles, since every byte of the inspected input  ...  The significant spare computational power and data parallelism capabilities of modern GPUs permits the efficient matching of multiple inputs at the same time against a large set of regular expressions.  ...  Acknowledgments This work was supported in part by the Marie Curie Actions -Reintegration Grants project PASS. Giorgos Vasiliadis, Michalis Polychronakis, Spiros Antonatos, Evangelos P.  ... 
doi:10.1007/978-3-642-04342-0_14 fatcat:tltn2m5vijf2xkb2b2zrws74ke

Nez: practical open grammar language

Kimio Kuramitsu
2016 Proceedings of the 2016 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software - Onward! 2016  
In Nez, we extend the symbol-based state management to recognize context-sensitive language syntax, which often appears in major programming languages.  ...  To highlight this feature, we have implemented Nez with dynamic parsing, which allows users to integrate a Nez parser as a parser library that loads a grammar at runtime.  ...  Finally, the anonymous reviewers are acknowledged for their helpful suggestions for improving an earlier draft of this paper.  ... 
doi:10.1145/2986012.2986019 dblp:conf/oopsla/Kuramitsu16 fatcat:uxestroeh5br5mle4bmybbal2e

Nez: practical open grammar language [article]

Kimio Kuramitsu
2015 arXiv   pre-print
In Nez, we extend the symbol-based state management to recognize context-sensitive language syntax, which often appears in major programming languages.  ...  To highlight this feature, we have implemented Nez with dynamic parsing, which allows users to integrate a Nez parser as a parser library that loads a grammar at runtime.  ...  Finally, the anonymous reviewers are acknowledged for their helpful suggestions for improving an earlier draft of this paper.  ... 
arXiv:1511.08307v1 fatcat:nxtldh2vojebvbimlw3tdibi7m

FIRE/J—optimizing regular expression searches with generative programming

Vassilios Karakoidas, Diomidis Spinellis
2008 Software, Practice & Experience  
The library is compatible with the POSIX standard.  ...  FIRE/J adopts a standard technique for generating the automaton and introduces a just-in time (JIT) compiler into the regular expression engine that generates tailor made classes for each regular expression  ...  Georgios Gousios and Vassilios Vlachos also supported the writing process with their comments and ideas.  ... 
doi:10.1002/spe.841 fatcat:xunreaaz6ne6zkxwdpe74irqma

A Polynomial-time Regular Expressions Implementation

Paulo Eustaquio Duarte Pinto, Juan Pedro Alves Lopes, Maria Alice Silveira de Brito
2017 Cadernos do IME - Série Informática  
Besides, the way they are implemented sometimes causes expressions that could be processed in linear time to take exponential time.  ...  In this work, we suggest a simple implementation (based on Thompson's Construction Algorithm) that has superior worst-case performance than many popular implementations.  ...  These results confirm the need for parsimony when using regular expressions, especially in software that share hardware resources among multiple users, e.g. websites and other network services.  ... 
doi:10.12957/cadinf.2016.13778 fatcat:lkkvblgec5aubcm3ks7walzl4e

Stream Processing using Grammars and Regular Expressions [article]

Ulrik Terp Rasmussen
2017 arXiv   pre-print
In the first part we develop two linear-time algorithms for regular expression based parsing with Perl-style greedy disambiguation.  ...  string transducers with worst-case linear-time performance.  ...  Oniglib, a regular expression library written in C++ with support for different character encodings [38] . Ragel, a finite state machine compiler with multiple language backends [65] .  ... 
arXiv:1704.08820v1 fatcat:twr3ysgyzzg3nap22n6xvepp5i

Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching

Martin Berglund, Frank Drewes, Brink van der Merwe
2014 Electronic Proceedings in Theoretical Computer Science  
Based on this, we propose two types of static analysis, which take a regular expression and tell whether there exists a family of strings which makes Java-style matching run in exponential time.  ...  In particular, we define an automata model which captures all the aspects needed to study such matching engines in a formal way.  ...  Acknowledgment We thank the referees for extensive lists of valuable comments.  ... 
doi:10.4204/eptcs.151.7 fatcat:og2ozdfqdzgl5kgyfyspulq4xq

Kleenex: compiling nondeterministic transducers to deterministic streaming transducers

Bjørn Bugge Grathwohl, Fritz Henglein, Ulrik Terp Rasmussen, Kristoffer Aalund Søholm, Sebastian Paaske Tørholm
2016 SIGPLAN notices  
In use cases it achieves consistently high throughput rates around the 1 Gbps range on stock hardware, performing well, especially in complex use cases, in comparison to both specialized and related tools  ...  We present and illustrate Kleenex, a language for expressing general nondeterministic finite transducers, and its novel compilation to streaming string transducers with essentially optimal streaming behavior  ...  This work has been partially supported by The Danish Council for Independent Research under Project 11-106278, "Kleene Meets Church: Regular Expressions and Types".  ... 
doi:10.1145/2914770.2837647 fatcat:awp6t3efmva6xg5dlewzclsp6e

Kleenex: compiling nondeterministic transducers to deterministic streaming transducers

Bjørn Bugge Grathwohl, Fritz Henglein, Ulrik Terp Rasmussen, Kristoffer Aalund Søholm, Sebastian Paaske Tørholm
2016 Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL 2016  
In use cases it achieves consistently high throughput rates around the 1 Gbps range on stock hardware, performing well, especially in complex use cases, in comparison to both specialized and related tools  ...  We present and illustrate Kleenex, a language for expressing general nondeterministic finite transducers, and its novel compilation to streaming string transducers with essentially optimal streaming behavior  ...  This work has been partially supported by The Danish Council for Independent Research under Project 11-106278, "Kleene Meets Church: Regular Expressions and Types".  ... 
doi:10.1145/2837614.2837647 dblp:conf/popl/GrathwohlHRST16 fatcat:e5nzqgpisban5lk44oi5hqcjty

GNU epsilon - an extensible programming language [article]

Luca Saiu
2013 arXiv   pre-print
We formally develop a static analysis and prove a soundness property with respect to the dynamic semantics.  ...  Reductionism is a viable strategy for designing and implementing practical programming languages, leading to solutions which are easier to extend, experiment with and formally analyze.  ...  is "static", convenient for analysis and compilable with traditional techniques.  ... 
arXiv:1212.5210v5 fatcat:2xod4xlt3nd33nhps7sijfd6y4

SPAF: Stateless FSA-Based Packet Filters

Pierluigi Rolando, Riccardo Sisto, Fulvio Risso
2011 IEEE/ACM Transactions on Networking  
In contrast with most traditional approaches, memory safety and termination can be enforced with minimal run-time overhead even in cyclic filters, thus enabling full parsing of complex protocols and supporting  ...  FSAs provide a comprehensive framework with well-defined composition operations that enable the generation of stateless filters from high-level specifications and their compilation into efficient executable  ...  The authors are with Politecnico di Torino, Dipartimento di Automatica e Informatica, e-mail: {pierluigi.rolando, riccardo.sisto, fulvio.risso}@polito.it This work has been partially supported by The Cisco  ... 
doi:10.1109/tnet.2010.2056698 fatcat:yyttbavdjbelpg5ohuzxdnwlre

Report from Dagstuhl Seminar Scripting Languages and Frameworks: Analysis and Verification 1 Executive Summary

Fritz Henglein, Ranjit Jhala, Shriram Krishnamurthi, Peter Thiemann, Fritz Ranjit, Jhala Shriram, Krishnamurthi Peter, Thiemann License
Seminar   unpublished
In addition to talks describing the latest problems and research on the key issues, split roughly into four overarching themes: semantics, types, analysis, contracts, languages, and security, the seminar  ...  and blame, and the role of soundness in analyzing real world languages, as well as several "tutorial" sessions explaining various new tools and techniques.  ...  Static application security testing (SAST) is a widely used technique that helps to find security vulnerabilities in program code at an early stage in the software development lifecycle.  ... 
fatcat:5w2jmn4qrvefvlq523wrerljyu

Parsing for agile modeling

Jan Kurs, Oscar Marius Nierstrasz
2016 unpublished
Parsec Parsec [LM01] is a library for writing parsers in Haskell based on monadic higher-order parser combinators [HM96].  ...  In pure Prolog normal DCGs can only express context-free grammars, however contextsensitive languages can be expressed in DCGs if extended with extra arguments.  ...  The static NEXT provides better performance, because the overhead can be moved from parse time to compile time.  ... 
doi:10.7892/boris.89195 fatcat:hyc4rgjqh5hxpgk6w6t2fj7kxu

Parsing for agile modeling

Jan Kurs
2016
Parsec Parsec [LM01] is a library for writing parsers in Haskell based on monadic higher-order parser combinators [HM96].  ...  In pure Prolog normal DCGs can only express context-free grammars, however contextsensitive languages can be expressed in DCGs if extended with extra arguments.  ...  The static NEXT provides better performance, because the overhead can be moved from parse time to compile time.  ... 
doi:10.24442/boristheses.891 fatcat:ko5wytvhyzcytfjpvof5ozkeoe

Unifying Synchronization and Events in a Multicore Operating System

Gerd Zellweger
2012
Our experience with Octopus has shown that it simplifies programming services that require complex coordination patterns by a great deal, while at the same time offering a flexible API for a programmer  ...  In a case study, we used Octopus to write a service that is responsible for device management and bootstrapping the OS as well as a replacement for the Barrelfish name server.  ...  Right now, ECL i PS e uses the PCRE regex library [29] to match regular expressions.  ... 
doi:10.3929/ethz-a-7305111 fatcat:7wi5g4lm4fajrnmnb3wpyv4k24
« Previous Showing results 1 — 15 out of 18 results