402 search results - page 73 / 81 » Complexity of Decision Problems for Simple Regular Expressio... |
STOC
2001
ACM
14 years 9 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
EOR
2011
13 years 4 days ago
2011
Combinatorial auctions have been used in procurement markets with economies of scope. Preference elicitation is already a problem in single-unit combinatorial auctions, but it bec...
SP
2006
IEEE
14 years 2 months ago
2006
IEEE
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...
ASPLOS
2006
ACM
14 years 2 months ago
2006
ACM
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...
EUROCRYPT
2004
Springer
14 years 2 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...