學術成果
  

[1] Shih-Han Hung, Kesha Hietala, Shaopeng Zhu, Mingsheng Ying, Michael Hicks, and Xiaodi Wu. ''Quantitative Robustness Analysis of Quantum Programs''. In: Proceedings of the 46th ACM SIGPLAN Symposium on Principles of Programming Languages. (2019). [URL]

[2] Ji Guan, Yuan Feng, and Mingsheng Ying. ''Decomposition of quantum Markov chains and its applications''. In: J. Comput. Syst. Sci 95 (2018), pp. 55–68. [URL]

[3] Yangjia Li and Mingsheng Ying. ''Algorithmic analysis of termination problems for quantum programs''. In: PACMPL 2.POPL (2018), 35:1–35:29. [URL]

[4] Shenggang Ying and Mingsheng Ying. ''Reachability Analysis of Quantum Markov Decision Processes.'' In: Information & Computation (2018). [URL]

[5] Mingsheng Ying, Shenggang Ying, and Xiaodi Wu. ''Invariants of quantum programs: characterisations and generation''. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017. (2017), pp. 818–832. [URL]

[6] Li Zhou and Mingsheng Ying. ''Differential Privacy in Quantum Computation''. In: 30th IEEE Computer Security Foundations Symposium, CSF 2017, Santa Barbara, CA, USA, August 21-25, 2017. (2017), pp. 249–262. [URL]

[7] Mingsheng Ying. Foundations of Quantum Programming. Morgan Kaufmann, (2016).

[8] Yuan Feng and Mingsheng Ying. ''Toward Automatic Verification of Quantum Cryptographic Protocols''. In: 26th International Conference on Concurrency Theory, CONCUR 2015, Madrid, Spain, September 1.4, 2015. 2015, pp. 441–455. [URL]

[9] Yuan Feng, Yuxin Deng, and Mingsheng Ying. ''Symbolic Bisimulation for Quantum Processes''. In: ACM Trans. Comput. log. 15.2 (2014), 14:1–14:32. [URL]

[10] Yangjia Li and Mingsheng Ying. ''(Un)decidable Problems about Reachability of Quantum Systems''. In: CONCUR 2014 - Concurrency Theory - 25th International Conference, CONCUR 2014, Rome, Italy, September 2-5, 2014. Proceedings. 2014, pp. 482–496. [URL]

[11] Yangjia Li, Nengkun Yu, and Mingsheng Ying. ''Termination of nondeterministic quantum programs''. In: Acta Inf. 51.1 (2014), pp. 1–24. [URL]

[12] Mingsheng Ying, Yangjia Li, Nengkun Yu, and Yuan Feng. ''Model-Checking Linear-Time Properties of Quantum Systems''. In: ACM Trans. Comput. log. 15.3 (2014), 22:1–22:31. [URL]

[13] Yuan Feng, Nengkun Yu, and Mingsheng Ying. ''Model checking quantum Markov chains''. In: J. Comput. Syst. Sci 79.7 (2013), pp. 1181–1198. [URL]

[14] Yuan Feng, Nengkun Yu, and Mingsheng Ying. ''Reachability Analysis of Recursive Quantum Markov Chains''. In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings. (2013), pp. 385–396. [URL]

[15] Mingsheng Ying, Yuan Feng, and Nengkun Yu. ''Quantum Information-Flow Security: Noninterference and Access Control''. In: 2013 IEEE 26th Computer Security Foundations Symposium, New Orleans, LA, USA, June 26-28, 2013. (2013), pp. 130–144. [URL]

[16] Mingsheng Ying, Nengkun Yu, Yuan Feng, and Runyao Duan. ''Verification of quantum programs''. In: Sci. Comput. Program. 78.9 (2013), pp. 1679–1700. [URL]

[17] Shenggang Ying, Yuan Feng, Nengkun Yu, and Mingsheng Ying. ''Reachability Probabilities of Quantum Markov Chains''. In: CONCUR 2013 - Concurrency Theory - 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings. (2013), pp. 334–348. [URL]

[18] Yuan Feng, Runyao Duan, and Mingsheng Ying. ''Bisimulation for Quantum Processes''. In: ACM Trans. Program. Lang. Syst. 34.4 (2012), 17:1–17:43. [URL]

[19] Nengkun Yu and Mingsheng Ying. ''Reachability and Termination Analysis of Concurrent Quantum Programs''. In: CONCUR 2012 - Concurrency Theory - 23rd International Conference, CONCUR 2012, Newcastle upon Tyne, UK, September 4-7, 2012. Proceedings. (2012), pp. 69–83. [URL]

[20] Yuan Feng, Runyao Duan, and Mingsheng Ying. ''Bisimulation for quantum processes''. In: Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26-28, 2011. (2011), pp. 523–534. [URL]

[21] Mingsheng Ying. ''Floyd-hoare logic for quantum programs''. In: ACM Trans. Program. Lang. Syst. 33.6 (2011),19:1–19:49. [URL]

[22] Mingsheng Ying and Yuan Feng. ''A Flowchart Language for Quantum Programming''. In: IEEE Trans. Software Eng. 37.4 (2011), pp. 466–485. [URL]

[23] Mingsheng Ying. ''Quantum computation, quantum theory and AI''. In: Artif. Intell. 174.2 (2010), pp. 162–176. [URL]

[24] Mingsheng Ying and Yuan Feng. ''Quantum loop programs''. In: Acta Inf. 47.4 (2010), pp. 221–250. [URL]

[25] Mingsheng Ying, Runyao Duan, Yuan Feng, and Zhengfeng Ji. ''Predicate transformer semantics of quantum programs''. In: Semantic Techniques in Quantum Computation 8 (2010), pp. 311–360. [URL]

[26] Mingsheng Ying and Yuan Feng. ''An Algebraic Language for Distributed Quantum Computing''. In: IEEE Trans. Computers. 58.6 (2009), pp. 728–743. [URL]

[27] Mingsheng Ying, Yuan Feng, Runyao Duan, and Zheng-Feng Ji. ''An algebra of quantum processes''. In: ACM Trans. Comput. log. 10.3 (2009), 19:1–19:36. [URL]

[28] Yuan Feng, Runyao Duan, Zhengfeng Ji, and Mingsheng Ying. ''Probabilistic bisimulations for quantum processes''. In: Inf. Comput. 205.11 (2007), pp. 1608–1639. [URL]

[29] Yuan Feng, Runyao Duan, Zhengfeng Ji, and Mingsheng Ying. ''Proof rules for the correctness of quantum programs''. In: Theor. Comput. Sci. 386.1-2 (2007), pp. 151–166. [URL]

[30] Mingsheng Ying, Jianxin Chen, Yuan Feng, and Runyao Duan. ''Commutativity of quantum weakest preconditions''. In: Inf. Process. Lett. 104.4 (2007), pp. 152–158. [URL]

[31] Mingsheng Ying. ''A theory of computation based on quantum logic (I)''. In: Theor. Comput. Sci. 344.2-3 (2005), pp. 134–207. [URL]