Henry Allard

dblp:426/2916 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0003-8003-8139ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Program verification · 56% Compilers and program optimization · 44%
Theoretical computer science
1 paper
Quantum computing and quantum information · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization › domain-specific compilation
quantum compilation
0.912025
Embedding Quantum Program Verification into Dafny · Proc. ACM Program. Lang. 2025
Program verification › code-level verification
quantum program verification
0.912025
Embedding Quantum Program Verification into Dafny · Proc. ACM Program. Lang. 2025
Quantum computing and quantum information › quantum programming languages
quantum program verification
0.912025
Embedding Quantum Program Verification into Dafny · Proc. ACM Program. Lang. 2025
Program verification
deductive verification
0.312025
Embedding Quantum Program Verification into Dafny · Proc. ACM Program. Lang. 2025

Methods — techniques the papers use, named apart from their topics

formal verification · 1.7compilation to classical verifier · 1.7
YearPublicationVenuePosition
2025 Embedding Quantum Program Verification into Dafny
abstract
Despite recent development of quantum program verification, it is still in its early stage, where many quantum programs are hard to verify due to their inherent probabilistic nature and parallelism in quantum superposition. We propose Qafny c , a system that compiles quantum program verification into a well-established classical program verifier Dafny, enabling the formal verification of quantum programs. The key insight behind Qafny c is the separation of quantum program verification from its execution, leveraging the strength of classical verifiers to ensure correctness before compiling certified quantum programs into executable circuits. Using Qafny c , we have successfully verified 37 diverse quantum programs by compiling their verification into Dafny. To the best of our knowledge, this is the most extensive formally verified set of quantum programs.
Feifei Cheng, Sushen Vangeepuram, Henry Allard, Seyed Mohammad Reza Jafari, Alex Potanin, Liyi Li 0002
Proc. ACM Program. Lang.3