徐鸣 副教授（偏重科研）
软件工程学院??????


导航
个人资料
研究方向
开授课程
科研项目
学术成果
荣誉及奖励







个人资料
部门： 软件工程学院
毕业院校： 华东师范大学
学位： 理学博士
学历： 博士研究生
邮编： 200062
联系电话：
传真：
电子邮箱： mxu@cs.ecnu.edu.cn
办公地址： 理科大楼B1005
通讯地址： 上海市普陀区中山北路3663号

教育经历

工作经历

个人简介

社会兼职
国家自然科学基金委数理学部、信息学部通讯评议人
美国《Mathematical Reviews》评论员


研究方向
目前研究方向：基础算法及其应用

招生类别：学术型硕士生、博士生
欢迎有兴趣从事基础研究的本科生、研究生与我联系，共同探讨！


开授课程
本科生课程:
离散数学计算理论

研究生生课程:
高级算法


科研项目
主持在研国家自然科学基金面上项目一项；
主持完成国家自然科学基金青年项目、教育部博士点基金、中国博士后科学基金各一项。


学术成果
[1] M. Xu, C. Huang and Y. Feng (2021): Measuring the Constrained Reachability in Quantum Markov Chains, Acta Informatica, online first. (DOI: 10.1007/s00236-020-00392-5) new!
[2] M. Xuand Y. Deng (2020): Time-Bounded Termination Analysis for Probabilistic Programs with Delays, Information and Computation, vol. 275, Article No. 104634. (DOI: 10.1016/j.ic.2020.104634) new!
[3] P. Wang, H. Fu, K. Chatterjee, Y. Deng and M. Xu(2020): Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time, in Proceedings of the ACM on Programming Languages, vol. 4, issue POPL, Article No. 25, pp. 1-30, ACM. (DOI: 10.1145/**)
[4] C. Huang, M. Xuand Z. Li (2020): A Conflict-Driven Solving Procedure for Poly-Power Constraints, Journal of Automated Reasoning, vol. 64(1), 1-20. (DOI: 10.1007/s10817-018-09501-z)
[5] C. Huang, J. Li, M. Xuand Z. Li (2018): Positive Root Isolation for Poly-Powers by Exclusion and Differentiation, Journal of Symbolic Computation, vol. 85, 148-169. (DOI: 10.1016/j.jsc.2017.07.007)
[6] J. Li, C. Huang, M. Xuand Z. Li (2016): Positive Root Isolation for Poly-Powers, in Proceedings of the 41st International Symposium on Symbolic and Algebraic Computation (ISSAC), pp. 325-332, ACM. (DOI: 10.1145/**.**)
[7] M. Xu, L. Zhang, D. N. Jansen, H. Zhu and Z. Yang (2016): Multiphase Until Formulas over Markov Reward Models: An Algebraic Approach, Theoretical Computer Science, vol. 611, 116-135. (DOI: 10.1016/j.tcs.2015.07.047)
[8] M. Xu, C. Huang, Z. Li and Z. Zeng (2016): Analyzing Ultimate Positivity for Solvable Systems, Theoretical Computer Science, vol. 609, part 2: 395-412. (DOI: 10.1016/j.tcs.2015.10.023)
[9] M. Xu, Z. Li and L. Yang (2015): Quantifier Elimination for a Class of Exponential Polynomial Formulas, Journal of Symbolic Computation, vol. 68, part 1: 146-168. (DOI: 10.1016/j.jsc.2014.09.015)
[10] J. Liu, M. Xu, N. Zhan and H. Zhao (2014): Discovering Non-terminating Inputs for Multi-path Polynomial Programs, Journal of Systems Science and Complexity, vol. 27(6):1286-1304. (DOI: 10.1007/s11424-014-2145-6)
[11] M. Xuand Z. Li (2013): Symbolic Termination Analysis of Solvable Loops, Journal of Symbolic Computation, vol. 50: 28-49. (DOI: 10.1016/j.jsc.2012.05.005)
[12] M. Xu, J. Zhu and Z. Li (2013): Some Decidable Results on Reachability of Solvable Systems,International Journal of General Systems, vol. 42(4): 405-425. (DOI: 10.1080/**.2012.757604)
[13] Y. Gao, M. Xu, N. Zhan and L. Zhang (2013): Model Checking Conditional CSL for Continuous-time Markov Chains, Information Processing Letters, vol. 113(1-2): 44-50. (DOI: 10.1016/j.ipl.2012.09.009)
[14] M. Xu, L. Chen, Z. Zeng and Z. Li (2010): Reachability Analysis of Rational Eigenvalue Linear Systems, International Journal of Systems Science, vol. 41(12): 1411-1419. (DOI: 10.1080/80691)
[15] M. Xu, L. Chen, Z. Zeng and Z. Li (2010): Termination Analysis of Linear Loops, International Journal of Foundations of Computer Science, vol. 21(6): 1005-1019. (DOI: 10.1142/S7696)
[16] M. Xu, C. Mu, Z. Zeng and Z. Li (2010): A Heuristic Approach to Positive Root Isolation for Multiple Power Sums, Journal of Universal Computer Science, vol. 16(14): 1912-1926. (DOI: 10.3217/jucs-016-14-1912)


荣誉及奖励


招生信息














10 访问


相关教师