111 search results - page 20 / 23 » Proactive Detection of Computer Worms Using Model Checking |
109
click to vote
SLP
1993
15 years 3 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
ASPDAC
2006
ACM
15 years 8 months ago
2006
ACM
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...
123
click to vote
ISSTA
2010
ACM
15 years 4 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
128
click to vote
ETFA
2006
IEEE
15 years 5 months ago
2006
IEEE
Wireless sensor networks (WSN) consist of small self-contained devices with computational, sensing and wireless communication capabilities. They allow flexible, powerful, tetherles...
111
click to vote
SMA
2003
ACM
15 years 7 months ago
2003
ACM
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...