{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T10:20:32Z","timestamp":1775384432490,"version":"3.50.1"},"publisher-location":"Cham","reference-count":64,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030255428","type":"print"},{"value":"9783030255435","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25543-5_12","type":"book-chapter","created":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T08:03:09Z","timestamp":1562918589000},"page":"187-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":51,"title":["Formal Verification of Quantum Algorithms Using Quantum Hoare Logic"],"prefix":"10.1007","author":[{"given":"Junyi","family":"Liu","sequence":"first","affiliation":[]},{"given":"Bohua","family":"Zhan","sequence":"additional","affiliation":[]},{"given":"Shuling","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Shenggang","family":"Ying","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yangjia","family":"Li","sequence":"additional","affiliation":[]},{"given":"Mingsheng","family":"Ying","sequence":"additional","affiliation":[]},{"given":"Naijun","family":"Zhan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"key":"12_CR1","unstructured":"IBM Q devices and simulators. \n                      https:\/\/www.research.ibm.com\/ibm-q\/technology\/devices\/"},{"key":"12_CR2","unstructured":"IBM Q experience community. \n                      https:\/\/quantumexperience.ng.bluemix.net\/qx\/community?channel=papers&category=ibm"},{"key":"12_CR3","unstructured":"IonQ. \n                      https:\/\/ionq.co\/resources"},{"key":"12_CR4","unstructured":"A preview of Bristlecone, Google\u2019s new quantum processor. \n                      https:\/\/ai.googleblog.com\/2018\/03\/a-preview-of-bristlecone-googles-new.html"},{"key":"12_CR5","unstructured":"Qiskit Aer. \n                      https:\/\/qiskit.org\/aer\n                      \n                    , \n                      https:\/\/medium.com\/qiskit\/qiskit-aer-d09d0fac7759"},{"key":"12_CR6","unstructured":"Unsupervised machine learning on Rigetti 19Q with Forest 1.2. \n                      https:\/\/medium.com\/rigetti\/unsupervised-machine-learning-on-rigetti-19q-with-forest-1-2-39021339699"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-642-36742-7_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Ardeshir-Larijani","year":"2013","unstructured":"Ardeshir-Larijani, E., Gay, S.J., Nagarajan, R.: Equivalence checking of quantum protocols. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 478\u2013492. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-36742-7_33"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-642-54862-8_42","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Ardeshir-Larijani","year":"2014","unstructured":"Ardeshir-Larijani, E., Gay, S.J., Nagarajan, R.: Verification of concurrent quantum protocols by equivalence checking. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 500\u2013514. Springer, Heidelberg (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-642-54862-8_42"},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1017\/S0960129506005299","volume":"16","author":"A Baltag","year":"2006","unstructured":"Baltag, A., Smets, S.: LQP: the dynamic logic of quantum information. Math. Struct. Comput. Sci. 16(3), 491\u2013525 (2006)","journal-title":"Math. Struct. Comput. Sci."},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-10082-1_6","volume-title":"Foundations of Security Analysis and Design VII","author":"G Barthe","year":"2014","unstructured":"Barthe, G., Dupressoir, F., Gr\u00e9goire, B., Kunz, C., Schmidt, B., Strub, P.-Y.: EasyCrypt: a tutorial. In: Aldini, A., Lopez, J., Martinelli, F. (eds.) FOSAD 2012-2013. LNCS, vol. 8604, pp. 146\u2013166. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-10082-1_6"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-22792-9_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G Barthe","year":"2011","unstructured":"Barthe, G., Gr\u00e9goire, B., Heraud, S., B\u00e9guelin, S.Z.: Computer-aided security proofs for the working cryptographer. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 71\u201390. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-22792-9_5"},{"key":"12_CR12","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: International Conference on Computers, Systems and Signal Processing, pp. 175\u2013179. IEEE (1984)"},{"key":"12_CR13","unstructured":"Bentkamp, A.: Expressiveness of deep learning. Archive of Formal Proofs, Formal proof development, November 2016. \n                      http:\/\/isa-afp.org\/entries\/Deep_Learning.html"},{"key":"12_CR14","unstructured":"Bentkamp, A., Blanchette, J.C., Klakow, D.: A formal proof of the expressiveness of deep learning. In: Interactive Theorem Proving - 8th International Conference, ITP 2017, Bras\u00edlia, Brazil, September 26\u201329, 2017, Proceedings, pp. 46\u201364 (2017). \n                      https:\/\/dblp.org\/rec\/bib\/conf\/itp\/BentkampBK17"},{"key":"12_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development: Coq\u2019Art The Calculus of Inductive Constructions","author":"Y Bertot","year":"2010","unstructured":"Bertot, Y., Castran, P.: Interactive Theorem Proving and Program Development: Coq\u2019Art The Calculus of Inductive Constructions, 1st edn. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-662-07964-5","edition":"1"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1140\/epjd\/e2003-00242-2","volume":"25","author":"S Bettelli","year":"2003","unstructured":"Bettelli, S., Calarco, T., Serafini, L.: Toward an architecture for quantum programming. Eur. Phys. J. D 25, 181\u2013200 (2003)","journal-title":"Eur. Phys. J. D"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Boender, J., Kamm\u00fcller, F., Nagarajan, R.: Formalization of quantum protocols using Coq. In: QPL 2015 (2015)","DOI":"10.4204\/EPTCS.195.6"},{"issue":"4\u20135","key":"12_CR18","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschr. der Phys. Prog. Phys. 46(4\u20135), 493\u2013505 (1998)","journal-title":"Fortschr. der Phys. Prog. Phys."},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., Hoyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. Contemp. Math. 305, 53\u201374 (2002)","journal-title":"Contemp. Math."},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1142\/S0219749904000067","volume":"2","author":"O Brunet","year":"2004","unstructured":"Brunet, O., Jorrand, P.: Dynamic quantum logic for quantum programs. Int. J. Quantum Inf. 2, 45\u201354 (2004)","journal-title":"Int. J. Quantum Inf."},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.entcs.2006.04.003","volume":"158","author":"R Chadha","year":"2006","unstructured":"Chadha, R., Mateus, P., Sernadas, A.: Reasoning about imperative quantum programs. Electron. Notes Theoret. Comput. Sci. 158, 19\u201339 (2006)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"12_CR22","unstructured":"Cross, A.W., Bishop, L.S., Smolin, J.A., Gambetta, J.M.: Open quantum assembly language. arXiv preprint \n                      arXiv:1707.03429\n                      \n                     (2017)"},{"issue":"7614","key":"12_CR23","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1038\/nature18648","volume":"536","author":"S Debnath","year":"2016","unstructured":"Debnath, S., Linke, N.M., Figgatt, C., Landsman, K.A., Wright, K., Monroe, C.: Demonstration of a small programmable quantum computer with atomic qubits. Nature 536(7614), 63\u201366 (2016)","journal-title":"Nature"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1017\/S0960129506005251","volume":"16","author":"E D\u2019Hondt","year":"2006","unstructured":"D\u2019Hondt, E., Panangaden, P.: Quantum weakest preconditions. Math. Struct. Comput. Sci. 16, 429\u2013451 (2006)","journal-title":"Math. Struct. Comput. Sci."},{"key":"12_CR25","unstructured":"Wecker, D., Svore, K.: Liqui\n                      \n                        \n                      \n                      $$|\\rangle $$\n                    : a software design architecture and domain-specific language for quantum computing. (\n                      http:\/\/research.microsoft.com\/en-us\/projects\/liquid\/\n                      \n                    )"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-319-21401-6_36","volume-title":"Automated Deduction - CADE-25","author":"N Fulton","year":"2015","unstructured":"Fulton, N., Mitsch, S., Quesel, J.-D., V\u00f6lp, M., Platzer, A.: KeYmaera\u00a0X: an axiomatic tactical theorem prover for hybrid systems. In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 527\u2013538. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-21401-6_36"},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1017\/S0960129506005378","volume":"16","author":"S Gay","year":"2006","unstructured":"Gay, S.: Quantum programming languages: survey and bibliography. Math. Struct. Comput. Sci. 16, 581\u2013600 (2006)","journal-title":"Math. Struct. Comput. Sci."},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-540-70545-1_51","volume-title":"Computer Aided Verification","author":"SJ Gay","year":"2008","unstructured":"Gay, S.J., Nagarajan, R., Papanikolaou, N.: QMC: a model checker for quantum systems. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 543\u2013547. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-70545-1_51"},{"key":"12_CR29","unstructured":"Gay, S.J., Nagarajan, R., Papanikolaou, N.: Probabilistic model-checking of quantum protocols. In: DCM Proceedings of International Workshop on Developments in Computational Models, p. 504007. IEEE (2005). \n                      https:\/\/arxiv.org\/abs\/quant-ph\/0504007"},{"key":"12_CR30","unstructured":"Google AI Quantum team. \n                      https:\/\/github.com\/quantumlib\/Cirq"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Green, A.S., Lumsdaine, P.L., Ross, N.J., Selinger, P., Valiron, B.: Quipper: a scalable quantum programming language. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2013, pp. 333\u2013342. ACM, New York (2013)","DOI":"10.1145\/2491956.2462177"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, STOC 1996, pp. 212\u2013219. ACM, New York (1996)","DOI":"10.1145\/237814.237866"},{"key":"12_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-02444-3_10","volume-title":"Types for Proofs and Programs","author":"F Haftmann","year":"2009","unstructured":"Haftmann, F., Wenzel, M.: Local theory specifications in isabelle\/isar. In: Berardi, S., Damiani, F., de\u2019Liguoro, U. (eds.) TYPES 2008. LNCS, vol. 5497, pp. 153\u2013168. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-02444-3_10"},{"key":"12_CR34","unstructured":"He, J.: From CSP to hybrid systems. In: A Classical Mind, Essays in Honour of C.A.R. Hoare, pp. 171\u2013189. Prentice Hall International (UK) Ltd. (1994)"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"JavadiAbhari, A., et al.: ScaffCC: scalable compilation and analysis of quantum programs. In: Parallel Computing, vol. 45, pp. 3\u201317 (2015)","DOI":"10.1016\/j.parco.2014.12.001"},{"key":"12_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-10622-4_7","volume-title":"Advances in Computer Science - ASIAN 2009. Information Security and Privacy","author":"Y Kakutani","year":"2009","unstructured":"Kakutani, Y.: A logic for formal verification of quantum programs. In: Datta, A. (ed.) ASIAN 2009. LNCS, vol. 5913, pp. 79\u201393. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-10622-4_7"},{"key":"12_CR37","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/s10009-004-0140-2","volume":"6","author":"M Kwiatkowska","year":"2004","unstructured":"Kwiatkowska, M., Norman, G., Parker, P.: Probabilistic symbolic model-checking with PRISM: a hybrid approach. Int. J. Softw. Tools Technol. Transf. 6, 128\u2013142 (2004)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"12_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00236-013-0185-3","volume":"51","author":"Y Li","year":"2014","unstructured":"Li, Y., Yu, N., Ying, M.: Termination of nondeterministic quantum programs. Acta Informatica 51, 1\u201324 (2014)","journal-title":"Acta Informatica"},{"key":"12_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-030-01461-2_8","volume-title":"Symposium on Real-Time and Hybrid Systems","author":"S Liu","year":"2018","unstructured":"Liu, S., et al.: \n                      \n                        \n                      \n                      $$Q|SI\\rangle $$\n                    : a quantum programming environment. In: Jones, C., Wang, J., Zhan, N. (eds.) Symposium on Real-Time and Hybrid Systems. LNCS, vol. 11180, pp. 133\u2013164. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-030-01461-2_8"},{"key":"12_CR40","doi-asserted-by":"crossref","unstructured":"Liu, X., Kubiatowicz, J.: Chisel-Q: designing quantum circuits with a scala embedded language. In: 2013 IEEE 31st International Conference on Computer Design (ICCD), pp. 427\u2013434. IEEE (2013)","DOI":"10.1109\/ICCD.2013.6657075"},{"key":"12_CR41","unstructured":"Nagarajan, R., Gay, S.: Formal verification of quantum protocols (2002). \n                      arXiv: quant-ph\/0203086"},{"key":"12_CR42","volume-title":"Quantum Computation and Quantum Information: 10th Anniversary Edition","author":"MA Nielsen","year":"2011","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition, 10th edn. Cambridge University Press, New York (2011)","edition":"10"},{"key":"12_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10542-0","volume-title":"Concrete Semantics: With Isabelle\/HOL","author":"T Nipkow","year":"2014","unstructured":"Nipkow, T., Klein, G.: Concrete Semantics: With Isabelle\/HOL. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-10542-0"},{"key":"12_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL: A Proof Assistant for Higher-Order Logic","year":"2002","unstructured":"Nipkow, T., Wenzel, M., Paulson, L.C. (eds.): Isabelle\/HOL: A Proof Assistant for Higher-Order Logic. LNCS, vol. 2283. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-45949-9"},{"key":"12_CR45","unstructured":"\u00d6mer, B.: Structured quantum programming. Ph.D. thesis, Technical University of Vienna (2003)"},{"key":"12_CR46","unstructured":"Papanikolaou, N.: Model checking quantum protocols. Ph.D. thesis, Department of Computer Science, University of Warwick (2008)"},{"key":"12_CR47","doi-asserted-by":"crossref","unstructured":"Paykin, J., Rand, R., Zdancewic, S.: QWIRE: a core language for quantum circuits. In: Proceedings of 44th ACM Symposium on Principles of Programming Languages (POPL), pp. 846\u2013858 (2017)","DOI":"10.1145\/3093333.3009894"},{"issue":"2","key":"12_CR48","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10817-016-9385-1","volume":"59","author":"A Platzer","year":"2017","unstructured":"Platzer, A.: A complete uniform substitution calculus for differential dynamic logic. J. Autom. Reas. 59(2), 219\u2013265 (2017)","journal-title":"J. Autom. Reas."},{"key":"12_CR49","unstructured":"Rand, R.: Formally verified quantum programming. Ph.D. thesis, University of Pennsylvania (2018)"},{"key":"12_CR50","doi-asserted-by":"crossref","unstructured":"Robert Rand, J.P., Zdancewic, S.: QWIRE practice: formal verification of quantum circuits in coq. In: Quantum Physics and Logic (2017)","DOI":"10.4204\/EPTCS.266.8"},{"key":"12_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/10722010_6","volume-title":"Mathematics of Program Construction","author":"JW Sanders","year":"2000","unstructured":"Sanders, J.W., Zuliani, P.: Quantum programming. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837, pp. 80\u201399. Springer, Heidelberg (2000). \n                      https:\/\/doi.org\/10.1007\/10722010_6"},{"key":"12_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24754-8_1","volume-title":"Functional and Logic Programming","author":"P Selinger","year":"2004","unstructured":"Selinger, P.: A brief survey of quantum programming languages. In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS 2004. LNCS, vol. 2998, pp. 1\u20136. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-24754-8_1"},{"issue":"4","key":"12_CR53","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1017\/S0960129504004256","volume":"14","author":"P Selinger","year":"2004","unstructured":"Selinger, P.: Towards a quantum programming language. Math. Struct. Comput. Sci. 14(4), 527\u2013586 (2004)","journal-title":"Math. Struct. Comput. Sci."},{"key":"12_CR54","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1137\/0213021","volume":"13","author":"M Sharir","year":"1984","unstructured":"Sharir, M., Pnueli, A., Hart, S.: Verification of probabilistic programs. SIAM J. Comput. 13, 292\u2013314 (1984)","journal-title":"SIAM J. Comput."},{"key":"12_CR55","unstructured":"Smith, R.S., Curtis, M.J., Zeng, W.J.: A practical quantum instruction set architecture. arXiv preprint \n                      arXiv:1608.03355\n                      \n                     (2016)"},{"key":"12_CR56","doi-asserted-by":"publisher","first-page":"49","DOI":"10.22331\/q-2018-01-31-49","volume":"2","author":"DS Steiger","year":"2018","unstructured":"Steiger, D.S., H\u00e4ner, T., Troyer, M.: ProjectQ: an open source software framework for quantum computing. Quantum 2, 49 (2018)","journal-title":"Quantum"},{"key":"12_CR57","doi-asserted-by":"crossref","unstructured":"Svore, K., et al.: Q#: enabling scalable quantum computing and development with a high-level DSL. In: Proceedings of the Real World Domain Specific Languages Workshop 2018, pp. 7:1\u20137:10 (2018)","DOI":"10.1145\/3183895.3183901"},{"key":"12_CR58","unstructured":"Thiemann, R., Yamada, A.: Matrices, Jordan normal forms, and spectral radius theory. Archive of Formal Proofs, Formal proof development, August 2015. \n                      http:\/\/isa-afp.org\/entries\/Jordan_Normal_Form.html"},{"key":"12_CR59","doi-asserted-by":"crossref","unstructured":"Thiemann, R., Yamada, A.: Formalizing Jordan normal forms in Isabelle\/HOL. In: Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, CPP 2016, pp. 88\u201399. ACM, New York (2016)","DOI":"10.1145\/2854065.2854073"},{"key":"12_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-319-25423-4_25","volume-title":"Formal Methods and Software Engineering","author":"S Wang","year":"2015","unstructured":"Wang, S., Zhan, N., Zou, L.: An improved HHL prover: an interactive theorem prover for hybrid systems. In: Butler, M., Conchon, S., Za\u00efdi, F. (eds.) ICFEM 2015. LNCS, vol. 9407, pp. 382\u2013399. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-25423-4_25"},{"issue":"6","key":"12_CR61","doi-asserted-by":"publisher","first-page":"19:1","DOI":"10.1145\/2049706.2049708","volume":"33","author":"M Ying","year":"2011","unstructured":"Ying, M.: Floyd-Hoare logic for quantum programs. ACM Trans. Programm. Lang. Syst. 33(6), 19:1\u201319:49 (2011)","journal-title":"ACM Trans. Programm. Lang. Syst."},{"key":"12_CR62","doi-asserted-by":"crossref","unstructured":"Ying, M., Ying, S., Wu, X.: Invariants of quantum programs: characterisations and generation. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, pp. 818\u2013832 (2017)","DOI":"10.1145\/3009837.3009840"},{"key":"12_CR63","doi-asserted-by":"publisher","first-page":"1679","DOI":"10.1016\/j.scico.2013.03.016","volume":"78","author":"M Ying","year":"2013","unstructured":"Ying, M., Yu, N., Feng, Y., Duan, R.: Verification of quantum programs. Sci. Comput. Programm. 78, 1679\u20131700 (2013)","journal-title":"Sci. Comput. Programm."},{"key":"12_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-40184-8_24","volume-title":"CONCUR 2013 \u2013 Concurrency Theory","author":"S Ying","year":"2013","unstructured":"Ying, S., Feng, Y., Yu, N., Ying, M.: Reachability probabilities of quantum Markov chains. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol. 8052, pp. 334\u2013348. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-40184-8_24"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25543-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T08:06:36Z","timestamp":1562918796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25543-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030255428","9783030255435"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25543-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York City, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"258","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}