We present a new verification technique for Promela which exploits state-space symmetries induced by scalarset values used in a model. The technique involves efficiently computing a marker for each state encountered during search. We propose a complete verification method which only partially exploits symmetry, and an approximate verification method which fully exploits symmetry. We describe how symmetry markers can be efficiently computed and integrated into the Spin tool, and provide an empirical evaluation of our technique using the Topspin symmetry reduction package, which shows very good performance results and a high degree of precision for the approximate method (i.e. very few non-symmetric states receive the same marker). We also identify a class of models for which the approximate technique is precise.
|Name||Lecture Notes in Computer Science|
|Conference||conference; ATVA 2007, Tokyo, Japan; 2007-10-22; 2007-10-25|
|Period||22/10/07 → 25/10/07|
|Other||ATVA 2007, Tokyo, Japan|