Sciweavers

103 search results - page 3 / 21
» Constructing malware normalizers using term rewriting
Sort
View
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
15 years 2 months ago
Malware detection using statistical analysis of byte-level file content
Commercial anti-virus software are unable to provide protection against newly launched (a.k.a “zero-day”) malware. In this paper, we propose a novel malware detection techniqu...
S. Momina Tabish, M. Zubair Shafiq, Muddassar Faro...
RTA
1995
Springer
15 years 1 months ago
(Head-) Normalization of Typeable Rewrite Systems
In this paper we study normalization properties of rewrite systems that are typeable using intersection types with and with sorts. We prove two normalization properties of typeable...
Steffen van Bakel, Maribel Fernández
PPDP
2005
Springer
15 years 3 months ago
Program transformation by templates based on term rewriting
Huet and Lang (1978) presented a framework of automated program transformation based on lambda calculus in which programs are transformed according to a given program transformati...
Yuki Chiba, Takahito Aoto, Yoshihito Toyama
89
Voted
CSL
2005
Springer
15 years 3 months ago
Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
Frédéric Blanqui
NAACL
2010
14 years 7 months ago
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
Carlos Gómez-Rodríguez, Marco Kuhlma...