{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:28:55Z","timestamp":1725701335782},"publisher-location":"Berlin, Heidelberg","reference-count":21,"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_10","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T04:59:35Z","timestamp":1346129975000},"page":"136-150","source":"Crossref","is-referenced-by-count":2,"title":["S-Narrowing for Constructor Systems"],"prefix":"10.1007","author":[{"given":"Adri\u00e1n","family":"Riesco","sequence":"first","affiliation":[]},{"given":"Juan","family":"Rodr\u00edguez-Hortal\u00e1","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/11799573_9","volume-title":"Logic Programming","author":"S. Antoy","year":"2006","unstructured":"Antoy, S., Hanus, M.: Overlapping Rules and Logic Variables in Functional Logic Programs. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 87\u2013101. Springer, Heidelberg (2006)"},{"issue":"4","key":"10_CR2","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/1721654.1721675","volume":"53","author":"S. Antoy","year":"2010","unstructured":"Antoy, S., Hanus, M.: Functional logic programming. Communications of the ACM\u00a053(4), 74\u201385 (2010)","journal-title":"Communications of the ACM"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)","DOI":"10.1017\/CBO9781139172752"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 445\u2013532. Elsevier and MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50010-2"},{"key":"10_CR5","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":"10_CR6","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)"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.C.-C.: On the security of public key protocols. IEEE Transactions on Information Theory\u00a029(2), 198\u2013207 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"10_CR8","unstructured":"Dur\u00e1n, F., Eker, S., Escobar, S., Meseguer, J., Talcott, C.L.: Variants, unification, narrowing, and symbolic reachability in maude 2.6. In: Schmidt-Schau\u00df, M. (ed.) RTA. LIPIcs, vol.\u00a010, pp. 31\u201340. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-24754-8_12","volume-title":"Functional and Logic Programming","author":"S. Escobar","year":"2004","unstructured":"Escobar, S.: Implementing Natural Rewriting and Narrowing Efficiently. In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS 2004. LNCS, vol.\u00a02998, pp. 147\u2013162. Springer, Heidelberg (2004)"},{"key":"10_CR10","unstructured":"Hanus, M.: Functional logic programming: From theory to Curry. Technical report, Christian-Albrechts-Universit\u00e4t Kiel (2005)"},{"key":"10_CR11","series-title":"LNCS","first-page":"318","volume-title":"Automated Deduction","author":"J. Hullot","year":"1980","unstructured":"Hullot, J.: Canonical Forms and Unification. In: Bibel, W., Kowalski, R. (eds.) Automated Deduction. LNCS, vol.\u00a087, pp. 318\u2013334. Springer, Heidelberg (1980)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-642-02348-4_23","volume-title":"Rewriting Techniques and Applications","author":"F.J. L\u00f3pez-Fraguas","year":"2009","unstructured":"L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Hortal\u00e1, J., S\u00e1nchez-Hern\u00e1ndez, J.: A Fully Abstract Semantics for Constructor Systems. In: Treinen, R. (ed.) RTA 2009. LNCS, vol.\u00a05595, pp. 320\u2013334. Springer, Heidelberg (2009)"},{"issue":"1","key":"10_CR13","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":"10_CR14","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"},{"issue":"1-2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10990-007-9000-6","volume":"20","author":"J. Meseguer","year":"2007","unstructured":"Meseguer, J., Thati, P.: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. Higher-Order and Symbolic Computation\u00a020(1-2), 123\u2013160 (2007)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BF01190830","volume":"5","author":"A. Middeldorp","year":"1994","unstructured":"Middeldorp, A., Hamoen, E.: Completeness results for basic narrowing. Appl. Algebra Eng. Commun. Comput.\u00a05, 213\u2013253 (1994)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"10_CR17","unstructured":"Riesco, A., Rodr\u00edguez-Hortal\u00e1, J.: Generators: Detailed proofs. Technical Report 07\/12, DSIC (2012), \n                  \n                    http:\/\/gpd.sip.ucm.es\/snarrowing"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Riesco, A., Rodr\u00edguez-Hortal\u00e1, J.: S-narrowing for constructor systems: Detailed proofs. Technical report, DSIC (2012), \n                  \n                    http:\/\/gpd.sip.ucm.es\/snarrowing","DOI":"10.1007\/978-3-642-32943-2_10"},{"key":"10_CR19","unstructured":"Rodr\u00edguez-Hortal\u00e1, J.: A hierarchy of semantics for non-deterministic term rewriting systems. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) Proceedings Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008. LIPICS, vol.\u00a02, pp. 328\u2013339. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2008)"},{"key":"10_CR20","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"},{"issue":"1-2","key":"10_CR21","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.tcs.2006.07.008","volume":"366","author":"P. Thati","year":"2006","unstructured":"Thati, P., Meseguer, J.: Complete symbolic reachability analysis using back-and-forth narrowing. Theoretical Computer Science\u00a0366(1-2), 163\u2013179 (2006)","journal-title":"Theoretical Computer Science"}],"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_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:49:43Z","timestamp":1620128983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32943-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329425","9783642329432"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32943-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}