{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:23:59Z","timestamp":1742973839636,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819930678"},{"type":"electronic","value":"9789819930685"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-3068-5_35","type":"book-chapter","created":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T10:02:19Z","timestamp":1685181739000},"page":"373-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Running Regular Research Seminar Online"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7515-9647","authenticated-orcid":false,"given":"N. V.","family":"Shilov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9387-6735","authenticated-orcid":false,"given":"D. A.","family":"Kondratyev","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6572-7292","authenticated-orcid":false,"given":"N.","family":"Kudasov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9574-128X","authenticated-orcid":false,"given":"I. S.","family":"Anureev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,28]]},"reference":[{"issue":"1","key":"35_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1134\/S0361768809010058","volume":"35","author":"IS Anureev","year":"2009","unstructured":"Anureev, I.S.: Operational ontological approach to formal programming language specification. Prog. Comput. Softw. 35(1), 35\u201342 (2009)","journal-title":"Prog. Comput. Softw."},{"key":"35_CR2","doi-asserted-by":"publisher","unstructured":"Belevantsev, A., Avetisyan, A.: Multi-level static analysis for finding error patterns and defects in source code. In: Petrenko, A., Voronkov, A. (eds.) PSI 2017, LNCS, vol. 10742. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-74313-4_3","DOI":"10.1007\/978-3-319-74313-4_3"},{"key":"35_CR3","unstructured":"Bodin, E.V., Garanina, N.O., Shilov, N.V.: Mars Robot puzzle (a multiagent approach to the Dijkstra problem). Model. Anal. Inform. Syst. 18(2), 113\u2013128 (2011) (In Russian)"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Burmyakov, A., Nikoli\u0107, B.: An exact comparison of global, partitioned, and semi-partitioned fixed-priority real-time multiprocessor schedulers. J. Syst. Arch. 121, 102313 (2021)","DOI":"10.1016\/j.sysarc.2021.102313"},{"key":"35_CR5","unstructured":"Carrasquel Gamez, J.C., Lomazova, I.A., Rivkin, A.: Modeling trading systems using Petri net extensions. In: Proceedings of the International Workshop on Petri Nets and Software Engineering Co-located with 41st International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2020), vol. 2651, pp. 118\u2013137. CEUR Workshop Proceedings (2020)"},{"key":"35_CR6","doi-asserted-by":"publisher","unstructured":"Davies, A., Seaton, A., Tonooka, C., White, J.: Covid-19, online workshops, and the future of intellectual exchange. Rethinking Hist. 25(2), 224\u2013241 (2021). https:\/\/doi.org\/10.1080\/13642529.2021.1934290","DOI":"10.1080\/13642529.2021.1934290"},{"key":"35_CR7","doi-asserted-by":"publisher","unstructured":"Denney, E., Fischer, B.: Explaining verification conditions. In: Meseguer, J., Ro\u015fu, G. (eds.) AMAST 2008, LNCS, vol. 5140, pp. 145\u2013159. Springer, Berlin, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79980-1_12","DOI":"10.1007\/978-3-540-79980-1_12"},{"key":"35_CR8","doi-asserted-by":"publisher","unstructured":"Garanina, N., Anureev, I., Sidorova, E., Koznov, D., Zyubin, V., Gorlatch, S.: An ontology-based approach to support formal verification of concurrent systems. In: Sekerinski, E., Moreira, N., Oliveira, J.N., Ratiu, D., Guidotti, R., Farrell, M., Luckcuck, M., Marmsoler, D., Campos, J., Astarte, T., Gonnord, L., Cerone, A., Couto, L., Dongol, B., Kutrib, M., Monteiro, P., Delmas, P. (eds.) FM 2019, LNCS, vol. 12232, pp. 114\u2013130. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-54994-7_9","DOI":"10.1007\/978-3-030-54994-7_9"},{"issue":"4","key":"35_CR9","first-page":"233","volume":"2","author":"P Juell","year":"1996","unstructured":"Juell, P., Brekke, D., Vetter, R., Wasson, J.: Evaluation of computer conferencing tools for conducting collaborative seminars on the internet. Int. J. Educ. Telecommun. 2(4), 233\u2013248 (1996)","journal-title":"Int. J. Educ. Telecommun."},{"issue":"5","key":"35_CR10","first-page":"27","volume":"28","author":"AV Kogtenkov","year":"2016","unstructured":"Kogtenkov, A.V.: Mechanically proved practical local null safety. Proc. Inst. Syst. Prog. RAS 28(5), 27\u201354 (2016)","journal-title":"Proc. Inst. Syst. Prog. RAS"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Kondratyev, D., Promsky, A.: Correctness of proof strategy for the sisal program verification. In: Proceedings of the 2019 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON-2019), pp. 641\u2013646. IEEE (2019)","DOI":"10.1109\/SIBIRCON48586.2019.8958225"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Kondratyev, D.A., Promsky, A.V.: Developing a self-applicable verification system. Theory and practice. Autom. Control Comput. Sci. 49(7), 445\u2013452 (2015)","DOI":"10.3103\/S0146411615070123"},{"key":"35_CR13","doi-asserted-by":"publisher","unstructured":"Kondratyev, D., Promsky, A.: Proof strategy for automated sisal program verification. In: Mazzara, M., Bruel, J.-M., Meyer, B., Petrenko, A. (eds.) TOOLS 2019, LNCS, vol. 11771, pp. 113\u2013120. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29852-4_9","DOI":"10.1007\/978-3-030-29852-4_9"},{"issue":"5","key":"35_CR14","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1134\/S036176882205005X","volume":"48","author":"DA Kondratyev","year":"2022","unstructured":"Kondratyev, D.A., Nepomniaschy, V.A.: Automation of C program deductive verification without using loop invariants. Prog. Comput. Softw. 48(5), 331\u2013346 (2022)","journal-title":"Prog. Comput. Softw."},{"key":"35_CR15","unstructured":"Kudasov, N., Sim, V.: Formalizing $$\\varphi $$-calculus: a purely object-oriented calculus of decorated objects (2022). CoRR abs\/2204.07454, https:\/\/arxiv.org\/abs\/2204.07454"},{"key":"35_CR16","unstructured":"Kudasov, N.: E-unification for second-order abstract syntax (2023). CoRR abs\/2302.05815, https:\/\/arxiv.org\/abs\/2302.05815"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Kukharenko, V.A., Ziborov, K.V., Sadykov, R.F., Naumchev, A.V., Rezin, R.M., Merkin-Janson, L.A.: InnoChain: a distributed ledger for industry with formal verification on all implementation levels. Model. Anal. Inform. Syst. 27(4), 454\u2013471 (2020) (In Russian)","DOI":"10.18255\/1818-1015-2020-4-454-471"},{"issue":"7","key":"35_CR18","doi-asserted-by":"publisher","first-page":"407","DOI":"10.3103\/S0146411614070141","volume":"48","author":"IV Maryasov","year":"2014","unstructured":"Maryasov, I.V., Nepomniaschy, V.A., Promsky, A.V., Kondratyev, D.A.: Automatic C program verification based on mixed axiomatic semantics. Autom. Control Comput. Sci. 48(7), 407\u2013414 (2014)","journal-title":"Autom. Control Comput. Sci."},{"key":"35_CR19","doi-asserted-by":"publisher","unstructured":"Mazzara, M., Succi, G., Tormasov, A.: Online and blended education: after COVID-19. In: Innopolis University\u2014From Zero to Hero. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-98599-8_10","DOI":"10.1007\/978-3-030-98599-8_10"},{"issue":"6","key":"35_CR20","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/s00165-019-00490-3","volume":"31","author":"JS Moore","year":"2019","unstructured":"Moore, J.S.: Milestones from the pure lisp theorem prover to ACL2. Formal Aspects Comput. 31(6), 699\u2013732 (2019)","journal-title":"Formal Aspects Comput."},{"key":"35_CR21","doi-asserted-by":"publisher","unstructured":"Moriconi, M., Schwartz, R.L.: Automatic construction of verification condition generators from Hoare logics. In: Even, S., Kariv, O. (eds.) ICALP 1981, LNCS, vol. 115, pp. 363\u2013377. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/3-540-10843-2_30","DOI":"10.1007\/3-540-10843-2_30"},{"key":"35_CR22","doi-asserted-by":"crossref","unstructured":"Naumchev, A: Seamless object-oriented requirements. In: Proceedings of the 2019 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON-2019), pp. 743\u2013748. IEEE (2019)","DOI":"10.1109\/SIBIRCON48586.2019.8958211"},{"issue":"1","key":"35_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11086-005-0007-7","volume":"31","author":"VA Nepomniaschy","year":"2005","unstructured":"Nepomniaschy, V.A.: Symbolic method of verification of definite iterations over altered data structures. Prog. Comput. Softw. 31(1), 1\u20139 (2005)","journal-title":"Prog. Comput. Softw."},{"key":"35_CR24","doi-asserted-by":"crossref","unstructured":"Pitts, A.M., Matthiesen, J., Derikx, J.: A dependent type theory with abstractable names. Electron. Notes Theor. Comput. Sci. 312(C), 19\u201350 (2015)","DOI":"10.1016\/j.entcs.2015.04.003"},{"key":"35_CR25","doi-asserted-by":"crossref","unstructured":"Romanov, V., Ivanov, V.: Prediction of types in python with pre-trained graph neural networks. In: Proceedings of the 2022 Ivannikov Memorial Workshop (IVMEM-2022), pp. 54\u201360. IEEE (2022)","DOI":"10.1109\/IVMEM57067.2022.9983956"},{"issue":"4","key":"35_CR26","first-page":"1","volume":"13","author":"G Rosu","year":"2017","unstructured":"Rosu, G.: Matching logic. Logical Methods Comput. Sci. 13(4), 1\u201361 (2017)","journal-title":"Logical Methods Comput. Sci."},{"key":"35_CR27","doi-asserted-by":"crossref","unstructured":"Shilov, N., Satekbayeva, A., Vorontsov, A.: Alias calculus for a simple imperative language with decidable pointer arithmetic. Bull. Novosibirsk Comput. Center. Ser. Comput. Sci. (37), 131\u2013147 (2014)","DOI":"10.31144\/bncc.cs.2542-1972.2014.n37.p131-147"},{"key":"35_CR28","doi-asserted-by":"publisher","unstructured":"Slind, K., Norrish, M.: A brief overview of HOL4. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008, LNCS, vol. 5170, pp. 28\u201332. Springer, Berlin, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-71067-7_6","DOI":"10.1007\/978-3-540-71067-7_6"},{"key":"35_CR29","doi-asserted-by":"crossref","unstructured":"Staroletov, S.: Towards modeling and verification of eurobalise telegram encoding algorithm. Transp. Res. Procedia 61, 447\u2013454 (2022)","DOI":"10.1016\/j.trpro.2022.01.073"},{"issue":"7","key":"35_CR30","doi-asserted-by":"publisher","first-page":"850","DOI":"10.3103\/S0146411618070301","volume":"52","author":"MS Ushakova","year":"2018","unstructured":"Ushakova, M.S., Legalov, A.I.: Verification of programs with mutual recursion in Pifagor language. Autom. Control Comput. Sci. 52(7), 850\u2013866 (2018)","journal-title":"Autom. Control Comput. Sci."},{"key":"35_CR31","doi-asserted-by":"publisher","unstructured":"Zyubin, V., Anureev, I., Garanina, N., Staroletov, S., Rozov, A., Liakh, T.: Event-driven temporal logic pattern for control software requirements specification. In: Hojjat, H., Massink, M. (eds.) FSEN 2021, LNCS, vol 12818, pp. 92\u2013107. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89247-0_7","DOI":"10.1007\/978-3-030-89247-0_7"}],"container-title":["Smart Innovation, Systems and Technologies","Agents and Multi-agent Systems: Technologies and Applications 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-3068-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T10:08:09Z","timestamp":1685182089000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-3068-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819930678","9789819930685"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-3068-5_35","relation":{},"ISSN":["2190-3018","2190-3026"],"issn-type":[{"type":"print","value":"2190-3018"},{"type":"electronic","value":"2190-3026"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KES-AMSTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"kesamsta2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}