Author of the publication

Formal Verification of Quantum Algorithms Using Quantum Hoare Logic.

, , , , , , , and . CAV (2), volume 11562 of Lecture Notes in Computer Science, page 187-207. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Algorithmic analysis of termination problems for quantum programs., and . Proc. ACM Program. Lang., 2 (POPL): 35:1-35:29 (2018)Computing reachable sets of linear vector fields revisited., , , , and . ECC, page 419-426. IEEE, (2016)Robust Non-termination Analysis of Numerical Software., , , and . SETTA, volume 10998 of Lecture Notes in Computer Science, page 69-88. Springer, (2018)Approximate Bisimulation and Discretization of Hybrid CSP., , , , and . FM, volume 9995 of Lecture Notes in Computer Science, page 702-720. (2016)Formal Verification of Quantum Algorithms Using Quantum Hoare Logic., , , , , , , and . CAV (2), volume 11562 of Lecture Notes in Computer Science, page 187-207. Springer, (2019)Reasoning about Parallel Quantum Programs., and . CoRR, (2018)Debugging Quantum Processes Using Monitoring Measurements., and . CoRR, (2014)Reachability Analysis for Solvable Dynamical Systems., , , , and . IEEE Trans. Automat. Contr., 63 (7): 2003-2018 (2018)Quantum Relational Hoare Logic with Expectations., and . CoRR, (2019)(Un)decidable Problems about Reachability of Quantum Systems., and . CONCUR, volume 8704 of Lecture Notes in Computer Science, page 482-496. Springer, (2014)