User-friendly model checking: Automatically configuring algorithms with rulebase/PE

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Model checking is known to be computationally hard, meaning no single algorithm can efficiently solve all problems. A possible approach is to run many algorithms in parallel until one of themfinds a solution. This approach is sometimes called state-of-the-art (SOTA) model checker. However, hardware resources are often limited, forcing some selection. In this paper we present an automatic decision system, called Whisperer, which generates an optimized set of configured algorithms for a given model-checking problem. The system weights the advice of advisors, each predicting the fitness of a different algorithm for the problem. Advisors also monitor the progress of currently running algorithms, allowing the replacement of ineffective algorithms. Whisperer is built into the formal verification platform, RuleBase/PE, and allows novice users to skip the delicate task of algorithm selection. Our experiments showWhisperer, after some training, performs nearly as well as SOTA. © Springer-Verlag Berlin Heidelberg 2009.

Cite

CITATION STYLE

APA

Nevo, Z. (2009). User-friendly model checking: Automatically configuring algorithms with rulebase/PE. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5394 LNCS, pp. 210–214). https://doi.org/10.1007/978-3-642-01702-5_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free