{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:30:04Z","timestamp":1742985004921,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031294754"},{"type":"electronic","value":"9783031294761"}],"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-3-031-29476-1_1","type":"book-chapter","created":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T11:03:45Z","timestamp":1679655825000},"page":"3-11","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Formal Derivation and Verification of Critical Path Algorithm for Directed Acyclic Graph"],"prefix":"10.1007","author":[{"given":"Zhen","family":"You","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinwu","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinyun","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwen","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiewen","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuo","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,25]]},"reference":[{"issue":"5","key":"1_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/MC.2020.2978567","volume":"53","author":"JB Michael","year":"2020","unstructured":"Michael, J.B., Dinolt, G.W., Drusinsky, D.: Open questions in formal methods. Computer 53(5), 81\u201384 (2020)","journal-title":"Computer"},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1017\/S0956796805005708","volume":"16","author":"K Malde","year":"2006","unstructured":"Malde, K., Giegerich, R.: Calculating PSSM probabilities with lazy dynamic programming. J. Funct. Program. 16(1), 75\u201381 (2006)","journal-title":"J. Funct. Program."},{"key":"1_CR3","unstructured":"Derrick, G. Bruce, W.: The Correctness-by-Construction Approach to Programming. Springer, Berlin, Heidelberg (2012)"},{"issue":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/BF02943151","volume":"12","author":"J Xue","year":"1997","unstructured":"Xue, J.: A unified approach for developing efficient algorithm of programs. J. Comput. Sci. Technol. 12(4), 314\u2013329 (1997)","journal-title":"J. Comput. Sci. Technol."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"You, Z., Xue, J., Zuo, Z.: Unified formal derivation and automatic verification of three binary-tree traversal non-recursive algorithms. Cluster Comput. 19(4), 2145\u20132156 (2016)","DOI":"10.1007\/s10586-016-0663-9"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Zhen, Y., et al.: A multiplayer virtual intelligent system based on distributed virtual reality. Int. J. Pattern Recogn. Artif. Intell. 35(14), 2159050, 1\u201321 (2021)","DOI":"10.1142\/S0218001421590503"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Xue, J., Cheng, Z., Yang, Q.: Methodology and platform of IS code generation. In: ICBDM 2020: 2020 International Conference on Big Data in Management, pp. 49\u201357 (2020)","DOI":"10.1145\/3437075.3437096"},{"key":"1_CR8","unstructured":"Jinyun, X.: PAR method: abstract programming language apla. Technical report. Key Laboratory of high performance computing technology. Jiangxi Normal University (in Chinese) (2001)"},{"key":"1_CR9","volume-title":"A Discipline of Programming","author":"EW Dijkstra","year":"1976","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)"},{"key":"1_CR10","volume-title":"Predicate Calculus and Program Semantics","author":"EW Dijkstra","year":"1989","unstructured":"Dijkstra, E.W., Scholten, C.S.: Predicate Calculus and Program Semantics. Springer, New York (1989)"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02939477","volume":"8","author":"X Jinyun","year":"1993","unstructured":"Jinyun, X.: Two new strategies for developing loop invariants and their applications. J. Comput. Sci. Technol. 8(2), 147\u2013154 (1993). (in Chinese)","journal-title":"J. Comput. Sci. Technol."},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Dur\u00e1n, J.E.: Transformational derivation of greedy network algorithms from descriptive specifications. In: Boiten, E.A., M\u00f6ller, B. (eds.) Mathematics of Program Construction. MPC 2002. Lecture Notes in Computer Science, vol. 2386, pp. 40\u201367. Springer, Berlin, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45442-X_5","DOI":"10.1007\/3-540-45442-X_5"},{"key":"1_CR13","unstructured":"Si, X. Dai, H., Raghothaman, M.: Learning loop invariants for program verification. Neural Inf. Process. Syst. (2018)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Fowler, M., Kraemer, E., Sitaraman, M.: Tool-aided loop invariant development: insights into student conceptions and difficulties. In: ITiCSE 2021: 26th ACM Conference on Innovation and Technology in Computer Science Education, pp. 387\u2013393. ACM (2021)","DOI":"10.1145\/3430665.3456351"}],"container-title":["Lecture Notes in Computer Science","Structured Object-Oriented Formal Language and Method"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-29476-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T11:04:33Z","timestamp":1679655873000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-29476-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031294754","9783031294761"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-29476-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFL+MSVL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Structured Object-Oriented Formal Language and Method","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofl2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","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":"12","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":"46% - 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":"2","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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy to use as a whole. Almost everything in the system is good.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}