Sciweavers

1054 search results - page 151 / 211
» A Formalization of the Turing Test
Sort
View
LOGCOM
2010
154views more  LOGCOM 2010»
14 years 11 months ago
Collaborative Runtime Verification with Tracematches
Perfect pre-deployment test coverage is notoriously difficult to achieve for large applications. Given enough end users, however, many more test cases will be encountered during a...
Eric Bodden, Laurie J. Hendren, Patrick Lam, Ondre...
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, ...
ASYNC
2000
IEEE
122views Hardware» more  ASYNC 2000»
15 years 9 months ago
DUDES: A Fault Abstraction and Collapsing Framework for Asynchronous Circuits
Fault Abstraction and Collapsing Framework for Asynchronous Circuits Philip P. Shirvani, Subhasish Mitra Center for Reliable Computing Stanford University Stanford, CA Jo C. Eberge...
Philip P. Shirvani, Subhasish Mitra, Jo C. Ebergen...
EMSOFT
2011
Springer
14 years 4 months ago
Software certification: coding, code, and coders
We describe a certification approach for software development that has been adopted at our organization. JPL develops robotic spacecraft for the exploration of the solar system. T...
Klaus Havelund, Gerard J. Holzmann
TPHOL
2009
IEEE
15 years 11 months ago
A Better x86 Memory Model: x86-TSO
Abstract. Real multiprocessors do not provide the sequentially consistent memory that is assumed by most work on semantics and verification. Instead, they have relaxed memory mode...
Scott Owens, Susmit Sarkar, Peter Sewell