Ming Xu

Orcid: 0000-0002-9906-5677

Affiliations:
  • East China Normal University, School of Software Engineering, Department of Computer Science and Technology, Shanghai Key Laboratory of Trustworthy Computing, Shanghai, China


According to our database1, Ming Xu authored at least 36 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Qubit Mapping Based on Tabu Search.
J. Comput. Sci. Technol., March, 2024

Algorithmic Analysis of Termination Problems for Nondeterministic Quantum Programs.
CoRR, 2024

Local Reasoning About Probabilistic Behaviour for Classical-Quantum Programs.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2024

A Sample-Driven Solving Procedure for the Repeated Reachability of Quantum Continuous-time Markov Chains.
Proceedings of the 27th ACM International Conference on Hybrid Systems: Computation and Control, 2024

2023
Quantitative controller synthesis for consumption Markov decision processes.
Inf. Process. Lett., 2023

A Sample-Driven Solving Procedure for the Repeated Reachability of Quantum CTMCs.
CoRR, 2023

Deep Algorithm Unrolling with Registration Embedding for Pansharpening.
Proceedings of the 31st ACM International Conference on Multimedia, 2023

Deep Unfolding Convolutional Dictionary Model for Multi-Contrast MRI Super-resolution and Reconstruction.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
An algebraic method to fidelity-based model checking over quantum Markov chains.
Theor. Comput. Sci., 2022

Model checking QCTL plus on quantum Markov chains.
Theor. Comput. Sci., 2022

Checking Continuous Stochastic Logic against Quantum Continuous-Time Markov Chains.
CoRR, 2022

Bisection Value Iteration.
Proceedings of the 29th Asia-Pacific Software Engineering Conference, 2022

2021
An optimal quantum error-correcting procedure using quantifier elimination.
Quantum Inf. Process., 2021

Measuring the constrained reachability in quantum Markov chains.
Acta Informatica, 2021

Model Checking Quantum Continuous-Time Markov Chains.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time.
Proc. ACM Program. Lang., 2020

A Conflict-Driven Solving Procedure for Poly-Power Constraints.
J. Autom. Reason., 2020

Time-bounded termination analysis for probabilistic programs with delays.
Inf. Comput., 2020

Weighted Local Outlier Factor for Detecting Anomaly on In-Vehicle Network.
Proceedings of the 16th International Conference on Mobility, Sensing and Networking, 2020

Revisiting the Fairness and Randomness of Delegated Proof of Stake Consensus Algorithm.
Proceedings of the IEEE International Conference on Parallel & Distributed Processing with Applications, 2020

Qsimulation V2.0: An Optimized Quantum Simulator.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Macau, China, November 30, 2020

2019
Proving Expected Sensitivity of Probabilistic Programs with Randomized Execution Time.
CoRR, 2019

2018
Positive root isolation for poly-powers by exclusion and differentiation.
J. Symb. Comput., 2018

2016
Analyzing ultimate positivity for solvable systems.
Theor. Comput. Sci., 2016

Multiphase until formulas over Markov reward models: An algebraic approach.
Theor. Comput. Sci., 2016

Positive Root Isolation for Poly-Powers.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015
Quantifier elimination for a class of exponential polynomial formulas.
J. Symb. Comput., 2015

2014
Discovering non-terminating inputs for multi-path polynomial programs.
J. Syst. Sci. Complex., 2014

2013
Symbolic termination analysis of solvable loops.
J. Symb. Comput., 2013

Model checking conditional CSL for continuous-time Markov chains.
Inf. Process. Lett., 2013

Some decidable results on reachability of solvable systems.
Int. J. Gen. Syst., 2013

2010
A Heuristic Approach to Positive Root Isolation for Multiple Power Sums.
J. Univers. Comput. Sci., 2010

Reachability analysis of rational eigenvalue linear systems.
Int. J. Syst. Sci., 2010

Termination Analysis of Linear Loops.
Int. J. Found. Comput. Sci., 2010

Real Root Isolation of Multi-Exponential Polynomials with Application.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

2009
Symbolic Reachability Computation of a Class of Nonlinear Systems.
Proceedings of the 8th IEEE/ACIS International Conference on Computer and Information Science, 2009


  Loading...