{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T00:06:29Z","timestamp":1722038789807},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T00:00:00Z","timestamp":1573430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T00:00:00Z","timestamp":1573430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s11432-018-9847-0","type":"journal-article","created":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T03:02:25Z","timestamp":1573614145000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Implementing termination analysis on quantum programming"],"prefix":"10.1007","volume":"62","author":[{"given":"Shusen","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kan","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Runyao","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,11]]},"reference":[{"key":"9847_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/173262.155095","volume":"28","author":"F Bourdoncle","year":"1993","unstructured":"Bourdoncle F. Abstract debugging of higher-order imperative languages. SIGPLAN Not, 1993, 28: 46\u201355","journal-title":"SIGPLAN Not"},{"key":"9847_CR2","doi-asserted-by":"crossref","unstructured":"Cook B, Podelski A, Rybalchenko A. Termination proofs for systems code. In: Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2006. 415\u2013426","DOI":"10.1145\/1133981.1134029"},{"key":"9847_CR3","doi-asserted-by":"crossref","unstructured":"Brockschmidt M, Cook B, Ishtiaq S, et al. T2: temporal property verification. In: Proceedings of International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2016. 387\u2013393","DOI":"10.1007\/978-3-662-49674-9_22"},{"key":"9847_CR4","doi-asserted-by":"crossref","unstructured":"Ying M S. Foundations of quantum programming. In: Proceedings of the 8th Asian Conference on Programming Languages and Systems, 2010","DOI":"10.1007\/978-3-642-17164-2_2"},{"key":"9847_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00236-010-0117-4","volume":"47","author":"M S Ying","year":"2010","unstructured":"Ying M S, Feng Y. Quantum loop programs. Acta Inform, 2010, 47: 221\u2013250","journal-title":"Acta Inform"},{"key":"9847_CR6","doi-asserted-by":"publisher","first-page":"1679","DOI":"10.1016\/j.scico.2013.03.016","volume":"78","author":"M S Ying","year":"2013","unstructured":"Ying M S, Yu N K, Feng Y, et al. Verification of quantum programs. Sci Comput Program, 2013, 78: 1679\u20131700","journal-title":"Sci Comput Program"},{"key":"9847_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00236-013-0185-3","volume":"51","author":"Y J Li","year":"2014","unstructured":"Li Y J, Yu N K, Ying M S. Termination of nondeterministic quantum programs. Acta Inform, 2014, 51: 1\u201324","journal-title":"Acta Inform"},{"key":"9847_CR8","doi-asserted-by":"crossref","unstructured":"Yu N K, Ying M S. Reachability and termination analysis of concurrent quantum programs. In: Proceedings of International Conference on Concurrency Theory, 2012. 69\u201383","DOI":"10.1007\/978-3-642-32940-1_7"},{"key":"9847_CR9","doi-asserted-by":"crossref","unstructured":"Li Y J, Ying M S. Algorithmic analysis of termination problems for quantum programs. In: Proceedings of ACM on Programming Languages, 2017","DOI":"10.1145\/3158123"},{"key":"9847_CR10","volume-title":"Matrix Analysis","author":"A R Horn","year":"1990","unstructured":"Horn A R, Johnson R C. Matrix Analysis. Cambridge: Cambridge University Press, 1990"},{"key":"9847_CR11","volume-title":"Completely Bounded Maps and Operator Algebras","author":"V Paulsen","year":"2002","unstructured":"Paulsen V. Completely Bounded Maps and Operator Algebras. Cambridge: Cambridge University Press, 2002"},{"key":"9847_CR12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1093\/oso\/9780198535645.003.0005","volume-title":"Reliable Numerical Computation","author":"T Beelen","year":"1990","unstructured":"Beelen T, van Dooren P M. Computational aspects of the Jordan canonical form. In: Reliable Numerical Computation. Oxford: Clarendon Press, 1990. 57\u201372"},{"key":"9847_CR13","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1360\/N112017-00095","volume":"47","author":"S S Liu","year":"2017","unstructured":"Liu S S, Zhou L, Guan J, et al. Q|SI\u232a: a quantum programming environment (in Chinese). Sci Sin Inform, 2017, 47: 1300\u20131315","journal-title":"Sci Sin Inform"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-018-9847-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-018-9847-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-018-9847-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T20:44:59Z","timestamp":1722026699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-018-9847-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,11]]},"references-count":13,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["9847"],"URL":"https:\/\/doi.org\/10.1007\/s11432-018-9847-0","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,11]]},"assertion":[{"value":"1 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"222501"}}