{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:00:02Z","timestamp":1773615602653,"version":"3.50.1"},"reference-count":18,"publisher":"Allerton Press","issue":"8","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.3103\/s0146411624700913","type":"journal-article","created":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T14:23:08Z","timestamp":1741962188000},"page":"1263-1270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Method of Searching for Clones of the Program Code in Binary Executive Files"],"prefix":"10.3103","volume":"58","author":[{"given":"E. V.","family":"Zavadskii","sequence":"first","affiliation":[]},{"given":"A. V.","family":"Bulat","sequence":"additional","affiliation":[]},{"given":"N. A.","family":"Gribkov","sequence":"additional","affiliation":[]}],"member":"1627","published-online":{"date-parts":[[2025,3,14]]},"reference":[{"key":"7790_CR1","doi-asserted-by":"publisher","unstructured":"Baker, B.S., On finding duplication and near-duplication in large software systems, Proceedings of 2nd Working Conference on Reverse Engineering, Toronto, 1995, IEEE, 1995, pp. 86\u201395. https:\/\/doi.org\/10.1109\/wcre.1995.514697","DOI":"10.1109\/wcre.1995.514697"},{"key":"7790_CR2","unstructured":"National Vulnerability Database. Statistics Result. https:\/\/nvd.nist.gov\/vuln\/search\/statistics?form_type=Basic&results_type=statis-tics&search_type=all&isCpeNameSearch=false. Cited May 21, 2024."},{"key":"7790_CR3","doi-asserted-by":"publisher","unstructured":"Busygin, A. and Kalinin, M., Criterion of blockchain vulnerability to majority attack based on hashing power distribution assessment, Futuristic Trends in Network and Communication Technologies. FTNCT 2020, Singh, P.K., Veselov, G., Vyatkin, V., Pljonkin, A., Dodero, J.M., and Kumar, Y., Eds., Communications in Computer and Information Science, vol. 1395, Singapore: Springer, 2021, pp. 68\u201377. https:\/\/doi.org\/10.1007\/978-981-16-1480-4_6","DOI":"10.1007\/978-981-16-1480-4_6"},{"key":"7790_CR4","doi-asserted-by":"publisher","unstructured":"Wang, W., Li, G., Ma, B., Xia, X., and Jin, Zh., Detecting code clones with graph neural network and flow-augmented abstract syntax tree, IEEE 27th International Conference on Software Analysis, Evolution and Reengineering (SANER), London, Canada, IEEE, 2020, pp. 261\u2013271. https:\/\/doi.org\/10.1109\/SANER48275.2020.9054857","DOI":"10.1109\/SANER48275.2020.9054857"},{"key":"7790_CR5","doi-asserted-by":"publisher","first-page":"714","DOI":"10.17586\/2226-1494-2020-20-5-714-721","volume":"20","author":"A.O. Osadchaya","year":"2024","unstructured":"Osadchaya, A.O. and Isaev, I.V., Search of clones in program code, Nauchno-Tekhnicheskii Vestnik Informatsionnykh Tekhnologii, \n               Mekhaniki i Optiki, 2024, vol. 20, no. 5, pp. 714\u2013721. https:\/\/doi.org\/10.17586\/2226-1494-2020-20-5-714-721","journal-title":"Mekhaniki i Optiki"},{"key":"7790_CR6","unstructured":"Zorin, A.G., Primenenie iskusstvennykh neironnykh setei dlya poiska klonov v iskhodnom kode programm (Application of Artificial Neural Networks for Searching Clones in the Source Code of Programs), St. Petersburg: Sankt-Peterburgskii Politekhnicheskii Universitet, 2018."},{"key":"7790_CR7","doi-asserted-by":"publisher","unstructured":"Poltavtseva, M.A. and Kalinin, M.O., Conceptual data modeling using aggregates to ensure large-scale distributed data management systems security, Intelligent Distributed Computing XIII, Kotenko, I., Badica, C., Desnitsky, V., El Baz, D., and Ivanovic, M., Eds., Cham: Springer, 2020, vol. 868, pp. 41\u201347. https:\/\/doi.org\/10.1007\/978-3-030-32258-8_5","DOI":"10.1007\/978-3-030-32258-8_5"},{"key":"7790_CR8","doi-asserted-by":"publisher","unstructured":"Aleksandrova, E.B., Poltavtseva, M.A., and Shmatov, V.S., Ensuring the big data integrity through verifiable zero-knowledge operations, Mobile Internet Security. MobiSec 2021, You, I., Kim, H., Youn, T.Y., Palmieri, F., and Kotenko, I., Eds., Communications in Computer and Information Science, vol. 1544, Singapore: Springer, 2022, pp. 211\u2013221. https:\/\/doi.org\/10.1007\/978-981-16-9576-6_15","DOI":"10.1007\/978-981-16-9576-6_15"},{"key":"7790_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.15514\/ISPRAS-2015-27(1)-3","volume":"27","author":"S. Sargsyan","year":"2015","unstructured":"Sargsyan, S., Kurmangaleev, Sh., Belevantsev, A., Aslanyan, H., and Baloian, A., Scalable code clone detection tool based on semantic analysis, Trudy Instituta Sistemnogo Programmirovaniya Rossiiskoi Akademii Nauk, 2015, vol. 27, no. 1, pp. 39\u201349. https:\/\/doi.org\/10.15514\/ISPRAS-2015-27(1)-3","journal-title":"Trudy Instituta Sistemnogo Programmirovaniya Rossiiskoi Akademii Nauk"},{"key":"7790_CR10","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1109\/tr.2022.3176922","volume":"72","author":"D. Yuan","year":"2022","unstructured":"Yuan, D., Fang, S., Zhang, T., Xu, Zh., and Luo, X., Java code clone detection by exploiting semantic and syntax information from intermediate code-based graph, IEEE Trans. Reliab., 2022, vol. 72, no. 2, pp. 511\u2013526. https:\/\/doi.org\/10.1109\/tr.2022.3176922","journal-title":"IEEE Trans. Reliab."},{"key":"7790_CR11","first-page":"39","volume":"25","author":"N.G. Zeltser","year":"2013","unstructured":"Zeltser, N.G., Authentic clone detection for refactoring, Trudy Instituta Sistemnogo Programmirovaniya Rossiiskoi Akademii Nauk, 2013, vol. 25, pp. 39\u201350.","journal-title":"Trudy Instituta Sistemnogo Programmirovaniya Rossiiskoi Akademii Nauk"},{"key":"7790_CR12","doi-asserted-by":"publisher","unstructured":"Mayrand, J., Leblanc, C., and Merlo, E., Experiment on the automatic detection of function clones in a software system using metrics, Proceedings of International Conference on Software Maintenance ICSM-96, Monterey, CA, 1996, IEEE, 1996, pp. 244\u2013253. https:\/\/doi.org\/10.1109\/icsm.1996.565012","DOI":"10.1109\/icsm.1996.565012"},{"key":"7790_CR13","doi-asserted-by":"publisher","first-page":"968","DOI":"10.3103\/s0146411620080283","volume":"54","author":"M.A. Poltavtseva","year":"2020","unstructured":"Poltavtseva, M.A. and Zegzhda, D.P., Building an adaptive system for collecting and preparing data for security monitoring, Autom. Control Comput. Sci., 2020, vol. 54, no. 8, pp. 968\u2013976. https:\/\/doi.org\/10.3103\/s0146411620080283","journal-title":"Autom. Control Comput. Sci."},{"key":"7790_CR14","doi-asserted-by":"publisher","unstructured":"Komondoor, R. and Horwitz, S., Using slicing to identify duplication in source code, Static Analysis, Cousot, P., Ed., Lecture Notes in Computer Science, vol. 2126, Berlin: Springer, 2001, pp. 40\u201356. https:\/\/doi.org\/10.1007\/3-540-47764-0_3","DOI":"10.1007\/3-540-47764-0_3"},{"key":"7790_CR15","doi-asserted-by":"publisher","first-page":"2208","DOI":"10.3390\/sym14102208","volume":"14","author":"M. Kalinin","year":"2022","unstructured":"Kalinin, M., Ovasapyan, T., and Poltavtseva, M., Application of the learning automaton model for ensuring cyber resiliency, Symmetry, 2022, vol. 14, no. 10, p. 2208. https:\/\/doi.org\/10.3390\/sym14102208","journal-title":"Symmetry"},{"key":"7790_CR16","doi-asserted-by":"publisher","first-page":"958","DOI":"10.3103\/s0146411623080060","volume":"57","author":"N.A. Gribkov","year":"2023","unstructured":"Gribkov, N.A., Ovasapyan, T.D., and Moskvin, D.A., Analysis of decompiled program code using abstract syntax trees, Autom. Control Comput. Sci., 2023, vol. 57, no. 8, pp. 958\u2013967. https:\/\/doi.org\/10.3103\/s0146411623080060","journal-title":"Autom. Control Comput. Sci."},{"key":"7790_CR17","first-page":"2702","volume":"48","author":"H. Dai","year":"2016","unstructured":"Dai, H., Dai, B., and Song, L., Discriminative embeddings of latent variable models for structured data, Proceedings of Machine Learning Research, 2016, vol. 48, pp. 2702\u20132711.","journal-title":"Proceedings of Machine Learning Research"},{"key":"7790_CR18","unstructured":"OpenSSL. https:\/\/www.openssl.org\/. Cited June 3, 2024."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411624700913.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411624700913","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411624700913.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:02:06Z","timestamp":1773612126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411624700913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":18,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["7790"],"URL":"https:\/\/doi.org\/10.3103\/s0146411624700913","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]},"assertion":[{"value":"8 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors of this work declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}