Sciweavers

ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
13 years 7 months ago
Efficient Automata-Based Assertion-Checker Synthesis of SEREs for Hardware Emulation
In this paper, we present a method for generating checker circuits from sequential-extended regular expressions (SEREs). Such sequences form the core of increasingly-used Assertion...
Marc Boule, Zeljko Zilic
ANCS
2007
ACM
13 years 7 months ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley
ANCS
2007
ACM
13 years 7 months ago
Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia
The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detectio...
Sailesh Kumar, Balakrishnan Chandrasekaran, Jonath...
VLDB
1990
ACM
116views Database» more  VLDB 1990»
13 years 7 months ago
Factoring Augmented Regular Chain Programs
In previous papers we have proposed a graphical query language for expressing traversal recursions in labelled, directed graphs. A fundamental feature of the language is the use o...
Peter T. Wood
ECHT
1992
13 years 7 months ago
Gram: A Graph Data Model and Query Language
We present a model for data organized as graphs. Regular expressions over the types of the node and edge labels are used to qualify connected subgraphs. An algebraic language base...
Bernd Amann, Michel Scholl
CPM
2001
Springer
98views Combinatorics» more  CPM 2001»
13 years 8 months ago
Regular Expression Searching over Ziv-Lempel Compressed Text
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 and LZW variants. Give...
Gonzalo Navarro
ICDT
2003
ACM
139views Database» more  ICDT 2003»
13 years 8 months ago
New Rewritings and Optimizations for Regular Path Queries
All the languages for querying semistructured data and the web use as an integral part regular expressions. Based on practical observations, finding the paths that satisfy those r...
Gösta Grahne, Alex Thomo
WIA
2004
Springer
13 years 9 months ago
Enumerating Regular Expressions and Their Languages
Abstract. We discuss enumeration of regular expressions and the distinct languages they represent.
Jonathan Lee, Jeffrey Shallit
WEBDB
2004
Springer
143views Database» more  WEBDB 2004»
13 years 9 months ago
DTDs versus XML Schema: A Practical Study
Among the various proposals answering the shortcomings of Document Type Definitions (DTDs), XML Schema is the most widely used. Although DTDs and XML Schema Defintions (XSDs) di...
Geert Jan Bex, Frank Neven, Jan Van den Bussche
MFCS
2004
Springer
13 years 9 months ago
The Dual of Concatenation
A binary language-theoretic operation is proposed, which is dual to the concatenation of languages in the same sense as the universal quantifier in logic is dual to the existenti...
Alexander Okhotin