61 search results - page 4 / 13 » Model Checking Almost All Paths Can Be Less Expensive Than C... |
SPIN
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. Model checking real programs has recently become an active research area. Programs however exhibit two characteristics that make model checking di cult: the complexity of...
PPOPP
2005
ACM
14 years 29 days ago
2005
ACM
Dataraces in multithreaded programs often indicate severe bugs and can cause unexpected behaviors when different thread interleavings are executed. Because dataraces are a cause f...
OSDI
2002
ACM
14 years 7 months ago
2002
ACM
Many system errors do not emerge unless some intricate sequence of events occurs. In practice, this means that most systems have errors that only trigger after days or weeks of ex...
ICRA
2003
IEEE
14 years 20 days ago
2003
IEEE
In Robotics, many path-planning algorithms have been proposed but almost all are evaluated only by their path lengths in PC. However, the evaluation is completely independent of a...
TEC
2002
13 years 7 months ago
2002
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...