{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T09:51:52Z","timestamp":1760521912448},"reference-count":43,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1976,1,1]],"date-time":"1976-01-01T00:00:00Z","timestamp":189302400000},"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":13712,"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":[[1976]]},"DOI":"10.1016\/0304-3975(76)90032-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"183-207","source":"Crossref","is-referenced-by-count":19,"title":["Correctness of parallel programs: The Church-Rosser approach"],"prefix":"10.1016","volume":"2","author":[{"given":"Barry K","family":"Rosen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(76)90032-3_BIB1","series-title":"Design and Optimization of Compilers","first-page":"89","article-title":"Code optimization and finite Church-Rosser systems","author":"Aho","year":"1972"},{"key":"10.1016\/0304-3975(76)90032-3_BIB2","first-page":"385","article-title":"A basis for program optimization","volume":"71","author":"Allen","year":"1972"},{"key":"10.1016\/0304-3975(76)90032-3_BIB3","first-page":"398","article-title":"Interprocedural data flow analysis","volume":"74","author":"Allen","year":"1974"},{"key":"10.1016\/0304-3975(76)90032-3_BIB4","series-title":"Tech. Rept. CS-73-01","article-title":"Proving assertions about parallel programs","author":"Ashcroft","year":"1973"},{"key":"10.1016\/0304-3975(76)90032-3_BIB5","first-page":"17","article-title":"Formalization of properties of parallel programs","volume":"6","author":"Ashcroft","year":"1970"},{"key":"10.1016\/0304-3975(76)90032-3_BIB6","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1147\/rd.183.0250","article-title":"On proving correctness of microprograms","volume":"18","author":"Birman","year":"1974","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0304-3975(76)90032-3_BIB7","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/SWAT.1973.14","article-title":"Mechanizable proofs about parallel processes","author":"Cadiou","year":"1973","journal-title":"Proc. 14th Ann. IEEE Symp. on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(76)90032-3_BIB8","series-title":"Second Colloq. on Automata, Languages, and Programming","first-page":"170","article-title":"Application of Church-Rosser properties to increase the parallelism and efficiency of algorithms","volume":"14","author":"Dezani-Ciancaglini","year":"1974"},{"key":"10.1016\/0304-3975(76)90032-3_BIB9","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF01933419","article-title":"A constructive approach to the problem of program correctness","volume":"8","author":"Dijkstra","year":"1968","journal-title":"BIT"},{"key":"10.1016\/0304-3975(76)90032-3_BIB10","series-title":"Programming Languages","first-page":"43","article-title":"Co-operating sequential processes","author":"Dijkstra","year":"1968"},{"key":"10.1016\/0304-3975(76)90032-3_BIB11","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","article-title":"Assigning meanings to programs","volume":"19","author":"Floyd","year":"1967","journal-title":"Proc. Symp. Appl. Math."},{"key":"10.1016\/0304-3975(76)90032-3_BIB12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/SWAT.1974.13","article-title":"Initial algebra semantics","author":"Goguen","year":"1974","journal-title":"Proc. 15th Ann. IEEE Symp. on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(76)90032-3_BIB13","article-title":"Locking","author":"Gray","year":"1970","journal-title":"Proc. ACM Conf. on Concurrent Systems and Parallel Computation"},{"key":"10.1016\/0304-3975(76)90032-3_BIB14","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/0201014","article-title":"Flow graph reducibility","volume":"1","author":"Hect","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(76)90032-3_BIB15","first-page":"207","article-title":"Analysis of a simple algorithm for global flow problems","author":"Hecht","year":"1973","journal-title":"Proc. ACM Symp. on Princ. of Programming Languages"},{"key":"10.1016\/0304-3975(76)90032-3_BIB16","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","article-title":"Parallel program schemata","volume":"3","author":"Karp","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(76)90032-3_BIB17","article-title":"A fundamental theorem of asynchronous parallel computation","author":"Keller","year":"1974","journal-title":"3rd Ann. Sagamore Conf."},{"key":"10.1016\/0304-3975(76)90032-3_BIB18","series-title":"Rept. 159(revised)","article-title":"On proving correctness of parallel programs","author":"Keller","year":"1975"},{"issue":"A","key":"10.1016\/0304-3975(76)90032-3_BIB19","first-page":"5","article-title":"A global flow analysis algorithm","volume":"3","author":"Kennedy","year":"1971","journal-title":"Internl. J. Comput. Math."},{"key":"10.1016\/0304-3975(76)90032-3_BIB20","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01692511","article-title":"Semantics of context-free languages","volume":"2","author":"Knuth","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(76)90032-3_BIB21","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/S0022-0000(74)80043-7","article-title":"Analysis of structured programs","volume":"9","author":"Kosaraju","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(76)90032-3_BIB22","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00288636","article-title":"On procedures as open subroutines II","volume":"3","author":"Langmaack","year":"1974","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(76)90032-3_BIB23","series-title":"Ph.D. Thesis","article-title":"Correctness in operating systems","author":"Lauer","year":"1972"},{"key":"10.1016\/0304-3975(76)90032-3_BIB24","first-page":"230","article-title":"Limitations of synchronization primitives with conditional branching and global variables","author":"Lipton","year":"1974","journal-title":"Proc. 6th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(76)90032-3_BIB25","first-page":"78","article-title":"Reduction: a new method of proving properties of systems of processes","author":"Lipton","year":"1975","journal-title":"Proc. 2nd ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(76)90032-3_BIB26","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/362835.362838","article-title":"Object code optimization","volume":"12","author":"Lowry","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(76)90032-3_BIB27","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0022-0000(69)80009-7","article-title":"The correctness of programs","volume":"3","author":"Manna","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(76)90032-3_BIB28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(70)90002-0","article-title":"The correctness of nondeterministic programs","volume":"1","author":"Manna","year":"1970","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(76)90032-3_BIB29","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0022-0000(71)80035-1","article-title":"Mathematical theory of partial correctness","volume":"5","author":"Manna","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(76)90032-3_BIB30","first-page":"481","article-title":"An algebraic definition of simulation between programs","author":"Milner","year":"1971","journal-title":"Second Internat. Joint Conf. on Artificial Intelligence"},{"key":"10.1016\/0304-3975(76)90032-3_BIB31","first-page":"144","article-title":"Advice on structuring compilers and proving them correct","author":"Morris","year":"1973","journal-title":"Proc. ACM Symp. on Princ. of Programming Languages"},{"key":"10.1016\/0304-3975(76)90032-3_BIB32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/366193.366201","volume":"6","year":"1963","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(76)90032-3_BIB33","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/BF01966091","article-title":"Proof of algorithms by general snapshots","volume":"6","author":"Naur","year":"1966","journal-title":"BIT"},{"key":"10.1016\/0304-3975(76)90032-3_BIB34","first-page":"221","article-title":"On some families of languages related to the Dyck language","author":"Nivat","year":"1970","journal-title":"Proc. 2nd ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(76)90032-3_BIB35","series-title":"Report CU-CS-055-74","article-title":"Data flow analysis as an aid in documentation, assertion generation, validation, and error detection","author":"Osterweil","year":"1974"},{"key":"10.1016\/0304-3975(76)90032-3_BIB36","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1145\/355609.362337","article-title":"On the capabilities of while, repeat, and exit statements","volume":"16","author":"Peterson","year":"1973","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(76)90032-3_BIB37","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","article-title":"Tree-manipulating systems and Church-Rosser theorems","volume":"20","author":"Rosen","year":"1973","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(76)90032-3_BIB38","article-title":"Data flow analysis for recursive PL\/I programs","author":"Rosen","year":"1975","journal-title":"IBM Research Rept. RC 5211"},{"key":"10.1016\/0304-3975(76)90032-3_BIB39","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1145\/321850.321862","article-title":"Testing for the Church-Rosser property","volume":"21","author":"Sethi","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(76)90032-3_BIB40","series-title":"Ph.D. Thesis","article-title":"Proving that computer programs terminate cleanly","author":"Sites","year":"1974"},{"key":"10.1016\/0304-3975(76)90032-3_BIB41","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1137\/0203006","article-title":"Finding dominators in directed graphs","volume":"3","author":"Tarjan","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(76)90032-3_BIB42","first-page":"408","article-title":"Programming without the GOTO","volume":"71","author":"Wulf","year":"1972"},{"issue":"11","key":"10.1016\/0304-3975(76)90032-3_BIB43","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/987361.987372","article-title":"A case against the GOTO","volume":"7","author":"Wulf","year":"1972","journal-title":"SIGPLAN Notices"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900323?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900323?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:21:06Z","timestamp":1555125666000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900323"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1976]]}},"alternative-id":["0304397576900323"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90032-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1976]]}}}