{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T14:41:27Z","timestamp":1698504087236},"reference-count":8,"publisher":"Wiley","issue":"10","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":4097,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp;amp; Computers in Japan"],"published-print":{"date-parts":[[1996,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We define an algebraic specification having a framework for error handling and give an algorithm for automatically appending error description. Generally, error description in algebraic specification is so complicated that it is difficult to comprehend and inconsistencies arise if handwritten. Therefore, it is effective to add error description automatically to algebraic specification that has no error description and without creating any inconsistency. Error constructors are introduced that represent error values as a framework for error handling. When there exists a term which is not equal to any constructor term, an equation to equalize the term and an error constructor are appended. To avoid inconsistency, i.e., normal value and error value become equal, we distinguish three kinds of variables. Some variables can be substituted for only by normal terms, some variables can be replaced only by error terms and some variables can be replaced by any term. Moreover, we show correctness of automatic error description addition; i.e., partitioning of terms in the normal part of sort is preserved before and after error description addition.<\/jats:p>","DOI":"10.1002\/scj.4690271006","type":"journal-article","created":{"date-parts":[[2007,7,8]],"date-time":"2007-07-08T09:55:15Z","timestamp":1183888515000},"page":"59-67","source":"Crossref","is-referenced-by-count":0,"title":["Error description on algebraic specification and its automatic addition"],"prefix":"10.1002","volume":"27","author":[{"given":"Takeshi","family":"Hamaguchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinichirou","family":"Yamamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kiyshi","family":"Agusa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiko","family":"Sakai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1985.232207"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90056-2"},{"key":"e_1_2_1_4_2","first-page":"80","volume-title":"An initial algebra approach to the specification, correctness and implementation of abstract data types","author":"Goguen J. A.","year":"1978"},{"key":"e_1_2_1_5_2","unstructured":"T.Hamaguchi M.Sakai S.YamamotoandK.Agusa.Making Term Rewriting System Well\u2010Covered. Proceedings of Conference of Tokai Branch Association of Electric Societies p.294(1992)."},{"key":"e_1_2_1_6_2","unstructured":"T.Hamaguchi M.Sakai S.YamamotoandK.Agusa.Automatic Error Description Addition to Algebraic Specification.Technical Report I.E.I.C.E. SS92\u201026(1993)."},{"issue":"1","key":"e_1_2_1_7_2","first-page":"47","article-title":"Basics of Algebraic Specification of Abstract Data Type (1), Multi Sort Algebra and Equivalence Equation Logic","volume":"25","author":"Inagaki Y.","year":"1984","journal-title":"Information Processing"},{"key":"e_1_2_1_8_2","series-title":"LNCS, 204","first-page":"348","volume-title":"Completeness in data type specifications","author":"Kounalis E.","year":"1985"},{"key":"e_1_2_1_9_2","unstructured":"Y.Toyama.How to prove equivalence of term rewriting without induction. Theoretical Computer Science pp.369\u2013390(1991)."}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690271006","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690271006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T21:10:14Z","timestamp":1698441014000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690271006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":8,"journal-issue":{"issue":"10","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["10.1002\/scj.4690271006"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690271006","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}