{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:15:22Z","timestamp":1761610522723,"version":"build-2065373602"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4958,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/s1571-0661(05)80128-8","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"2-23","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Behavioral and Coinductive Rewriting (invited talk)"],"prefix":"10.1016","volume":"36","author":[{"given":"Joseph","family":"Goguen","sequence":"first","affiliation":[]},{"given":"Kai","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Grigore","family":"Ro\u015fu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1996","series-title":"Vicious Circles: On the Mathematics of Non-wellfounded Phenomena.","author":"Barwise","key":"10.1016\/S1571-0661(05)80128-8_BIB1"},{"key":"10.1016\/S1571-0661(05)80128-8_BIB2","unstructured":"Michel Bidoit and Rolf Hennicker. Observer complete definitions are behaviourally coherent. In Kokichi Futatsugi, Joseph Goguen, and Jos\u00e9 Meseguer, editors, OBJ\/CafeOBJ\/Maude at Formal Methods '99, pages 83-94. Theta, 1999. Proceedings of a workshop held in Toulouse, France, 20th and 22nd September 1999."},{"key":"10.1016\/S1571-0661(05)80128-8_BIB3","doi-asserted-by":"crossref","unstructured":"Samuel Buss and Grigore Ro\u015fu. Incompleteness of behavioral logics. In Horst Reichel, editor, Proceedings of Coalgebraic Methods in Computer Science (CMCS'OO), Berlin, Germany, March 2000, volume 33 of Electronic Notes in Theoretical Computer Science, pages 61-79. Elsevier Science, 2000.","DOI":"10.1016\/S1571-0661(05)80756-X"},{"key":"10.1016\/S1571-0661(05)80128-8_BIB4","doi-asserted-by":"crossref","unstructured":"Manuel Clavel, Steven Eker, Patrick Lincoln, and Jos\u00e9 Meseguer. Principles of Maude. In Jos\u00e9 Meseguer, editor, Proceedings, First International Workshop on Rewriting Logic and its Applications. Elsevier Science, 1996. Volume 4, Electronic Notes in Theoretical Computer Science.","DOI":"10.1016\/S1571-0661(04)00034-9"},{"key":"10.1016\/S1571-0661(05)80128-8_BIB5","doi-asserted-by":"crossref","unstructured":"Louise Dennis, Alan Bundy, and Ian Green. Using a generalisation critic to find bisimulations for coinductive proofs. In William McCune, editor, Proceedings of the 14th Conference on Automated Deduction, volume 1249 of Lecture Notes in Artificial Inteligence, pages 276-290. Springer, 1996.","DOI":"10.1007\/3-540-63104-6_29"},{"year":"1998","series-title":"Cafe OBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification","author":"Diaconescu","key":"10.1016\/S1571-0661(05)80128-8_BIB6"},{"key":"10.1016\/S1571-0661(05)80128-8_BIB7","unstructured":"Ra\u0103zvan Diaconescu and Kokichi Futatsugi. Behavioral coherence in object-oriented algebraic specification. Journal of Universal Computer Science, 6(1):74-96, 2000. Also Japan Advanced Institute for Science and Technology Technical Report number IS-RR-98-0017F, 1998."},{"key":"10.1016\/S1571-0661(05)80128-8_BIB8","doi-asserted-by":"crossref","unstructured":"Joseph Goguen. Types as theories. In George Michael Reed, Andrew William Roscoe, and Ralph F. Wachter, editors, Topology and Category Theory in Computer Science, pages 357-390. Oxford, 1991. Proceedings of a Conference held at Oxford, June 1989.","DOI":"10.1093\/oso\/9780198537601.003.0014"},{"key":"10.1016\/S1571-0661(05)80128-8_BIB9","doi-asserted-by":"crossref","unstructured":"Joseph Goguen and Ra\u0103zvan Diaconescu. Towards an algebraic semantics for the object paradigm. In Hartmut Ehrig and Fernando Orejas, editors, Proceedings, Tenth Workshop on Abstract Data Types, pages 1-29. Springer, 1994. Lecture Notes in Computer Science, Volume 785.","DOI":"10.1007\/3-540-57867-6_1"},{"key":"10.1016\/S1571-0661(05)80128-8_BIB10","doi-asserted-by":"crossref","unstructured":"Joseph Goguen, Kai Lin, and Grigore Ro\u015fu. Circular coinductive rewriting. In Proceedings, Automated Software Engineering (ASE'OO). IEEE, 2000. to appear.","DOI":"10.1109\/ASE.2000.873657"},{"year":"1996","series-title":"Algebraic Semantics of Imperative Programs","author":"Goguen","key":"10.1016\/S1571-0661(05)80128-8_BIB11"},{"issue":"3","key":"10.1016\/S1571-0661(05)80128-8_BIB12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1017\/S0960129599002777","article-title":"Hidden coinduction: Behavioral correctness proofs for objects","volume":"9","author":"Goguen","year":"1999","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(05)80128-8_BIB13","first-page":"97","article-title":"A hidden agenda","author":"Goguen","year":"1997","journal-title":"Theoretical Computer Science, to appear. Also UCSD Dept. Computer Science & Eng. Technical Report CS"},{"key":"10.1016\/S1571-0661(05)80128-8_BIB14","doi-asserted-by":"crossref","unstructured":"Joseph Goguen and Grigore Ro\u0394u. Hiding more of hidden algebra. In FM'99 -Formal Methods, pages 1704-1719. Springer, 1999. Lecture Notes in Computer Sciences, Volume 1709, Proceedings of World Congress on Formal Methods, Toulouse, France.","DOI":"10.1007\/3-540-48118-4_40"},{"key":"10.1016\/S1571-0661(05)80128-8_BIB15","series-title":"Software Engineering with OBJ: Algebraic Specification in Action","article-title":"Introducing OBJ","author":"Goguen","year":"2000"},{"issue":"4","key":"10.1016\/S1571-0661(05)80128-8_BIB16","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/BF01642507","article-title":"Context induction: a proof principle for behavioral abstractions","volume":"3","author":"Hennicker","year":"1991","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/S1571-0661(05)80128-8_BIB17","first-page":"263","article-title":"Observational logic","author":"Hennicker","year":"1999"},{"key":"10.1016\/S1571-0661(05)80128-8_BIB18","first-page":"222","article-title":"A tutorial on (co)algebras and (co)induction","volume":"62","author":"Jacobs","year":"1997","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80128-8_BIB19","doi-asserted-by":"crossref","unstructured":"Peter Padawitz. Swinging data types: Syntax, semantics, and theory. In Proceedings, WADT'95, volume 1130 of Lecture Notes in Computer Science, pages 409-435. Springer, 1996.","DOI":"10.1007\/3-540-61629-2_56"},{"key":"10.1016\/S1571-0661(05)80128-8_BIB20","unstructured":"Grigore Ro\u015fu. Behavioral coinductive rewriting. In Kokichi Futatsugi, Joseph Goguen, and Jos\u00e9 Meseguer, editors, OBJ\/CafeOBJ\/Maude at Formal Methods '99, pages 179-196. Theta, 1999. Proceedings of a workshop held in Toulouse, France, 20th and 22nd September 1999."},{"key":"10.1016\/S1571-0661(05)80128-8_BIB21","unstructured":"Grigore Ro\u015fu. Hidden Logic. PhD thesis, University of California at San Diego, 2000."},{"key":"10.1016\/S1571-0661(05)80128-8_BIB22","series-title":"Automated Deduction in Classical and Non-Classical Logics","first-page":"252","article-title":"Hidden congruent deduction","author":"Ro\u015fu","year":"2000"},{"key":"10.1016\/S1571-0661(05)80128-8_BIB23","article-title":"Circular coinduction","author":"Ro\u015fu","year":"2000","journal-title":"Technical Report CSE2000\u20130647, University of California at San Diego"},{"key":"10.1016\/S1571-0661(05)80128-8_BIB24","first-page":"357","article-title":"PVS Tutorial","author":"Shankar","year":"1993"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105801288?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105801288?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:51Z","timestamp":1761610131000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105801288"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":24,"alternative-id":["S1571066105801288"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80128-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Behavioral and Coinductive Rewriting (invited talk)","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80128-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}