Slicing abstractions

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

Abstract

Abstraction and slicing are both techniques for reducing the size of the state space to be inspected during verification. In this paper, we present a new model checking procedure for infinite-state concurrent systems that interleaves automatic abstraction refinement, which splits states according to new predicates obtained by Craig interpolation, with slicing, which removes irrelevant states and transitions from the abstraction. The effects of abstraction and slicing complement each other. As the refinement progresses, the increasing accuracy of the abstract model allows for a more precise slice; the resulting smaller representation gives room for additional predicates in the abstraction. The procedure terminates when an error path in the abstraction can be concretized, which proves that the system is erroneous, or when the slice becomes empty, which proves that the system is correct. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Brückner, I., Dräger, K., Finkbeiner, B., & Wehrheim, H. (2007). Slicing abstractions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4767 LNCS, pp. 17–32). Springer Verlag. https://doi.org/10.1007/978-3-540-75698-9_2

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