Abstract

The bitstate hashing, or supertrace, technique was introduced in 1987 as a method to increase the quality of verification by reachability analyses for applications that defeat analysis by traditional means because of their size. Since then, the technique has been included in many research verification tools, and was adopted in tools that are marketed commercially. It is therefore important that we understand well how and why the method works, what its limitations are, and how it compares with alternative methods over a broad range of problem sizes. The original

Citations

1130	The model checker SPIN - Holzmann - 1997
732	The Design and Validation of Computer Protocols - Holzmann - 1991
62	Reliable hashing without collision detection - Wolper, Leroy - 1993
54	Coverage Preserving Reduction Strategies for Reachabily Analysis - Holzmann, Godefroid, et al. - 1992
49	An improved protocol reachability analysis technique - Holzmann - 1988
38	State Space Caching Revisited - Godefroid, Holzmann, et al.
32	On limits and possibilities of automated protocol analysis - Holzmann - 1987
28	Improved Probabilistic Verification by Hash Compaction - Stern, Dill - 1995
25	The Theory and Practice of a Formal Method: NewCoRe - Holzmann - 1994
21	A New Scheme for Memory-Efficient Probabilistic Verification - Stern, Dill - 1996
17	Modelling and verification of a multiprocessor realtime OS kernel - Cattel - 1994
11	Formal methods at AT&T { an industrial usage report - Chaves - 1991
5	Proving the value of formal methods - Holzmann - 1995
1	Specification and validation of communications in client/server models - Lin - 1994
1	The theory and practice of a formal method - Holzmann - 1994