{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T16:51:57Z","timestamp":1694623917519},"reference-count":3,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[1994,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>UNITY, introduced by Chandy and Misra [ChM88], is a programming logic intended to reason about temporal properties of distributed programs. Despite the fact that UNITY does not have the full power of, for example, linear temporal logic, it enjoys popularity due to its simplicity.<\/jats:p>\n          <jats:p>There was however a serious problem with the Substitution Rule. The logic is incomplete without the rule, and with the rule it is inconsistent.<\/jats:p>\n          <jats:p>Latterly Beverly Sanders introduced the concept of strongest invariant and proposed a new definition for UNITY [San91] that fixes the problem with the Substitution Rule. For the benefit of program union, she also introduced the concept of subscripted properties and claimed a generalized version of Substitution Rule for the subscripted properties.<\/jats:p>\n          <jats:p>This report presents an example that shows that the latter claim is false. A proposal as how to fix this follows.<\/jats:p>","DOI":"10.1007\/bf01211309","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T22:17:40Z","timestamp":1109369860000},"page":"466-470","source":"Crossref","is-referenced-by-count":2,"title":["Error in the UNITY substitution rule for subscripted operators"],"prefix":"10.1145","volume":"6","author":[{"given":"I. S. W. B.","family":"Prasetya","sequence":"first","affiliation":[{"name":"Rijksuniversiteit Utrecht Vakgroep Informatica, Postbus 80.089, 3508, TB Utrecht, Nederland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","doi-asserted-by":"crossref","unstructured":"Chandy K. M. and Misra J.: Parallel Program Design a Foundation . Addison-Wesley 1988.","DOI":"10.1007\/978-1-4613-9668-0_6"},{"key":"e_1_2_1_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01898402"},{"key":"e_1_2_1_2_3_2","unstructured":"Misra J.: Soundness of the Substitution Axiom . Notes on UNITY: 14\u201390."}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01211309.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01211309\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/BF01211309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:19:34Z","timestamp":1641482374000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/BF01211309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":3,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["10.1007\/BF01211309"],"URL":"https:\/\/doi.org\/10.1007\/bf01211309","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}