Sciweavers

1729 search results - page 83 / 346
» Deterministic Expressions in C
Sort
View
ANCS
2009
ACM
14 years 9 months ago
LaFA: lookahead finite automata for scalable regular expression detection
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
WCRE
2003
IEEE
15 years 5 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
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 12 months ago
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...
Bernard Boigelot, Julien Brusten, Véronique...
CSFW
2012
IEEE
13 years 2 months ago
Measuring Information Leakage Using Generalized Gain Functions
Abstract—This paper introduces g-leakage, a rich generalization of the min-entropy model of quantitative information flow. In g-leakage, the benefit that an adversary derives f...
Mário S. Alvim, Konstantinos Chatzikokolaki...
FSE
2010
Springer
146views Cryptology» more  FSE 2010»
15 years 3 months ago
A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs
This paper provides a unified framework for improving PRF (pseudorandom function) advantages of several popular MACs (message authentication codes) based on a blockcipher modeled a...
Mridul Nandi