On Implementation of the Assumption Generation Method for Component-Based Software Verification

Chapter
First Online:
Part of the Studies in Computational Intelligence book series (SCI, volume 710)

Abstract

The assume-guarantee verification has been recognized as a promising method for solving the state space explosion in modular model checking of component-based software. However, the counterexample analysis technique used in this method has huge complexity and the computational cost for generating assumptions is very high. As a result, the method is difficult to be applied in practice. Therefore, this paper presents two improvements of the assume-guarantee verification method in order to solve the above problems. The first one is a counterexample analysis method that is simple to implement but effective enough to prevent the verification process from infinite loops when considering the last action of counterexample as suffix in implementation. This is done by finding a suffix that can make the observation table not closed when being added to the suffix set of the table and use that suffix for the learning process. The second one is a reduction of the number of membership queries to be asked to teacher when learning assumptions. This results in a significantly faster speed in generating assumption than that of the original algorithm. An implemented tool and experimental results are also described to show the effectiveness of the improvements.

Keywords

Model Check Assumption Generation Improve Algorithm Software Verification Membership Query 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Notes

Acknowledgements

This work is supported by the project no. QG.16.31 granted by Vietnam National University, Hanoi (VNU).

References

  1. 1.
    Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Chaki, S., Strichman, O.: Optimized L*-based assume-guarantee reasoning. In: Tools and Algorithms for the Construction and Analysis of Systems: 13th International Conference, TACAS’07. Proceedings, pp. 276–291. Springer, Berlin, Heidelberg (2007)Google Scholar
  3. 3.
    Chen, Y.-F., Clarke, E., Farzan, A., Tsai, M.-H., Tsay, Y.-K., Wang, B.-Y.: Automated assume-guarantee reasoning through implicit learning. In: Touili, T., Cook, B., Jackson, P. (eds.) Computer Aided Verification. Lecture Notes in Computer Science, vol. 6174, pp. 511–526. Springer, Berlin, Heidelberg (2010)Google Scholar
  4. 4.
    Clarke Jr., E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge, MA, USA (1999)Google Scholar
  5. 5.
    Cobleigh, J.M., Giannakopoulou, D., Păsăreanu, C.S.: Learning assumptions for compositional verification. In: Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS’03, pp. 331–346. Springer, Berlin, Heidelberg (2003)Google Scholar
  6. 6.
    Gupta, A., Mcmillan, K.L., Fu, Z.: Automated assumption generation for compositional verification. Form. Methods Syst. Des. 32(3), 285–301 (2008)CrossRefMATHGoogle Scholar
  7. 7.
    Hung, P.N., Nguyen, V.H., Aoki, T., Katayama, T.: An improvement of minimized assumption generation method for component-based software verification. In: Computing and Communication Technologies, Research, Innovation, and Vision for the Future (RIVF), pp. 1–6, Feb 2012Google Scholar
  8. 8.
    Hung, P.N., Nguyen, V.H., Aoki, T., Katayama, T.: On optimization of minimized assumption generation method for component-based software verification. IEICE Trans. 95-A(9), 1451–1460 (2012)Google Scholar
  9. 9.
    Maler, O., Pnueli, A.: On the learnability of infinitary regular sets. Inf. Comput. 118(2), 316–326 (1995)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
  11. 11.
    Hung, P.N., Aoki, T., Katayama, T.: A Minimized Assumption Generation Method for Component-Based Software Verification. In: Theoretical Aspects of Computing—ICTAC’09: 6th International Colloquium. Proceedings, pp. 277–291. Springer, Berlin, Heidelberg (2009)Google Scholar
  12. 12.
    Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. In: Proceedings of the Twenty-first Annual ACM Symposium on Theory of Computing, STOC ’89, pp. 411–420. ACM, New York, NY, USA (1989)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Chi-Luan Le
    • 1
    • 2
  • Hoang-Viet Tran
    • 2
  • Pham Ngoc Hung
    • 2
  1. 1.University of Transport TechnologyThanh XuanVietnam
  2. 2.VNU University of Engineering and TechnologyCau GiayVietnam

Personalised recommendations