58,019 research outputs found
A generic approach for the automatic verification of featured, parameterised systems
A general technique is presented that allows property based feature analysis of systems consisting of an arbitrary number of components. Each component may have an arbitrary set of safe features. The components are defined in a guarded command form and the technique combines model checking and abstraction. Features must fulfill certain criteria in order to be safe, the criteria express constraints on the variables which occur in feature guards. The main result is a generalisation theorem which we apply to a well known example: the ubiquitous, featured telephone system
Graph Subsumption in Abstract State Space Exploration
In this paper we present the extension of an existing method for abstract
graph-based state space exploration, called neighbourhood abstraction, with a
reduction technique based on subsumption. Basically, one abstract state
subsumes another when it covers more concrete states; in such a case, the
subsumed state need not be included in the state space, thus giving a
reduction. We explain the theory and especially also report on a number of
experiments, which show that subsumption indeed drastically reduces both the
state space and the resources (time and memory) needed to compute it.Comment: In Proceedings GRAPHITE 2012, arXiv:1210.611
- ā¦