{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:37:41Z","timestamp":1720201061444},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10059,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1986]]},"DOI":"10.1016\/0304-3975(86)90033-2","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"261-284","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["The automated proof of a trace transformation for a bitonic sort"],"prefix":"10.1016","volume":"46","author":[{"given":"Chua-Huang","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Lengauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90033-2_BIB1","series-title":"A Computational Logic","author":"Boyer","year":"1979"},{"key":"10.1016\/0304-3975(86)90033-2_BIB2","author":"Boyer","year":"1979"},{"key":"10.1016\/0304-3975(86)90033-2_BIB3","series-title":"Series in Automatic Computation","article-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0304-3975(86)90033-2_BIB4","series-title":"Mathematical Logic and Programming Languages","first-page":"55","article-title":"Mechanical proofs about computer programs","author":"Good","year":"1985"},{"key":"10.1016\/0304-3975(86)90033-2_BIB5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF00288746","article-title":"Automatic program verification I: A logical basis and its implementation","volume":"4","author":"Igarashi","year":"1975","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(86)90033-2_BIB6","author":"Knuth","year":"1973"},{"issue":"1","key":"10.1016\/0304-3975(86)90033-2_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(82)90002-8","article-title":"A methodology for programming with concurrency: An informal presentation","volume":"2","author":"Lengauer","year":"1982","journal-title":"Sci. Comput. Programm."},{"issue":"1","key":"10.1016\/0304-3975(86)90033-2_BIB8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0167-6423(82)90003-X","article-title":"A methodology for programming with concurrency: The formalism","volume":"2","author":"Lengauer","year":"1982","journal-title":"Sci. Comput. Programm."},{"issue":"1","key":"10.1016\/0304-3975(86)90033-2_BIB9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF00244290","article-title":"On the role of automated theorem proving in the compile-time derivation of concurrency","volume":"1","author":"Lengauer","year":"1985","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/0304-3975(86)90033-2_BIB10","series-title":"Seminar on Concurrency","first-page":"131","article-title":"The static derivation of concurrency and its mechanized certification","volume":"197","author":"Lengauer","year":"1985"},{"key":"10.1016\/0304-3975(86)90033-2_BIB11","series-title":"Proc. 13th Ann. ACM Symp. on Principles of Programming Languages","first-page":"307","article-title":"A mechanically certified theorem about optimal concurrency of sorting networks","author":"Lengauer","year":"1986"},{"key":"10.1016\/0304-3975(86)90033-2_BIB12","article-title":"Compiler Specification and Verification","volume":"124","author":"Polak","year":"1981"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900332?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900332?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T16:53:42Z","timestamp":1553187222000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586900332"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":12,"alternative-id":["0304397586900332"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90033-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}