Explicit State Model Checking with Hopper

The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that it includes in its distribution published parallel and disk based algorithms, as well as several new algorithms. For example, Hopper includes parallel dynamic partitioning, cooperative parallel search for LTL violations and property-based guided search (parallel or sequential). We discuss Hopper in general and present a recently implemented randomized guided search algorithm. In multiple parallel guided searches, randomization increases the expected average time to find an error but decreases the expected minimum time to find an error.

[1]  Michael D. Jones,et al.  Guided model checking with a Bayesian meta-heuristic , 2004, Proceedings. Fourth International Conference on Application of Concurrency to System Design, 2004. ACSD 2004..

[2]  Michael D. Jones,et al.  Parallel search for LTL violations , 2003, International Journal on Software Tools for Technology Transfer.

[3]  David L. Dill,et al.  Parallelizing the Murϕ Verifier , 2001, Formal Methods Syst. Des..

[4]  Stefan Edelkamp,et al.  Directed explicit model checking with HSF-SPIN , 2001, SPIN '01.

[5]  David L. Dill,et al.  Parallelizing the Murphi Verifier , 1997, CAV.

[6]  U. Stern,et al.  Using Magnatic Disk Instead of Main Memory in the Murphi Verifier , 1998, CAV.

[7]  Michael D. Jones,et al.  Benchmarking Explicit State Parallel Model Checkers , 2003, Electron. Notes Theor. Comput. Sci..

[8]  Steven M. German,et al.  Formal Design of Cache Memory Protocols in IBM , 2003, Formal Methods Syst. Des..

[9]  Bradley P. Carlin,et al.  BAYES AND EMPIRICAL BAYES METHODS FOR DATA ANALYSIS , 1996, Stat. Comput..

[10]  U. Stern,et al.  Using magnetic disk instead of main memory in the mur φ verifier , 1998 .