On the Scalability of the GPUexplore Explicit-State Model Checker

Nathan Cassee
(Eindhoven University of Technology, Eindhoven, The Netherlands)
Thomas Neele
(Eindhoven University of Technology, Eindhoven, The Netherlands)
Anton Wijs
(Eindhoven University of Technology, Eindhoven, The Netherlands)

The use of graphics processors (GPUs) is a promising approach to speed up model checking to such an extent that it becomes feasible to instantly verify software systems during development. GPUexplore is an explicit-state model checker that runs all its computations on the GPU. Over the years it has been extended with various techniques, and the possibilities to further improve its performance have been continuously investigated. In this paper, we discuss how the hash table of the tool works, which is at the heart of its functionality. We propose an alteration of the hash table that in isolated experiments seems promising, and analyse its effect when integrated in the tool. Furthermore, we investigate the current scalability of GPUexplore, by experimenting both with input models of varying sizes and running the tool on one of the latest GPUs of NVIDIA.

In Timo Kehrer and Alice Miller: Proceedings Third Workshop on Graphs as Models (GaM 2017), Uppsala, Sweden, 23rd April 2017, Electronic Proceedings in Theoretical Computer Science 263, pp. 38–52.
Published: 22nd December 2017.

ArXived at: http://dx.doi.org/10.4204/EPTCS.263.4 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org