skip to main content
10.1145/1081180.1081193acmconferencesArticle/Chapter ViewAbstractPublication PagesfseConference Proceedingsconference-collections
Article

Enhancing random walk state space exploration

Published: 05 September 2005 Publication History

Abstract

We study the behavior of the random walk method in the context of model checking and its capacity to explore a state space. We describe the methodology we have used for observing the random walk and report on the results obtained. We also describe many possible enhancements of the random walk and study their behavior and limits. Finally, we discuss some practically important but often neglected issues like counterexamples, coverage estimation, and setting of parameters. Similar methodology can be used for studying other state space exploration techniques like bit-state hashing, partial storage methods, or partial order reduction.

References

[1]
http://www.fi.muni.cz/~xpelanek/state_spaces.]]
[2]
G. Behrmann, K.G. Larsen, and R. Pelánek. To store or not to store. In Proc. Computer Aided Verification (CAV'03), volume 2725 of LNCS, 2003.]]
[3]
S. Christensen, L.M. Kristensen, and T. Mailund. A Sweep-Line Method for State Space Exploration. In Proc. of Tools and Algorithms for Construction and Analysis of Systems (TACAS'01), volume 2031 of LNCS, pages 450--464, 2001.]]
[4]
S. Edelkamp, A. L. Lafuente, and S. Leue. Directed explicit model checking with HSF-SPIN. In Proc. SPIN workshop, volume 2057 of LNCS, pages 57--79, 2001.]]
[5]
J. Geldenhuys. State caching reconsidered. In SPIN Workshop, volume 2989 of LNCS, pages 23--39, 2004.]]
[6]
P. Godefroid, G.J. Holzmann, and D. Pirottin. State space caching revisited. In Proc. of Computer Aided Verification (CAV 1992), volume 663 of LNVS, pages 178--191, 1992.]]
[7]
P. Godefroid and S. Khurshid. Exploring very large state spaces using genetic algorithms. In Proc. of Tools and Algorithms for Construction and Analysis of Systems (TACAS 2002), volume 2280 of LNCS, pages 266--280, 2002.]]
[8]
A. Groce and W. Visser. Heuristics for model checking java programs. International Journal on Software Tools for Technology Transfer (STTT), 2004. to appear.]]
[9]
R. Grosu and S. A. Smolka. Monte carlo model checking. In Proc. of Tools and Algorithms for Construction and Analysis of Systems (TACAS 2005), volume 3440 of LNCS, pages 271--286. Springer, 2005.]]
[10]
P. Haslum. Model checking by random walk. In Proc. of ECSEL Workshop, 1999.]]
[11]
G. J. Holzmann. An analysis of bitstate hashing. In Proc. of Protocol Specification, Testing, and Verification, pages 301--314, 1995.]]
[12]
G.J. Holzmann. Algorithms for automated protocol verification. AT&T Technical Journal, 69(2):32--44, February 1990.]]
[13]
M.D. Jones and J.Sorber. Parallel random walk search for LTL violations. In Proc. of Parallel and Distributed Model Checking (PDMC 2002), volume 68 of ENTCS, pages 156--161, 2002.]]
[14]
A. Kuehlmann, K. L. McMillan, and R. K. Brayton. Probabilistic state space search. In Proc. of Computer-Aided Design (CAD 1999), pages 574--579. IEEE Press, 1999.]]
[15]
F. Lin, P. Chu, and M. Liu. Protocol verification using reachability analysis: the state space explosion problem and relief strategies. Computer Communication Review, 17(5):126--134, 1987.]]
[16]
M. Mihail and C. H. Papadimitriou. On the random walk method for protocol testing. In Proc. Computer-Aided Verification (CAV 1994), volume 818 of LNCS, pages 132--141, 1994.]]
[17]
D. Owen and T. Menzies. Lurch: a lightweight alternative to model checking. In Proc. of Software Engineering & Knowledge Engineering (SEKE'2003), pages 158--165, 2003.]]
[18]
D. Owen, T. Menzies, M. Heimdahl, and J. Gao. On the advantages of approximate vs. complete verification: Bigger models, faster, less memory, usually accurate. In Proc. of IEEE/NASA Software Engineering Workshop (SEW'03), pages 75--81. IEEE, 2003.]]
[19]
R. Pelánek. Typical structural properties of state spaces. In Proc. of SPIN Workshop, volume 2989 of LNCS, pages 5--22, 2004.]]
[20]
K Qian and A. Nymeyer. Guided invariant model checking based on abstraction and symbolic pattern databases. In Proc. of Tools and Algorithms for Construction and Analysis of Systems (TACAS 2004), number 2988 in LNCS, pages 487--511, 2004.]]
[21]
H. Sivaraj and G. Gopalakrishnan. Random walk based heuristic algorithms for distributed memory model checking. In Proc. of Parallel and Distributed Model Checking (PDMC'03), volume 89 of ENTCS, 2003.]]
[22]
E. Tronci, G. D. Penna, B. Intrigila, and M. Venturini. A probabilistic approach to automatic verification of concurrent systems. In Proc. of Asia-Pacific Software Engineering Conference (APSEC 2001), 2001.]]
[23]
E. Tronci, G. D. Penna, B. Intrigila, and M. V. Zilli. Exploiting transition locality in automatic verification. In Proc. of Correct Hardware Design and Verification Methods (CHARME 2001), volume 2144, pages 259--274, 2001.]]
[24]
C. H. West. Protocol validation by random state exploration. In International Symposium on Protocol Specification, Testing and Verification, 1986.]]

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
FMICS '05: Proceedings of the 10th international workshop on Formal methods for industrial critical systems
September 2005
152 pages
ISBN:1595931481
DOI:10.1145/1081180
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 September 2005

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. formal verification
  2. random walk
  3. state space exploration

Qualifiers

  • Article

Conference

FMICS05
Sponsor:

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)2
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2021)Handling State Space Explosion in Component-Based Software Verification: A ReviewIEEE Access10.1109/ACCESS.2021.30817429(77526-77544)Online publication date: 2021
  • (2020)Improving swarming using genetic algorithmsInnovations in Systems and Software Engineering10.1007/s11334-020-00362-7Online publication date: 2-Jun-2020
  • (2018)Scalable Parallel Model Checking via Monte-Carlo Tree SearchACM SIGSOFT Software Engineering Notes10.1145/3149485.314949542:4(1-5)Online publication date: 11-Jan-2018
  • (2018)Improving Parallel State-Space Exploration Using Genetic AlgorithmsVerification and Evaluation of Computer and Communication Systems10.1007/978-3-030-00359-3_9(133-149)Online publication date: 31-Aug-2018
  • (2013)Coverage Estimation in Model Checking with Bitstate HashingIEEE Transactions on Software Engineering10.1109/TSE.2012.4439:4(477-486)Online publication date: 1-Apr-2013
  • (2012)Towards early emergent property understandingProceedings of the 2012 Extreme Modeling Workshop10.1145/2467307.2467315(39-44)Online publication date: 1-Oct-2012
  • (2012)Partial Exploration of State Spaces and Hypothesis Test for Unsuccessful SearchElectrical Engineering and Intelligent Systems10.1007/978-1-4614-2317-1_1(1-13)Online publication date: 2-May-2012
  • (2011)Uniform Monte-Carlo model checkingProceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software10.5555/1987434.1987448(127-140)Online publication date: 26-Mar-2011
  • (2011)Towards informed swarm verificationProceedings of the Third international conference on NASA Formal methods10.5555/1986308.1986341(422-437)Online publication date: 18-Apr-2011
  • (2011)A Comparison of Test Generation Algorithms for Testing Application InteractionsProceedings of the 2011 11th International Conference on Quality Software10.1109/QSIC.2011.12(131-140)Online publication date: 13-Jul-2011
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media