{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:00:38Z","timestamp":1743138038528,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031160806"},{"type":"electronic","value":"9783031160813"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16081-3_40","type":"book-chapter","created":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T22:02:24Z","timestamp":1663452144000},"page":"456-465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Three Algorithms for\u00a0Converting Control Flow Statements from\u00a0Python to\u00a0XD-M"],"prefix":"10.1007","author":[{"given":"Jiarui","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenhua","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,18]]},"reference":[{"key":"40_CR1","unstructured":"P2M: A Python to XD-M translator. https:\/\/github.com\/FairyJiar\/P2M"},{"key":"40_CR2","unstructured":"Python AST Document. https:\/\/docs.python.org\/3\/library\/ast.html"},{"key":"40_CR3","unstructured":"Python Homepage. https:\/\/www.python.org\/"},{"issue":"7","key":"40_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/390013.808479","volume":"5","author":"FE Allen","year":"1970","unstructured":"Allen, F.E.: Control flow analysis. ACM SIGPLAN Notices 5(7), 1\u201319 (1970)","journal-title":"ACM SIGPLAN Notices"},{"issue":"3","key":"40_CR5","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/322139.322151","volume":"26","author":"BS Baker","year":"1979","unstructured":"Baker, B.S., Kosaraju, S.R.: A comparison of multilevel break and next statements. J. ACM (JACM) 26(3), 555\u2013566 (1979)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"40_CR6","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1093\/logcom\/13.2.195","volume":"13","author":"H Bowman","year":"2003","unstructured":"Bowman, H., Thompson, S.: A decision procedure and complete axiomatization of finite interval temporal logic with projection. J. Logic Comput. 13(2), 195\u2013239 (2003)","journal-title":"J. Logic Comput."},{"key":"40_CR7","doi-asserted-by":"publisher","first-page":"102679","DOI":"10.1016\/j.scico.2021.102679","volume":"209","author":"W Chen","year":"2021","unstructured":"Chen, W.: Loop invariance with break and continue. Sci. Comput. Program. 209, 102679 (2021)","journal-title":"Sci. Comput. Program."},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Duan, Z.: Temporal Logic and Temporal Logic Programming. Science Press, Beijing (2005)","DOI":"10.1007\/11562931_27"},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.tcs.2014.02.011","volume":"554","author":"Z Duan","year":"2014","unstructured":"Duan, Z., Tian, C.: A practical decision procedure for propositional projection temporal logic with infinite models. Theoret. Comput. Sci. 554, 169\u2013190 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/j.tcs.2015.08.039","volume":"609","author":"Z Duan","year":"2016","unstructured":"Duan, Z., Tian, C., Zhang, N.: A canonical form based decision procedure and model checking approach for propositional projection temporal logic. Theoret. Comput. Sci. 609, 544\u2013560 (2016)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"40_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.scico.2007.09.001","volume":"70","author":"Z Duan","year":"2008","unstructured":"Duan, Z., Yang, X., Koutny, M.: Framed temporal logic programming. Sci. Comput. Program. 70(1), 31\u201361 (2008)","journal-title":"Sci. Comput. Program."},{"key":"40_CR12","unstructured":"Hammond, M., Robinson, A.: Python Programming on Win32: Help for Windows Programmers. O\u2019Reilly Media, Inc., Sebastapol (2000)"},{"key":"40_CR13","unstructured":"Lomet, D.B.: Control structures and the RETURN statement. In: Watson T.J., (ed.) IBM Research Division (1973)"},{"key":"40_CR14","unstructured":"Rosner, R., Pnueli, A.: A choppy logic. Weizmann Institute of Science, Department of Applied Mathematics (1986)"},{"issue":"3","key":"40_CR15","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/2950065","volume":"7","author":"J Sorva","year":"2016","unstructured":"Sorva, J., Vihavainen, A.: Break statement considered. ACM Inroads 7(3), 36\u201341 (2016)","journal-title":"ACM Inroads"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Taft, S.T.: Implementing the extended return statement for ADA 2005. In: Proceedings of the 2008 ACM Annual International Conference on SIGAda Annual International Conference, pp. 97\u2013104 (2008)","DOI":"10.1145\/1454497.1454491"},{"issue":"12","key":"40_CR17","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1109\/TSE.2014.2357442","volume":"40","author":"C Tian","year":"2014","unstructured":"Tian, C., Duan, Z., Duan, Z.: Making CEGAR more efficient in software model checking. IEEE Trans. Softw. Eng. 40(12), 1206\u20131223 (2014)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"5","key":"40_CR18","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1007\/s11704-016-6059-4","volume":"11","author":"X Wang","year":"2017","unstructured":"Wang, X., Tian, C., Duan, Z., Zhao, L.: MSVL: a typed language for temporal logic programming. Front. Comput. Sci. 11(5), 762\u2013785 (2017)","journal-title":"Front. Comput. Sci."},{"key":"40_CR19","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.tcs.2016.02.037","volume":"654","author":"N Zhang","year":"2016","unstructured":"Zhang, N., Duan, Z., Tian, C.: A mechanism of function calls in MSVL. Theoret. Comput. Sci. 654, 11\u201325 (2016)","journal-title":"Theoret. Comput. Sci."},{"issue":"11","key":"40_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-015-0882-6","volume":"59","author":"N Zhang","year":"2016","unstructured":"Zhang, N., Duan, Z., Tian, C.: Model checking concurrent systems with MSVL. Sci. China Inf. Sci. 59(11), 1\u20133 (2016)","journal-title":"Sci. China Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16081-3_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T22:05:38Z","timestamp":1663452338000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16081-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031160806","9783031160813"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16081-3_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer Nature EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}