{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:21:41Z","timestamp":1770283301378,"version":"3.49.0"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030550882","type":"print"},{"value":"9783030550899","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-55089-9_4","type":"book-chapter","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T17:08:28Z","timestamp":1596215308000},"page":"122-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["$$\\mathbb {K}$$\u2014A Semantic Framework for Programming Languages and Formal Analysis"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3208-4061","authenticated-orcid":false,"given":"Xiaohong","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3102-0421","authenticated-orcid":false,"given":"Grigore","family":"Ro\u015fu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,1]]},"reference":[{"key":"4_CR1","unstructured":"Clang: A C language family frontend for LLVM. https:\/\/clang.llvm.org\/"},{"key":"4_CR2","unstructured":"GCC, the GNU compiler collection. https:\/\/gcc.gnu.org\/"},{"key":"4_CR3","unstructured":"TrustInSoft\u2013cybersecurity and safety provider. https:\/\/trust-in-soft.com\/"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Ahrendt, W., Beckert, B., Bubel, R., Hahnle, R., Schmitt, P.H., Ulbrich, M.: Deductive Software Verification-The KeY Book. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-319-49812-6","DOI":"10.1007\/978-3-319-49812-6"},{"key":"4_CR5","unstructured":"Barendregt, H.: The lambda calculus: its syntax and semantics. Studies in Logic and the Foundations of Mathematics, Elsevier Science Publishers (1984)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11804192_17","volume-title":"Formal Methods for Components and Objects","author":"M Barnett","year":"2006","unstructured":"Barnett, M., Chang, B.-Y.E., DeLine, R., Jacobs, B., Leino, K.R.M.: Boogie: a modular reusable verifier for object-oriented programs. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol. 4111, pp. 364\u2013387. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11804192_17"},{"key":"4_CR7","series-title":"Coq\u2019Art the Calculus of Inductive Constructions","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development","author":"Y Bertot","year":"2010","unstructured":"Bertot, Y., Castran, P.: Interactive Theorem Proving and Program Development. Coq\u2019Art the Calculus of Inductive Constructions. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-662-07964-5"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Bogd\u0103na\u015f, D., Ro\u015fu, G.: K-Java: a complete semantics of Java. In: Proceedings of the 42$$^{\\rm nd}$$ Symposium on Principles of Programming Languages (POPL 2015), pp. 445\u2013456. ACM, January 2015. https:\/\/doi.org\/10.1145\/2676726.2676982","DOI":"10.1145\/2676726.2676982"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Brady, E.: IDRIS \u2013 systems programming meets full dependent types. In: Proceedings of the 5$$^{\\rm th}$$ ACM Workshop on Programming Languages Meets Program Verification (PLPV 2011), pp. 43\u201354. ACM (2011). https:\/\/doi.org\/10.1145\/1929529.1929536","DOI":"10.1145\/1929529.1929536"},{"key":"4_CR10","unstructured":"Chen, X., Ro\u015fu, G.: Applicative matching logic. Technical Report, University of Illinois at Urbana-Champaign, July 2019. http:\/\/hdl.handle.net\/2142\/104616"},{"key":"4_CR11","unstructured":"Chen, X., Ro\u015fu, G.: Matching $$\\mu $$-logic. In: Proceedings of the 34$$^{\\rm th}$$ Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2019) (2019)"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Chen, X., Ro\u015fu, G.: A language-independent program verification framework. In: Proceedings of the 8th International Symposium on Leveraging Applications of Formal Methods (ISoLA 2018), vol.11245, pp. 92\u2013102. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-03421-4","DOI":"10.1007\/978-3-030-03421-4"},{"key":"4_CR13","volume-title":"The Calculi of Lambda-Conversion","author":"A Church","year":"1941","unstructured":"Church, A.: The Calculi of Lambda-Conversion. Princeton University Press, New Jersey (1941)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-03359-9_2","volume-title":"Theorem Proving in Higher Order Logics","author":"E Cohen","year":"2009","unstructured":"Cohen, E., et al.: VCC: a practical system for verifying concurrent C. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 23\u201342. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03359-9_2"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Dasgupta, S., Park, D., Kasampalis, T., Adve, V.S., Ro\u015fu, G.: A complete formal semantics of x 86\u201364 user-level instruction set architecture. In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2019), pp. 1133\u20131148. ACM, June 2019. https:\/\/doi.org\/10.1145\/3314221.3314601","DOI":"10.1145\/3314221.3314601"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"De Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Proceedings of the 14$$^{\\rm th}$$ International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2008). pp. 337\u2013340. Springer, Cham (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"4_CR17","unstructured":"Ethereum: Solidity documentation (2019). http:\/\/solidity.readthedocs.io"},{"key":"4_CR18","unstructured":"Ethereum: Vyper documentation (2019). https:\/\/vyper.readthedocs.io"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-73368-3_21","volume-title":"Computer Aided Verification","author":"J-C Filli\u00e2tre","year":"2007","unstructured":"Filli\u00e2tre, J.-C., March\u00e9, C.: The Why\/Krakatoa\/caduceus platform for deductive program verification. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 173\u2013177. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73368-3_21"},{"key":"4_CR20","unstructured":"Guth, D.: A formal semantics of Python 3.3. Master\u2019s thesis, University of Illinois at Urbana-Champaign (2013). http:\/\/hdl.handle.net\/2142\/45275"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Hathhorn, C., Ellison, C., Ro\u015fu, G.: Defining the undefinedness of C. In: Proceedings of the 36$$^{\\rm th}$$ ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2015). pp. 336\u2013345. ACM, June 2015. https:\/\/doi.org\/10.1145\/2813885.2737979","DOI":"10.1145\/2813885.2737979"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Hildenbrandt, E., et al.: KEVM: a complete semantics of the Ethereum virtual machine. In: Proceedings of the 2018 IEEE Computer Security Foundations Symposium (CSF 2018). IEEE (2018). http:\/\/jellopaper.org","DOI":"10.1109\/CSF.2018.00022"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Kasampalis, T., et al.: IELE: a rigorously designed language and tool ecosystem for the blockchain. In: Proceeding of the 23$$^{\\rm rd}$$ International Symposium on Formal Methods (FM 2019) (2019)","DOI":"10.1007\/978-3-030-30942-8_35"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-54862-8_26","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Kroening","year":"2014","unstructured":"Kroening, D., Tautschnig, M.: CBMC \u2013 C bounded model checker. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 389\u2013391. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_26"},{"key":"4_CR25","unstructured":"The Coq development team: The Coq proof assistant reference manual. LogiCal Project (2004). http:\/\/coq.inria.fr"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-04652-0_5","volume-title":"Advanced Functional Programming","author":"U Norell","year":"2009","unstructured":"Norell, U.: Dependently typed programming in agda. In: Koopman, P., Plasmeijer, R., Swierstra, D. (eds.) AFP 2008. LNCS, vol. 5832, pp. 230\u2013266. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04652-0_5"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Park, D., \u015etef\u0103nescu, A., Ro\u015fu, G.: KJS: a complete formal semantics of JavaScript. In: Proceedings of the 36$$^{\\rm th}$$ ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2015), pp. 346\u2013356. ACM, June 2015. https:\/\/doi.org\/10.1145\/2737924.2737991","DOI":"10.1145\/2737924.2737991"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"Reynolds, J.C.: Separation logic: a logic for shared mutable data structures. In: Proceedings of the 17$$^{\\rm th}$$ Annual IEEE Symposium on Logic in Computer Science (LICS 2002), pp. 55\u201374. IEEE (2002). https:\/\/doi.org\/10.1109\/lics.2002.1029817","DOI":"10.1109\/lics.2002.1029817"},{"key":"4_CR29","unstructured":"Ro\u015fu, G.: K\u2013a semantic framework for programming languages and formal analysis tools. In: Dependable Software Systems Engineering. IOS Press (2017)"},{"issue":"4","key":"4_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.23638\/lmcs-13(4:28)2017","volume":"13","author":"G Ro\u015fu","year":"2017","unstructured":"Ro\u015fu, G.: Matching logic. Logic. Methods Comput. Sci. 13(4), 1\u201361 (2017). https:\/\/doi.org\/10.23638\/lmcs-13(4:28)2017","journal-title":"Logic. Methods Comput. Sci."},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Ro\u015fu, G., \u015etef\u0103nescu, A.: Checking reachability using matching logic. In: Proceedings of the 27$$^{\\rm th}$$ Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA 2012), pp. 555\u2013574. ACM, October 2012. http:\/\/dl.acm.org\/citation.cfm?doid=2384616.2384656","DOI":"10.1145\/2384616.2384656"},{"key":"4_CR32","doi-asserted-by":"publisher","unstructured":"Ro\u015fu, G., \u015etef\u0103nescu, A., Ciob\u00e2c\u0103, \u015e., Moore, B.M.: One-path reachability logic. In: Proceedings of the 28$$^{\\rm th}$$ Symposium on Logic in Computer Science (LICS 2013), pp. 358\u2013367. IEEE (2013). https:\/\/doi.org\/10.1109\/lics.2013.42","DOI":"10.1109\/lics.2013.42"},{"key":"4_CR33","doi-asserted-by":"publisher","unstructured":"Ro\u015fu, G., Serbanuta, T.F.: K overview and simple case study. In: Proceedings of International K Workshop (K 2011). ENTCS, vol. 304, pp. 3\u201356. Elsevier, June 2014. https:\/\/doi.org\/10.1016\/j.entcs.2014.05.002","DOI":"10.1016\/j.entcs.2014.05.002"},{"issue":"6","key":"4_CR34","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.jlap.2010.03.012","volume":"79","author":"G Ro\u015fu","year":"2010","unstructured":"Ro\u015fu, G., \u015eerb\u0103nu\u0163\u0103, T.F.: An overview of the K semantic framework. J. Logic Algebraic Program. 79(6), 397\u2013434 (2010). https:\/\/doi.org\/10.1016\/j.jlap.2010.03.012","journal-title":"J. Logic Algebraic Program."},{"issue":"2","key":"4_CR35","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5(2), 285\u2013309 (1955). https:\/\/doi.org\/10.2140\/pjm.1955.5.285","journal-title":"Pacific J. Math."},{"key":"4_CR36","unstructured":"The Isabelle development team: Isabelle (2018). https:\/\/isabelle.in.tum.de\/"}],"container-title":["Lecture Notes in Computer Science","Engineering Trustworthy Software Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-55089-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:03:30Z","timestamp":1754154210000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-55089-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030550882","9783030550899"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-55089-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SETSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Summer School on Engineering Trustworthy Software Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chongqing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"21 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"setss2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.swu-rise.net.cn\/SETSS2019\/index.html","order":11,"name":"conference_url","label":"Conference URL","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":"5","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":"5","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":"100% - 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":"1.4","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":"1","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)"}}]}}