Yuxin Deng

According to our database1, Yuxin Deng authored at least 87 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

2023
Preface for the special issue of Theoretical Computer Science in honor of the 60<sup>th</sup> birthday of Yuxi Fu.
Theor. Comput. Sci., February, 2023

ReDFeat: Recoupling Detection and Description for Multimodal Feature Learning.
IEEE Trans. Image Process., 2023

Investigation on the Radar Scattering and Doppler Spectrum From Trimaran Based on the Motion of Six Degrees of Freedom.
IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens., 2023

Child Safety and Data Privacy in Smart Homes With Speakers: Comparison of Privacy Policies in the United States and China.
IEEE Secur. Priv., 2023

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

Trusta: Reasoning about Assurance Cases with Formal Methods and Large Language Models.
CoRR, 2023

ResMatch: Residual Attention Learning for Local Feature Matching.
CoRR, 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

Formal semantics of a classical-quantum language.
Theor. Comput. Sci., 2022

SuperFusion: A Versatile Image Registration and Fusion Network with Semantic Awareness.
IEEE CAA J. Autom. Sinica, 2022

Behavioural Pseudometrics for Nondeterministic Probabilistic Systems.
Sci. Ann. Comput. Sci., 2022

Too Slow to Be Useful? On Incorporating Humans in the Loop of Smart Speakers.
CoRR, 2022

Encodability Criteria for Quantum Based Systems (Technical Report).
CoRR, 2022

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

Invited talk: Formal Verification of Quantum Protocols.
Proceedings of the International Workshop on Formal Analysis and Verification of Post-Quantum Cryptographic Protocols co-located with the 23rd International Conference on Formal Engineering Methods (ICFEM 2022), 2022

Encodability Criteria for Quantum Based Systems.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2022

2021
Electromagnetic Scattering of Near-Field Turbulent Wake Generated by Accelerated Propeller.
Remote. Sens., 2021

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

Symbolic Reasoning About Quantum Circuits in Coq.
J. Comput. Sci. Technol., 2021

Preface to the Topic of Formal Methods and Their Applications.
Int. J. Softw. Informatics, 2021

SDGMNet: Statistic-based Dynamic Gradient Modulation for Local Descriptor Learning.
CoRR, 2021

Trustworthiness Derivation Tree: A Model of Evidence-Based Software Trustworthiness.
Proceedings of the 21st IEEE International Conference on Software Quality, 2021

Learning Attention-Based Translational Knowledge Graph Embedding via Nonlinear Dynamic Mapping.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2021

Explaining GBDT by Probabilistic Finite-State Automata.
Proceedings of the ICCPR '21: 10th International Conference on Computing and Pattern Recognition, Shanghai, China, October 15, 2021

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

Reachability of Patterned Conditional Pushdown Systems.
J. Comput. Sci. Technol., 2020

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

SMT-based generation of symbolic automata.
Acta Informatica, 2020

Verifying Quantum Communication Protocols with Ground Bisimulation.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 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
Simulations for Multi-Agent Systems with Imperfect Information.
Proceedings of the Formal Methods and Software Engineering, 2019

Formalisation of Probabilistic Testing Semantics in Coq.
Proceedings of the Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy, 2019

2018
Distribution-Based Behavioral Distance for Nondeterministic Fuzzy Transition Systems.
IEEE Trans. Fuzzy Syst., 2018

Preface for the special issue of the 10th International Symposium on Theoretical Aspects of Software Engineering (TASE 2016).
Sci. Comput. Program., 2018

Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems.
Fuzzy Sets Syst., 2018

Generating Permission-Based Security Policies.
Proceedings of the 5th International Conference on Dependable Systems and Their Applications, 2018

Bisimulations for Probabilistic and Quantum Processes (Invited Paper).
Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017
Probabilistic bisimilarity as testing equivalence.
Inf. Comput., 2017

Bisimulations for probabilistic linear lambda calculi.
Proceedings of the 11th International Symposium on Theoretical Aspects of Software Engineering, 2017

On Equivalence Checking of Nondeterministic Finite Automata.
Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2017

An Algebraic Approach to Automatic Reasoning for NetKAT Based on Its Operational Semantics.
Proceedings of the Formal Methods and Software Engineering, 2017

2016
Relating reasoning methodologies in linear logic and process algebra.
Math. Struct. Comput. Sci., 2016

Logical characterizations of simulation and bisimulation for fuzzy transition systems.
Fuzzy Sets Syst., 2016

2015
Program equivalence in linear contexts.
Theor. Comput. Sci., 2015

Book Introduction by the Author: Semantics of Probabilistic Processes An Operational Approach.
Bull. EATCS, 2015

Modal Characterisations of Behavioural Pseudometrics.
CoRR, 2015

On Coinduction and Quantum Lambda Calculi.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

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

Real-reward testing for probabilistic processes.
Theor. Comput. Sci., 2014

Modal Characterisations of Probabilistic and Fuzzy Bisimulations.
Proceedings of the Formal Methods and Software Engineering, 2014

2013
Compositional reasoning for weighted Markov decision processes.
Sci. Comput. Program., 2013

On the semantics of Markov automata.
Inf. Comput., 2013

The Buffered π-Calculus: A Model for Concurrent Languages.
Proceedings of the Language and Automata Theory and Applications, 2013

2012
Open Bisimulation for Quantum Processes.
Proceedings of the Theoretical Computer Science, 2012

2011
Real-Reward Testing for Probabilistic Processes (Extended Abstract)
Proceedings of the Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages, 2011

Logical, Metric, and Algorithmic Characterisations of Probabilistic Bisimulation
CoRR, 2011

Compositional Reasoning for Markov Decision Processes - (Extended Abstract).
Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

A Framework for Verifying Data-Centric Protocols.
Proceedings of the Formal Techniques for Distributed Systems, 2011

2010
Characterising Probabilistic Processes Logically
CoRR, 2010

Characterising Probabilistic Processes Logically - (Extended Abstract).
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009
On Mobility and Communication.
Proceedings of the Fifth International Symposium on Domain Theory, 2009

The Kantorovich Metric in Computer Science: A Brief Survey.
Proceedings of Seventh Workshop on Quantitative Aspects of Programming Languages, 2009

Verifying Self-stabilizing Population Protocols with Coq.
Proceedings of the TASE 2009, 2009

A Local Algorithm for Checking Probabilistic Bisimilarity.
Proceedings of the Fourth International Conference on Frontier of Computer Science and Technology, 2009

Testing Finitary Probabilistic Processes.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

Verifying Anonymous Credential Systems in Applied Pi Calculus.
Proceedings of the Cryptology and Network Security, 8th International Conference, 2009

2008
Characterising Testing Preorders for Finite Probabilistic Processes.
Log. Methods Comput. Sci., 2008

On automatic verification of self-stabilizing population protocols.
Frontiers Comput. Sci. China, 2008

A Simpler Framework Based on the Applied Pi Calculus and Its Application to Electronic Cash Protocol.
Proceedings of the 2008 International Symposium on Computer Science and Computational Technology, 2008

Game Characterizations of Process Equivalences.
Proceedings of the Programming Languages and Systems, 6th Asian Symposium, 2008

2007
Axiomatizations for probabilistic finite-state behaviors.
Theor. Comput. Sci., 2007

Remarks on Testing Probabilistic Processes.
Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

Probabilistic Barbed Congruence.
Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages, 2007

A Simple Completeness Proof for the Axiomatisations of Weak Behavioural Equivalences.
Bull. EATCS, 2007

Towards Automatic Measurement of Probabilistic Processes.
Proceedings of the Seventh International Conference on Quality Software (QSIC 2007), 2007

Characterising Testing Preorders for Finite Probabilistic Processes.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Scalar Outcomes Suffice for Finitary Probabilistic Testing.
Proceedings of the Programming Languages and Systems, 2007

Analyzing an Electronic Cash Protocol Using Applied Pi Calculus.
Proceedings of the Applied Cryptography and Network Security, 5th International Conference, 2007

2006
Towards an algebraic theory of typed mobile processes.
Theor. Comput. Sci., 2006

Ensuring termination by typability.
Inf. Comput., 2006

Measuring Anonymity with Relative Entropy.
Proceedings of the Formal Aspects in Security and Trust, Fourth International Workshop, 2006

2005
Axiomatisations and Types for Probabilistic and Mobile Processes. (Axiomatisations et types pour des processus probabilistes et mobiles).
PhD thesis, 2005

Weak Probabilistic Anonymity.
Proceedings of the International Workshop on Security and Concurrency, SecCo@CONCUR 2005, 2005

Metrics for Action-labelled Quantitative Transition Systems.
Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages, 2005

Compositional Reasoning for Probabilistic Finite-State Behaviors.
Proceedings of the Processes, 2005


  Loading...