{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:09:24Z","timestamp":1725538164694},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642037405"},{"type":"electronic","value":"9783642037412"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03741-2_30","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T10:20:01Z","timestamp":1252923601000},"page":"433-442","source":"Crossref","is-referenced-by-count":21,"title":["CIRC: A Behavioral Verification Tool Based on Circular Coinduction"],"prefix":"10.1007","author":[{"given":"Dorel","family":"Lucanu","sequence":"first","affiliation":[]},{"given":"Eugen-Ioan","family":"Goriac","sequence":"additional","affiliation":[]},{"given":"Georgiana","family":"Caltais","sequence":"additional","affiliation":[]},{"given":"Grigore","family":"Ro\u015fu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/0012-365X(93)00147-W","volume":"139","author":"J.-P. Allouche","year":"1995","unstructured":"Allouche, J.-P., Arnold, A., Berstel, J., Brlek, S., Jockusch, W., Plouffe, S., Sagan, B.E.: A sequence related to that of Thue-Morse. Discrete Mathematics\u00a0139, 455\u2013461 (1995)","journal-title":"Discrete Mathematics"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4471-0551-0_1","volume-title":"Sequences and Their applications (Proc. SETA 1998)","author":"J.-P. Allouche","year":"1999","unstructured":"Allouche, J.-P., Shallit, J.: The ubiquitous prouhet-thue-morse sequence. In: Ding, C., Helleseth, T., Niederreiter, H. (eds.) Sequences and Their applications (Proc. SETA 1998), pp. 1\u201316. Springer, Heidelberg (1999)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Caltais, G., Goriac, E.-I., Lucanu, D., Grigora\u015f, G.: A Rewrite Stack Machine for ROC! Technical Report TR 08-02, \u201cAl.I.Cuza\u201d University of Ia\u015fi, Faculty of Computer Science (2008), http:\/\/www.infoiasi.ro\/~tr\/tr.pl.cgi","DOI":"10.1109\/SYNASC.2008.76"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-40020-2_12","volume-title":"Recent Trends in Algebraic Development Techniques","author":"J. Goguen","year":"2003","unstructured":"Goguen, J., Lin, K., Ro\u015fu, G.: Conditional circular coinductive rewriting with case analysis. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2003. LNCS, vol.\u00a02755, pp. 216\u2013232. Springer, Heidelberg (2003)"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Grigora\u015f, G., Caltais, D.L.G., Goriac, E.: Automated proving of the behavioral attributes. Accepted for the 4th Balkan Conference in Informatics, BCI 2009 (2009)","DOI":"10.1109\/BCI.2009.40"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Lucanu, D., Ro\u015fu, G.: Circular Coinduction with Special Contexts. Technical Report UIUCDCS-R-2009-3039, University of Illinois at Urbana-Champaign (submitted, 2009)","DOI":"10.1007\/978-3-642-10373-5_33"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-73859-6_25","volume-title":"Algebra and Coalgebra in Computer Science","author":"D. Lucanu","year":"2007","unstructured":"Lucanu, D., Ro\u015fu, G.: Circ: A circular coinductive prover. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol.\u00a04624, pp. 372\u2013378. Springer, Heidelberg (2007)"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/978-3-642-03741-2_10","volume-title":"CALCO 2009","author":"G. Ro\u015fu","year":"2009","unstructured":"Ro\u015fu, G., Lucanu, D.: Circular Coinduction \u2013A Proof Theoretical Foundation. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol.\u00a05728, pp. 127\u2013144. Springer, Heidelberg (2009)"},{"key":"30_CR9","volume-title":"Fractals, Chaos, Power Laws","author":"M.R. Schroeder","year":"1991","unstructured":"Schroeder, M.R.: Fractals, Chaos, Power Laws. W.H. Freeman, New York (1991)"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Zantema, H.: Well-definedness of streams by termination (submitted, 2009)","DOI":"10.1007\/978-3-642-02348-4_12"}],"container-title":["Lecture Notes in Computer Science","Algebra and Coalgebra in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03741-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:17:03Z","timestamp":1558523823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03741-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642037405","9783642037412"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03741-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}