Sciweavers

103 search results - page 5 / 21
» Constructing malware normalizers using term rewriting
Sort
View
SIGIR
2012
ACM
13 years 2 months ago
Automatic term mismatch diagnosis for selective query expansion
People are seldom aware that their search queries frequently mismatch a majority of the relevant documents. This may not be a big problem for topics with a large and diverse set o...
Le Zhao, Jamie Callan
PLILP
1998
Springer
15 years 3 months ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...
ICTAC
2004
Springer
15 years 5 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
JSC
2010
102views more  JSC 2010»
14 years 10 months ago
Equational approximations for tree automata completion
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms...
Thomas Genet, Vlad Rusu
MOBISYS
2008
ACM
15 years 11 months ago
Detecting energy-greedy anomalies and mobile malware variants
Mobile users of computation and communication services have been rapidly adopting battery-powered mobile handhelds, such as PocketPCs and SmartPhones, for their work. However, the...
Hahnsang Kim, Joshua Smith, Kang G. Shin