{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T04:36:25Z","timestamp":1792902985594,"version":"4.5.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/cit.2004.1357338","type":"proceedings-article","created":{"date-parts":[[2004,12,23]],"date-time":"2004-12-23T04:34:02Z","timestamp":1103776442000},"page":"1073-1080","source":"Crossref","is-referenced-by-count":1,"title":["Supporting case analysis with algebraic speci .cation languages"],"prefix":"10.1109","author":[{"given":"T.","family":"Seino","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"K.","family":"Ogata","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"K.","family":"Futatsugi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"CafeOBJ web site"},{"key":"ref2","volume-title":"Tatami homepage"},{"key":"ref3","volume-title":"CafeOBJ report. Number 6 in AMAST Series in Computing. World Sci-entific","author":"Diaconescu","year":"1998"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/32.908957"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MMSE.2000.897186"},{"key":"ref6","author":"Nipkow","year":"2002","journal-title":"Is-abeile\/H\u2019Ol, - A Proof Assistant for Higer-Order Logic, volume 2283 of LNCS."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46674-6_24"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2001.925137"},{"key":"ref9","first-page":"181","article-title":"Formal analysis of suzuki&kasami distributed mutual exclusion algorithm","volume-title":"FMOODS\u201902","author":"Ogata","year":"2002"},{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1016\/S1571-0661(05)82536-8","article-title":"Rewriting-based verification of authentication protocols","volume-title":"Proceedings of WRLA \u201902, volume 71 of ENTCS.","author":"Ogata"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39958-2_12"},{"issue":"6","key":"ref12","first-page":"1471","article-title":"Specification and verification of a single-track railroad signaling in CafeOBJ","volume":"E84-A","author":"Seino","year":"2001","journal-title":"IEICE TRANSACTIONS on Fundamental of Electronics, Communications and Computer Sci-ence"},{"key":"ref13","first-page":"357","article-title":"PVS Tu-torial","author":"Shankar","year":"1993","journal-title":"Computer Science Laboratory, SRI International, Menlo Park, CA, Feb. 1993. Also appears in Tutorial Notes, em Formal Methods Europe \u201993: Industrial-Strength Formal Methods"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36384-X_23"}],"event":{"name":"The Fourth International Conference onComputer and Information Technology, 2004. CIT '04.","location":"Wuhan, China"},"container-title":["The Fourth International Conference onComputer and Information Technology, 2004. CIT '04."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9381\/29791\/01357338.pdf?arnumber=1357338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T04:31:51Z","timestamp":1792902711000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1357338\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/cit.2004.1357338","relation":{},"subject":[]}}