{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T02:09:18Z","timestamp":1648951758017},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Research Foundation of Young Teachers in Sichuan University of P.R. China","award":["2011SCU11120"],"award-info":[{"award-number":["2011SCU11120"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IIEEE Trans. Software Eng."],"published-print":{"date-parts":[[2016,9,1]]},"DOI":"10.1109\/tse.2016.2521379","type":"journal-article","created":{"date-parts":[[2016,2,3]],"date-time":"2016-02-03T19:11:56Z","timestamp":1454526716000},"page":"866-885","source":"Crossref","is-referenced-by-count":1,"title":["Software Reliability Analysis Using Weakest Preconditions in Linear Assignment Programs"],"prefix":"10.1109","volume":"42","author":[{"given":"Hang","family":"Luo","sequence":"first","affiliation":[]},{"given":"Xue","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xi","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Ting","family":"Long","sequence":"additional","affiliation":[]},{"given":"Ronghua","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE.2014.20"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2014.01.010"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2009.09.009"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF00290145"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264277"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.ipl.2004.10.015","article-title":"Efficient weakest preconditions","volume":"93","author":"rustan","year":"2005","journal-title":"Inf Process Lett"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1108768.1108813"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1093\/comjnl\/bxn075","article-title":"Slicing execution with partial weakest precondition for model abstraction of C programs","volume":"53","author":"xuejun","year":"2010","journal-title":"The Comput J"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/360204.360220"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.ipl.2004.10.015","article-title":"Efficient weakest preconditions","volume":"93","author":"rustan","year":"2005","journal-title":"Inf Process Lett"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512558"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542517"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_48"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/360933.360975"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375616"},{"key":"ref3","first-page":"33","author":"mecarthy","year":"1963","journal-title":"A Basis for A Mathematical Theory of Computation"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-3228-5"},{"key":"ref5","author":"dijkstra","year":"1976","journal-title":"A Discipline of Programming"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2012.05.009"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23283-1_13"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-8795-1"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","article-title":"Assigning meanings to programs","volume":"19","author":"floyd","year":"0","journal-title":"Proc Symp Appl Math"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2012.05.006"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1041685.1029907"},{"key":"ref22","article-title":"Building a better back trace: Techniques for postmortem program analysis","author":"liblit","year":"2002"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/32.232013"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1984.5010248"},{"key":"ref23","first-page":"121","article-title":"A survey of program slicing techniques","volume":"3","author":"tip","year":"1995","journal-title":"J Program Lang"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISoLA.2006.69"},{"key":"ref25","first-page":"109","article-title":"Verification of C programs using slicing execution","author":"yi","year":"0","journal-title":"Proc Int Conf Quality Softw"}],"container-title":["IEEE Transactions on Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/32\/7569153\/07398131.pdf?arnumber=7398131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:03:19Z","timestamp":1642003399000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7398131\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,1]]},"references-count":31,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tse.2016.2521379","relation":{},"ISSN":["0098-5589","1939-3520"],"issn-type":[{"value":"0098-5589","type":"print"},{"value":"1939-3520","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,1]]}}}