Adaptive pattern matching

Sekar, R.; Ramesh, R.; Ramakrishnan, I. V.

doi:10.1007/3-540-55719-9_78

Cited by 18 publications

(25 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If only parameter positions remain, this basic version of the algorithm fails. For the related problem of building matching automata for trees, such a choice has been shown to be optimal [45][46][47]. Extensions to this basic algorithm are described later in this section.…”

Section: Transducer Constructionmentioning

confidence: 99%

“…The criteria used for constructing compact matching automata are closely related to those used to construct decision trees in machine learning. While machine learning techniques rely on heuristics such as information gain that aren't guaranteed to construct optimal trees, it has been shown that under certain conditions, an optimal matching automaton can be constructed [46,47]. Reference [51] extended the approach to matching network packets, and in that context, demonstrated major gains in terms of space and runtime over a previous technique [34] that relied on information gain.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Lifting Assembly to Intermediate Representation

Hasabnis

Sekar

2016

SIGARCH Comput. Archit. News

View full text Add to dashboard Cite

Translating low-level machine instructions into higher-level intermediate language (IL) is one of the central steps in many binary analysis and instrumentation systems. Existing systems build such translators manually. As a result, it takes a great deal of effort to support new architectures. Even for widely deployed architectures, full instruction sets may not be modeled, e.g., mature systems such as Valgrind still lack support for AVX, FMA4 and SSE4.1 for x86 processors. To overcome these difficulties, we propose a novel approach that leverages knowledge about instruction set semantics that is already embedded into modern compilers such as GCC. In particular, we present a learning-based approach for automating the translation of assembly instructions to a compiler's architecture-neutral IL. We present an experimental evaluation that demonstrates the ability of our approach to easily support many architectures (x86, ARM and AVR), including their advanced instruction sets. Our implementation is available as open-source software.

show abstract

Section: Transducer Constructionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Lifting Assembly to Intermediate Representation

Hasabnis

Sekar

2016

SIGARCH Comput. Archit. News

View full text Add to dashboard Cite

show abstract

“…Deterministic tree automata approaches have been proposed before, e.g. by Baudinet & MacQueen (1985) or by Sekar et al (1995). Such tree-based approaches guarantee that no constructor symbol is inspected twice at runtime, but doing so leads to exponential upper bounds on the automaton size.…”

Section: Related Workmentioning

confidence: 99%

“…An early work on the subject of appropriate such heuristics is that of Baudinet & MacQueen (1985). In the same spirit, Sekar et al (1995) also suggest several different heuristics to synthesize an adaptive traversal order that results in a tree automaton of small size. To further decrease the size of the automaton they generate a directed acyclic graph (DAG) automaton by sharing all isomorphic subtrees and construct automata which are minimal under certain criteria.…”

Section: Related Workmentioning

confidence: 99%

“…To further decrease the size of the automaton they generate a directed acyclic graph (DAG) automaton by sharing all isomorphic subtrees and construct automata which are minimal under certain criteria. Finally, Scott & Ramsey (2000) also examine several different pattern matching compilation heuristics (including those of Baudinet & MacQueen (1985) and Sekar et al (1995)) and measure their effects on different benchmarks. However, all these works differ from ours in that they heavily rely on being able to do a constructor-based decomposition of patterns, and to inspect terms in positions which are known statically.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Efficient manipulation of binary data using pattern matching

Gustafsson

Sagonas

2005

J. Funct. Prog.

View full text Add to dashboard Cite

Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article 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 the binary datatype and a notation for matching binary data against patterns, we present an algorithm that constructs a decision tree automaton from a set of binary patterns. We then show how the pattern matching using this tree automaton can be made adaptive, how redundant tests can be avoided, and how we can further reduce the size of the resulting automaton by taking interferences between patterns into account. Since the size of the tree automaton is exponential in the worst case, we also present an alternative new approach to compiling binary pattern matching which is conservative in space and analyze its complexity properties. The effectiveness of our techniques is evaluated using standard packet filter benchmarks and on implementations of network protocols taken from actual telecom applications.

show abstract

ON tree pattern unification problems

Růžička

Prívara

1993

Fundamentals of Computation Theory

View full text Add to dashboard Cite

Adaptive pattern matching

Cited by 18 publications

References 1 publication

Lifting Assembly to Intermediate Representation

Lifting Assembly to Intermediate Representation

Efficient manipulation of binary data using pattern matching

ON tree pattern unification problems

Contact Info

Product

Resources

About