{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T08:23:05Z","timestamp":1649060585152},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Languages"],"published-print":{"date-parts":[[1989,1]]},"DOI":"10.1016\/0096-0551(89)90019-2","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T19:04:53Z","timestamp":1060283093000},"page":"125-136","source":"Crossref","is-referenced-by-count":1,"title":["A probabilistic analysis of loop programs"],"prefix":"10.1016","volume":"14","author":[{"given":"M.E.","family":"Szabo","sequence":"first","affiliation":[]},{"given":"E.J.","family":"Farkas","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(89)90019-2_BIB1","series-title":"Proc. 22nd Nat. Conf. of the ACM","first-page":"465","article-title":"The complexity of loop programs","author":"Meyer","year":"1967"},{"key":"10.1016\/0096-0551(89)90019-2_BIB2","series-title":"Theory of Computation","author":"Brainerd","year":"1974"},{"key":"10.1016\/0096-0551(89)90019-2_BIB3","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0096-0551(89)90019-2_BIB4","series-title":"Graphs, Networks, and Algorithms","author":"Swamy","year":"1981"},{"key":"10.1016\/0096-0551(89)90019-2_BIB5","series-title":"Fundamentals of Network Analysis","author":"Phillips","year":"1981"},{"key":"10.1016\/0096-0551(89)90019-2_BIB6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/00207168608803501","article-title":"A hierarchy of loop programs over binary trees","volume":"19","author":"Fachini","year":"1986","journal-title":"Int. J. Comput. Math."},{"key":"10.1016\/0096-0551(89)90019-2_BIB7","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/S0019-9958(85)80018-8","article-title":"The equivalence problem and correctness formulas for a simple class of programs","volume":"65","author":"Ibarra","year":"1985","journal-title":"Inform. Control"},{"key":"10.1016\/0096-0551(89)90019-2_BIB8","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0019-9958(85)80019-X","article-title":"On simple programs with primitive conditional statements","volume":"65","author":"Ibarra","year":"1985","journal-title":"Inform. Control"},{"key":"10.1016\/0096-0551(89)90019-2_BIB9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0168-0072(88)90024-3","article-title":"On the programs-as-formulas interpretation of parallel programs in Peano arithmetic","volume":"37","author":"Farkas","year":"1988","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0096-0551(89)90019-2_BIB10","article-title":"A type structure for parallel programs","author":"Farkas","year":"1985"},{"key":"10.1016\/0096-0551(89)90019-2_BIB11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0096-0551(82)90003-0","article-title":"A measure of logical complexity of programs","volume":"7","author":"Iyengar","year":"1982","journal-title":"Comput. Lang."},{"key":"10.1016\/0096-0551(89)90019-2_BIB12","first-page":"267","article-title":"GERT: Graphical evaluation review technique I","volume":"17","author":"Pritsker","year":"1966","journal-title":"J. Ind. Engng"},{"key":"10.1016\/0096-0551(89)90019-2_BIB13","first-page":"293","article-title":"GERT: Graphical evaluation review technique II","volume":"17","author":"Pritsker","year":"1966","journal-title":"J. Ind. Engng"},{"key":"10.1016\/0096-0551(89)90019-2_BIB14","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1137\/0213021","article-title":"Verification of probabilistic programs","volume":"13","author":"Sharir","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0096-0551(89)90019-2_BIB15","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0096-0551(84)90006-7","article-title":"A measure of program complexity","volume":"9","author":"Stetter","year":"1984","journal-title":"Comput. Lang."},{"key":"10.1016\/0096-0551(89)90019-2_BIB16","first-page":"383","article-title":"On some arithmetically expressible properties of programs","volume":"21","author":"Szabo","year":"1987","journal-title":"Mathematical Problems in Computation Theory. Banach Center Publ."}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055189900192?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055189900192?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T03:23:19Z","timestamp":1552620199000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0096055189900192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["0096055189900192"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(89)90019-2","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}