Directed model checking with distance-preserving abstractions

Authors:
Klaus Dräger;Bernd Finkbeiner;Andreas Podelski
Affiliations:
Universität des Saarlandes, Saarbrücken, Germany;Universität des Saarlandes, Saarbrücken, Germany and Max-Planck-Institut für Informatik, Saarbrücken, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany
Venue:
International Journal on Software Tools for Technology Transfer (STTT)
Year:
2009

Citing 0
Cited 4

Context-enhanced directed model checking

SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Abstractions and pattern databases: the quest for succinctness and accuracy

TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
A box-based distance between regions for guiding the reachability analysis of spaceex

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Computing upper bounds on lengths of transition sequences

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In directed model checking, the traversal of the state space is guided by an estimate of the distance from the current state to the nearest error state. This paper presents a distance-preserving abstraction for concurrent systems that allows one to compute an interesting estimate of the error distance without hitting the state explosion problem. Our experiments show a dramatic reduction both in the number of states explored by the model checker and in the total runtime.