{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:03:59Z","timestamp":1725566639412},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255963"},{"type":"electronic","value":"9783540320333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32033-3_8","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T00:20:02Z","timestamp":1285633202000},"page":"90-104","source":"Crossref","is-referenced-by-count":1,"title":["Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Lynch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"Morawska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","first-page":"447","volume-title":"Handbook of Automated Reasoning","author":"F. Baader","year":"2001","unstructured":"Baader, F., Snyder, W.: Unification Theory. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol.\u00a0I, pp. 447\u2013533. Elsevier Science Publishers, Amsterdam (2001)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24727-2_1","volume-title":"Foundations of Software Science and Computation Structures","author":"H. Comon","year":"2004","unstructured":"Comon, H.: Intruder Theories (Ongoing Work). In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 1\u20134. Springer, Heidelberg (2004)"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","volume":"105","author":"J.A. Goguen","year":"1992","unstructured":"Goguen, J.A., Meseguer, J.: Order-Sorted algebra I: equational deduction for multiple inheritance, overload, exceptions and partial operations. Theoretical Computer Science\u00a0105, 217\u2013273 (1992)","journal-title":"Theoretical Computer Science"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/3-540-58201-0_89","volume-title":"Automata, Languages, and Programming","author":"C. Hintermeier","year":"1994","unstructured":"Hintermeier, C., Kirchner, C., Kirchner, H.: Dynamically-Typed Computations for Order-Sorted Equational Presentations. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol.\u00a0820, pp. 450\u2013461. Springer, Heidelberg (1994)"},{"key":"8_CR5","first-page":"257","volume-title":"Computational Logic, Essays in Honor of Alan Robinson","author":"J.P. Jouannaud","year":"1991","unstructured":"Jouannaud, J.P., Kirchner, C.: Solving Equations in Abstract Algebras: A Rule- Based Survey of Unification. In: Lassez, J., Plotkin, G. (eds.) Computational Logic, Essays in Honor of Alan Robinson, vol.\u00a0ch. 8, pp. 257\u2013321. MIT Press, Cambridge (1991)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Lynch, C., Meadows, C.: Sound Approximations to Diffie-Hellman Using Rewrite Rules. In: Proceedings of the Sixth International Conference on Information and Communications Security, Malaga, Spain (October 2004)","DOI":"10.1007\/978-3-540-30191-2_21"},{"key":"8_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/3-540-45620-1_37","volume-title":"Automated Deduction - CADE-18","author":"C. Lynch","year":"2002","unstructured":"Lynch, C., Morawska, B.: Basic Syntactic Mutation. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, pp. 471\u2013485. Springer, Heidelberg (2002)"},{"key":"8_CR8","volume-title":"Proceedings of the 1999 IEEE Symposium on Security and Privacy","author":"C. Meadows","year":"1999","unstructured":"Meadows, C.: Analysis of the Internet Key Exchange Protocol Using the NRL Protocol Analyzer. In: Proceedings of the 1999 IEEE Symposium on Security and Privacy, May 1999, IEEE Computer Society Press, Los Alamitos (1999)"},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/JSAC.2002.806125","volume":"21","author":"C. Meadows","year":"2003","unstructured":"Meadows, C.: Formal Methods for Cryptographic Protocol Analysis: Emerging Issues and Trends. IEEE Journal on Selected Areas in Communication\u00a021(1), 44\u201354 (2003)","journal-title":"IEEE Journal on Selected Areas in Communication"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2730","volume":"147","author":"R. Nieuwenhuis","year":"1998","unstructured":"Nieuwenhuis, R.: Decidability and Complexity Analysis by Basic Paramodulation. Information and Computation\u00a0147, 1\u201321 (1998)","journal-title":"Information and Computation"},{"key":"8_CR11","series-title":"Rewriting Techniques","first-page":"267","volume-title":"Resolution of Equations in Algebraic Structures","author":"G. Smolka","year":"1989","unstructured":"Smolka, G., Nutt, W., Goguen, J.A., Meseguer, J.: Order-Sorted Equational Computation. In: Ait-Kaci, H., Nivat, M. (eds.) Resolution of Equations in Algebraic Structures. Rewriting Techniques, vol.\u00a02, ch. 10, pp. 267\u2013297. Academic Press, London (1989)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Wallner, D., Harder, E., Agee, R.C.: Key Management for Multicast: Issues and Architectures. RFC 2627 (June 1999)","DOI":"10.17487\/rfc2627"},{"key":"8_CR13","series-title":"Applied Logic","first-page":"291","volume-title":"Automated Deduction \u2013 A Basis for Applications","author":"C. Weidenbach","year":"1998","unstructured":"Weidenbach, C.: Sorted Unification and Tree Automata. In: Bibel, W., Schmitt, P.H. (eds.) Automated Deduction \u2013 A Basis for Applications. Applied Logic, vol.\u00a01, ch. 9, pp. 291\u2013320. Kluwer, Dordrecht (1998)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32033-3_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:34:02Z","timestamp":1605760442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32033-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255963","9783540320333"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32033-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}