Mingsheng Ying

According to our database1, Mingsheng Ying authored at least 96 papers between 1987 and 2019.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Quantitative robustness analysis of quantum programs.
PACMPL, 2019

Toward automatic verification of quantum programs.
Formal Asp. Comput., 2019

Quantum Hoare Logic.
Archive of Formal Proofs, 2019

An applied quantum Hoare logic.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

Super-activating quantum memory with entanglement.
Quantum Information & Computation, 2018

Algorithmic analysis of termination problems for quantum programs.
PACMPL, 2018

Decomposition of quantum Markov chains and its applications.
J. Comput. Syst. Sci., 2018

Reachability analysis of quantum Markov decision processes.
Inf. Comput., 2018

Q|SI⟩ : A Quantum Programming Environment.
Proceedings of the Symposium on Real-Time and Hybrid Systems, 2018

Invariants of quantum programs: characterisations and generation.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Differential Privacy in Quantum Computation.
Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

Toward Automatic Verification of Quantum Cryptographic Protocols.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

Model-Checking Linear-Time Properties of Quantum Systems.
ACM Trans. Comput. Log., 2014

Symbolic Bisimulation for Quantum Processes.
ACM Trans. Comput. Log., 2014

Distinguishability of Quantum States by Positive Operator-Valued Measures With Positive Partial Transpose.
IEEE Trans. Information Theory, 2014

Termination of nondeterministic quantum programs.
Acta Inf., 2014

(Un)decidable Problems about Reachability of Quantum Systems.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Verification of quantum programs.
Sci. Comput. Program., 2013

Model checking quantum Markov chains.
J. Comput. Syst. Sci., 2013

Probabilistic automata for computing with words.
J. Comput. Syst. Sci., 2013

Reachability Analysis of Recursive Quantum Markov Chains.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Quantum Information-Flow Security: Noninterference and Access Control.
Proceedings of the 2013 IEEE 26th Computer Security Foundations Symposium, 2013

Reachability Probabilities of Quantum Markov Chains.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

Approximating Markov processes through filtration.
Theor. Comput. Sci., 2012

Semantic Analysis of Component-aspect Dynamism for Connector-based Architecture Styles.
Proceedings of the 2012 Joint Working IEEE/IFIP Conference on Software Architecture and European Conference on Software Architecture, 2012

Reachability and Termination Analysis of Concurrent Quantum Programs.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

A Flowchart Language for Quantum Programming.
IEEE Trans. Software Eng., 2011

Floyd-hoare logic for quantum programs.
ACM Trans. Program. Lang. Syst., 2011

Bisimulation for quantum processes.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Translating First-Order Theories into Logic Programs.
Proceedings of the IJCAI 2011, 2011

The LU-LC conjecture is false.
Quantum Information & Computation, 2010

Ancilla-assisted discrimination of quantum gates.
Quantum Information & Computation, 2010

Quantum computation, quantum theory and AI.
Artif. Intell., 2010

Reasoning about cardinal directions between extended objects.
Artif. Intell., 2010

Quantum loop programs.
Acta Inf., 2010

An ADL-Approach to Specifying and Analyzing Centralized-Mode Architectural Connection.
Proceedings of the Software Architecture, 4th European Conference, 2010

Foundations of Quantum Programming (Extended Abstract).
Proceedings of the Programming Languages and Systems - 8th Asian Symposium, 2010

Decidable Fragments of First-Order Language Under Stable Model Semantics and Circumscription.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

An algebra of quantum processes.
ACM Trans. Comput. Log., 2009

Distinguishability of Quantum States by Separable Operations.
IEEE Trans. Information Theory, 2009

An Algebraic Language for Distributed Quantum Computing.
IEEE Trans. Computers, 2009

Locally undetermined states, generalized schmidt decomposition, and application in deistributed comuting.
Quantum Information & Computation, 2009

Dealing with uncertainty and fuzziness in intelligent systems.
Int. J. Intell. Syst., 2009

Parameter Estimation of Quantum Channels.
IEEE Trans. Information Theory, 2008

Soft constraint abstraction based on semiring homomorphism.
Theor. Comput. Sci., 2008

Reasoning with Cardinal Directions: An Efficient Algorithm.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

State-Based Control of Fuzzy Discrete-Event Systems.
IEEE Trans. Systems, Man, and Cybernetics, Part B, 2007

Retraction and Generalized Extension of Computing With Words.
IEEE Trans. Fuzzy Systems, 2007

Proof rules for the correctness of quantum programs.
Theor. Comput. Sci., 2007

Commutativity of quantum weakest preconditions.
Inf. Process. Lett., 2007

Probabilistic bisimulations for quantum processes.
Inf. Comput., 2007

On fundamentals of fuzzy logic and soft computing and some applications.
Fuzzy Sets and Systems, 2007

Sequential voting rules and multiple elections paradoxes.
Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2007), 2007

Strongly Decomposable Voting Rules on Multiattribute Domains.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

Partial Recovery of Quantum Entanglement.
IEEE Trans. Information Theory, 2006

Observability and Decentralized Control of Fuzzy Discrete-Event Systems.
IEEE Trans. Fuzzy Systems, 2006

Similarity-based supervisory control of discrete-event systems.
IEEE Trans. Automat. Contr., 2006

Some Issues in Quantum Information Theory.
J. Comput. Sci. Technol., 2006

Linguistic quantifiers modeled by Sugeno integrals.
Artif. Intell., 2006

Supervisory control of fuzzy discrete event systems.
IEEE Trans. Systems, Man, and Cybernetics, Part B, 2005

The existence of quantum entanglement catalysts.
IEEE Trans. Information Theory, 2005

Catalyst-assisted probabilistic entanglement transformation.
IEEE Trans. Information Theory, 2005

On countable RCC models.
Fundam. Inform., 2005

Knowledge transformation and fusion in diagnostic systems.
Artif. Intell., 2005

pi-calculus with noisy channels.
Acta Inf., 2005

A theory of computation based on quantum logic (I).
Proceedings of the 2005 IEEE International Conference on Granular Computing, 2005

Characterizations of quantum automata.
Theor. Comput. Sci., 2004

Process Algebra Approach to Reasoning About Concurrent Actions.
J. Comput. Sci. Technol., 2004

Generalized Region Connection Calculus.
Artif. Intell., 2004

Extensionality of the RCC8 Composition Table.
Fundam. Inform., 2003

Region Connection Calculus: Its models and composition table.
Artif. Intell., 2003

Reasoning about probabilistic sequential programs in a probabilistic logic.
Acta Inf., 2003

A formal model of computing with words.
IEEE Trans. Fuzzy Systems, 2002

Implication operators in fuzzy logic.
IEEE Trans. Fuzzy Systems, 2002

Additive models of probabilistic processes.
Theor. Comput. Sci., 2002

Bisimulation indexes and their applications.
Theor. Comput. Sci., 2002

Lattice-theoretic models of conjectures, hypotheses and consequences.
Artif. Intell., 2002

Recursive equations in higher-order process calculi.
Theor. Comput. Sci., 2001

Topology in process calculus - approximate correctness and infinite evolution of concurrent programs.
Springer, ISBN: 978-0-387-95092-1, 2001

Weak confluence and tau-inertness.
Theor. Comput. Sci., 2000

Approximate Reasoning Based on Similarity.
Math. Log. Q., 2000

Approximate Bisimilarity.
Proceedings of the Algebraic Methodology and Software Technology. 8th International Conference, 2000

Perturbation of fuzzy reasoning.
IEEE Trans. Fuzzy Systems, 1999

A Shorter Proof to Uniqueness of Solutions of Equations.
Theor. Comput. Sci., 1999

Topology in process calculus (I): Limit behaviour of agents.
J. Comput. Sci. Technol., 1999

Phase semantics for a pure noncommutative linear propositional logic.
J. Comput. Sci. Technol., 1999

Approximate reasoning with linguistic modifiers.
Int. J. Intell. Syst., 1998

Quantifiers, modifiers and qualifiers in fuzzy logic.
Journal of Applied Non-Classical Logics, 1997

When is the Ideal Completion of Abstract Basis Algebraic.
Theor. Comput. Sci., 1996

Institutions of variable truth values: An approach in the ordered style.
J. Comput. Sci. Technol., 1995

Putting consistent theories together in institutions.
J. Comput. Sci. Technol., 1995

A Logic for Approximate Reasoning.
J. Symb. Log., 1994

Compactness, the LöWenheim-Skolem Property and the Direct Product of Lattices of Truth Values.
Math. Log. Q., 1992

The Fundamental Theorem of Ultraproduct in Pavelka's Logic.
Math. Log. Q., 1992

Deduction Theorem for Many-Valued Inference.
Math. Log. Q., 1991

Fuzzy semilattices.
Inf. Sci., 1987