Peter C. Dillinger, Panagiotis Manolios  Home/Search
Context Related
| spinroot.com/spin/Wo...040spin2004.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: spinroot.com/spin/W...program2004 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Bitstate hashing in SPIN has proved invaluable in probabilistically detecting errors in large models, but in many cases, the number of omitted states is much higher than it would be if SPIN allowed more than two hash functions to be used. For example, adding just one more hash function can reduce the probability of omitting states at all from 99% to under 3%. Because hash computation accounts for an overwhelming portion of the total execution cost of bitstate verification with SPIN, adding... (Update)
Cited by: More
Simple Summaries for Hashing with Multiple Choices - Kirsch, Mitzenmacher (Correct)
Active bibliography (related documents): More All
0.3: Memory Efficient State Storage in SPIN - Visser (1996) (Correct)
0.3: Using OBDD encodings for Space Efficient State Storage during.. - Visser (1995) (Correct)
0.2: Minimization of counterexamples in SPIN - Paul Gastin Pierre (2004) (Correct)
Similar documents based on text: More All
0.3: Adding a Total Order to ACL2 - Manolios, Kaufmann (2002) (Correct)
0.2: Model Checking TLA+ Specifications - Yu, Manolios, Lamport (1999) (Correct)
0.1: Linking Theorem Proving and Model-Checking with.. - Manolios, Namjoshi.. (1999) (Correct)
BibTeX entry: (Update)
P. C. Dillinger and P. Manolios. Fast and accurate bitstate verification for SPIN. In Proceedings of the 11th International SPIN Workshop on Model Checking of Software (SPIN), pp. 57-75, 2004. http://citeseer.ist.psu.edu/dillinger04fast.html More
@inproceedings{ dillinger:spin,
author = "Peter C. Dillinger and Panagiotis Manolios",
title = "Fast \emph{and} accurate bitstate verification for {SPIN}",
booktitle = "11th {SPIN} Workshop on Model Checking Software",
series="{LNCS}",
publisher="Springer-Verlag",
volume=2989,
month = "April",
year = "2004",
url = "citeseer.ist.psu.edu/dillinger04fast.html" }
Citations (may not include all citations):249 volume 3: Sorting and Searching (context) - Knuth, of - 1997
181 Spacetime trade off hash coding with allowable error - time, in et al. - 1970
121 Handbook of Algorithms and Data Structures (context) - Gonnet - 1984
106 A partial approach to model checking - Godefroid, Wolper - 1991
101 Better verification through symmetry - Ip, Dill - 1993
45 Reliable hashing without collision detection - Wolper, Leroy - 1993
40 The Spin Model Checker: Primer and Reference Manual (context) - Holzmann - 2003
35 Network applications of Bloom filters: A survey - Broder, Mitzenmacher - 2002
21 Algorithms for automated protocol validation - Holzmann - 1990
20 An analysis of bitstate hashing - Holzmann - 1995
14 A new scheme for memory-efficient probabilistic verification - Stern, Dill - 1996
5 McGraw-Hill Higher Education (context) - Cormen, Stein et al. - 2001
4 Improved probilistic verification by hash compaction (context) - Stern, Dill - 1995
1 Partial order reduction of the state space - Holzmann, Peled - 1995
1 Algorithm alley: Hash functions (context) - Jenkins - 1997
http://www.cc.gatech.edu/peterd/3spin/
Documents on the same site (http://spinroot.com/spin/Workshops/ws04/program2004.html): More
Model checking of UML models via a mapping to communicating.. - Ober, Graf, Ober (2004) (Correct)
Formal Analysis of Processor Timing Models - Wilhelm (Correct)
IF Validation Environment Tutorial - Bozga, Graf, Mounier, Ober (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC