DeepAI AI Chat
Log In Sign Up

CoqQ: Foundational Verification of Quantum Programs

by   Li Zhou, et al.

CoqQ is a framework for reasoning about quantum programs in the Coq proof assistant. Its main components are: a deeply embedded quantum programming language, in which classic quantum algorithms are easily expressed, and an expressive program logic for proving properties of programs. CoqQ is foundational: the program logic is formally proved sound with respect to a denotational semantics based on state-of-art mathematical libraries (mathcomp and mathcomp analysis). CoqQ is also practical: assertions can use Dirac expressions, which eases concise specifications, and proofs can exploit local and parallel reasoning, which minimizes verification effort. We illustrate the applicability of CoqQ with many examples from the literature.


page 1

page 2

page 3

page 4


Toward Automatic Verification of Quantum Programs

This paper summarises the results obtained by the author and his collabo...

PML 2 : Integrated Program Verification in ML

We present the PML 2 language, which provides a uniform environment for ...

SMLtoCoq: Automated Generation of Coq Specifications and Proof Obligations from SML Programs with Contracts

Formally reasoning about functional programs is supposed to be straightf...

VST-A: A Foundationally Sound Annotation Verifier

An interactive program verification tool usually requires users to write...

Verification of Locally Tight Programs

ANTHEM is a proof assistant that can be used for verifying the correctne...

A Framework for Modelling, Verification and Transformation of Concurrent Imperative Programs

The paper gives a comprehensive presentation of a framework, embedded in...

Slicing of Probabilistic Programs based on Specifications

This paper presents the first slicing approach for probabilistic program...