{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:29:02Z","timestamp":1725701342394},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329425"},{"type":"electronic","value":"9783642329432"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32943-2_7","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T04:59:35Z","timestamp":1346129975000},"page":"90-104","source":"Crossref","is-referenced-by-count":4,"title":["Using Semantics Specified in Maude to Generate Test Cases"],"prefix":"10.1007","author":[{"given":"Adri\u00e1n","family":"Riesco","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Beck, K., Gamma, E.: Test-infected: programmers love writing tests, pp. 357\u2013376. Cambridge University Press (2000)","DOI":"10.1017\/CBO9780511550881.029"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0304-3975(99)00206-6","volume":"236","author":"A. Bouhoula","year":"2000","unstructured":"Bouhoula, A., Jouannaud, J.-P., Meseguer, J.: Specification and proof in membership equational logic. Theoretical Computer Science\u00a0236, 35\u2013132 (2000)","journal-title":"Theoretical Computer Science"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Cartaxo, E.G., Neto, F.G.O., Machado, P.D.L.: Test case generation by means of UML sequence diagrams and labeled transition systems. In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, SMC 2007, pp. 1292\u20131297. IEEE (2007)","DOI":"10.1109\/ICSMC.2007.4414060"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Claessen, K., Hughes, J.: Quickcheck: A lightweight tool for random testing of Haskell programs. In: ACM SIGPLAN Notices, pp. 268\u2013279. ACM Press (2000)","DOI":"10.1145\/357766.351266"},{"key":"7_CR5","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 - A High-Performance Logical Framework. LNCS, vol.\u00a04350. Springer, Heidelberg (2007)"},{"key":"7_CR6","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.: Maude Manual (Version 2.6) (January 2011), \n                  \n                    http:\/\/maude.cs.uiuc.edu\/maude2-manual"},{"key":"7_CR7","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":"7_CR8","unstructured":"Fay, M.J.: First-order unification in an equational theory. In: Joyner, W.H. (ed.) Proceedings of the 4th Workshop on Automated Deduction, pp. 161\u2013167. Academic Press (1979)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Fischer, S., Kuchen, H.: Systematic generation of glass-box test cases for functional logic programs. In: Proceedings of the 9th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, PPDP 2007, pp. 63\u201374. ACM Press (2007)","DOI":"10.1145\/1273920.1273930"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-14335-9_7","volume-title":"Testing Techniques in Software Engineering","author":"M.-C. Gaudel","year":"2010","unstructured":"Gaudel, M.-C.: Software Testing Based on Formal Specification. In: Borba, P., Cavalcanti, A., Sampaio, A., Woodcook, J. (eds.) PSSE 2007. LNCS, vol.\u00a06153, pp. 215\u2013242. Springer, Heidelberg (2010)"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1017\/S1471068410000347","volume":"10","author":"M. Gomez-Zamalloa","year":"2010","unstructured":"Gomez-Zamalloa, M., Albert, E., Puebla, G.: Test case generation for object-oriented imperative languages in CLP. Theory and Practice of Logic Programming\u00a010, 659\u2013674 (2010)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1459352.1459354","volume":"41","author":"R.M. Hierons","year":"2009","unstructured":"Hierons, R.M., Bogdanov, K., Bowen, J.P., Rance Cleaveland, J.D., Dick, J., Gheorghe, M., Harman, M., Kapoor, K., Krause, P., L\u00fcttgen, G., Simons, A.J.H., Vilkomir, S., Woodward, M.R., Zedan, H.: Using formal specifications to support testing. ACM Computing Surveys\u00a041(2), 1\u201376 (2009)","journal-title":"ACM Computing Surveys"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Meadows, C.: Applying formal methods to the analysis of a key management protocol. Journal of Computer Security\u00a01 (1992)","DOI":"10.3233\/JCS-1992-1102"},{"issue":"1","key":"7_CR14","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.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science\u00a096(1), 73\u2013155 (1992)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"7_CR15","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.tcs.2006.12.018","volume":"373","author":"J. Meseguer","year":"2007","unstructured":"Meseguer, J., Ro\u015fu, G.: The rewriting logic semantics project. Theoretical Computer Science\u00a0373(3), 213\u2013237 (2007)","journal-title":"Theoretical Computer Science"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/BFb0013830","volume-title":"Algebraic and Logic Programming","author":"A. Middeldorp","year":"1992","unstructured":"Middeldorp, A., Hamoen, E.: Counterexamples to Completeness Results for Basic Narrowing. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol.\u00a0632, pp. 244\u2013258. Springer, Heidelberg (1992)"},{"key":"7_CR17","unstructured":"M\u00fcller, R.A., Lembeck, C., Kuchen, H.: A symbolic Java virtual machine for test case generation. In: IASTED Conf. on Software Engineering, pp. 365\u2013371 (2004)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Papadakis, M., Sagonas, K.: A PropEr integration of types and function specifications with property-based testing. In: Proceedings of the 2011 ACM SIGPLAN Erlang Workshop, pp. 39\u201350. ACM Press (2011)","DOI":"10.1145\/2034654.2034663"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-28412-0_18","volume-title":"Recent Trends in Algebraic Development Techniques","author":"A. Riesco","year":"2012","unstructured":"Riesco, A.: Test-Case Generation for Maude Functional Modules. In: Mossakowski, T., Kreowski, H.-J. (eds.) WADT 2010. LNCS, vol.\u00a07137, pp. 287\u2013301. Springer, Heidelberg (2012)"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Riesco, A.: Using Narrowing to Test Maude Specifications. In: Dur\u00e1n, F. (ed.) Proceedings of the 9th International Workshop on Rewriting Logic and its Applications, WRLA 2012. LNCS. Springer (to appear, 2012)","DOI":"10.1007\/978-3-642-34005-5_11"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Riesco, A., Verdejo, A., Mart\u00ed-Oliet, N., Caballero, R.: Declarative debugging of rewriting logic specifications. Journal of Logic and Algebraic Programming (to appear, 2012)","DOI":"10.1016\/j.jlap.2011.06.004"},{"issue":"1","key":"7_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. Journal of the ACM\u00a012(1), 23\u201341 (1965)","journal-title":"Journal of the ACM"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Runciman, C., Naylor, M., Lindblad, F.: Smallcheck and Lazy Smallcheck: automatic exhaustive testing for small values. In: Gill, A. (ed.) Proceedings of the 1st ACM SIGPLAN Symposium on Haskell, Haskell 2008, pp. 37\u201348. ACM (2008)","DOI":"10.1145\/1411286.1411292"},{"key":"7_CR24","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. \u015eerb\u0103nu\u0163\u0103","year":"2009","unstructured":"\u015eerb\u0103nu\u0163\u0103, T., \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.\u00a05391, pp. 374\u2013393. Springer, Heidelberg (2009)"},{"issue":"4","key":"7_CR25","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1145\/321850.321859","volume":"21","author":"J.R. Slagle","year":"1974","unstructured":"Slagle, J.R.: Automated theorem-proving for theories with simplifiers, commutativity and associativity. Journal of the ACM\u00a021(4), 622\u2013642 (1974)","journal-title":"Journal of the ACM"},{"issue":"1","key":"7_CR26","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0169-7552(96)00017-7","volume":"29","author":"J. Tretmans","year":"1996","unstructured":"Tretmans, J.: Conformance testing with labelled transition systems: Implementation relations and test generation. Computer Networks and ISDN Systems\u00a029(1), 49\u201379 (1996)","journal-title":"Computer Networks and ISDN Systems"},{"key":"7_CR27","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. Journal of Logic and Algebraic Programming\u00a067, 226\u2013293 (2006)","journal-title":"Journal of Logic and Algebraic Programming"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32943-2_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:49:49Z","timestamp":1620128989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32943-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329425","9783642329432"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32943-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}