{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T05:20:50Z","timestamp":1725772850198},"publisher-location":"Berlin, Heidelberg","reference-count":29,"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_15","type":"book-chapter","created":{"date-parts":[[2014,2,28]],"date-time":"2014-02-28T17:42:59Z","timestamp":1393609379000},"page":"296-314","source":"Crossref","is-referenced-by-count":0,"title":["Behavioral Rewrite Systems and Behavioral Productivity"],"prefix":"10.1007","author":[{"given":"Grigore","family":"Ro\u015fu","sequence":"first","affiliation":[]},{"given":"Dorel","family":"Lucanu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Bidoit, M., Hennicker, R.: Observer complete definitions are behaviourally coherent. In: OBJ\/CAFEOBJ\/MAUDE AT FORMAL METHODS 1999, pp. 83\u201394. THETA (1999)"},{"issue":"298","key":"15_CR2","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/S0304-3975(02)00865-4","volume":"3","author":"M. Bidoit","year":"2003","unstructured":"Bidoit, M., Hennicker, R., Kurz, A.: Observational logic, constructor-based logic, and their duality. Theoretical Computer Science\u00a03(298), 471\u2013510 (2003)","journal-title":"Theoretical Computer Science"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Buss, S., Ro\u015fu, G.: Incompleteness of behavioral logics. In: Proceeding of CMCS 2000. ENTCS, vol.\u00a033, pp. 61\u201379. Elsevier (2000)","DOI":"10.1016\/S1571-0661(05)80756-X"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Diaconescu, R., Futatsugi, K.: CafeOBJ Report. AMAST Series in Computing, vol.\u00a06. World Scientific (1998)","DOI":"10.1142\/3831"},{"key":"15_CR5","unstructured":"Dijkstra, E.W.: On the productivity of recursive definitions. EWD749 (September 1980)"},{"key":"15_CR6","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":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-04027-6_20","volume-title":"Computer Science Logic","author":"J. Endrullis","year":"2009","unstructured":"Endrullis, J., Geuvers, J., Zantema, H.: Degrees of undecidability in term rewriting. In: Gr\u00e4del, E., Kahle, R. (eds.) CSL 2009. LNCS, vol.\u00a05771, pp. 255\u2013270. Springer, Heidelberg (2009)"},{"key":"15_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-89439-1_6","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J. Endrullis","year":"2008","unstructured":"Endrullis, J., Grabmayer, C., Hendriks, D.: Data-oblivious stream productivity. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol.\u00a05330, pp. 79\u201396. Springer, Heidelberg (2008)"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Endrullis, J., Grabmayer, C., Hendriks, D.: Complexity of fractran and productivity. In: Schmidt, R.A. (ed.) CADE 2009. LNCS (LNAI), vol.\u00a05663, pp. 371\u2013387. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-02959-2_28"},{"issue":"4-5","key":"15_CR10","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.tcs.2009.10.014","volume":"411","author":"J. Endrullis","year":"2010","unstructured":"Endrullis, J., Grabmayer, C., Hendriks, D., Isihara, A., Klop, J.W.: Productivity of stream definitions. Theor. Comput. Sci.\u00a0411(4-5), 765\u2013782 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Endrullis, J., Hendriks, D., Bakhshi, R.: On the Complexity of Equivalence of Specifications of Infinite Objects. In: Proc. ACM SIGPLAN Int. Conf. on Functional Programming (ICFP\u00a02013), pp. 153\u2013164. ACM (2012)","DOI":"10.1145\/2398856.2364551"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-25979-4_15","volume-title":"Rewriting Techniques and Applications","author":"J. Giesl","year":"2004","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated Termination Proofs with AProVE. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 210\u2013220. Springer, Heidelberg (2004)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-57867-6_1","volume-title":"Recent Trends in Data Type Specification","author":"J.A. Goguen","year":"1994","unstructured":"Goguen, J.A., Diaconescu, R.: Towards an algebraic semantics for the object paradigm. In: Ehrig, H., Orejas, F. (eds.) Abstract Data Types 1992 and COMPASS 1992. LNCS, vol.\u00a0785, pp. 1\u201329. Springer, Heidelberg (1994)"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-540-31984-9_26","volume-title":"Fundamental Approaches to Software Engineering","author":"D. Hausmann","year":"2005","unstructured":"Hausmann, D., Mossakowski, T., Schr\u00f6der, L.: Iterative Circular Coinduction for CoCASL in Isabelle\/HOL. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol.\u00a03442, pp. 341\u2013356. Springer, Heidelberg (2005)"},{"issue":"4","key":"15_CR15","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."},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-642-03741-2_30","volume-title":"Algebra and Coalgebra in Computer Science","author":"D. Lucanu","year":"2009","unstructured":"Lucanu, D., Goriac, E.-I., Caltais, G., Ro\u015fu, G.: CIRC: A behavioral verification tool based on circular coinduction. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol.\u00a05728, pp. 433\u2013442. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"15_CR17","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.jlap.2005.09.006","volume":"67","author":"T. Mossakowski","year":"2006","unstructured":"Mossakowski, T., Schr\u00f6der, L., Roggenbach, M., Reichel, H.: Algebraic-coalgebraic specification in CoCASL. J. Log. Alg. Program.\u00a067(1-2), 146\u2013197 (2006)","journal-title":"J. Log. Alg. Program."},{"key":"15_CR18","unstructured":"Reichel, H.: Behavioural equivalence \u2013 a unifying concept for initial and final specifications. In: The 3rd Hungarian Comp. Sci. Conference, Akademiai Kiado (1981)"},{"key":"15_CR19","unstructured":"Ro\u015fu, G.: Hidden Logic. PhD thesis, University of California at San Diego (2000)"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Ro\u015fu, G.: Equality of streams is a \n                  \n                    \n                  \n                  $\\Pi_2^0$\n                -complete problem. In: Proceedgins of ICFP 2006, pp. 184\u2013191. ACM (2006)","DOI":"10.1145\/1160074.1159827"},{"key":"15_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-46508-1_17","volume-title":"Automated Deduction in Classical and Non-Classical Logics","author":"G. Ro\u015fu","year":"2000","unstructured":"Ro\u015fu, G., Goguen, J.: Hidden congruent deduction. In: Caferra, R., Salzer, G. (eds.) FTP 1998. LNCS (LNAI), vol.\u00a01761, pp. 251\u2013266. Springer, Heidelberg (2000)"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-03741-2_10","volume-title":"Algebra and Coalgebra in Computer Science","author":"G. Ro\u015fu","year":"2009","unstructured":"Ro\u015fu, G., Lucanu, D.: Circular Coinduction \u2013 A Proof Theoretical Foundation. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol.\u00a05728, pp. 127\u2013144. Springer, Heidelberg (2009)"},{"key":"15_CR23","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. Paperback edn. The MIT Press (1987)"},{"issue":"4","key":"15_CR24","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1145\/69558.69563","volume":"11","author":"B.A. Sijtsma","year":"1989","unstructured":"Sijtsma, B.A.: On the productivity of recursive list definitions. ACM Trans. Program. Lang. Syst.\u00a011(4), 633\u2013649 (1989)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-540-73445-1_23","volume-title":"Logic, Language, Information and Computation","author":"A. Silva","year":"2007","unstructured":"Silva, A., Rutten, J.: Behavioural differential equations and coinduction for binary trees. In: Leivant, D., de Queiroz, R. (eds.) WoLLIC 2007. LNCS, vol.\u00a04576, pp. 322\u2013336. Springer, Heidelberg (2007)"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-02348-4_24","volume-title":"Rewriting Techniques and Applications","author":"J.G. Simonsen","year":"2009","unstructured":"Simonsen, J.G.: The \n                  \n                    \n                  \n                  $\\Pi_2^0$\n                -completeness of most of the properties of rewriting systems you care about (and productivity). In: Treinen, R. (ed.) RTA 2009. LNCS, vol.\u00a05595, pp. 335\u2013349. Springer, Heidelberg (2009)"},{"key":"15_CR27","unstructured":"Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a055. Cambridge University Press (2003)"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-03741-2_32","volume-title":"Algebra and Coalgebra in Computer Science","author":"H. Zantema","year":"2009","unstructured":"Zantema, H.: A tool proving well-definedness of streams using termination tools. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol.\u00a05728, pp. 449\u2013456. Springer, Heidelberg (2009)"},{"key":"15_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-02348-4_12","volume-title":"Rewriting Techniques and Applications","author":"H. Zantema","year":"2009","unstructured":"Zantema, H.: Well-definedness of streams by termination. In: Treinen, R. (ed.) RTA 2009. LNCS, vol.\u00a05595, pp. 164\u2013178. Springer, Heidelberg (2009)"}],"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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T06:07:59Z","timestamp":1558850879000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54624-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642546235","9783642546242"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54624-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}