Directed Model Checking for PROMELA with Relaxation-Based Distance Functions

Andisha, Ahmad Siyar; Wehrle, Martin; Westphal, Bernd

doi:10.1007/978-3-319-23404-5_11

Cited by 5 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The related work for search algorithms is directed model checking, which focuses on several techniques to reduce the search space based on the abstractions of the system state [15], [16] or based on estimating the distance [17], [18] from the current state to the error states. The process that has the transition corresponding to the best value (lowest/highest) will be chosen for the execution.…”

Section: Related Workmentioning

confidence: 99%

Model Checking in the Presence of Schedulers Using a Domain-Specific Language for Scheduling Policies

Tran

Chiba

Aoki

2019

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

A concurrent system consists of multiple processes that are run simultaneously. The execution orders of these processes are defined by a scheduler. In model checking techniques, the scheduling policy is closely related to the search algorithm that explores all of the system states. To ensure the correctness of the system, the scheduling policy needs to be taken into account during the verification. Current approaches, which use fixed strategies, are only capable of limited kinds of policies and are difficult to extend to handle the variations of the schedulers. To address these problems, we propose a method using a domain-specific language (DSL) for the succinct specification of different scheduling policies. Necessary artifacts are automatically generated from the specification to analyze the behaviors of the system. We also propose a search algorithm for exploring the state space. Based on this method, we develop a tool to verify the system with the scheduler. Our experiments show that we could serve the variations of the schedulers easily and verify the systems accurately.

show abstract

Section: Related Workmentioning

confidence: 99%

Model Checking in the Presence of Schedulers Using a Domain-Specific Language for Scheduling Policies

Tran

Chiba

Aoki

2019

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…The authors propose a depth-first search which can be applied to verification of LTL properties of Java bytecode. With regard to heuristic model checking, the authors of [13] evaluated the resulting search behaviour on a number of of models from the BEEM database within the HSF-SPIN explicit-state model checker. The technique of [13] applies a distance function to estimate the distance from a given state to an error state, and explores states with the shortest estimated distance first.…”

Section: Introduction: Motivation and Related Workmentioning

confidence: 99%

“…With regard to heuristic model checking, the authors of [13] evaluated the resulting search behaviour on a number of of models from the BEEM database within the HSF-SPIN explicit-state model checker. The technique of [13] applies a distance function to estimate the distance from a given state to an error state, and explores states with the shortest estimated distance first. Guided by the distance function, error paths can often be found after exploring only a small part of the overall state space.…”

Section: Introduction: Motivation and Related Workmentioning

confidence: 99%