An improved DFA for fast regular expression matching

doi:10.1145/1452335.1452339

An improved DFA for fast regular expression matching

Full Text:

Pdf

Buy this Article

Authors:	Domenico Ficara	University of Pisa, Pisa, Italy
	Stefano Giordano	University of Pisa, Pisa, Italy
	Gregorio Procissi	University of Pisa, Pisa, Italy
	Fabio Vitucci	University of Pisa, Pisa, Italy
	Gianni Antichi	University of Pisa, Pisa, Italy
	Andrea Di Pietro	University of Pisa, Pisa, Italy

	2008 Article
Bibliometrics
· Downloads (6 Weeks): 14 · Downloads (12 Months): 105 · Downloads (cumulative): 653 · Citation Count: 17

Published in:

	· Newsletter
	ACM SIGCOMM Computer Communication Review archive
	Volume 38 Issue 5, October 2008 Pages 29-40 ACM New York, NY, USA table of contents doi>10.1145/1452335.1452339

Tools and Resources

Buy this Article
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms deep packet inspection design dfa intrusion prevention packet classification regular expressions security security and protection

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder