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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987)
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)
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)
Clarke Jr., E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge, MA, USA (1999)
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)
Gupta, A., Mcmillan, K.L., Fu, Z.: Automated assumption generation for compositional verification. Form. Methods Syst. Des. 32(3), 285–301 (2008)
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 2012
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)
Maler, O., Pnueli, A.: On the learnability of infinitary regular sets. Inf. Comput. 118(2), 316–326 (1995)
Microsoft: Visual studio community. https://www.visualstudio.com/en-us/products/visual-studio-community-vs.aspx (2015)
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)
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)
Acknowledgements
This work is supported by the project no. QG.16.31 granted by Vietnam National University, Hanoi (VNU).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Le, CL., Tran, HV., Hung, P.N. (2017). On Implementation of the Assumption Generation Method for Component-Based Software Verification. In: Król, D., Nguyen, N., Shirai, K. (eds) Advanced Topics in Intelligent Information and Database Systems. ACIIDS 2017. Studies in Computational Intelligence, vol 710. Springer, Cham. https://doi.org/10.1007/978-3-319-56660-3_47
Download citation
DOI: https://doi.org/10.1007/978-3-319-56660-3_47
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-56659-7
Online ISBN: 978-3-319-56660-3
eBook Packages: EngineeringEngineering (R0)