{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T18:00:00Z","timestamp":1726164000118},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031067723"},{"type":"electronic","value":"9783031067730"}],"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"},{"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-06773-0_32","type":"book-chapter","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T11:24:44Z","timestamp":1652959484000},"page":"597-615","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Operational Annotations"],"prefix":"10.1007","author":[{"given":"Paul C.","family":"Attie","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,20]]},"reference":[{"key":"32_CR1","unstructured":"Attie, P.C.: Operational annotations: A new method for sequential program verification. CoRR abs\/2102.06727 (2021). https:\/\/arxiv.org\/abs\/2102.06727"},{"key":"32_CR2","doi-asserted-by":"publisher","unstructured":"Back, R., von Wright, J.: Refinement Calculus - A Systematic Introduction. Graduate Texts in Computer Science. Springer (1998). https:\/\/doi.org\/10.1007\/978-1-4612-1674-2","DOI":"10.1007\/978-1-4612-1674-2"},{"issue":"3","key":"32_CR3","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s00165-016-0361-7","volume":"28","author":"\u015e Ciob\u00e2c\u0103","year":"2016","unstructured":"Ciob\u00e2c\u0103, \u015e, Lucanu, D., Rusu, V., Ro\u015fu, G.: A language-independent proof system for full program equivalence. Formal Aspects Comput. 28(3), 469\u2013497 (2016). https:\/\/doi.org\/10.1007\/s00165-016-0361-7","journal-title":"Formal Aspects Comput."},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Crole, R.L., Gordon, A.D.: Relating operational and denotational semantics for input\/output effects. Math. Struct. Comput. Sci. 9(2), 125\u2013158 (1999). http:\/\/journals.cambridge.org\/action\/displayAbstract?aid=44797","DOI":"10.1017\/S0960129598002709"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: Guarded commands, nondeterminacy and formal derivation of programs. Commun. ACM 18(8), 453\u2013457 (1975)","DOI":"10.1145\/360933.360975"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Floyd, R.: Assigning meanings to programs. In: Mathematical Aspects of Computer Science. Proceedings of Symposium on Applied Mathematics, pp. 19\u201332. American Mathematical Society (1967)","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"32_CR7","volume-title":"Program verification","author":"N Francez","year":"1992","unstructured":"Francez, N.: Program verification. Addison-Wesley, International computer science series (1992)"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall (1985)","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"32_CR9","doi-asserted-by":"publisher","unstructured":"Hoare, C.A.R., et al.: Laws of programming. Commun. ACM 30(8), 672\u2013686 (1987). https:\/\/doi.org\/10.1145\/27651.27653","DOI":"10.1145\/27651.27653"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Hoare, C.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580, 583 (1969)","DOI":"10.1145\/363235.363259"},{"key":"32_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-44584-6_1","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","author":"T Hoare","year":"2014","unstructured":"Hoare, T.: Laws of programming: the algebraic unification of theories of concurrency. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 1\u20136. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44584-6_1"},{"key":"32_CR12","doi-asserted-by":"publisher","unstructured":"Jacobs, B.: Dijkstra and Hoare monads in monadic computation. Theor. Comput. Sci. 604, 30\u201345 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.03.020","DOI":"10.1016\/j.tcs.2015.03.020"},{"issue":"4","key":"32_CR13","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/s00165-014-0319-6","volume":"27","author":"D Lucanu","year":"2014","unstructured":"Lucanu, D., Rusu, V.: Program equivalence by circular reasoning. Formal Aspects Comput. 27(4), 701\u2013726 (2014). https:\/\/doi.org\/10.1007\/s00165-014-0319-6","journal-title":"Formal Aspects Comput."},{"key":"32_CR14","unstructured":"Lynch, N.A., Tuttle, M.R.: An introduction to input\/output automata. CWI-Quarterly 2(3), 219\u2013246 (1989), centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands. Technical Memo MIT\/LCS\/TM-373, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, November 1988"},{"key":"32_CR15","doi-asserted-by":"publisher","unstructured":"Lynch, N.A., Vaandrager, F.W.: Forward and backward simulations: I. Untimed systems. Inf. Comput. 121(2), 214\u2013233 (1995). https:\/\/doi.org\/10.1006\/inco.1995.1134","DOI":"10.1006\/inco.1995.1134"},{"key":"32_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","year":"1980","unstructured":"Milner, R. (ed.): A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3"},{"key":"32_CR17","unstructured":"Milner, R.: Communicating and mobile systems - the Pi-calculus. Cambridge University Press (1999)"},{"key":"32_CR18","doi-asserted-by":"publisher","unstructured":"Moggi, E.: Computational lambda-calculus and monads. In: Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS \u201989), Pacific Grove, California, USA, 5\u20138 June, 1989, pp. 14\u201323. IEEE Computer Society (1989). https:\/\/doi.org\/10.1109\/LICS.1989.39155","DOI":"10.1109\/LICS.1989.39155"},{"key":"32_CR19","doi-asserted-by":"publisher","unstructured":"Moggi, E.: Notions of computation and monads. Inf. Comput. 93(1), 55\u201392 (1991). https:\/\/doi.org\/10.1016\/0890-5401(91)90052-4","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"32_CR20","unstructured":"Morgan, C.: Programming from specifications, 2nd edn. Prentice Hall International series in computer science, Prentice Hall (1994)"},{"key":"32_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167\u2013183. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/BFb0017309"},{"key":"32_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/3-540-45699-6_8","volume-title":"Applied Semantics","author":"AM Pitts","year":"2002","unstructured":"Pitts, A.M.: Operational semantics and program equivalence. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) APPSEM 2000. LNCS, vol. 2395, pp. 378\u2013412. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45699-6_8"},{"key":"32_CR23","doi-asserted-by":"publisher","unstructured":"Pitts, A.M., Stark, I.D.B.: Observable properties of higher order functions that dynamically create local names, or: What\u2019s new? In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 122\u2013141. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57182-5_8","DOI":"10.1007\/3-540-57182-5_8"},{"key":"32_CR24","first-page":"17","volume":"60\u201361","author":"GD Plotkin","year":"2004","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. J. Log. Algebraic Methods Program. 60\u201361, 17\u2013139 (2004)","journal-title":"J. Log. Algebraic Methods Program."},{"key":"32_CR25","unstructured":"Reynolds, J.C.: Separation logic: a logic for shared mutable data structures. In: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science, LICS 2002, pp. 55\u201374. IEEE Computer Society, Washington, DC (2002). http:\/\/dl.acm.org\/citation.cfm?id=645683.664578"},{"key":"32_CR26","doi-asserted-by":"crossref","unstructured":"Schmidt, D.A.: Programming language semantics. In: Gonzalez, T.F., Diaz-Herrera, J., Tucker, A. (eds.) Computing Handbook, Third Edition: Computer Science and Software Engineering, pp. 69: 1\u201319. CRC Press (2014)","DOI":"10.1201\/b16812-78"},{"key":"32_CR27","doi-asserted-by":"publisher","unstructured":"Swamy, N., Hritcu, C., Keller, C., Rastogi, A., Delignat-Lavaud, A., Forest, S., Bhargavan, K., Fournet, C., Strub, P., Kohlweiss, M., Zinzindohoue, J.K., B\u00e9guelin, S.Z.: Dependent types and multi-monadic effects in F. In: Bodik, R., Majumdar, R. (eds.) Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, January 20\u201322, 2016, pp. 256\u2013270. ACM (2016). https:\/\/doi.org\/10.1145\/2837614.2837655","DOI":"10.1145\/2837614.2837655"},{"key":"32_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-642-03359-9_30","volume-title":"Theorem Proving in Higher Order Logics","author":"W Swierstra","year":"2009","unstructured":"Swierstra, W.: A hoare logic for the state monad. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 440\u2013451. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03359-9_30"},{"key":"32_CR29","unstructured":"Wing, J.M.: Hints to specifiers. Teaching and learning formal methods, pp. 57\u201378 (1995)"},{"key":"32_CR30","doi-asserted-by":"publisher","unstructured":"Wirsing, M.: Algebraic specification. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pp. 675\u2013788. Elsevier and MIT Press (1990). https:\/\/doi.org\/10.1016\/b978-0-444-88074-1.50018-4","DOI":"10.1016\/b978-0-444-88074-1.50018-4"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06773-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T11:13:37Z","timestamp":1659352417000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06773-0_32"}},"subtitle":["A New Method for Sequential Program Verification"],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031067723","9783031067730"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06773-0_32","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":"20 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pasadena, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/shemesh.larc.nasa.gov\/nfm2022\/","order":11,"name":"conference_url","label":"Conference URL","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"118","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":"33","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":"6","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":"28% - 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":"6.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)"}}]}}