{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T17:12:38Z","timestamp":1785345158710,"version":"3.55.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030290252","type":"print"},{"value":"9783030290269","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29026-9_25","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:10:06Z","timestamp":1566429006000},"page":"446-476","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Operational Semantics and Program Verification Using Many-Sorted Hybrid Modal Logic"],"prefix":"10.1007","author":[{"given":"Ioana","family":"Leu\u015ftean","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Natalia","family":"Moang\u0103","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Traian Florin","family":"\u015eerb\u0103nu\u0163\u0103","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1016\/S1570-2464(07)80017-6","volume-title":"Handbook of Modal Logic","author":"C Areces","year":"2007","unstructured":"Areces, C., ten Cate, B.: Hybrid logics. In: Blackburn, P., et al. (eds.) Handbook of Modal Logic, vol. 3, pp. 822\u2013868. Elsevier, Amsterdam (2007)"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01049415","volume":"4","author":"P Blackburn","year":"1995","unstructured":"Blackburn, P., Seligman, J.: Hybrid Languages. J. Log. Lang. Inf. 4, 251\u2013272 (1995)","journal-title":"J. Log. Lang. Inf."},{"issue":"2","key":"25_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s11225-006-9009-6","volume":"84","author":"P Blackburn","year":"2006","unstructured":"Blackburn, P., ten Cate, B.: Pure extensions, proof rules, and hybrid axiomatics. Stud. Log. 84(2), 277\u2013322 (2006)","journal-title":"Stud. Log."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1093\/jigpal\/6.4.625","volume":"4","author":"P Blackburn","year":"1998","unstructured":"Blackburn, P., Tzakova, M.: Hybrid completeness. Log. J. IGPL 4, 625\u2013650 (1998)","journal-title":"Log. J. IGPL"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1093\/jigpal\/7.1.27","volume":"7","author":"P Blackburn","year":"1999","unstructured":"Blackburn, P., Tzakova, M.: Hybrid languages and temporal logic. Log. J. IGPL 7, 27\u201354 (1999)","journal-title":"Log. J. IGPL"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Blackburn, P, van Benthem, J.: Modal logic: a semantic perspective. In: Blackburn, P., et al. (eds.) Handbook of Modal Logic, vol. 3, pp. 1\u201384 (2007)","DOI":"10.1016\/S1570-2464(07)80004-8"},{"key":"25_CR7","volume-title":"Modal Logic","author":"P Blackburn","year":"2002","unstructured":"Blackburn, P., Venema, Y., de Rijke, M.: Modal Logic. Cambridge University Press, Cambridge (2002)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Bohrer, B., Platzer, A.: A hybrid, dynamic logic for hybrid-dynamic information flow. In: LICS 2018 Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 115\u2013124 (2018)","DOI":"10.1145\/3209108.3209151"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Calcagno, C., Gardner, P., Zarfaty, U.: Context logic as modal logic: completeness and parametric inexpressivity. In: POPL 2007 Proceedings of the 34th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 123\u2013134 (2007)","DOI":"10.1145\/1190216.1190236"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Chen, X., Ro\u015fu, G.: Matching mu-Logic. In: LICS 2019. Technical report http:\/\/hdl.handle.net\/2142\/102281 (2019, to appear)","DOI":"10.1109\/LICS.2019.8785675"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","volume":"19","author":"RW Floyd","year":"1967","unstructured":"Floyd, R.W.: Assigning meanings to programs. Proc. Am. Math. Soc. Symp. Appl. Math. 19, 19\u201331 (1967)","journal-title":"Proc. Am. Math. Soc. Symp. Appl. Math."},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/BF01054038","volume":"22","author":"G Gargov","year":"1993","unstructured":"Gargov, G., Goranko, V.: Modal logic with names. J. Philos. Log. 22, 607\u2013636 (1993)","journal-title":"J. Philos. Log."},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1093\/logcom\/11.5.737","volume":"11","author":"V Goranko","year":"2001","unstructured":"Goranko, V., Vakarelov, D.: Sahlqvist formulas in hybrid polyadic modal logics. J. Log. Comput. 11, 737\u2013754 (2001)","journal-title":"J. Log. Comput."},{"key":"25_CR14","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1188.001.0001","volume-title":"Algebraic Semantics of Imperative Programs","author":"J Goguen","year":"1996","unstructured":"Goguen, J., Malcolm, G.: Algebraic Semantics of Imperative Programs. MIT Press, Cambridge (1996)"},{"key":"25_CR15","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D Harel","year":"2000","unstructured":"Harel, D., Tiuryn, J., Kozen, D.: Dynamic Logic. MIT Press Cambridge, Cambridge (2000)"},{"issue":"11","key":"25_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/71605.71607","volume":"24","author":"J Heering","year":"1989","unstructured":"Heering, J., Hendriks, P.R.H., Klint, P., Rekers, J.: The syntax definition formalism SDF \u2014reference manual\u2014. ACM Sigplan Not. 24(11), 43\u201375 (1989)","journal-title":"ACM Sigplan Not."},{"issue":"10","key":"25_CR17","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580 (1969)","journal-title":"Commun. ACM"},{"key":"25_CR18","unstructured":"Leu\u015ftean, I., Moang\u0103, N., \u015eerb\u0103nu\u0163\u0103, T.F.: A many-sorted polyadic modal logic. arXiv:1803.09709 (2018, submitted)"},{"key":"25_CR19","unstructured":"Leu\u015ftean, I., Moang\u0103, N., \u015eerb\u0103nu\u0163\u0103, T.F.: Operational semantics using many-sorted hybrid modal logic. arXiv:1905.05036 (2019)"},{"key":"25_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63588-0","volume-title":"Logical Foundations of Cyber-Physical Systems","author":"A Platzer","year":"2018","unstructured":"Platzer, A.: Logical Foundations of Cyber-Physical Systems. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-63588-0"},{"key":"25_CR21","unstructured":"Plotkin, G.D.: A structural approach to operational semantics (1981) Technical report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark. (Reprinted with corrections in J. Log. Algebr. Program) 60\u201361, 17\u2013139 (2004)"},{"issue":"4","key":"25_CR22","first-page":"1","volume":"13","author":"G Ro\u015fu","year":"2017","unstructured":"Ro\u015fu, G.: Matching logic. Log. Methods Comput. Sci. 13(4), 1\u201361 (2017)","journal-title":"Log. Methods Comput. Sci."},{"key":"25_CR23","unstructured":"Reynolds, J.C.: Separation logic: a logic for shared mutable data structures. In: Proceedings 17th Annual IEEE Symposium on Logic in Computer Science (2002)"},{"issue":"2","key":"25_CR24","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1017\/S0960129510000563","volume":"21","author":"L Schr\u00f6der","year":"2011","unstructured":"Schr\u00f6der, L., Pattinson, D.: Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra. Math. Struct. Comput. Sci. 21(2), 235\u2013266 (2011)","journal-title":"Math. Struct. Comput. Sci."},{"key":"25_CR25","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1093\/logcom\/9.5.601","volume":"9","author":"Y Venema","year":"1999","unstructured":"Venema, Y.: Points, lines and diamonds: a two-sorted modal logic for projective planes. J. Log. Comput. 9, 601\u2013621 (1999)","journal-title":"J. Log. Comput."},{"issue":"13","key":"25_CR26","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1002\/cpe.598","volume":"13","author":"D Oheimb von","year":"2001","unstructured":"von Oheimb, D.: Hoare logic for Java in Isabelle\/HOL. Concurr. Comput. Pract. Exp. 13(13), 1173\u20131214 (2001)","journal-title":"Concurr. Comput. Pract. Exp."}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29026-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T22:42:09Z","timestamp":1575585729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29026-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290252","9783030290269"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29026-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TABLEAUX","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Reasoning with Analytic Tableaux and Related Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tableaux2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tableaux2019.org\/","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":"43","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":"25","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":"58% - 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.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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}