Improving Non-Progress Cycle Checks

Authors:
David Faragó;Peter H. Schmitt
Affiliations:
Institut für Theoretische Informatik Logik und Formale Methoden, Universität Karlsruhe (TH),;Institut für Theoretische Informatik Logik und Formale Methoden, Universität Karlsruhe (TH),
Venue:
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Year:
2009

Citing 4
Cited 0

An improvement in formal verification

Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Combining Partial Order Reductions with On-the-fly Model-Checking

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Spin model checker, the: primer and reference manual

Spin model checker, the: primer and reference manual

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first search, i.e., it searches through the graph incrementally deeper. It simultaneously constructs the state space and searches for non-progress cycles. The algorithm is expected to be more efficient than the method the model checker SPIN currently uses, and finds shortest (w.r.t. progress) counterexamples. Its only downside is the need for a subsequent reachability depth-first search (which is not the bottleneck) for constructing a full counterexample. The new algorithm is better combinable with partial order reduction than SPIN's method.