PT Unknown
AU Tronci, E
   Della Penna, G
   Intrigila, B
   Venturini Zilli, M
TI A Probabilistic Approach to Automatic Verification of Concurrent Systems
SE 8th Asia-Pacific Software Engineering Conference (APSEC)
PY 2001
BP 317
EP 324
DI 10.1109/APSEC.2001.991495
AB The main barrier to automatic verification of concurrent systems is the huge amount of memory required to complete the verification task (state explosion). In this paper we present a probabilistic algorithm for automatic verification via model checking. Our algorithm trades space with time. In particular, when memory is full because of state explosion our algorithm does not give up verification. Instead it just proceeds at a lower speed and its results will only hold with some arbitrarily small error probability. Our preliminary experimental results show that by using our probabilistic algorithm we can typically save more than 30% of RAM with an average time penalty of about 100% w.r.t. a deterministic state space exploration with enough memory to complete the verification task. This is better than giving up the verification task because of lack of memory.
PI Macau, China
ER