{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:21:04Z","timestamp":1743081664130,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319307336"},{"type":"electronic","value":"9783319307343"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-319-30734-3_22","type":"book-chapter","created":{"date-parts":[[2016,3,12]],"date-time":"2016-03-12T08:19:52Z","timestamp":1457770792000},"page":"325-343","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards a $$\\mathbb {K}$$ool Future"],"prefix":"10.1007","author":[{"given":"Dorel","family":"Lucanu","sequence":"first","affiliation":[]},{"given":"Traian-Florin","family":"\u015eerb\u0103nu\u0163\u0103","sequence":"additional","affiliation":[]},{"given":"Grigore","family":"Ro\u015fu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,13]]},"reference":[{"issue":"7","key":"22_CR1","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.jlap.2009.01.001","volume":"78","author":"E \u00c1brah\u00e1m","year":"2009","unstructured":"\u00c1brah\u00e1m, E., Grabe, I., Gr\u00fcner, A., Steffen, M.: Behavioral interface description of an object-oriented language with futures and promises. J. Logic Algebraic Program. 78(7), 491\u2013518 (2009)","journal-title":"J. Logic Algebraic Program."},{"key":"22_CR2","unstructured":"Arusoaie, A., Lucanu, D., Rusu, V.: A generic framework for symbolic execution: theory and applications. Research Report RR-8189, Inria, September 2015"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-71316-6_22","volume-title":"Programming Languages and Systems","author":"FS de Boer","year":"2007","unstructured":"de Boer, F.S., Clarke, D., Johnsen, E.B.: A complete guide to the future. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 316\u2013330. Springer, Heidelberg (2007)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Bogd\u0103na\u015f, D., Ro\u015fu, G.: K-Java: a complete semantics of Java. In: Proceedings of the 42nd Symposium on Principles of Programming Languages (POPL 2015), pp. 445\u2013456. ACM, January 2015","DOI":"10.1145\/2676726.2676982"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Caromel, D., Henrio, L., Serpette, B.P.: Asynchronous and deterministic objects. In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL, 14\u201316 January 2004, Venice, Italy, pp. 123\u2013134. ACM (2004)","DOI":"10.1145\/964001.964012"},{"issue":"4","key":"22_CR6","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/j.ic.2008.12.004","volume":"207","author":"D Caromel","year":"2009","unstructured":"Caromel, D., Henrio, L., Serpette, B.P.: Asynchronous sequential processes. Inf. Comput. 207(4), 459\u2013495 (2009)","journal-title":"Inf. Comput."},{"key":"22_CR7","unstructured":"Danvy, O., Nielsen, L.R.: Refocusing in reduction semantics. RS RS-04-26, BRICS, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, November 2004. This report supersedes BRICS report RS-02-04. A preliminary version appears in the informal proceedings of the Second International Workshop on Rule-Based Programming, RULE 2001, Electronic Notes in Theoretical Computer Science, vol. 59.4 (2001)"},{"issue":"5\u20136","key":"22_CR8","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.jlamp.2014.03.003","volume":"83","author":"CC Din","year":"2014","unstructured":"Din, C.C., Owe, O.: A sound and complete reasoning system for asynchronous communication with shared futures. J. Logical Algebraic Meth. Program. 83(5\u20136), 360\u2013383 (2014)","journal-title":"J. Logical Algebraic Meth. Program."},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Ellison, C., Ro\u015fu, G.: An executable formal semantics of C with applications. In: Proceedings of the 39th Symposium on Principles of Programming Languages (POPL 2012), pp. 533\u2013544. ACM (2012)","DOI":"10.1145\/2103656.2103719"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/978-3-662-44202-9_23","volume-title":"ECOOP 2014 \u2013 Object-Oriented Programming","author":"D Filaretti","year":"2014","unstructured":"Filaretti, D., Maffeis, S.: An executable formal semantics of PHP. In: Jones, R. (ed.) ECOOP 2014. LNCS, vol. 8586, pp. 567\u2013592. Springer, Heidelberg (2014)"},{"key":"22_CR11","volume-title":"Essentials of Programming Languages","author":"DP Friedman","year":"2001","unstructured":"Friedman, D.P., Wand, M., Haynes, C.T.: Essentials of Programming Languages, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"issue":"1","key":"22_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.entcs.2010.07.004","volume":"264","author":"L Henrio","year":"2010","unstructured":"Henrio, L., Khan, M.U.: Asynchronous components with futures: semantics and proofs in Isabelle\/HOL. Electron. Notes Theor. Comput. Sci. 264(1), 35\u201353 (2010)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1\u20132","key":"22_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2006.07.031","volume":"365","author":"EB Johnsen","year":"2006","unstructured":"Johnsen, E.B., Owe, O., Yu, I.C.: Creol: a type-safe object-oriented model for distributed concurrent systems. Theor. Comput. Sci. 365(1\u20132), 23\u201366 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"22_CR14","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/4472.4478","volume":"7","author":"RH Halstead Jr","year":"1985","unstructured":"Halstead Jr., R.H.: MULTILISP: a language for concurrent symbolic computation. ACM Trans. Program. Lang. Syst. 7(4), 501\u2013538 (1985)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Park, D., \u015etef\u0103nescu, A., Ro\u015fu, G.: KJS: a complete formal semantics of JavaScript. In: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2015), pp. 346\u2013356. ACM, June 2015","DOI":"10.1145\/2737924.2737991"},{"key":"22_CR16","unstructured":"Ro\u015fu, G.: Matching logic \u2013 extended abstract. In: Proceedings of the 26th International Conference on Rewriting Techniques and Applications (RTA 2015). Leibniz International Proceedings in Informatics (LIPIcs), vol. 36, pp. 5\u201321. Dagstuhl, Germany, July 2015"},{"key":"22_CR17","unstructured":"Ro\u015fu, G., \u015eerb\u0103nu\u0163\u0103, T.: Kool - typed - dynamic. K Tutorial. http:\/\/www.kframework.org\/index.php\/K_Tutorial, https:\/\/github.com\/kframework\/k\/tree\/master\/k-distribution\/tutorial"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/978-3-642-32759-9_32","volume-title":"FM 2012: Formal Methods","author":"G Ro\u015fu","year":"2012","unstructured":"Ro\u015fu, G., \u015etef\u0103nescu, A.: From hoare logic to matching logic reachability. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 387\u2013402. Springer, Heidelberg (2012)"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Ro\u015fu, G., \u015etef\u0103nescu, A., Ciob\u00e2c\u0103, \u015e., Moore, B.M.: One-path reachability logic. In: Proceedings of the 28th Symposium on Logic in Computer Science (LICS 2013), pp. 358\u2013367. IEEE, June 2013","DOI":"10.1109\/LICS.2013.42"},{"issue":"6","key":"22_CR20","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)","journal-title":"J. Logic Algebraic Program."},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Ro\u015fu, G., \u015etef\u0103nescu, A.: Checking reachability using matching logic. In: OOPSLA, pp. 555\u2013574. ACM, Also available as technical report (2012). http:\/\/hdl.handle.net\/2142\/33771","DOI":"10.1145\/2398857.2384656"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/978-3-319-08918-8_29","volume-title":"Rewriting and Typed Lambda Calculi","author":"A \u015etef\u0103nescu","year":"2014","unstructured":"\u015etef\u0103nescu, A., Ciob\u00e2c\u0103, \u015e., Mereuta, R., Moore, B.M., \u015eerb\u0103nut\u0103, T.F., Ro\u015fu, G.: All-path reachability logic. In: Dowek, G. (ed.) RTA-TLCA 2014. LNCS, vol. 8560, pp. 425\u2013440. Springer, Heidelberg (2014)"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Welc, A., Jagannathan, S., Hosking, A.L.: Safe futures for Java. In: Proceedings of the 20th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA, 16\u201320 October 2005, San Diego, CA, USA, pp. 439\u2013453. ACM (2005)","DOI":"10.1145\/1094811.1094845"},{"key":"22_CR24","volume-title":"An Introduction to MultiAgent Systems","author":"M Wooldridge","year":"2009","unstructured":"Wooldridge, M.: An Introduction to MultiAgent Systems, 2nd edn. Wiley, New York (2009)","edition":"2"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Yonezawa, A., Shibayama, E., Takada, T., Honda, Y.: Object-oriented concurrent programming-modelling and programming in an object-oriented concurrent language, ABCL\/1. In: Object-oriented Concurrent Programming, pp. 55\u201389 (1987)","DOI":"10.1145\/28697.28722"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30734-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T12:24:26Z","timestamp":1720787066000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-30734-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319307336","9783319307343"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30734-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"13 March 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}