Profiling the operational behavior of OS device drivers
Empirical Software Engineering
SBIA'12 Proceedings of the 21st Brazilian conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
Formal analysis of software is a powerful analysis tool,but can be too costly. Random search of formal models canreduce that cost, but is theoretically incomplete. However,random search of finite-state machines exhibits an early saturationeffect, i.e., random search quickly yields all thatcan be found, even after a much longer search. Hence, weavoid the theoretical problem of incompleteness, providedthat testing continues until after the saturation point. Sucha random search is rapid, consumes little memory, is simpleto implement, and can handle very large formal models (inone experiment shown here, over 10178 states).