Yangjia Li
YOU?
Author Swipe
View article: A Characterization of Robust Regions of Attraction for Discrete-Time Systems Based on Bellman Equations
A Characterization of Robust Regions of Attraction for Discrete-Time Systems Based on Bellman Equations Open
In this paper we present a Bellman equation for computing robust regions of attraction for state-constrained perturbed discrete-time systems. The robust region of attraction of interest is a set of states such that every trajectory initial…
View article: Robust Regions of Attraction Generation for State-Constrained Perturbed Discrete-Time Polynomial Systems
Robust Regions of Attraction Generation for State-Constrained Perturbed Discrete-Time Polynomial Systems Open
In this paper we propose a convex programming based method for computing robust regions of attraction for state-constrained perturbed discrete-time polynomial systems. The robust region of attraction of interest is a set of states such tha…
View article: Formal Verification of Quantum Algorithms Using Quantum Hoare Logic
Formal Verification of Quantum Algorithms Using Quantum Hoare Logic Open
We formalize the theory of quantum Hoare logic (QHL) [TOPLAS 33(6),19], an extension of Hoare logic for reasoning about quantum programs. In particular, we formalize the syntax and semantics of quantum programs in Isabelle/HOL, write down …
View article: Robust Regions of Attraction Generation for State-Constrained Perturbed Discrete-Time Polynomial Systems
Robust Regions of Attraction Generation for State-Constrained Perturbed Discrete-Time Polynomial Systems Open
In this paper we propose a convex programming based method for computing robust regions of attraction for state-constrained perturbed discrete-time polynomial systems. The robust region of attraction of interest is a set of states such tha…
View article: Reasoning about Parallel Quantum Programs
Reasoning about Parallel Quantum Programs Open
We initiate the study of parallel quantum programming by defining the operational and denotational semantics of parallel quantum programs. The technical contributions of this paper include: (1) find a series of useful proof rules for reaso…
View article: Robust Non-termination Analysis of Numerical Software
Robust Non-termination Analysis of Numerical Software Open
Numerical software are widely used in safety-critical systems such as aircrafts, satellites, car engines and so on, facilitating dynamics control of such systems in real time, it is therefore absolutely necessary to verify their correctnes…
View article: Robust Verification of Numerical Software
Robust Verification of Numerical Software Open
Numerical software are widely used in safety-critical systems such as aircrafts, satellites, car engines and so on, facilitating dynamics control of such systems in real time, it is therefore absolutely necessary to verify their correctnes…
View article: Algorithmic analysis of termination problems for quantum programs
Algorithmic analysis of termination problems for quantum programs Open
We introduce the notion of linear ranking super-martingale (LRSM) for quantum programs (with nondeterministic choices, namely angelic and demonic choices). Several termination theorems are established showing that the existence of the LRSM…
View article: A Theorem Prover for Quantum Hoare Logic and Its Applications
A Theorem Prover for Quantum Hoare Logic and Its Applications Open
Quantum Hoare Logic (QHL) was introduced in Ying's work to specify and reason about quantum programs. In this paper, we implement a theorem prover for QHL based on Isabelle/HOL. By applying the theorem prover, verifying a quantum program a…