Sciweavers

40 search results - page 8 / 8
» A NFA-based programmable regular expression match engine
Sort
View
ASPLOS
2006
ACM
13 years 11 months ago
Combinatorial sketching for finite programs
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...
Armando Solar-Lezama, Liviu Tancau, Rastislav Bod&...
ACSAC
2004
IEEE
13 years 8 months ago
Automatic Generation and Analysis of NIDS Attacks
A common way to elude a signature-based NIDS is to transform an attack instance that the NIDS recognizes into another instance that it misses. For example, to avoid matching the a...
Shai Rubin, Somesh Jha, Barton P. Miller
EUROSYS
2008
ACM
14 years 2 months ago
Documenting and automating collateral evolutions in linux device drivers
The internal libraries of Linux are evolving rapidly, to address new requirements and improve performance. These evolutions, however, entail a massive problem of collateral evolut...
Yoann Padioleau, Julia L. Lawall, René Rydh...
POPL
2010
ACM
14 years 2 months ago
Semantics and Algorithms for Data-dependent Grammars
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
Yitzhak Mandelbaum, Trevor Jim, David Walker
PPPJ
2009
ACM
13 years 12 months ago
Phase detection using trace compilation
Dynamic compilers can optimize application code specifically for observed code behavior. Such behavior does not have to be stable across the entire program execution to be bene...
Christian Wimmer, Marcelo Silva Cintra, Michael Be...