Sciweavers

229 search results - page 36 / 46
» How Efficient Can Memory Checking Be
Sort
View
ICSE
2004
IEEE-ACM
14 years 7 months ago
Using Compressed Bytecode Traces for Slicing Java Programs
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
Tao Wang, Abhik Roychoudhury
SIGCOMM
2010
ACM
13 years 7 months ago
NetShield: massive semantics-based vulnerability signature matching for high-speed networks
Accuracy and speed are the two most important metrics for Network Intrusion Detection/Prevention Systems (NIDS/NIPSes). Due to emerging polymorphic attacks and the fact that in ma...
Zhichun Li, Gao Xia, Hongyu Gao, Yi Tang, Yan Chen...
PAMI
2007
138views more  PAMI 2007»
13 years 7 months ago
A Fast Biologically Inspired Algorithm for Recurrent Motion Estimation
—We have previously developed a neurodynamical model of motion segregation in cortical visual area V1 and MT of the dorsal stream. The model explains how motion ambiguities cause...
Pierre Bayerl, Heiko Neumann
WWW
2005
ACM
14 years 8 months ago
Design for verification for asynchronously communicating Web services
We present a design for verification approach to developing reliable web services. We focus on composite web services which consist of asynchronously communicating peers. Our goal...
Aysu Betin-Can, Tevfik Bultan, Xiang Fu
ESORICS
2009
Springer
14 years 8 months ago
Cumulative Attestation Kernels for Embedded Systems
1 There are increasing deployments of networked embedded systems and rising threats of malware intrusions on such systems. To mitigate this threat, it is desirable to enable common...
Michael LeMay, Carl A. Gunter