G. Holzmann. Formal Methods in System Design, page 301--314. Chapman & Hall, (1995)
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 motivation for the bitstate hashing technique was based on empirical evidence of its effectiveness. In this paper we provide an analytical argument. We compare the technique with two alternatives that have been proposed in the recent literature. We also describe a sequential bitstate hashing technique that can be of value when confronted with very large problem sizes. Keywords: Verification, Concurrency, State explosion, Mode...
%0 Conference Paper
%1 Holzmann95ananalysis
%A Holzmann, Gerard J.
%B Formal Methods in System Design
%D 1995
%I Chapman & Hall
%K bitstate hashing memory modelchecking
%P 301--314
%T An Analysis of Bitstate Hashing
%U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.8840
%X . 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 motivation for the bitstate hashing technique was based on empirical evidence of its effectiveness. In this paper we provide an analytical argument. We compare the technique with two alternatives that have been proposed in the recent literature. We also describe a sequential bitstate hashing technique that can be of value when confronted with very large problem sizes. Keywords: Verification, Concurrency, State explosion, Mode...
@inproceedings{Holzmann95ananalysis,
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 motivation for the bitstate hashing technique was based on empirical evidence of its effectiveness. In this paper we provide an analytical argument. We compare the technique with two alternatives that have been proposed in the recent literature. We also describe a sequential bitstate hashing technique that can be of value when confronted with very large problem sizes. Keywords: Verification, Concurrency, State explosion, Mode...},
added-at = {2009-11-16T10:47:27.000+0100},
author = {Holzmann, Gerard J.},
biburl = {https://www.bibsonomy.org/bibtex/219fa2fc5a54519ca82c6bf98539fb072/giuliano.losa},
booktitle = {Formal Methods in System Design},
description = {An Analysis of Bitstate Hashing},
interhash = {03d96326840e4c85ac9dd401fc552c00},
intrahash = {19fa2fc5a54519ca82c6bf98539fb072},
keywords = {bitstate hashing memory modelchecking},
pages = {301--314},
publisher = {Chapman & Hall},
timestamp = {2009-11-16T10:47:27.000+0100},
title = {An Analysis of Bitstate Hashing},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.8840},
year = 1995
}