{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T10:36:20Z","timestamp":1726223780790},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031388279"},{"type":"electronic","value":"9783031388286"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-38828-6_7","type":"book-chapter","created":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T08:05:32Z","timestamp":1689753932000},"page":"108-126","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Testing Languages with a Languages-as-Databases Approach"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-0162-9997","authenticated-orcid":false,"given":"Matteo","family":"Cimini","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,20]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1040","volume":"111","author":"L Aceto","year":"1994","unstructured":"Aceto, L., Bloom, B., Vaandrager, F.: Turning SOS rules into equations. Inf. Comput. 111(1), 1\u201352 (1994). https:\/\/doi.org\/10.1006\/inco.1994.1040","journal-title":"Inf. Comput."},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-22944-2_27","volume-title":"Algebra and Coalgebra in Computer Science","author":"L Aceto","year":"2011","unstructured":"Aceto, L., Caltais, G., Goriac, E.-I., Ingolfsdottir, A.: PREG axiomatizer \u2013 a ground bisimilarity checker for GSOS with predicates. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol. 6859, pp. 378\u2013385. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22944-2_27"},{"issue":"28","key":"7_CR3","doi-asserted-by":"publisher","first-page":"3045","DOI":"10.1016\/j.tcs.2011.01.024","volume":"412","author":"L Aceto","year":"2011","unstructured":"Aceto, L., Cimini, M., Ing\u00f3lfsd\u00f3ttir, A., Mousavi, M.R., Reniers, M.A.: SOS rule formats for zero and unit elements. Theoret. Comput. Sci. 412(28), 3045\u20133071 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.01.024","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.07.036","volume":"458","author":"L Aceto","year":"2012","unstructured":"Aceto, L., Cimini, M., Ingolfsdottir, A., Mousavi, M., Reniers, M.A.: Rule formats for distributivity. Theoret. Comput. Sci. 458, 1\u201328 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.07.036","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Bach Poulsen, C., Rouvoet, A., Tolmach, A., Krebbers, R., Visser, E.: Intrinsically-typed definitional interpreters for imperative languages. Proc. ACM Program. Lang. (PACMPL) 2(POPL), 1\u201334 (2017). https:\/\/doi.org\/10.1145\/3158104","DOI":"10.1145\/3158104"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Baeten, J.C.M., Bergstra, J.A.: Process algebra with signals and conditions. In: Broy, M. (ed.) Programming and Mathematical Method, pp. 273\u2013323. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/978-3-642-77572-7_13","DOI":"10.1007\/978-3-642-77572-7_13"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.3233\/FI-1986-9202","volume":"9","author":"JCM Baeten","year":"1986","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Syntax and defining equations for an interrupt mechanism in process algebra. Fund. Inform. 9(2), 127\u2013167 (1986). https:\/\/doi.org\/10.3233\/FI-1986-9202","journal-title":"Fund. Inform."},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Berghofer, S., Nipkow, T.: Random testing in Isabelle\/HOL. In: Proceedings of the 2nd International Conference on Software Engineering and Formal Methods, pp. 230\u2013239, SEFM 2004. IEEE Computer Society, USA (2004). https:\/\/doi.org\/10.1109\/SEFM.2004.10049","DOI":"10.1109\/SEFM.2004.10049"},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J Bergstra","year":"1984","unstructured":"Bergstra, J., Klop, J.: Process algebra for synchronous communication. Inf. Control 60(1), 109\u2013137 (1984). https:\/\/doi.org\/10.1016\/S0019-9958(84)80025-X","journal-title":"Inf. Control"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation can\u2019t be traced. J. ACM 42(1), 232\u2013268 (1995). https:\/\/doi.org\/10.1145\/200836.200876","DOI":"10.1145\/200836.200876"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Cheney, J.: Toward a general theory of names: binding and scope. In: Proceedings of the 3rd ACM SIGPLAN Workshop on Mechanized Reasoning about Languages with Variable Binding, MERLIN 2005, pp. 33\u201340. Association for Computing Machinery, New York, NY, USA (2005). https:\/\/doi.org\/10.1145\/1088454.1088459","DOI":"10.1145\/1088454.1088459"},{"key":"7_CR12","unstructured":"Cimini, M.: Lang-SQL (2022). https:\/\/github.com\/mcimini\/lang-sql"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Cimini, M.: A query language for language analysis. In: Schlingloff, B.H., Chai, M. (eds.) Software Engineering and Formal Methods - 20th International Conference, SEFM 2022, Berlin, Germany, 26\u201330 September 2022, Proceedings, vol. 13550, pp. 57\u201373. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17108-6_4","DOI":"10.1007\/978-3-031-17108-6_4"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Cimini, M.: A declarative validator for GSOS languages. In: Proceedings of the 14th International Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software (PLACES 2023), vol. 378, pp. 14\u201325. Open Publishing Association (2023). https:\/\/doi.org\/10.4204\/EPTCS.378.2","DOI":"10.4204\/EPTCS.378.2"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Cimini, M., Miller, D., Siek, J.G.: Extrinsically typed operational semantics for functional languages. In: Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering, SLE 2020, Virtual Event, USA, 16\u201317 November 2020, pp. 108\u2013125 (2020). https:\/\/doi.org\/10.1145\/3426425.3426936","DOI":"10.1145\/3426425.3426936"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Cranen, S., Mousavi, M., Reniers, M.A.: A rule format for associativity. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008 - Concurrency Theory, pp. 447\u2013461. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85361-9_35","DOI":"10.1007\/978-3-540-85361-9_35"},{"key":"7_CR17","unstructured":"Felleisen, M., Findler, R.B., Flatt, M.: Semantics Engineering with PLT Redex, 1st edn. The MIT Press (2009)"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Fetscher, B., Claessen, K., Pa\u0142ka, M., Hughes, J., Findler, R.B.: Making random judgments: automatically generating well-typed terms from the definition of a type-system. In: Vitek, J. (ed.) European Symposium on Programming Languages and Systems (ESOP 2015), pp. 383\u2013405. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46669-8_16","DOI":"10.1007\/978-3-662-46669-8_16"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Grewe, S., Erdweg, S., Wittmann, P., Mezini, M.: Type systems for the masses: deriving soundness proofs and efficient checkers. In: 2015 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!), pp. 137\u2013150. Onward! 2015. ACM, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2814228.2814239","DOI":"10.1145\/2814228.2814239"},{"issue":"2","key":"7_CR20","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"JF Groote","year":"1992","unstructured":"Groote, J.F., Vaandrager, F.: Structured operational semantics and bisimulation as a congruence. Inf. Comput. 100(2), 202\u2013260 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90013-6","journal-title":"Inf. Comput."},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Hoare, C.A.R.: Communicating sequential processes. Commun. ACM 21(8), 666\u2013677 (1978). https:\/\/doi.org\/10.1145\/359576.359585","DOI":"10.1145\/359576.359585"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Kats, L.C., Vermaas, R., Visser, E.: Integrated language definition testing: enabling test-driven language development. In: Proceedings of the 2011 ACM International Conference on Object Oriented Programming Systems Languages and Applications, OOPSLA 2011, pp. 139\u2013154. Association for Computing Machinery, New York, NY, USA (2011). https:\/\/doi.org\/10.1145\/2048066.2048080","DOI":"10.1145\/2048066.2048080"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Klein, C., et al.: Run your research: on the effectiveness of lightweight mechanization. In: Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, pp. 285\u2013296. Association for Computing Machinery, New York, NY, USA (2012). https:\/\/doi.org\/10.1145\/2103656.2103691","DOI":"10.1145\/2103656.2103691"},{"key":"7_CR24","doi-asserted-by":"publisher","unstructured":"Milner, R. (ed.): A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3","DOI":"10.1007\/3-540-10235-3"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-030-38919-2_44","volume-title":"SOFSEM 2020: Theory and Practice of Computer Science","author":"B Mourad","year":"2020","unstructured":"Mourad, B., Cimini, M.: A calculus for language transformations. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020. LNCS, vol. 12011, pp. 547\u2013555. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38919-2_44"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-030-59025-3_12","volume-title":"Functional and Logic Programming","author":"B Mourad","year":"2020","unstructured":"Mourad, B., Cimini, M.: System description: Lang-n-Change - a tool for transforming languages. In: Nakano, K., Sagonas, K. (eds.) FLOPS 2020. LNCS, vol. 12073, pp. 198\u2013214. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59025-3_12"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"Mousavi, M.R., Reniers, M.A.: Prototyping SOS meta-theory in Maude. Electron. Notes Theoret. Comput. Sci. 156(1), 135\u2013150 (2006). https:\/\/doi.org\/10.1016\/j.entcs.2005.09.030, Proceedings of the Second Workshop on Structural Operational Semantics (SOS 2005)","DOI":"10.1016\/j.entcs.2005.09.030"},{"issue":"3","key":"7_CR28","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.tcs.2006.12.019","volume":"373","author":"MR Mousavi","year":"2007","unstructured":"Mousavi, M.R., Reniers, M.A., Groote, J.F.: SOS formats and meta-theory: 20 years after. Theoret. Comput. Sci. 373(3), 238\u2013272 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2006.12.019","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"7_CR29","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ipl.2004.11.007","volume":"93","author":"M Mousavi","year":"2005","unstructured":"Mousavi, M., Reniers, M., Groote, J.F.: A syntactic commutativity format for SOS. Inf. Process. Lett. 93(5), 217\u2013223 (2005). https:\/\/doi.org\/10.1016\/j.ipl.2004.11.007","journal-title":"Inf. Process. Lett."},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-48660-7_14","volume-title":"Automated Deduction \u2014 CADE-2016","author":"F Pfenning","year":"1999","unstructured":"Pfenning, F., Sch\u00fcrmann, C.: System description: Twelf \u2014 a meta-logical framework for deductive systems. In: CADE 1999. LNCS (LNAI), vol. 1632, pp. 202\u2013206. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48660-7_14"},{"key":"7_CR31","unstructured":"Pierce, B.C.: Types and Programming Languages. MIT Press (2002)"},{"key":"7_CR32","doi-asserted-by":"publisher","unstructured":"Ratiu, D., Voelter, M.: Automated testing of DSL implementations: experiences from building mbeddr. In: Proceedings of the 11th International Workshop on Automation of Software Test, AST 2016, pp. 15\u201321. Association for Computing Machinery, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2896921.2896922","DOI":"10.1145\/2896921.2896922"},{"key":"7_CR33","doi-asserted-by":"publisher","unstructured":"van der Rest, C., Poulsen, C.B., Rouvoet, A., Visser, E., Mosses, P.: Intrinsically-typed definitional interpreters \u00e0 la carte. Proc. ACM Program. Lang. 6(OOPSLA2), 1903\u20131932 (2022). https:\/\/doi.org\/10.1145\/3563355","DOI":"10.1145\/3563355"},{"key":"7_CR34","doi-asserted-by":"publisher","unstructured":"Roberson, M., Harries, M., Darga, P.T., Boyapati, C.: Efficient software model checking of soundness of type systems. In: Harris, G.E. (ed.) Proceedings of the 23rd ACM SIGPLAN Conference on Object-Oriented Programming Systems Languages and Applications, OOPSLA 2008, pp. 493\u2013504. Association for Computing Machinery, New York, NY, USA (2008). https:\/\/doi.org\/10.1145\/1449764.1449803","DOI":"10.1145\/1449764.1449803"},{"issue":"6","key":"7_CR35","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.jlap.2010.03.012","volume":"79","author":"G Rosu","year":"2010","unstructured":"Rosu, 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":"1","key":"7_CR36","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1017\/S0956796809990293","volume":"20","author":"P Sewell","year":"2010","unstructured":"Sewell, P.: Ott: effective tool support for the working semanticist. J. Funct. Program. 20(1), 71\u2013122 (2010). https:\/\/doi.org\/10.1017\/S0956796809990293","journal-title":"J. Funct. Program."},{"key":"7_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-540-48654-1_32","volume-title":"CONCUR 1994: Concurrency Theory","author":"C Verhoef","year":"1994","unstructured":"Verhoef, C.: A congruence theorem for structured operational semantics with predicates and negative premises. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 433\u2013448. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/978-3-540-48654-1_32"},{"key":"7_CR38","doi-asserted-by":"publisher","unstructured":"Wu, H.: Grammar-driven generation of domain-specific language tools. In: Companion to the 21st ACM SIGPLAN Symposium on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA 2006, pp. 772\u2013773. Association for Computing Machinery, New York, NY, USA (2006). https:\/\/doi.org\/10.1145\/1176617.1176718","DOI":"10.1145\/1176617.1176718"}],"container-title":["Lecture Notes in Computer Science","Tests and Proofs"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38828-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T11:43:01Z","timestamp":1710330181000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38828-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031388279","9783031388286"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38828-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"20 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tests and Proofs","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leicester","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tap2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/tap-2023","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":"14","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":"8","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":"2","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":"57% - 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","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":"2","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)"}}]}}