Computer Software
Evolution of the LMNtal Runtime to a Parallel Model Checker
Masato GOCHOTaisuke HORIKazunori UEDA
Author information
JOURNALS FREE ACCESS

Volume 28 (2011) Issue 4 Pages 4_137-4_157

Details
Download PDF (758K) Contact us
Abstract

Model checking is a verification technique based on the exhaustive search of erroneous behaviors of state transition systems, which is attracting growing interest. The LMNtal language allows us to represent state transition systems using hierarchical graph rewriting, and its runtime system, SLIM, has recently evolved into an explicit-state model checker. Hierarchical graphs are a powerful data structure that features a builtin symmetry reduction mechanism that plays a key role in state space search. However, model checking is still prone to state space explosion and has called for time- and space-efficient methods for state management. To address this problem and make our model checker more useful, we have extended the SLIM runtime further to a parallel model checker to run on shared-memory multiprocessors and developed various optimization techniques of state management. These two enhancements drastically improved the scale of problems the LMNtal model checker can handle as well as its performance.

Information related to the author
© Japan Society for Software Science and Technology 2011
Previous article Next article

Recently visited articles
feedback
Top