Computer Science and Engineering, Department of
Evaluating the Effectiveness of Slicing for Model Reduction of Concurrent Object-Oriented Programs
Date of this Version
Model checking techniques have proven effective for checking a number of non-trivial concurrent object-oriented software systems. However, due to the high computational and memory costs, a variety of model reduction techniques are needed to overcome current limitations on applicability and scalability. Conventional wisdom holds that static program slicing can be an effective model reduction technique, yet anecdotal evidence is mixed, and there has been no work that has systematically studied the costs/benefits of slicing for model reduction in the context of model checking source code for realistic systems. In this paper, we present an overview of the sophisticated Indus program slicer that is capable of handling full Java and is readily applicable to interesting off-the- shelf concurrent Java programs. Using the Indus program slicer as part of the next generation of the Bandera model checking framework, we experimentally demonstrate significant benefits from using slicing as a fully automatic model reduction technique. Our experimental results consider a number of Java systems with varying structural properties, the effects of combining slicing with other well-known model reduction techniques such as partial order reductions, and the effects of slicing for different classes of properties. Our conclusions are that slicing concurrent object-oriented source code provides significant reductions that are orthogonal to a number of other reduction techniques, and that slicing should always be applied due to its automation and low computational costs.
Published in Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science Volume 3920, ed. H. Hermanns and J. Palsberg (Berlin / Heidelberg: Springer, 2006), pp. 73–89; doi: 10.1007/11691372 Copyright © 2006 Springer-Verlag. Used by permission.