An Improvement of Minimized Assumption Generation Method for Component-Based Software Verification

• Main Authors: Pham Ngoc Hung, Viet-Ha Nguyen, Aoki, T., Katayama, T.
• Format: Conference Proceeding
• Language: English
• Subjects: Complexity theory; Computational efficiency; Context; Memory management; Search problems; Software; Software algorithms
• DOI: 10.1109/rivf.2012.6169862

The minimized assumption generation has been recognized as an improved method of the assume-guarantee verification for generating minimal assumptions. This method is not only fitted to component-based software but also has a potential to solve the state space explosion problem in model checking. However, the computational cost for generating the minimal assumption is very high so the method is difficult to be applied in practice. This paper presents an optimization as a continuous work of the minimized assumption generation method in order to reduce the complexity of the method. The key idea of this method is to find a smaller assumption in a sub-tree of the search tree containing the candidate assumptions using the depth-limited search strategy. With this approach, the improved method can generate smaller assumptions with a lower computational cost and consumption memory than the minimized method. The generated assumptions are also effective for rechecking the systems at much lower computational cost in the context of software evolution. We have implemented a tool supporting the improved method. Experimental results are also presented and discussed.