Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Incremental Slicing
verfasst von : Heike Wehrheim
Erschienen in: Formal Methods and Software Engineering
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Slicing is one of a number of techniques for reducing the state space of specifications during verification. Unlike techniques as e.g. data abstraction slicing is
precise
: the slice exactly reflects the property to be verified. This necessitates keeping large parts of the specification.
In this paper we relax this requirement and instead compute slices
overapproximating
the behaviour of the specification. This can lead to substantially smaller slices. We consequently adapt the technique of
abstraction refinement
to slicing as to improve the slice once a false negative is detected. Slicing thus becomes an
incremental
method: it starts with a small, minimal part of the specification and successively adds further parts until either the property under interest holds on the slice or a real counterexample is found. We show correctness and termination of our technique.