{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T04:05:21Z","timestamp":1748664321424,"version":"3.41.0"},"publisher-location":"Cham","reference-count":76,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319231648"},{"type":"electronic","value":"9783319231655"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-23165-5_28","type":"book-chapter","created":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T03:57:43Z","timestamp":1440561463000},"page":"598-616","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["From Rewriting Logic, to Programming Language Semantics, to Program Verification"],"prefix":"10.1007","author":[{"given":"Grigore","family":"Ro\u0219u","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,27]]},"reference":[{"key":"28_CR1","unstructured":"ISO\/IEC: Programming languages\u2013C, ISO\/IEC WG14, ISO 9899:2011, December 2011. http:\/\/www.open-std.org\/JTC1\/SC22\/WG14\/www\/standards"},{"key":"28_CR2","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., Dahlweid, M., Hillebrand, M., Leinenbach, D., Moskal, M., Santen, T., Schulte, W., Tobies, S.: 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)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-33826-7_16","volume-title":"Software Engineering and Formal Methods","author":"P Cuoq","year":"2012","unstructured":"Cuoq, P., Kirchner, F., Kosmatov, N., Prevosto, V., Signoles, J., Yakobowski, B.: Frama-C. In: Eleftherakis, G., Hinchey, M., Holcombe, M. (eds.) SEFM 2012. LNCS, vol. 7504, pp. 233\u2013247. Springer, Heidelberg (2012)"},{"issue":"1","key":"28_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditioned rewriting logic as a united model of concurrency. Theoret. Comput. Sci. 96(1), 73\u2013155 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR5","unstructured":"Verdejo, A., Mart\u00ed-Oliet, N.: Executable structural operational semantics in Maude. Departamento de Sistemas Inform\u00e0ticos y Programaci\u00f2n, Universidad Complutense de Madrid. Technical report 134-03 (2003)"},{"issue":"1\u20132","key":"28_CR6","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.jlap.2005.09.008","volume":"67","author":"A Verdejo","year":"2006","unstructured":"Verdejo, A., Mart\u00ed-Oliet, N.: Executable structural operational semantics in Maude. J. Logic Algebraic Program. 67(1\u20132), 226\u2013293 (2006)","journal-title":"J. Logic Algebraic Program."},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"All About Maude - A High-Performance Logical Framework","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C. (eds.): All About Maude. LNCS, vol. 4350. Springer, Heidelberg (2007)"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/BFb0039592","volume-title":"STACS 87","author":"G Kahn","year":"1987","unstructured":"Kahn, G.: Natural semantics. In: Brandenburg, F.J., Wirsing, M., Vidal-Naquet, G. (eds.) STACS 1987. LNCS, vol. 247, pp. 22\u201339. Springer, Heidelberg (1987)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. University of Aarhus, Technical report. DAIMI FN-19 (1981) republished in Journal of Logic and Algebraic Programming, 60\u201361 (2004)","DOI":"10.1016\/j.jlap.2004.03.009"},{"key":"28_CR10","first-page":"17","volume":"60\u201361","author":"GD Plotkin","year":"2004","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. J. Logic Algebraic Program. 60\u201361, 17\u2013139 (2004)","journal-title":"J. Logic Algebraic Program."},{"issue":"2","key":"28_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.ic.2008.03.026","volume":"207","author":"T-F \u015eerb\u0103nu\u0163\u0103","year":"2009","unstructured":"\u015eerb\u0103nu\u0163\u0103, T.-F., Ro\u015fu, G., Meseguer, J.: A rewriting logic approach to operational semantics. Inf. Comput. 207(2), 305\u2013340 (2009)","journal-title":"Inf. Comput."},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Berry, G., Boudol, G.: The chemical abstract machine. In: POPL, pp. 81\u201394 (1990)","DOI":"10.1145\/96709.96717"},{"issue":"1","key":"28_CR13","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","volume":"96","author":"G Berry","year":"1992","unstructured":"Berry, G., Boudol, G.: The chemical abstract machine. Theoret. Comput. Sci. 96(1), 217\u2013248 (1992)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"28_CR14","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","volume":"103","author":"M Felleisen","year":"1992","unstructured":"Felleisen, M., Hieb, R.: The revised report on the syntactic theories of sequential control and state. Theoret. Comput. Sci. 103(2), 235\u2013271 (1992)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"28_CR15","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/inco.1994.1093","volume":"115","author":"AK Wright","year":"1994","unstructured":"Wright, A.K., Felleisen, M.: A syntactic approach to type soundness. Inf. Comput. 115(1), 38\u201394 (1994)","journal-title":"Inf. Comput."},{"key":"28_CR16","volume-title":"The Semantics of Programming Languages: An Elementary Introduction using Structural Operational Semantics","author":"M Hennessy","year":"1990","unstructured":"Hennessy, M.: The Semantics of Programming Languages: An Elementary Introduction using Structural Operational Semantics. Wiley, New York (1990)"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/3-540-48340-3_7","volume-title":"Mathematical Foundations of Computer Science 1999","author":"PD Mosses","year":"1999","unstructured":"Mosses, P.D.: Foundations of modular SOS. In: Kuty\u0142owski, M., Wierzbicki, T.M., Pacholski, L. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 70\u201380. Springer, Heidelberg (1999)"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-45719-4_3","volume-title":"Algebraic Methodology and Software Technology","author":"PD Mosses","year":"2002","unstructured":"Mosses, P.D.: Pragmatics of modular SOS. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol. 2422, pp. 21\u201340. Springer, Heidelberg (2002)"},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.jlap.2004.03.008","volume":"60\u201361","author":"PD Mosses","year":"2004","unstructured":"Mosses, P.D.: Modular structural operational semantics. J. Logic Algebraic Program. 60\u201361, 195\u2013228 (2004)","journal-title":"J. Logic Algebraic Program."},{"key":"28_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-540-27815-3_29","volume-title":"Algebraic Methodology and Software Technology","author":"J Meseguer","year":"2004","unstructured":"Meseguer, J., Braga, C.O.: Modular rewriting semantics of programming languages. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 364\u2013378. Springer, Heidelberg (2004)"},{"key":"28_CR21","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.entcs.2004.06.019","volume":"117","author":"C Braga","year":"2005","unstructured":"Braga, C., Meseguer, J.: Modular rewriting semantics in practice. Electron. Notes Theor. Comput. Sci. 117, 393\u2013416 (2005)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Chalub, F., Braga, C.: Maude MSOS tool. In: Denker, G., Talcott, C. (eds.) Proceedings of the Sixth International Workshop on Rewriting Logic and its Applications (WRLA 2006). Electronic Notes in Theoretical Computer Science, vol. 176(4), pp. 133\u2013146 (2007)","DOI":"10.1016\/j.entcs.2007.06.012"},{"issue":"6","key":"28_CR23","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":"28_CR24","doi-asserted-by":"crossref","unstructured":"Ellison, C., Ro\u015fu, G.: An executable formal semantics of C with applications. In: POPL, pp. 533\u2013544 (2012)","DOI":"10.1145\/2103621.2103719"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Hathhorn, C., Ellison, C., Ro\u015fu, G.: Defining the undefinedness of C. In: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2015). ACM (2015)","DOI":"10.1145\/2737924.2737979"},{"key":"28_CR26","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":"28_CR27","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). ACM (2015)","DOI":"10.1145\/2737924.2737991"},{"key":"28_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-19718-5_1","volume-title":"Programming Languages and Systems","author":"AW Appel","year":"2011","unstructured":"Appel, A.W.: Verified software toolchain. In: Barthe, G. (ed.) ESOP 2011. LNCS, vol. 6602, pp. 1\u201317. Springer, Heidelberg (2011)"},{"key":"28_CR29","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":"28_CR30","doi-asserted-by":"crossref","unstructured":"Ro\u015fu, G., \u015etef\u0103nescu, A., Ciob\u00e2c\u0103, S., Moore, B.M.: One-path reachability logic. In: LICS 2013. IEEE (2013)","DOI":"10.1109\/LICS.2013.42"},{"key":"28_CR31","doi-asserted-by":"crossref","unstructured":"Ro\u015fu, G., \u015etef\u0103nescu, A.: Checking reachability using matching logic. In: Proceedings of the 27th Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA 2012), pp. 555\u2013574. ACM (2012)","DOI":"10.1145\/2384616.2384656"},{"key":"28_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/978-3-642-31585-5_33","volume-title":"Automata, Languages, and Programming","author":"G Ro\u015fu","year":"2012","unstructured":"Ro\u015fu, G., \u015etef\u0103nescu, A.: Towards a unified theory of operational and axiomatic semantics. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol. 7392, pp. 351\u2013363. Springer, Heidelberg (2012)"},{"key":"28_CR33","unstructured":"Ro\u015fu, G.: Matching logic \u2013 extended abstract. In: Proceedings of the 26th International Conference on Rewriting Techniques and Applications (RTA 2015). LNCS. Springer, Heidelberg (2015, to appear)"},{"key":"28_CR34","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":"28_CR35","doi-asserted-by":"crossref","unstructured":"Ro\u015fu, G., \u015etef\u0103nescu, A.: Matching logic: a new program verification approach. In: ICSE (NIER track), pp. 868\u2013871 (2011)","DOI":"10.1145\/1985793.1985928"},{"key":"28_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-17796-5_9","volume-title":"Algebraic Methodology and Software Technology","author":"G Ro\u015fu","year":"2011","unstructured":"Ro\u015fu, G., Ellison, C., Schulte, W.: Matching logic: an alternative to Hoare\/Floyd logic. In: Johnson, M., Pavlovic, D. (eds.) AMAST 2010. LNCS, vol. 6486, pp. 142\u2013162. Springer, Heidelberg (2011)"},{"key":"28_CR37","unstructured":"Ro\u015fu, G., \u015etef\u0103nescu, A.: Matching logic rewriting: unifying operational and axiomatic semantics in a practical and generic framework. University of Illinois, Technical report, November 2011. http:\/\/hdl.handle.net\/2142\/28357"},{"key":"28_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008)"},{"key":"28_CR39","unstructured":"Ro\u015fu, G.: CS322, Fall 2003 - Programming language design: Lecture notes. University of Illinois at Urbana-Champaign, Department of Computer Science, Technical report. UIUCDCS-R-2003-2897, December 2003, lecture notes of a course taught at UIUC"},{"key":"28_CR40","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-25984-8_1","volume-title":"Automated Reasoning","author":"J Meseguer","year":"2004","unstructured":"Meseguer, J., Ro\u015fu, G.: Rewriting logic semantics: from language specifications to formal analysis tools. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 1\u201344. Springer, Heidelberg (2004)"},{"key":"28_CR41","unstructured":"Guth, D.: A formal semantics of Python 3.3. Master\u2019s thesis, University of Illinois at Urbana-Champaign, July 2013. https:\/\/github.com\/kframework\/python-semantics"},{"key":"28_CR42","unstructured":"Meredith, P., Hills, M., Ro\u015fu, G.: An executable rewriting logic semantics of K-scheme. In: Dube, D. (ed.) Proceedings of the 2007 Workshop on Scheme and Functional Programming (SCHEME 2007), Technical report DIUL-RT-0701. Laval University, pp. 91\u2013103 (2007)"},{"key":"28_CR43","unstructured":"Lazar, D.: K definition of Haskell\u201998 (2012). https:\/\/github.com\/davidlazar\/haskell-semantics"},{"key":"28_CR44","doi-asserted-by":"crossref","unstructured":"Gligoric, M., Marinov, D., Kamin, S.: CoDeSe: fast deserialization via code generation. In: Dwyer, M.B., Tip, F. (eds.) ISSTA, pp. 298\u2013308. ACM (2011)","DOI":"10.1145\/2001420.2001456"},{"key":"28_CR45","doi-asserted-by":"crossref","unstructured":"As\u0103voae, M.: K semantics for assembly languages: a case study. In: Hills, M. (ed.) K\u201911. Electronic Notes in Theoretical Computer Science, vol. 304, pp. 111\u2013125 (2014)","DOI":"10.1016\/j.entcs.2014.05.006"},{"key":"28_CR46","unstructured":"As\u0103voae, M.: A K-based methodology for modular design of embedded systems. In: WADT (preliminary proceedings). TR-08\/12, Universidad Complutense de Madrid, p. 16 (2012). http:\/\/maude.sip.ucm.es\/wadt2012\/docs\/WADT2012-preproceedings.pdf"},{"key":"28_CR47","unstructured":"Ellison, C., Lazar, D.: K definition of the LLVM assembly language (2012). https:\/\/github.com\/davidlazar\/llvm-semantics"},{"key":"28_CR48","doi-asserted-by":"crossref","unstructured":"Meredith, P.O., Katelman, M., Meseguer, J., Ro\u015fu, G.: A formal executable semantics of Verilog. In: Eighth ACM\/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010), pp. 179\u2013188. IEEE (2010)","DOI":"10.1109\/MEMCOD.2010.5558634"},{"key":"28_CR49","doi-asserted-by":"crossref","unstructured":"Hills, M., Chen, F., Ro\u015fu, G.: A rewriting logic approach to static checking of units of measurement in C. In: Kniesel, G., Pinto, J.S. (eds.) RULE 2008. Electronic Notes in Theoretical Computer Science, vol. 290, pp. 51\u201367. Elsevier (2012)","DOI":"10.1016\/j.entcs.2012.11.011"},{"key":"28_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-31762-0_14","volume-title":"Formal Verification of Object-Oriented Software","author":"V Rusu","year":"2012","unstructured":"Rusu, V., Lucanu, D.: A $$\\mathbb{K}$$-based formal framework for domain-specific modelling languages. In: Beckert, B., Damiani, F., Gurov, D. (eds.) FoVeOOS 2011. LNCS, vol. 7421, pp. 214\u2013231. Springer, Heidelberg (2012)"},{"key":"28_CR51","doi-asserted-by":"crossref","unstructured":"Arusoaie, A., Lucanu, D., Rusu, V.: Towards a K semantics for OCL. In: Hills, M. (ed.) K\u201911. Electronic Notes in Theoretical Computer Science, vol. 304, pp. 81\u201396 (2014)","DOI":"10.1016\/j.entcs.2014.05.004"},{"key":"28_CR52","doi-asserted-by":"crossref","unstructured":"Heumann, S., Adve, V.S., Wang, S.: The tasks with effects model for safe concurrency. In: Nicolau, A., Shen, X., Amarasinghe, S.P., Vuduc, R. (eds.) PPOPP, pp. 239\u2013250. ACM (2013)","DOI":"10.1145\/2517327.2442540"},{"key":"28_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-30829-1_7","volume-title":"Coordination Models and Languages","author":"P Dinges","year":"2012","unstructured":"Dinges, P., Agha, G.: Scoped synchronization constraints for large scale actor systems. In: Sirjani, M. (ed.) COORDINATION 2012. LNCS, vol. 7274, pp. 89\u2013103. Springer, Heidelberg (2012)"},{"key":"28_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-540-95885-7_26","volume-title":"Membrane Computing","author":"T-F \u015eerb\u0103nu\u0163\u0103","year":"2009","unstructured":"\u015eerb\u0103nu\u0163\u0103, T.-F., \u015etef\u0103nescu, G., Ro\u015fu, G.: Defining and executing P systems with structured data in K. In: Corne, D.W., Frisco, P., P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2008. LNCS, vol. 5391, pp. 374\u2013393. Springer, Heidelberg (2009)"},{"issue":"6","key":"28_CR55","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.jlap.2010.03.006","volume":"79","author":"C Chira","year":"2010","unstructured":"Chira, C., \u015eerb\u0103nu\u0163\u0103, T.-F., \u015etef\u0103nescu, G.: P systems with control nuclei: the concept. J. Logic Algebraic Program. 79(6), 326\u2013333 (2010)","journal-title":"J. Logic Algebraic Program."},{"key":"28_CR56","unstructured":"\u015eerb\u0103nu\u0163\u0103, T.-F.: A rewriting approach to concurrent programming language design and semantics. Ph.D. dissertation, University of Illinois at Urbana-Champaign, December 2010. https:\/\/www.ideals.illinois.edu\/handle\/2142\/18252"},{"key":"28_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-03429-9_10","volume-title":"Recent Trends in Algebraic Development Techniques","author":"C Ellison","year":"2009","unstructured":"Ellison, C., \u015eerb\u0103nu\u0163\u0103, T.-F., Ro\u015fu, G.: A rewriting logic approach to type inference. In: Corradini, A., Montanari, U. (eds.) WADT 2008. LNCS, vol. 5486, pp. 135\u2013151. Springer, Heidelberg (2009)"},{"key":"28_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-16310-4_9","volume-title":"Rewriting Logic and Its Applications","author":"IM As\u0103voae","year":"2010","unstructured":"As\u0103voae, I.M., As\u0103voae, M.: Collecting semantics under predicate abstraction in the K framework. In: \u00d6lveczky, P.C. (ed.) WRLA 2010. LNCS, vol. 6381, pp. 123\u2013139. Springer, Heidelberg (2010)"},{"key":"28_CR59","unstructured":"As\u0103voae, I.M.: Systematic design of abstractions in K. In: WADT (preliminary proceedings), TR-08\/12, Universidad Complutense de Madrid, p. 9 (2012). http:\/\/maude.sip.ucm.es\/wadt2012\/docs\/WADT2012-preproceedings.pdf"},{"key":"28_CR60","doi-asserted-by":"crossref","unstructured":"Rot, J., As\u0103voae, I.M., de Boer, F.S., Bonsangue, M.M., Lucanu, D.: Interacting via the heap in the presence of recursion. In: Carbone, M., Lanese, I., Silva, A., Sokolova, A. (eds.) ICE. Electronic Proceedings in Theoretical Computer Science, vol. 104, pp. 99\u2013113 (2012)","DOI":"10.4204\/EPTCS.104.9"},{"key":"28_CR61","doi-asserted-by":"crossref","unstructured":"As\u0103voae, I.M., As\u0103voae, M., Lucanu, D.: Path directed symbolic execution in the K framework. In: Ida, T., Negru, V., Jebelean, T., Petcu, D., Watt, S.M., Zaharie, D. (eds.) SYNASC, pp. 133\u2013141. IEEE Computer Society (2010)","DOI":"10.1109\/SYNASC.2010.78"},{"key":"28_CR62","doi-asserted-by":"crossref","unstructured":"As\u0103voae, I.M.: Abstract semantics for alias analysis in K. In: Hills, M. (ed.) K\u201911. Electronic Notes in Theoretical Computer Science, vol. 304, pp. 97\u2013110 (2014)","DOI":"10.1016\/j.entcs.2014.05.005"},{"key":"28_CR63","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-319-02654-1_16","volume-title":"Software Language Engineering","author":"A Arusoaie","year":"2013","unstructured":"Arusoaie, A., Lucanu, D., Rusu, V.: A generic framework for symbolic execution. In: Erwig, M., Paige, R.F., Van Wyk, E. (eds.) SLE 2013. LNCS, vol. 8225, pp. 281\u2013301. Springer, Heidelberg (2013)"},{"key":"28_CR64","unstructured":"Arusoaie, A.: A generic framework for symbolic execution: theory and applications. Ph.D. dissertation, Faculty of Computer Science, Alexandru I. Cuza, University of Iasi, September 2014. https:\/\/fmse.info.uaic.ro\/publications\/193\/"},{"key":"28_CR65","unstructured":"As\u0103voae, M., Lucanu, D., Ro\u015fu, G.: Towards semantics-based WCET analysis. In: Healy, C. (ed.) WCET. Austian Computer Society (OCG) (2011)"},{"key":"28_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-32495-6_6","volume-title":"Foundational and Practical Aspects of Resource Analysis","author":"M As\u0103voae","year":"2012","unstructured":"As\u0103voae, M., As\u0103voae, I.M., Lucanu, D.: On abstractions for timing analysis in the $$\\mathbb{K}$$ framework. In: Pe\u00f1a, R., van Eekelen, M., Shkaravska, O. (eds.) FOPARA 2011. LNCS, vol. 7177, pp. 90\u2013107. Springer, Heidelberg (2012). http:\/\/dx.doi.org\/10.1007\/978-3-642-32495-6_6"},{"key":"28_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-319-12466-7_2","volume-title":"Foundational and Practical Aspects of Resource Analysis","author":"M As\u01cevoae","year":"2014","unstructured":"As\u01cevoae, M., As\u01cevoae, I.M.: On the modular integration of abstract semantics for WCET analysis. In: Lago, U.D., Pe\u00f1a, R. (eds.) FOPARA 2013. LNCS, vol. 8552, pp. 19\u201337. Springer, Heidelberg (2014). http:\/\/dx.doi.org\/10.1007\/978-3-319-12466-7_2"},{"key":"28_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-642-38613-8_25","volume-title":"Integrated Formal Methods","author":"D Lucanu","year":"2013","unstructured":"Lucanu, D., Rusu, V.: Program equivalence by circular reasoning. In: Johnsen, E.B., Petre, L. (eds.) IFM 2013. LNCS, vol. 7940, pp. 362\u2013377. Springer, Heidelberg (2013). https:\/\/hal.inria.fr\/hal-01065830"},{"key":"28_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-3-319-11737-9_6","volume-title":"Formal Methods and Software Engineering","author":"\u015e Ciob\u00e2c\u0103","year":"2014","unstructured":"Ciob\u00e2c\u0103, \u015e., Lucanu, D., Rusu, V., Ro\u015fu, G.: A language-independent proof system for mutual program equivalence. In: Merz, S., Pang, J. (eds.) ICFEM 2014. LNCS, vol. 8829, pp. 75\u201390. Springer, Heidelberg (2014). https:\/\/hal.inria.fr\/hal-01030754"},{"key":"28_CR70","doi-asserted-by":"crossref","unstructured":"Ciob\u00e2c\u0103, S., Lucanu, D., Rusu, V., Ro\u015fu, G.: A theoretical foundation for programming languages aggregation. In: 22nd International Workshop on Algebraic Development Techniques. LNCS, Sinaia, Romania. Spriger, Heidelberg, September 2014 (to appear). https:\/\/hal.inria.fr\/hal-01076641","DOI":"10.1007\/978-3-319-28114-8_3"},{"key":"28_CR71","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-04694-0_10","volume-title":"Runtime Verification","author":"G Ro\u015fu","year":"2009","unstructured":"Ro\u015fu, G., Schulte, W., \u015eerb\u0103nu\u0163\u0103, T.F.: Runtime verification of C memory safety. In: Bensalem, S., Peled, D.A. (eds.) RV 2009. LNCS, vol. 5779, pp. 132\u2013151. Springer, Heidelberg (2009)"},{"key":"28_CR72","doi-asserted-by":"crossref","unstructured":"Regehr, J., Chen, Y., Cuoq, P., Eide, E., Ellison, C., Yang, X.: Test-case reduction for C compiler bugs. In: Vitek, J., Lin, H., Tip, F. (eds.) PLDI, pp. 335\u2013346. ACM (2012)","DOI":"10.1145\/2345156.2254104"},{"key":"28_CR73","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-319-12904-4_5","volume-title":"Rewriting Logic and Its Applications","author":"A Arusoaie","year":"2014","unstructured":"Arusoaie, A., Lucanu, D., Rusu, V., \u015eerb\u0103nu\u0163\u0103, T.-F., \u015etef\u0103nescu, A., Ro\u015fu, G.: Language definitions as rewrite theories. In: Escobar, S. (ed.) WRLA 2014. LNCS, vol. 8663, pp. 97\u2013112. Springer, Heidelberg (2014). https:\/\/hal.inria.fr\/hal-00950775"},{"key":"28_CR74","doi-asserted-by":"crossref","unstructured":"Chiri\u0163\u0103, C.E., \u015eerb\u0103nu\u0163\u0103, T.-F.: An institutional foundation for the K semantic framework. In: 22nd International Workshop on Algebraic Development Techniques (WADT 2014). LNCS (2014, to appear)","DOI":"10.1007\/978-3-319-28114-8_2"},{"key":"28_CR75","unstructured":"Feli\u00fa, M.A.: Logic-based techniques for program analysis and specification synthesis. Ph.D. dissertation, Universitat Polit\u00e8cnica de Val\u00e8ncia, Departamento de Sistemas Inform\u00e1ticos y Computaci\u00f3n, September 2013"},{"key":"28_CR76","doi-asserted-by":"crossref","unstructured":"Alpuente, M., Feli\u00fa, M.A., Villanueva, A.: Automatic inference of specifications using matching logic. In: Proceedings of the ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation, PEPM 2013, Rome, Italy, 21\u201322 January 2013, pp. 127\u2013136. ACM (2013)","DOI":"10.1145\/2426890.2426914"}],"container-title":["Lecture Notes in Computer Science","Logic, Rewriting, and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23165-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T04:40:09Z","timestamp":1748580009000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23165-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319231648","9783319231655"],"references-count":76,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23165-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}