Name
Abstract | ||
|---|---|---|
AbstractBug-catching is important for developing quantum programs. Motivated by the incorrectness logic for classical programs, we propose an incorrectness logic towards a logical foundation for static bug-catching in quantum programming. The validity of formulas in this logic is dual to that of quantum Hoare logics. We justify the formulation of validity by an intuitive explanation from a reachability point of view and a comparison against several alternative formulations. Compared with existing works focusing on dynamic analysis, our logic provides sound and complete arguments. We further demonstrate the usefulness of the logic by reasoning several examples, including Grover's search, quantum teleportation, and a repeat-until-success program. We also automate the reasoning procedure by a prototyped static analyzer built on top of the logic rules. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1145/3527316 | Proceedings of the ACM on Programming Languages |
Keywords | DocType | Volume |
Incorrectness Logic, Quantum Programming Languages, Projective Quantum Predicates | Journal | 6 |
Issue | Citations | PageRank |
OOPSLA1 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peng Yan | 1 | 0 | 0.34 |
| Hanru Jiang | 2 | 0 | 0.68 |
| Nengkun Yu | 3 | 0 | 0.68 |