2004
DOI: 10.1007/978-3-540-24725-8_10
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive Pattern Matching on Binary Data

Abstract: Abstract. Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This paper presents an approach to extend pattern matching to terms without (much of a) structure such as binaries which is the kind of data format that network applications typically manipulate.After introducing a notation for matching binary data against patterns, we present an algorithm that constructs a tree automaton from a set of binary patterns. … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2004
2004
2010
2010

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 11 publications
0
4
0
Order By: Relevance
“…Many of its commands are directly inspired by the design of domain-specific languages and language extensions such as PADS [10,11,21], DATASCRIPT [4], PACKETTYPES [23], Demeter [20], BINPAC [27] and Erlang binaries [32,15].…”
Section: Related Workmentioning
confidence: 99%
“…Many of its commands are directly inspired by the design of domain-specific languages and language extensions such as PADS [10,11,21], DATASCRIPT [4], PACKETTYPES [23], Demeter [20], BINPAC [27] and Erlang binaries [32,15].…”
Section: Related Workmentioning
confidence: 99%
“…DATASCRIPT has been used to manipulate Java jar files and ELF object files. The developers of Erlang have also introduced language extensions that they refer to as binaries [Wikström and Rogvall 1999;Gustafsson and Sagonas 2004] to aid in packet processing and protocol programming. Finally, we are part of a group developing PADS, another system for managing ad hoc data.…”
Section: Promising Solutionsmentioning
confidence: 99%
“…Some of the different forms of type specifiers are shown in Table 1 together with a brief description of their use; they are explained in detail below. The specifiers for signedness and endianess are not described in this paper, but a description of these specifiers can be found in [1]. If all type specifiers are used, the syntax of each segment expression is:…”
Section: Segments Each Segment Expression Has the General Syntaxmentioning
confidence: 99%
“…[{X,Y} || X <- [1,2,3], Y <- [4,5], is odd(X)] produces the list of pairs: [{1,4},{1,5},{3,4},{3,5}]. There is nothing wrong with multiple generators, but our experience is that they are rarely used in practice.…”
Section: Extended Comprehensions With Multiple Generatorsmentioning
confidence: 99%