Modular Synthesis of Verified Verifiers of Computation with STV Algorithms
Single transferrable vote (STV) is a family of preferential voting systems, different instances of which are used in binding elections throughout the world. We give a formal specification of this family, from which we derive fully verified tools that verify the computation for various instances of STV vote counting. These tools validate the probably correct execution of a run of a vote counting algorithm, based on a transcript of the count.
Our framework distils the similarities and differences of various instances of STV and gives a uniform and modular way of synthesising verifiers for its various instances, and provides the flexibility and ease for adapting and extending it to a variety of STV schemes. We minimise the trusted base in correctness of the tools produced by using the HOL4 and CakeML as the technical basis. We first formally specify and verify the tools in HOL4 and then obtain the machine executable versions for the tools by relying on the verified proof translator and the compiler of the CakeML. Moreover, proofs that we establish in HOL4 and CakeML are almost completely automated so that new verified instances of STV can be created with no (or minimal) extra proof. Finally, our experimental results with executable code demonstrate feasibility of deploying the framework for verifying real size elections having an STV counting algorithm.
Mon 27 MayDisplayed time zone: Eastern Time (US & Canada) change
16:00 - 18:00
|Modular Synthesis of Verified Verifiers of Computation with STV Algorithms
|A Vision for Helping Developers Use APIs by Leveraging Temporal Patterns
|A Proof-Producing Translator for Verilog Development in HOL
|On the Formalization of Importance Measures using HOL Theorem Proving
C: Nico Plat Thanos