Adaptive Pattern Matching on Binary Data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2986, Issue , 2004, Pages 124-139

  Gustafsson, Per ^a   Sagonas, Konstantinos ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; BINS; INTERFERENCE SUPPRESSION; NETWORK PROTOCOLS; PATTERN MATCHING;

ADAPTIVE PATTERN; BINARY DATA; FUNCTIONAL PROGRAMS; NETWORK APPLICATIONS; REDUNDANT TESTS; TELECOM APPLICATIONS; TREE AUTOMATA;

TREES (MATHEMATICS);

EID: 35048901494     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24725-8_10     Document Type: Article

References (17)

1. L. Augustsson. Compiling pattern matching. In Functional Programming Languages and Computer Architecture, number 201 in LNCS, pages 368-381. Springer-Verlag, Sept. 1985.
2. M. Bailey, B. Gopal, M. Pagels, L. Peterson, and P. Sarkar. PATHFINDER: A pattern-based packet classifier. In Proceedings of USENIX OSDI Symposium, pages 115-123, Nov. 1994.
3. M. Baudinet and D. MacQueen. Tree pattern matching for ML. Unpublished paper, 1985.
4. A. Begel, S. McCanne, and S. L. Graham. BPF+: Exploiting global data-flow optimization in a generalized packet filter architecture. In ACM SIGCOMM, pages 123-134, Aug. 1999.
5. D. Comer and R. Sethi. The complexity of trie index construction. Journal of the ACM, 24(3):428-440, July 1977.
6. D. R. Engler and M. F. Kaashoek. DPF: Fast, flexible message demultiplexing using dynamic code generation. In Proceedings of ACM SIGCOMM, pages 53-59. Aug. 1996.
7. P. Gustafsson and K. Sagonas. Native code compilation of Erlang's bit syntax. In Proceedings of ACM SIGPLAN Erlang Workshop, pages 6-15. ACM Press, Nov. 2002.
8. P. Gustafsson and K. Sagonas. Adaptive pattern matching on binary data. Technical Report, Department of Information Technology, Uppsala University, Sweden, Dec. 2003.
9. L. Hyafil and R. L. Rivest. Constructing optimal binary decision tress is NP-complete. Information Processing Letters, 5(1):15-17, May 1976.
10. F. Le Fessant and L. Maranget. Optimizing pattern matching. In Proceedings of the ACM SIGPLAN International Conference on Functional programming, pages 26-37. Sept. 2001.
11. P. J. McCann and S. Chandra. Packet types: Abstract specification of network protocol messages. In Proceedings of ACM SIGCOMM, pages 321-333. Aug./Sept. 2000.
12. P. Nyblom. The bit syntax - the released version. In Proceedings of the Sixth International Erlang/OTP User Conference, Oct. 2000. Available at http://www.erlang.se/euc/00/.
13. K. Scott and N. Ramsey. When do match-compilation heuristics matter? Technical Report CS-2000-13, Department of Computer Science, University of Virginia, May 2000.
14. R. C. Sekar, R. Ramesh, and I. V. Ramakrishnan. Adaptive pattern matching. SIAM Journal of Computing, 24(6): 1207-1234, Dec. 1995.
15. P. Wadler. Efficient compilation of pattern matching. In S. L. Peyton Jones, editor, The Implementation of Functional Programming Languages, chapter 7. Prentice-Hall, 1987.
16. M. Wallace and C. Runciman. The bits between the lambdas: Binary data in a lazy functional language. In Proceedings of ACM SIGPLAN ISMM, pages 107-117. ACM Press, Oct. 1998.
17. C. Wikström and T. Rogvall. Protocol programming in Erlang using binaries. In the Erlang/OTP User Conference, Oct. 1999. Available at http://www.erlang.se/euc/99/.