Citation: Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, M. Ganzha, L. Maciaszek, M. Paprzycki (eds). ACSIS, Vol. 21, pages 657–660 (2020)
Abstract. Model-based GUI testing has achieved widespread recognition in academy thanks to its advantages compared to code-based testing due to its potentials to automate testing and the ability to cover bigger parts more efficiently. In this study design paper, we address the scalability part of the model-based GUI testing by using community detection algorithms. A case study is presented as an example of possible improvements to make a model-based testing approach more efficient. We demonstrate layered ESG models as an example of our approach to consider the scalability problem. We present rough calculations with expected results, which show 9 times smaller time and space units for 100 events ESG model when a community detection algorithm is applied.
- R. K. Shehady & D. P. Siewiorek, "A method to automate user interface testing using variable finite state machines," Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing, Seattle, WA, USA, 1997, pp. 80-88, http://dx.doi.org/10.1109/FTCS.1997.614080.
- A. M. Memon, M. E. Pollack & M. L. Soffa, "Hierarchical GUI test case generation using automated planning," in IEEE Transactions on Software Engineering, vol. 27, no. 2, pp. 144-155, Feb. 2001, http://dx.doi.org/10.1109/32.908959.
- Memon, A. M. (2007). An event-flow model of GUI-based applications for testing. Software testing, verification and reliability, 17(3), 137-157.
- Belli, F. (2001, November). Finite state testing and analysis of graphical user interfaces. In Proceedings 12th international symposium on software reliability engineering (pp. 34-43). IEEE.
- Belli, F., Beyazıt, M., Budnik, C. J., & Tuglular, T. (2017). Advances in model-based testing of graphical user interfaces. In Advances in Computers (Vol. 107, pp. 219-280). Elsevier.
- Kilinccceker, O., Turk, E., Challenger, M., & Belli, F. (2018, July). Regular expression based test sequence generation for HDL program validation. In 2018 IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C) (pp. 585-592). IEEE.
- Kilincceker, O., Silistre, A., Challenger, M., & Belli, F. (2019, July). Random test generation from regular expressions for graphical user interface (GUI) testing. In 2019 IEEE 19th International Conference on Software Quality, Reliability and Security Companion (QRS-C) (pp. 170-176). IEEE.
- Harary, F., & Ross, I. C. (1957). A procedure for clique detection using the group matrix. Sociometry, 20(3), 205-215.
- Fortunato, S. (2010). Community detection in graphs. Physics reports, 486(3-5), 75-174.
- Leskovec, J., Lang, K. J., & Mahoney, M. (2010, April). Empirical comparison of algorithms for network community detection. In Proceedings of the 19th international conference on World wide web (pp. 631-640).
- Sadi, S., Öğüdücü, Ş., & Uyar, A. Ş. (2010, July). An efficient community detection method using parallel clique-finding ants. In IEEE Congress on Evolutionary Computation (pp. 1-7). IEEE.
- Yang, Z., Algesheimer, R., & Tessone, C. J. (2016). A comparative analysis of community detection algorithms on artificial networks. Scientific reports, 6, 30750.
- Mercan, G., Akgündüz, E., Kılınççeker, O., Challenger, M., & Belli, F. (2018). Android uygulaması testi için ideal test ön çalışması. CEUR Workshop Proceedings.
- Kılınççeker, O., & Belli, F. (2017). Grafiksel kullanıcı arayüzleri için düzenli ifade bazlı test kapsama kriterleri. CEUR Workshop Proceedings.
- Kilincceker, O., Turk, E., Challenger, M., & Belli, F. (2018, April). Applying the Ideal Testing Framework to HDL Programs. In ARCS Workshop 2018; 31th International Conference on Architecture of Computing Systems (pp. 1-6). VDE.
- Kilincceker, O., & Belli, F. (2019, November). Towards Uniform Modeling and Holistic Testing of Hardware and Software. In 2019 1st International Informatics and Software Engineering Conference (UBMYK) (pp. 1-6). IEEE.
- Festinger, L. (1949). The analysis of sociograms using matrix algebra. Human relations, 2(2), 153-158.
- Li, Y., He, K., Bindel, D., & Hopcroft, J. E. (2015, May). Uncovering the small community structure in large networks: A local spectral approach. In Proceedings of the 24th international conference on world wide web (pp. 658-668).
- Lancichinetti, A., Radicchi, F., Ramasco, J. J., & Fortunato, S. (2011). Finding statistically significant communities in networks. PloS one, 6(4), e18961.
- Coscia, M., Rossetti, G., Giannotti, F., & Pedreschi, D. (2012, August). Demon: a local-first discovery method for overlapping communities. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 615-623).
- Ahn, Y. Y., Bagrow, J. P., & Lehmann, S. (2010). Link communities reveal multiscale complexity in networks. nature, 466(7307), 761-764.