Sciweavers

103 search results - page 8 / 21
» Constructing malware normalizers using term rewriting
Sort
View
ENTCS
2007
103views more  ENTCS 2007»
14 years 9 months ago
Static Slicing of Rewrite Systems
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
Diego Cheda, Josep Silva, Germán Vidal
108
Voted
USS
2008
14 years 12 months ago
CloudAV: N-Version Antivirus in the Network Cloud
Antivirus software is one of the most widely used tools for detecting and stopping malicious and unwanted files. However, the long term effectiveness of traditional hostbased anti...
Jon Oberheide, Evan Cooke, Farnam Jahanian
LFCS
1994
Springer
15 years 1 months ago
Strong Normalization in a Non-Deterministic Typed Lambda-Calculus
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
Philippe de Groote
BIRTHDAY
2006
Springer
15 years 1 months ago
Best-First Rippling
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...
Moa Johansson, Alan Bundy, Lucas Dixon
81
Voted
CADE
2006
Springer
15 years 9 months ago
Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics
Church's Higher Order Logic is a basis for proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We ...
Robert L. Constable, Wojciech Moczydlowski