2218 search results - page 410 / 444 » Testing Expressibility Is Hard |
PODC
2012
ACM
11 years 10 months ago
2012
ACM
In recent years, there have been a few proposals to add a small amount of trusted hardware at each replica in a Byzantine fault tolerant system to cut back replication factors. Th...
SIGSOFT
2002
ACM
14 years 8 months ago
2002
ACM
Static checking can verify the absence of errors in a program, but often requires written annotations or specifications. As a result, static checking can be difficult to use effec...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
VR
2008
IEEE
14 years 2 months ago
2008
IEEE
The automotive industry uses physical seating bucks, which are minimal mockups of a car interior, to assess various aspects of the planned interior early in the development proces...
SP
2006
IEEE
14 years 1 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...