Name
Abstract | ||
|---|---|---|
We introduce a formal, modular framework that captures a large number of different instances of the Single Transferable Vote (STV) counting scheme in a uniform way. The framework requires that each instance defines the precise mechanism of counting and transferring ballots, electing and eliminating candidates. From formal proofs of basic sanity conditions for each mechanism inside the Coq theorem prover, we then synthesise code that implements the given scheme in a provably correct way and produces a universally verifiable certificate of the count. We have applied this to various variations of STV, including several used in Australian parliamentary elections and demonstrated the feasibility of our approach by means of real-world case studies. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-030-00419-4_4 | Lecture Notes in Computer Science |
DocType | Volume | ISSN |
Conference | 11143 | 0302-9743 |
Citations | PageRank | References |
1 | 0.37 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Milad K. Ghale | 1 | 1 | 1.05 |
| Rajeev Goré | 2 | 641 | 63.45 |
| Dirk Pattinson | 3 | 617 | 51.32 |
| Mukesh Tiwari | 4 | 5 | 2.54 |