{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T09:50:58Z","timestamp":1672739458437},"reference-count":24,"publisher":"Elsevier BV","issue":"13","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":["Information and Software Technology"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0950-5849(02)00106-4","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T18:05:40Z","timestamp":1034100340000},"page":"733-741","source":"Crossref","is-referenced-by-count":4,"title":["Concurrent Ada dead statements detection"],"prefix":"10.1016","volume":"44","author":[{"given":"Zhenqiang","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baowen","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongji","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianjun","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0950-5849(02)00106-4_BIB1","unstructured":"ISO\/IEC 8652:(E), Ada Reference Manual\u2013Language and Standard Libraries, 1995."},{"issue":"1","key":"10.1016\/S0950-5849(02)00106-4_BIB2","first-page":"53","article-title":"An overview of Ada 95","volume":"34","author":"Xu","year":"1997","journal-title":"Journal of Computer Research and Development"},{"key":"10.1016\/S0950-5849(02)00106-4_BIB3","first-page":"147","article-title":"A compact Petri Net representation for concurrent programs","author":"Dwyer","year":"1995","journal-title":"Proceedings of the Seventeenth International Conference on Software Engineering, Seattle"},{"issue":"11","key":"10.1016\/S0950-5849(02)00106-4_BIB4","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1109\/32.553699","article-title":"A compact Petri Net representation and its implications for analysis","volume":"22","author":"Dwyer","year":"1996","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"4","key":"10.1016\/S0950-5849(02)00106-4_BIB5","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1109\/71.80172","article-title":"Design and implementation of a Petri Net based toolkit for Ada tasking analysis","volume":"1","author":"Shatz","year":"1990","journal-title":"IEEE Transactions on Parallel and Distributed System"},{"issue":"12","key":"10.1016\/S0950-5849(02)00106-4_BIB6","doi-asserted-by":"crossref","first-page":"1307","DOI":"10.1109\/71.553301","article-title":"An application of Petri Net reduction for Ada tasking deadlock analysis","volume":"7","author":"Shatz","year":"1996","journal-title":"IEEE Transaction on Parallel and Distributed Systems"},{"issue":"2","key":"10.1016\/S0950-5849(02)00106-4_BIB7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0096-0551(99)00014-4","article-title":"Compositional Petri Net models of advanced tasking in Ada-95","volume":"25","author":"Gedela","year":"1999","journal-title":"Computer Language"},{"key":"10.1016\/S0950-5849(02)00106-4_BIB8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF00263928","article-title":"Complexity of analysing the synchronisation structure of concurrent programs","volume":"19","author":"Taylor","year":"1983","journal-title":"Acta Informatica"},{"issue":"5","key":"10.1016\/S0950-5849(02)00106-4_BIB9","first-page":"129","article-title":"Non-concurrency analysis","volume":"28","author":"Masticola","year":"1993","journal-title":"Proceedings of the 12th Symposium on Principles and Practices of Parallel Programming, San Diego, CA, ACM SIGPLAN Notices"},{"key":"10.1016\/S0950-5849(02)00106-4_BIB10","first-page":"36","article-title":"Concurrency analysis in the presence of procedures using a data flow framework","volume":"October","author":"Duesterwald","year":"1991","journal-title":"Proceedings of the ACM SIGSOFT Fourth Workshop on Software Testing, Analysis, and Verification, Victoria, BC"},{"key":"10.1016\/S0950-5849(02)00106-4_BIB11","series-title":"Proceedings of the Sixth International Symposium on the Foundation of Software Engneering","author":"Naumovich","year":"1998"},{"key":"10.1016\/S0950-5849(02)00106-4_BIB12","doi-asserted-by":"crossref","unstructured":"G. Naumovich et al., An efficient algorithm for computing MHP information for concurrent Java programs, ESEC\/FSE'99, pp. 338\u2013354.","DOI":"10.1007\/3-540-48166-4_21"},{"issue":"10","key":"10.1016\/S0950-5849(02)00106-4_BIB13","first-page":"265","article-title":"Detecting all pairs of statements in parallel programs","volume":"36","author":"Chen","year":"2000","journal-title":"Journal of Nanjing University (Natural Sciences)"},{"key":"10.1016\/S0950-5849(02)00106-4_BIB14","first-page":"225","article-title":"Symbolic data flow analysis for detecting deadlocks in Ada tasking programs","author":"Blieberger","year":"2000","journal-title":"Proceedings of Ada-Europe'2000, Germany"},{"key":"10.1016\/S0950-5849(02)00106-4_BIB15","unstructured":"S.P. Masticola, Detecting deadlocks in the Ada Accept\u2026Do and Select Constructs, http:\/\/www.cs.rutgers.edu\/pub\/technical-reports\/lcsr-tr-190."},{"key":"10.1016\/S0950-5849(02)00106-4_BIB16","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1145\/381837.381846","article-title":"A classification on tasking deadlocks","volume":"May\/June","author":"Cheng","year":"1990","journal-title":"Ada Letters"},{"key":"10.1016\/S0950-5849(02)00106-4_BIB17","first-page":"125","article-title":"Analysing Ada tasking deadlocks and livelocks using extended Petri Nets","volume":"499","author":"Cheng","year":"1991","journal-title":"LNCS"},{"key":"10.1016\/S0950-5849(02)00106-4_BIB18","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1145\/122037.122040","article-title":"A survey of Ttasking deadlock detection methods","volume":"January\/February","author":"Cheng","year":"1991","journal-title":"Ada Letters"},{"key":"10.1016\/S0950-5849(02)00106-4_BIB19","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/154183.154197","article-title":"Using state space reduction methods for deadlock analysis in Ada tasking","author":"Duri","year":"1993","journal-title":"ISSTA"},{"issue":"3","key":"10.1016\/S0950-5849(02)00106-4_BIB20","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1109\/32.489078","article-title":"Evaluating deadlock detection methods for concurrent software","volume":"22","author":"Corbett","year":"1996","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"7","key":"10.1016\/S0950-5849(02)00106-4_BIB21","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/277633.277638","article-title":"Static slicing of threaded programs","volume":"33","author":"Krinke","year":"1998","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/S0950-5849(02)00106-4_BIB22","series-title":"Proceedings of APAQS'2000","author":"Chen","year":"2000"},{"issue":"4","key":"10.1016\/S0950-5849(02)00106-4_BIB23","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/375431.375420","article-title":"Slicing concurrent Java programs","volume":"36","author":"Chen","year":"2001","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/S0950-5849(02)00106-4_BIB24","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1145\/289524.289633","article-title":"Transforming Ada serving tasks into protected objects","author":"Li","year":"1998","journal-title":"SIGAda'98, Washington"}],"container-title":["Information and Software Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950584902001064?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950584902001064?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,8]],"date-time":"2020-03-08T03:44:47Z","timestamp":1583639087000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950584902001064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":24,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0950584902001064"],"URL":"https:\/\/doi.org\/10.1016\/s0950-5849(02)00106-4","relation":{},"ISSN":["0950-5849"],"issn-type":[{"value":"0950-5849","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}