Date of this Version
Rajeev Alur, P. Madhusudan, and Wonhong Nam, "Symbolic Compositional Verification by Learning Assumptions", Lecture Notes in Computer Science: Computer Aided Verification 3576, 548-562. July 2005. http://dx.doi.org/10.1007/11513988_52
The verification problem for a system consisting of components can be decomposed into simpler subproblems for the components using assume-guarantee reasoning. However, such compositional reasoning requires user guidance to identify appropriate assumptions for components. In this paper, we propose an automated solution for discovering assumptions based on the L* algorithm for active learning of regular languages. We present a symbolic implementation of the learning algorithm, and incorporate it in the model checker NuSMV. Our experiments demonstrate significant savings in the computational requirements of symbolic model checking.
CPS Formal Methods
Lecture Notes in Computer Science: Computer Aided Verification
The original publication is available at www.springerlink.com
Date Posted: 02 November 2005