Name
Abstract | ||
|---|---|---|
The possibility to use computers for counting ballots allows us to design new voting schemes that are arguably fairer than existing schemes designed for hand-counting. We argue that formal methods can and should be used to ensure that such schemes behave as intended and conform to the desired democratic properties. Specifically, we define two semantic criteria for single transferable vote (STV) schemes, formulated in first-order logic over the theories of arrays and integers, and show how bounded model-checking and SMT solvers can be used to check whether these criteria are met. As a case study, we then analyse an existing voting scheme for electing the board of trustees for a major international conference and discuss its deficiencies. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.jisa.2014.04.005 | Journal of Information Security and Applications |
Keywords | Field | DocType |
smt solvers,verification,single transferable vote,voting schemes,bounded model checking | Integer,Single transferable vote,Voting,Computer science,Computer security,Theoretical computer science,Formal methods,Democracy,Bounded function | Journal |
Volume | Issue | ISSN |
19 | 2 | 2214-2126 |
Citations | PageRank | References |
3 | 0.45 | 6 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bernhard Beckert | 1 | 862 | 86.50 |
| Rajeev Goré | 2 | 641 | 63.45 |
| Carsten Schürmann | 3 | 625 | 49.63 |
| Thorsten Bormer | 4 | 3 | 0.45 |
| Jian Wang | 5 | 3 | 0.79 |