7 papers · 1 filter
A Practical Specification Language for Automatic Quantum Program Verification (Technical Report)
Wei-Lun Tsai, Yu-Fang Chen, OndÅej Lengál
Hoare-style verification provides a principled foundation for reasoning about the correctness of quantum programs, but existing approaches do not allow fully automatic verification…
Parameterized Verification of Quantum Circuits (Technical Report)
Parosh Aziz Abdulla, Yu-Fang Chen, Michal HeÄko +4
We present the first fully automatic framework for verifying relational properties of parameterized quantum programs, i.e., a program that, given an input size, generates a corresp…
Negated String Containment is Decidable (Technical Report)
VojtÄch Havlena, Michal HeÄko, Lukáš HolÃk +1
We provide a positive answer to a long-standing open question of the decidability of the not-contains string predicate. Not-contains is practically relevant, for instance in symbol…
A Uniform Framework for Handling Position Constraints in String Solving (Technical Report)
Yu-Fang Chen, VojtÄch Havlena, Michal HeÄko +2
We introduce a novel decision procedure for solving the class of position string constraints, which includes string disequalities, not-prefixof, not-suffixof, strat, and not-str…
Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report)
Parosh Aziz Abdulla, Yo-Ga Chen, Yu-Fang Chen +5
We present a new method for the verification of quantum circuits based on a novel symbolic representation of sets of quantum states using level-synchronized tree automata (LSTAs).…
Complementation of Emerson-Lei Automata (Technical Report)
VojtÄch Havlena, OndÅej Lengál, Barbora Å mahlÃková
We give new constructions for complementing subclasses of Emerson-Lei automata using modifications of rank-based Büchi automata complementation. In particular, we propose a specia…