{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:44Z","timestamp":1761611264175,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540205371"},{"type":"electronic","value":"9783540400202"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":[[2003]]},"DOI":"10.1007\/978-3-540-40020-2_12","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T22:42:34Z","timestamp":1277332954000},"page":"216-232","source":"Crossref","is-referenced-by-count":13,"title":["Conditional Circular Coinductive Rewriting with Case Analysis"],"prefix":"10.1007","author":[{"given":"Joseph A.","family":"Goguen","sequence":"first","affiliation":[]},{"given":"Kai","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Grigore","family":"Ro\u015fu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0304-3975(94)00017-D","volume":"139","author":"G. Bernot","year":"1995","unstructured":"Bernot, G., Bidoit, M., Knapik, T.: Observational specifications and the indistinguishability assumption. Theoretical Computer Science\u00a0139, 275\u2013314 (1995)","journal-title":"Theoretical Computer Science"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/BFb0053582","volume-title":"Fundamental Approaches to Software Engineering","author":"N. Berregeb","year":"1998","unstructured":"Berregeb, N., Bouhoula, A., Rusinowitch, M.: Observational proofs with critical contexts. In: Astesiano, E. (ed.) ETAPS 1998 and FASE 1998. LNCS, vol.\u00a01382, pp. 38\u201353. Springer, Heidelberg (1998)"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(96)00039-4","volume":"165","author":"M. Bidoit","year":"1996","unstructured":"Bidoit, M., Hennicker, R.: Behavioral theories and the proof of behavioral properties. Theoretical Computer Science\u00a0165(1), 3\u201355 (1996)","journal-title":"Theoretical Computer Science"},{"key":"12_CR4","unstructured":"Bidoit, M., Hennicker, R.: Observer complete definitions are behaviourally coherent. In: Futatsugi, K., Goguen, J., Meseguer, J. (eds.) OBJ\/CafeOBJ\/Maude at Formal Methods 1999, Theta, pp. 83\u201394 (1999)"},{"key":"12_CR5","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"61","volume-title":"Proceedings of Coalgebraic Methods in Computer Science","author":"S. Buss","year":"2000","unstructured":"Buss, S., Ro\u015fu, G.: Incompleteness of behavioral logics. In: Reichel, H. (ed.) Proceedings of Coalgebraic Methods in Computer Science. Electronic Notes in Theoretical Computer Science, vol.\u00a033, pp. 61\u201379. Elsevier Science, Amsterdam (2000)"},{"key":"12_CR6","series-title":"AMAST Series in Computing","doi-asserted-by":"crossref","DOI":"10.1142\/3831","volume-title":"CafeOBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification","author":"R. Diaconescu","year":"1998","unstructured":"Diaconescu, R., Futatsugi, K.: CafeOBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification. AMAST Series in Computing, vol.\u00a06. World Scientific, Singapore (1998)"},{"issue":"1","key":"12_CR7","first-page":"74","volume":"6","author":"R. Diaconescu","year":"2000","unstructured":"Diaconescu, R., Futatsugi, K.: Behavioral coherence in object-oriented algebraic specification. Journal of Universal Computer Science\u00a06(1), 74\u201396 (2000)","journal-title":"Journal of Universal Computer Science"},{"key":"12_CR8","unstructured":"Futatsugi, K., Ogata, K.: Rewriting can verify distributed real-time systems \u2013 how to verify in CafeOBJ. In: Toyama, Y. (ed.) Proc. Int. Workshop on Rewriting in Proof and Computation, pp. 60\u201379. Tohoku University (2001)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Goguen, J.: Types as theories. In: Reed, G.M., Roscoe, A.W., Wachter, R.F. (eds.) Topology and Category Theory in Computer Science, Oxford, pp. 357\u2013390 (1991)","DOI":"10.1093\/oso\/9780198537601.003.0014"},{"key":"12_CR10","first-page":"123","volume-title":"Proceedings, Automated Software Engineering","author":"J. Goguen","year":"2000","unstructured":"Goguen, J., Lin, K., Ro\u015fu, G.: Circular coinductive rewriting. In: Proceedings, Automated Software Engineering, pp. 123\u2013131. IEEE, Los Alamitos (2000)"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0304-3975(99)00275-3","volume":"245","author":"J. Goguen","year":"2000","unstructured":"Goguen, J., Malcolm, G.: A hidden agenda. Theoretical Computer Science\u00a0245(1), 55\u2013101 (2000)","journal-title":"Theoretical Computer Science"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1704","DOI":"10.1007\/3-540-48118-4_40","volume-title":"FM\u201999 - Formal Methods","author":"J. Goguen","year":"1999","unstructured":"Goguen, J., Ro\u015fu, G.: Hiding more of hidden algebra. In: Woodcock, J.C.P., Davies, J., Wing, J.M. (eds.) FM 1999. LNCS, vol.\u00a01709, pp. 1704\u20131719. Springer, Heidelberg (1999)"},{"issue":"4","key":"12_CR13","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/BF01642507","volume":"3","author":"R. Hennicker","year":"1991","unstructured":"Hennicker, R.: Context induction: a proof principle for behavioral abstractions. Formal Aspects of Computing\u00a03(4), 326\u2013345 (1991)","journal-title":"Formal Aspects of Computing"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-49253-4_20","volume-title":"Algebraic Methodology and Software Technology","author":"R. Hennicker","year":"1998","unstructured":"Hennicker, R., Bidoit, M.: Observational logic. In: Haeberer, A.M. (ed.) AMAST 1998. LNCS, vol.\u00a01548, pp. 263\u2013277. Springer, Heidelberg (1998)"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/3-540-60043-4_57","volume-title":"Algebraic Methodology and Software Technology","author":"B. Jacobs","year":"1995","unstructured":"Jacobs, B.: Mongruences and cofree coalgebras. In: Alagar, V.S., Nivat, M. (eds.) AMAST 1995. LNCS, vol.\u00a0936, pp. 245\u2013260. Springer, Heidelberg (1995)"},{"key":"12_CR16","first-page":"222","volume":"62","author":"B. Jacobs","year":"1997","unstructured":"Jacobs, B., Rutten, J.: A tutorial on (co)algebras and (co)induction. Bulletin of European Association for Theoretical Computer Science\u00a062, 222\u2013259 (1997)","journal-title":"Bulletin of European Association for Theoretical Computer Science"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/3-540-64299-4_45","volume-title":"Recent Trends in Algebraic Development Techniques","author":"P. Padawitz","year":"1998","unstructured":"Padawitz, P.: Towards the one-tiered design of data types and transition systems. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol.\u00a01376, pp. 365\u2013380. Springer, Heidelberg (1998)"},{"key":"12_CR18","unstructured":"Ro\u015fu, G.: Behavioral coinductive rewriting. In: Futatsugi, K., Goguen, J., Meseguer, J. (eds.) OBJ\/CafeOBJ\/Maude at Formal Methods 1999, Theta, pp. 179\u2013196 (1999)"},{"key":"12_CR19","unstructured":"Ro\u015fu, G.: Hidden Logic. PhD thesis, University of California, San Diego (2000)"},{"key":"12_CR20","series-title":"Lecture Notes in Artificial Intelligence","first-page":"252","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. 252\u2013267. Springer, Heidelberg (2000)"},{"key":"12_CR21","unstructured":"Ro\u015fu, G., Goguen, J.: Circular coinduction. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083. Springer, Heidelberg (2001)"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J. Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theoretical Computer Science\u00a0249, 3\u201380 (2000)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Algebraic Development Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40020-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:05:51Z","timestamp":1711569951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40020-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205371","9783540400202"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40020-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}