{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T21:11:47Z","timestamp":1791061907887,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642163098","type":"print"},{"value":"9783642163104","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16310-4_7","type":"book-chapter","created":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T03:44:29Z","timestamp":1285904669000},"page":"86-103","source":"Crossref","is-referenced-by-count":15,"title":["A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories"],"prefix":"10.1007","author":[{"given":"Francisco","family":"Dur\u00e1n","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/3-540-58216-9_40","volume-title":"Logic Programming and Automated Reasoning","author":"J. Avenhaus","year":"1994","unstructured":"Avenhaus, J., Lor\u00eda-S\u00e1enz, C.: On conditional rewrite systems with extra variables and deterministic logic programs. In: Pfenning, F. (ed.) LPAR 1994. LNCS, vol.\u00a0822, pp. 215\u2013229. Springer, Heidelberg (1994)"},{"issue":"1","key":"7_CR2","first-page":"286","volume":"351","author":"R. Bruni","year":"2006","unstructured":"Bruni, R., Meseguer, J.: Semantic foundations for generalized rewrite theories. Theoretical Computer Science\u00a0351(1), 286\u2013414 (2006)","journal-title":"Theoretical Computer Science"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0304-3975(01)00359-0","volume":"285","author":"M. Clavel","year":"2002","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Quesada, J.: Maude: Specification and programming in rewriting logic. Theoretical Computer Science\u00a0285, 187\u2013243 (2002)","journal-title":"Theoretical Computer Science"},{"key":"7_CR4","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.: All About Maude - A High-Performance Logical Framework. LNCS, vol.\u00a04350. Springer, Heidelberg (2007)"},{"key":"7_CR5","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., Meseguer, J., \u00d6lveczky, P.: 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":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-32033-3_22","volume-title":"Term Rewriting and Applications","author":"H. Comon-Lundh","year":"2005","unstructured":"Comon-Lundh, H., Delaune, S.: The finite variant property: How to get rid of some algebraic properties. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 294\u2013307. Springer, Heidelberg (2005)"},{"key":"7_CR7","unstructured":"Dur\u00e1n, F.: A Reflective Module Algebra with Applications to the Maude Language. PhD thesis, U. de M\u00e1laga, Spain (June 1999), http:\/\/maude.csl.sri.com\/papers"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/3-540-45499-3_30","volume-title":"Algebraic Methodology and Software Technology","author":"F. Dur\u00e1n","year":"2000","unstructured":"Dur\u00e1n, F.: The extensibility of Maude\u2019s module algebra. In: Rus, T. (ed.) AMAST 2000. LNCS, vol.\u00a01816, pp. 422\u2013437. Springer, Heidelberg (2000)"},{"key":"7_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-540-71070-7_27","volume-title":"Automated Reasoning","author":"F. Dur\u00e1n","year":"2008","unstructured":"Dur\u00e1n, F., Lucas, S., Meseguer, J.: MTT: The Maude termination tool (system description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol.\u00a05195, pp. 313\u2013319. Springer, Heidelberg (2008)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/978-3-642-04222-5_15","volume-title":"FroCoS 2009","author":"F. Dur\u00e1n","year":"2009","unstructured":"Dur\u00e1n, F., Lucas, S., Meseguer, J.: Termination modulo combinations of equational theories. In: Ghilardi, S. (ed.) FroCoS 2009. LNCS, vol.\u00a05749, pp. 246\u2013262. Springer, Heidelberg (2009)"},{"key":"7_CR11","unstructured":"Dur\u00e1n, F., Meseguer, J.: A Church-Rosser checker tool for Maude equational specifications. Technical Report ITI-2000-5, Dpto. de Lenguajes y Ciencias de la Computaci\u00f3n, U. de M\u00e1laga (October 2000), http:\/\/maude.cs.uiuc.edu"},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.scico.2006.07.002","volume":"66","author":"F. Dur\u00e1n","year":"2007","unstructured":"Dur\u00e1n, F., Meseguer, J.: Maude\u2019s module algebra. Science of Computer Programming\u00a066(2), 125\u2013153 (2007)","journal-title":"Science of Computer Programming"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Dur\u00e1n, F., Meseguer, J.: ChC 3: A coherence checker tool for conditional order-sorted rewrite Maude specifications (2009), http:\/\/maude.lcc.uma.es\/CRChC","DOI":"10.1007\/978-3-642-16310-4_7"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Dur\u00e1n, F., Meseguer, J.: CRC 3: A Church-Rosser checker tool for conditional order-sorted equational Maude specifications (2009), http:\/\/maude.lcc.uma.es\/CRChC","DOI":"10.1007\/978-3-642-16310-4_6"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Dur\u00e1n, F., Meseguer, J.: A Church-Rosser checker tool for conditional order-sorted equational Maude specifications. In: \u00d6lveczky, P.C. (ed.) 8th Intl. Workshop on Rewriting Logic and its Applications (2010)","DOI":"10.1007\/978-3-642-16310-4_6"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Dur\u00e1n, F., Meseguer, J.: A Maude coherence checker tool for conditional order-sorted rewrite theories, long version (2010), http:\/\/maude.lcc.uma.es\/CRChC","DOI":"10.1007\/978-3-642-16310-4_7"},{"key":"7_CR17","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Proceedings 7th Intl. Workshop on Rewriting Logic and its Applications (WRLA 2008)","author":"F. Dur\u00e1n","year":"2008","unstructured":"Dur\u00e1n, F., \u00d6lveczky, P.C.: A guide to extending Full Maude illustrated with the implementation of Real-Time Maude. In: Ro\u015fu, G. (ed.) Proceedings 7th Intl. Workshop on Rewriting Logic and its Applications (WRLA 2008). Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam (2008)"},{"key":"7_CR18","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"103","volume-title":"Proc. 7th Intl. Workshop on Rewriting Logic and its Applications (WRLA 2008)","author":"S. Escobar","year":"2008","unstructured":"Escobar, S., Meseguer, J., Sasse, R.: Variant narrowing and equational unification. In: Rosu, G. (ed.) Proc. 7th Intl. Workshop on Rewriting Logic and its Applications (WRLA 2008). Electronic Notes in Theoretical Computer Science, vol.\u00a0238, pp. 103\u2013119. Elsevier, Amsterdam (2008)"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-45127-7_9","volume-title":"Rewriting Techniques and Applications","author":"J. Giesl","year":"2001","unstructured":"Giesl, J., Kapur, D.: Dependency pairs for equational rewriting. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 93\u2013108. Springer, Heidelberg (2001)"},{"issue":"4","key":"7_CR20","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/0215084","volume":"15","author":"J.-P. Jouannaud","year":"1986","unstructured":"Jouannaud, J.-P., Kirchner, H.: Completion of a set of rules modulo a set of equations. SIAM Journal of Computing\u00a015(4), 1155\u20131194 (1986)","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"7_CR21","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"},{"key":"7_CR22","doi-asserted-by":"crossref","first-page":"314","DOI":"10.7551\/mitpress\/2087.003.0017","volume-title":"Research Directions in Concurrent Object-Oriented Programming","author":"J. Meseguer","year":"1993","unstructured":"Meseguer, J.: A logical theory of concurrent objects and its realization in the Maude language. In: Agha, G., Wegner, P., Yonezawa, A. (eds.) Research Directions in Concurrent Object-Oriented Programming, pp. 314\u2013390. The MIT Press, Cambridge (1993)"},{"key":"7_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3661-8","volume-title":"Advanced Topics in Term Rewriting","author":"E. Ohlebusch","year":"2002","unstructured":"Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, Heidelberg (2002)"},{"issue":"2","key":"7_CR24","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"G. Peterson","year":"1981","unstructured":"Peterson, G., Stickel, M.: Complete sets of reductions for some equational theories. Journal of ACM\u00a028(2), 233\u2013264 (1981)","journal-title":"Journal of ACM"},{"issue":"2","key":"7_CR25","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/S0304-3975(01)00366-8","volume":"285","author":"P. Viry","year":"2002","unstructured":"Viry, P.: Equational rules for rewriting logic. Theoretical Computer Science\u00a0285(2), 487\u2013517 (2002)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Rewriting Logic and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16310-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T21:35:46Z","timestamp":1711834546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16310-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163098","9783642163104"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16310-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}