{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T05:20:55Z","timestamp":1725772855145},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642546235"},{"type":"electronic","value":"9783642546242"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-642-54624-2_5","type":"book-chapter","created":{"date-parts":[[2014,2,28]],"date-time":"2014-02-28T22:42:59Z","timestamp":1393627379000},"page":"92-109","source":"Crossref","is-referenced-by-count":4,"title":["Incremental Proofs of Termination, Confluence and Sufficient Completeness of OBJ Specifications"],"prefix":"10.1007","author":[{"given":"Masaki","family":"Nakamura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhiro","family":"Ogata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kokichi","family":"Futatsugi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"CafeOBJ, \n                  \n                    http:\/\/www.ldl.jaist.ac.jp\/cafeobj\/"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.jal.2011.09.001","volume":"10","author":"A. Bouhoula","year":"2012","unstructured":"Bouhoula, A., Jacquemard, F.: Sufficient Completeness Verification for Conditional and Constrained Term Rewriting Systems. Journal of Applied Logic\u00a010(1), 127\u2013143 (2012)","journal-title":"Journal of Applied Logic"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.tcs.2012.07.041","volume":"464","author":"K. Futatsugi","year":"2012","unstructured":"Futatsugi, K., G\u0103in\u0103, D., Ogata, K.: Principles of proof scores in CafeOBJ. Theor. Comput. Sci.\u00a0464, 90\u2013112 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Goguen, J.A., Winkler, T., Meseguer, J., Futatsugi, K., Jouannaud, J.-P.: Software Engineering with OBJ: Algebraic Specification in Action. In: Introducing OBJ*. Kluwers Academic Publishers (2000)","DOI":"10.1007\/978-1-4757-6541-0_1"},{"key":"5_CR5","unstructured":"Guttag, J.V.: The specification and application to programming of abstract data types. PhD thesis, University of Toronto, Toronto, Ont., Canada, Canada (1975)"},{"issue":"3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0004-3702(85)90074-8","volume":"25","author":"J. Hsiang","year":"1985","unstructured":"Hsiang, J.: Refutational theorem proving using term-rewriting systems. Artif. Intell.\u00a025(3), 255\u2013300 (1985)","journal-title":"Artif. Intell."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Jouannaud, J.-P., Kirchner, C., Kirchner, H., M\u00e9grelis, A.: OBJ: Programming with equalities, subsorts, overloading and parameterization. In: Grabowski, J., Lescanne, P., Wechler, W. (eds.) ALP 1988. LNCS, vol.\u00a0343, pp. 41\u201352. Springer (1988)","DOI":"10.1007\/3-540-50667-5_57"},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF01893885","volume":"28","author":"D. Kapur","year":"1991","unstructured":"Kapur, D., Narendran, P., Rosenkrantz, D.J., Zhang, H.: Sufficient-completeness, ground-reducibility and their complexity. Acta Inf.\u00a028(4), 311\u2013350 (1991)","journal-title":"Acta Inf."},{"issue":"5","key":"5_CR9","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1587\/transinf.E93.D.974","volume":"93-D","author":"W. Kong","year":"2010","unstructured":"Kong, W., Ogata, K., Futatsugi, K.: Towards reliable e-government systems with the OTS\/CafeOBJ method. IEICE Transactions\u00a093-D(5), 974\u2013984 (2010)","journal-title":"IEICE Transactions"},{"issue":"4","key":"5_CR10","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.ipl.2005.05.002","volume":"95","author":"S. Lucas","year":"2005","unstructured":"Lucas, S., March\u00e9, C., Meseguer, J.: Operational termination of conditional term rewriting systems. Inf. Process. Lett.\u00a095(4), 446\u2013453 (2005)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.jsc.2004.02.003","volume":"38","author":"C. March\u00e9","year":"2004","unstructured":"March\u00e9, C., Urbain, X.: Modular and incremental proofs of ac-termination. J. Symb. Comput.\u00a038(1), 873\u2013897 (2004)","journal-title":"J. Symb. Comput."},{"issue":"5","key":"5_CR12","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/j.jsc.2010.01.008","volume":"45","author":"M. Nakamura","year":"2010","unstructured":"Nakamura, M., Ogata, K., Futatsugi, K.: Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications. J. Symb. Comput.\u00a045(5), 551\u2013573 (2010)","journal-title":"J. Symb. Comput."},{"issue":"2","key":"5_CR13","first-page":"117","volume":"40","author":"M. Nakamura","year":"2013","unstructured":"Nakamura, M., Ogata, K., Futatsugi, K.: On proving operational termination incrementally with modular conditional dependency pairs. IAENG International Journal of Computer Science\u00a040(2), 117\u2013123 (2013)","journal-title":"IAENG International Journal of Computer Science"},{"key":"5_CR14","unstructured":"Nakamura, M., Ogawa, K., Futatsugi, K.: A hierarchical approach to operational termination of algebraic specifications. In: Proceedings of the International Conference on Electronics, Information and Communication, ICEIC 2013, pp. 144\u2013145 (2013)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-39958-2_12","volume-title":"Formal Methods for Open Object-Based Distributed Systems","author":"K. Ogata","year":"2003","unstructured":"Ogata, K., Futatsugi, K.: Proof scores in the OTS\/CafeOBJ Method. In: Najm, E., Nestmann, U., Stevens, P. (eds.) FMOODS 2003. LNCS, vol.\u00a02884, pp. 170\u2013184. Springer, Heidelberg (2003)"},{"key":"5_CR16","volume-title":"Advanced Topics in Term Rewriting","author":"E. Ohlebusch","year":"2010","unstructured":"Ohlebusch, E.: Advanced Topics in Term Rewriting, 1st edn. Springer Publishing Company, Incorporated (2010)","edition":"1"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-34032-1_15","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Applications and Case Studies","author":"I. Ouranos","year":"2012","unstructured":"Ouranos, I., Ogata, K., Stefaneas, P.: Formal analysis of tesla protocol in the timed OTS\/CafeOBJ method. In: Margaria, T., Steffen, B. (eds.) ISoLA 2012, Part II. LNCS, vol.\u00a07610, pp. 126\u2013142. Springer, Heidelberg (2012)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Schernhammer, F., Meseguer, J.: Incremental checking of well-founded recursive specifications modulo axioms. In: Schneider-Kamp, P., Hanus, M. (eds.) PPDP, pp. 5\u201316. ACM (2011)","DOI":"10.1145\/2003476.2003481"},{"key":"5_CR19","unstructured":"Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a055. Cambridge University Press (2003)"},{"issue":"4","key":"5_CR20","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF03177743","volume":"32","author":"X. Urbain","year":"2004","unstructured":"Urbain, X.: Modular & incremental automated termination proofs. J. Autom. Reasoning\u00a032(4), 315\u2013355 (2004)","journal-title":"J. Autom. Reasoning"}],"container-title":["Lecture Notes in Computer Science","Specification, Algebra, and Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54624-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T10:27:44Z","timestamp":1558866464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54624-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642546235","9783642546242"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54624-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}