{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:02:12Z","timestamp":1762459332342,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319281131"},{"type":"electronic","value":"9783319281148"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-28114-8_3","type":"book-chapter","created":{"date-parts":[[2015,12,29]],"date-time":"2015-12-29T12:57:37Z","timestamp":1451393857000},"page":"30-47","source":"Crossref","is-referenced-by-count":2,"title":["A Theoretical Foundation for Programming Languages Aggregation"],"prefix":"10.1007","author":[{"given":"\u015etefan","family":"Ciob\u00e2c\u0103","sequence":"first","affiliation":[]},{"given":"Dorel","family":"Lucanu","sequence":"additional","affiliation":[]},{"given":"Vlad","family":"Rusu","sequence":"additional","affiliation":[]},{"given":"Grigore","family":"Ro\u015fu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,30]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.entcs.2009.07.013","volume":"246","author":"M Alpuente","year":"2009","unstructured":"Alpuente, M., Escobar, S., Meseguer, J., Ojeda, P.: Order-sorted generalization. Electr. Notes Theor. Comput. Sci. 246, 27\u201338 (2009)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Chiri\u0163\u0103, C.E.: An institutional foundation for the k semantic framework. Master\u2019s thesis, University of Bucharest (2014)","DOI":"10.1007\/978-3-319-28114-8_2"},{"key":"3_CR3","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 Recent Trends in Algebraic Development Techniques, WADT 2014 (in press)","DOI":"10.1007\/978-3-319-28114-8_2"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Ciob\u00e2c\u0103, \u015e.: Reducing partial equivalence to partial correctness. In: 2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp. 164\u2013171, September 2014","DOI":"10.1109\/SYNASC.2014.30"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Ciob\u00e2c\u0103, \u015e., Lucanu, D., Rusu, V., Ro\u015fu, G.: A language-independent proof system for mutual program equivalence. Technical report 14\u201301, Al. I. Cuza University (2014)","DOI":"10.1007\/978-3-319-11737-9_6"},{"key":"3_CR6","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)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"All About Maude, A High-Performance Logical Framework","author":"M Clavel","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.L.: All About Maude, A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)"},{"key":"3_CR8","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":"3_CR9","volume-title":"Institution-Independent Model Theory","author":"R Diaconescu","year":"2008","unstructured":"Diaconescu, R.: Institution-Independent Model Theory. Birkhauser, Basel (2008)"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/BFb0014312","volume-title":"Algebraic Methodology and Software Technology","author":"AE Haxthausen","year":"1996","unstructured":"Haxthausen, A.E., Nickl, F.: Pushouts of order-sorted algebraic specifications. In: Nivat, M., Wirsing, M. (eds.) AMAST 1996. LNCS, vol. 1101, pp. 132\u2013147. Springer, Heidelberg (1996)"},{"key":"3_CR11","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":"3_CR12","unstructured":"Ro\u015fu, G.: Matching logic: a logic for structural reasoning. Technical report, University of Illinois, January 2014. http:\/\/hdl.handle.net\/2142\/47004"},{"key":"3_CR13","unstructured":"Ro\u015fu, G.: Matching logic (invited talk). In: 26th International Conference on Rewriting Techniques and Applications, RTA 2015, 29 June - 1 July, Warsaw, Poland (2015, to appear)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Ro\u015fu, G., \u015etefanescu, A., \u015etefan Ciob\u00e2c\u0103, Moore, B.M.: One-path reachability logic. In: 28th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2013, 25\u201328 June 2013, New Orleans, LA, USA, pp. 358\u2013367 (2013). http:\/\/dx.doi.org\/10.1109\/LICS.2013.42","DOI":"10.1109\/LICS.2013.42"},{"issue":"6","key":"3_CR15","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. Log. Algebr. Program. 79(6), 397\u2013434 (2010)","journal-title":"J. Log. Algebr. Program."},{"key":"3_CR16","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17336-3","volume-title":"Foundations of Algebraic Specification and Formal Software Development","author":"D Sannella","year":"2012","unstructured":"Sannella, D., Tarlecki, A.: Foundations of Algebraic Specification and Formal Software Development. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2012). http:\/\/dx.doi.org\/10.1007\/978-3-642-17336-3"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.tcs.2004.09.037","volume":"331","author":"L Schr\u00f6der","year":"2005","unstructured":"Schr\u00f6der, L., Mossakowski, T., Tarlecki, A., Hoffman, P., Klin, B.: Amalgamation in the semantics of CASL. Theoret. Comput. Sci. 331(1), 215\u2013247 (2005). http:\/\/dx.doi.org\/10.1016\/j.tcs.2004.09.037","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.ic.2008.03.026","volume":"207","author":"TF \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":"3_CR19","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/CBO9780511526619.008","volume-title":"Semantics and Logics of Computation, Publications of the Newton Institute","author":"G Winskel","year":"1997","unstructured":"Winskel, G., Nielsen, M.: Categories in concurrency. In: Pitts, A.M., Dybjer, P. (eds.) Semantics and Logics of Computation, Publications of the Newton Institute, pp. 299\u2013354. Cambridge University Press, Cambridge (1997)"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Algebraic Development Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28114-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,13]],"date-time":"2020-09-13T09:23:55Z","timestamp":1599989035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28114-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319281131","9783319281148"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28114-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}