{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:02:03Z","timestamp":1743141723878,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642224379"},{"type":"electronic","value":"9783642224386"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22438-6_5","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T18:21:44Z","timestamp":1311013304000},"page":"34-48","source":"Crossref","is-referenced-by-count":14,"title":["Backward Trace Slicing for Rewriting Logic Theories"],"prefix":"10.1007","author":[{"given":"Mar\u00eda","family":"Alpuente","sequence":"first","affiliation":[]},{"given":"Demis","family":"Ballis","sequence":"additional","affiliation":[]},{"given":"Javier","family":"Espert","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Romero","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Alpuente, M., Ballis, D., Espert, J., Romero, D.: Backward trace slicing for RWL rewriting logic theories (Technical Report), \n                  \n                    http:\/\/hdl.handle.net\/10251\/10770"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/1706356.1706367","volume-title":"Proc 2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2010","author":"M. Alpuente","year":"2010","unstructured":"Alpuente, M., Ballis, D., Baggi, M., Falaschi, M.: A Fold\/Unfold Transformation Framework for Rewrite Theories extended to CCT. In: Proc. PEPM 2010, pp. 43\u201352. ACM, New York (2010)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-642-15643-4_25","volume-title":"Automated Technology for Verification and Analysis","author":"M. Alpuente","year":"2010","unstructured":"Alpuente, M., Ballis, D., Espert, J., Romero, D.: Model-Checking Web Applications with Web-TLR. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol.\u00a06252, pp. 341\u2013346. Springer, Heidelberg (2010)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1007\/978-3-642-05089-3_50","volume-title":"FM 2009: Formal Methods","author":"M. Alpuente","year":"2009","unstructured":"Alpuente, M., Ballis, D., Romero, D.: Specification and Verification of Web Applications in Rewriting Logic. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 790\u2013805. Springer, Heidelberg (2009)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-03845-7_5","volume-title":"Computational Methods in Systems Biology","author":"M. Baggi","year":"2009","unstructured":"Baggi, M., Ballis, D., Falaschi, M.: Quantitative pathway logic for computational biology. In: Degano, P., Gorrieri, R. (eds.) CMSB 2009. LNCS, vol.\u00a05688, pp. 68\u201382. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.2000.2876","volume":"159","author":"I. Bethke","year":"2000","unstructured":"Bethke, I., Klop, J.W., de Vrijer, R.: Descendants and origins in term rewriting. Inf. Comput.\u00a0159(1-2), 59\u2013124 (2000)","journal-title":"Inf. Comput."},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-00768-2_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F. Chen","year":"2009","unstructured":"Chen, F., Ro\u015fu, G.: Parametric trace slicing and monitoring. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol.\u00a05505, pp. 246\u2013261. Springer, Heidelberg (2009)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-45361-X_11","volume-title":"Implementation of Functional Languages","author":"O. Chitil","year":"2001","unstructured":"Chitil, O., Runciman, C., Wallace, M.: Freja, hat and hood - a comparative evaluation of three systems for tracing and debugging lazy functional programs. In: Mohnen, M., Koopman, P. (eds.) IFL 2000. LNCS, vol.\u00a02011, pp. 176\u2013193. Springer, Heidelberg (2001)"},{"key":"5_CR9","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., Bevilacqua, V., Talcott, C.: All About Maude - A High-Performance Logical Framework. LNCS, vol.\u00a04350. Springer, Heidelberg (2007)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-73859-6_12","volume-title":"Algebra and Coalgebra in Computer Science","author":"M. Clavel","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Hendrix, J., Lucas, S., Bevilacqua, V., \u00d6lveczky, P.C.: The Maude Formal Tool Environment. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol.\u00a04624, pp. 173\u2013178. Springer, Heidelberg (2007)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-44881-0_3","volume-title":"Rewriting Techniques and Applications","author":"S. Eker","year":"2003","unstructured":"Eker, S.: Associative-Commutative Rewriting on Large Terms. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 14\u201329. Springer, Heidelberg (2003)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-44829-2_16","volume-title":"Model Checking Software","author":"S. Eker","year":"2003","unstructured":"Eker, S., Bevilacqua, V., Sridharanarayanan, A.: The maude LTL model checker and its implementation. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol.\u00a02648, pp. 230\u2013234. Springer, Heidelberg (2003)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-58402-1_29","volume-title":"Programming Language Implementation and Logic Programming","author":"J. Field","year":"1994","unstructured":"Field, J., Tip, F.: Dynamic dependence in term rewriting systems and its application to program slicing. In: Penjam, J. (ed.) PLILP 1994. LNCS, vol.\u00a0844, pp. 415\u2013431. Springer, Heidelberg (1994)"},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0304-3975(01)00357-7","volume":"285","author":"N. Mart\u00ed-Oliet","year":"2002","unstructured":"Mart\u00ed-Oliet, N., Meseguer, J.: Rewriting Logic: Roadmap and Bibliography. Theoretical Computer Science\u00a0285(2), 121\u2013154 (2002)","journal-title":"Theoretical Computer Science"},{"key":"5_CR15","unstructured":"Riesco, A., Verdejo, A., Mart\u00ed-Oliet, N.: Declarative Debugging of Missing Answers for Maude Specifications. In: Proc. RTA 2010, LIPIcs, vol.\u00a06, pp. 277\u2013294 (2010)"},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10515-005-6205-y","volume":"12","author":"G. Rosu","year":"2005","unstructured":"Rosu, G., Havelund, K.: Rewriting-Based Techniques for Runtime Verification. Autom. Softw. Eng.\u00a012(2), 151\u2013197 (2005)","journal-title":"Autom. Softw. Eng."},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-68894-5_2","volume":"5016","author":"C. Talcott","year":"2008","unstructured":"Talcott, C.: Pathway logic. Formal Methods for Computational Systems Biology\u00a05016, 21\u201353 (2008)","journal-title":"Formal Methods for Computational Systems Biology"},{"volume-title":"Term Rewriting Systems","year":"2003","key":"5_CR18","unstructured":"TeReSe (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-23"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22438-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T03:42:02Z","timestamp":1553917322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22438-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642224379","9783642224386"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22438-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}