Proving correctness of regular expression accelerators

Proceedings - Design Automation Conference

Volumn , Issue , 2012, Pages 350-355

  Purandare, Mitra ^a   Atasu, Kubilay ^a   Hagleitner, Christoph ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

formal verification; regular expression accelerators

Indexed keywords

COMPLEX PATTERN; FORMAL VERIFICATIONS; POST-PROCESSOR; REGULAR EXPRESSIONS; REGULAR-EXPRESSION MATCHING; RULE SET; SEQUENTIAL EQUIVALENCE CHECKING; SIMULATION AND TESTING; VERIFICATION METHOD;

COMPUTER AIDED DESIGN;

PATTERN MATCHING;

EID: 84863554414     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2228360.2228424     Document Type: Conference Paper

References (15)

1. Emerging Threats. http://www.emergingthreats.net/.
2. PCRE - Perl Compatible Regular Expressions. http://www.pcre.org/.
3. SNORT network intrusion detection system. http://www.snort.org/.
4. J. Baumgartner, H. Mony, V. Paruthi, R. Kanzelman, and G. Janssen. Scalable sequential equivalence checking across arbitrary design transformations. In ICCD'06, pages 259-266, 2006.
5. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. Inf. Comput., 98:142-170, June 1992.
6. D. D. Gajski, N. D. Dutt, A. C.-H. Wu, and S. Y.-L. Lin. High-level synthesis: Introduction to Chip and System Design. Kluwer Academic Publishers, Norwell, MA, USA, 1992.
7. J. E. Hopcroft, R. Motwani, and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison Wesley, 2000.
8. S. Kumar, B. Chandrasekaran, J. Turner, and G. Varghese. Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia. In ANCS '07, pages 155-164. ACM, 2007.
9. K. McMillan. Interpolation and SAT-based model checking. In Computer Aided Verification, volume 2725 of Lecture Notes in Computer Science, pages 1-13. Springer Berlin / Heidelberg, 2003.
10. H. Mony, J. Baumgartner, A. Mishchenko, and R. Brayton. Speculative reduction-based scalable redundancy identification. In DATE '09, pages 1674-1679, 2009.
11. J. Rohrer, K. Atasu, J. van Lunteren, and C. Hagleitner. Memory-e cient distribution of regular expressions for fast deep packet inspection. In CODES+ISSS, pages 147-154, 2009.
12. R. Smith, C. Estan, S. Jha, and S. Kong. Deating the big bang: fast and scalable deep packet inspection with extended finite automata. In SIGCOMM '08, pages 207-218. ACM, 2008.
13. L. Tan and T. Sherwood. A high throughput string matching architecture for intrusion detection and prevention. In ISCA '05, pages 112-122, 2005.
14. N. Tuck, T. Sherwood, B. Calder, and G. Varghese. Deterministic memory-efficient string matching algorithms for intrusion detection. In IEEE Infocom, pages 2628-2639, 2004.
15. J. van Lunteren. High-performance pattern-matching for intrusion detection. In INFOCOM 2006, pages 1-13, 2006.