View in EDS

An Innovative Heuristic to Detect Special States in Concurrent Software Systems.

Saved in:
Bibliographic Details
Title: An Innovative Heuristic to Detect Special States in Concurrent Software Systems.
Authors: Pira, Einollah, Rouhi, Alireza
Source: Quality & Reliability Engineering International; Dec2025, Vol. 41 Issue 8, p3686-3697, 12p
Subject Terms: HEURISTIC, VERIFICATION of computer systems, SOFTWARE development tools, COMPUTER performance, STATE-space methods, SOFTWARE validation, PARALLEL programs (Computer programs)
Abstract: Model checking is a formal verification technique used to verify whether a model of a given concurrent software system will meet some special states such as reachability (so‐called goal) ones, in the future. Although useful, this heuristic cannot be a suitable way in large models of given systems due to the high time of finding the similarity amount. In this paper, we present a rule‐based heuristic that uses the erase/addition of components by the rules to obtain the interdependence of rules. After acquiring these interdependences, they are employed to explore the state space efficiently. To validate the efficiency of the presented heuristic, it is applied on the concurrent software systems specified through graph transformation language, and implemented in GROOVE, an open‐source toolset for designing and model checking graph transformation systems. Experimental results show that the presented heuristic outperforms the existing algorithms in terms of running time, the number of exploration states, and the length of generated witnesses. [ABSTRACT FROM AUTHOR]
Copyright of Quality & Reliability Engineering International is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Complementary Index
Description
Abstract:Model checking is a formal verification technique used to verify whether a model of a given concurrent software system will meet some special states such as reachability (so‐called goal) ones, in the future. Although useful, this heuristic cannot be a suitable way in large models of given systems due to the high time of finding the similarity amount. In this paper, we present a rule‐based heuristic that uses the erase/addition of components by the rules to obtain the interdependence of rules. After acquiring these interdependences, they are employed to explore the state space efficiently. To validate the efficiency of the presented heuristic, it is applied on the concurrent software systems specified through graph transformation language, and implemented in GROOVE, an open‐source toolset for designing and model checking graph transformation systems. Experimental results show that the presented heuristic outperforms the existing algorithms in terms of running time, the number of exploration states, and the length of generated witnesses. [ABSTRACT FROM AUTHOR]
ISSN:07488017
DOI:10.1002/qre.70052