Sciweavers

6740 search results - page 1209 / 1348
» Using Classification as a Programming Language
Sort
View
SP
2006
IEEE
132views Security Privacy» more  SP 2006»
15 years 10 months ago
Towards Automatic Generation of Vulnerability-Based Signatures
In this paper we explore the problem of creating vulnerability signatures. A vulnerability signature matches all exploits of a given vulnerability, even polymorphic or metamorphic...
David Brumley, James Newsome, Dawn Xiaodong Song, ...
ASPLOS
2006
ACM
15 years 10 months ago
Temporal search: detecting hidden malware timebombs with virtual machines
Worms, viruses, and other malware can be ticking bombs counting down to a specific time, when they might, for example, delete files or download new instructions from a public we...
Jedidiah R. Crandall, Gary Wassermann, Daniela A. ...
ASPLOS
2006
ACM
15 years 10 months ago
Ultra low-cost defect protection for microprocessor pipelines
The sustained push toward smaller and smaller technology sizes has reached a point where device reliability has moved to the forefront of concerns for next-generation designs. Sil...
Smitha Shyam, Kypros Constantinides, Sujay Phadke,...
ECOOP
2005
Springer
15 years 10 months ago
The Role of Design Information in Software Evolution
Software modeling has received a lot a of attention in the last decade and now is an important support for the design process. Actually, the design process is very important to the...
Walter Cazzola, Sonia Pini, Massimo Ancona
ICALP
2010
Springer
15 years 9 months ago
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
Amir Shpilka, Ilya Volkovich
« Prev « First page 1209 / 1348 Last » Next »