Hanna Lachnitt
Ph.D. Student in Computer Science, admitted Autumn 2020
Bio
I am a fourth year PhD student advised by Clark Barrett and part of the CENTAUR lab at Stanford University. My research interests lie in automated reasoning and formal verification. I am currently working on proofs for SMT solvers.
All Publications
-
IsaRARE: Automatic Verification of SMT Rewrites in Isabelle/HOL
SPRINGER INTERNATIONAL PUBLISHING AG. 2024: 311-330
View details for DOI 10.1007/978-3-031-57246-3_17
View details for Web of Science ID 001284177100017
-
Generating and Exploiting Automated Reasoning Proof Certificates
COMMUNICATIONS OF THE ACM
2023; 66 (10): 86-95
View details for DOI 10.1145/3587692
View details for Web of Science ID 001075786500018
-
CARCARA: An Efficient Proof Checker and Elaborator for SMT Proofs in the Alethe Format
SPRINGER INTERNATIONAL PUBLISHING AG. 2023: 367-386
View details for DOI 10.1007/978-3-031-30823-1_19
View details for Web of Science ID 001288688000019
-
cvc5: A Versatile and Industrial-Strength SMT Solver
SPRINGER INTERNATIONAL PUBLISHING AG. 2022: 415-442
View details for DOI 10.1007/978-3-030-99524-9_24
View details for Web of Science ID 000782396700024
-
Flexible Proof Production in an Industrial-Strength SMT Solver
SPRINGER INTERNATIONAL PUBLISHING AG. 2022: 15-35
View details for DOI 10.1007/978-3-031-10769-6_3
View details for Web of Science ID 000876376400003
-
Axiomatic Hardware-Software Contracts for Security
ASSOC COMPUTING MACHINERY. 2022: 72-86
View details for DOI 10.1145/3470496.3527412
View details for Web of Science ID 000852702500006
-
Certified Quantum Computation in Isabelle/HOL.
Journal of automated reasoning
2021; 65 (5): 691-709
Abstract
In this article we present an ongoing effort to formalise quantum algorithms and results in quantum information theory using the proof assistant Isabelle/HOL. Formal methods being critical for the safety and security of algorithms and protocols, we foresee their widespread use for quantum computing in the future. We have developed a large library for quantum computing in Isabelle based on a matrix representation for quantum circuits, successfully formalising the no-cloning theorem, quantum teleportation, Deutsch's algorithm, the Deutsch-Jozsa algorithm and the quantum Prisoner's Dilemma. We discuss the design choices made and report on an outcome of our work in the field of quantum game theory.
View details for DOI 10.1007/s10817-020-09584-7
View details for PubMedID 34720282
View details for PubMedCentralID PMC8550268
-
Certified Quantum Computation in Isabelle/HOL
JOURNAL OF AUTOMATED REASONING
2020
View details for DOI 10.1007/s10817-020-09584-7
View details for Web of Science ID 000601507400001