{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T18:39:44Z","timestamp":1761590384562,"version":"build-2065373602"},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4064,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["The Journal of Logic and Algebraic Programming"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s1567-8326(02)00019-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:15:57Z","timestamp":1027638957000},"page":"157-174","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Program algebra with unit instruction operators"],"prefix":"10.1016","volume":"51","author":[{"given":"Alban","family":"Ponse","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1567-8326(02)00019-X_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00003928","article-title":"Program algebra for component code","volume":"12","author":"Bergstra","year":"2000","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/S1567-8326(02)00019-X_BIB2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S1567-8326(02)00018-8","article-title":"Program algebra for sequential code","volume":"51","author":"Bergstra","year":"2002","journal-title":"J. Logic Algebr. Programming"},{"year":"2000","series-title":"The Java Language Specification","author":"Bracha","key":"10.1016\/S1567-8326(02)00019-X_BIB3"},{"key":"10.1016\/S1567-8326(02)00019-X_BIB4","series-title":"Handbook of Process Algebra","first-page":"391","article-title":"Equivalence and preorder checking for finite-state systems","author":"Cleaveland","year":"2001"},{"year":"1988","series-title":"The C Programming Language","author":"Kernighan","key":"10.1016\/S1567-8326(02)00019-X_BIB5"},{"key":"10.1016\/S1567-8326(02)00019-X_BIB6","series-title":"Proceedings of the 5th GI (Gesellschaft f\u00fcr Informatik) Conference, Karlsruhe","first-page":"167","article-title":"Concurrency and automata on infinite sequences","author":"Park","year":"1981"}],"container-title":["The Journal of Logic and Algebraic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S156783260200019X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S156783260200019X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T18:33:30Z","timestamp":1761590010000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S156783260200019X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S156783260200019X"],"URL":"https:\/\/doi.org\/10.1016\/s1567-8326(02)00019-x","relation":{},"ISSN":["1567-8326"],"issn-type":[{"type":"print","value":"1567-8326"}],"subject":[],"published":{"date-parts":[[2002,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Program algebra with unit instruction operators","name":"articletitle","label":"Article Title"},{"value":"The Journal of Logic and Algebraic Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1567-8326(02)00019-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}