Abstract
We introduce new software for provably correct computation with Single Transferable Voting (STV) algorithms. The software is engineered as a framework for modular formalisation, verification, extraction of executable certifying programmes, and verified certificate checking for various STV algorithms. We demonstrate functionality and effectiveness of our approach by evaluating the software on some real-size elections.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Source codes are at https://github.com/MiladKetabGhale.
References
CakeML: A Verified Implementation of ML. https://cakeml.org/
Conway, A., Blom, M., Naish, L., Teague, V.: An analysis of New South Wales electronic vote counting. In: Proceeding of ACSW 2017, pp. 24:1–24:5 (2017)
The Coq Theorem Prover. https://coq.inria.fr/
DeYoung, H., Schürmann, C.: Linear logical voting protocols. In: Kiayias, A., Lipmaa, H. (eds.) Vote-ID 2011. LNCS, vol. 7187, pp. 53–70. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32747-6_4
Ghale, M.K., Goré, R., Pattinson, D.: A formally verified single transferable voting scheme with fractional values. In: Krimmer, R., Volkamer, M., Braun Binder, N., Kersting, N., Pereira, O., Schürmann, C. (eds.) E-Vote-ID 2017. LNCS, vol. 10615, pp. 163–182. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68687-5_10
Ghale, M.K., Gore, R., Pattinson, D., Tiwari, M.: Modular formalisation and verification of STV algorithms. In: Forthcoming E-Vote-ID 2018. LNCS. Springer, Heidelberg (2018)
Ghale, M.K., Pattinson, D., Kummar, R., Norrish, M.: Verified certificate checking for counting votes. In: Forthcoming VSTTE 2018. LNCS. Springer, Heidelberg (2018)
Girard, J.Y.: Linear logic. Theor. Comput. Sci. 50, 1–102 (1987)
HOL Interactive Theorem Prover. https://hol-theorem-prover.org/
Pattinson, D., Schürmann, C.: Vote counting as mathematical proof. In: Australasian Conference on Artificial Intelligence, pp. 464–475 (2015)
Pattinson, D., Tiwari, M.: Schulze voting as evidence carrying computation. In.: Proceedings of ITP, pp. 410–426 (2017)
Verity, F., Pattinson, D.: Formally verified invariants of vote counting schemes. In: ACSW, pp. 31:1–31:10 (2017)
Cortier, V., Galindo, D., Küsters, R., Müller, J., Truderung, T.: Verifiability notions for E-Voting protocols. IACR Cryptology ePrint Archive 2016: 287 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Ghale, M.K. (2018). Engineering Software for Modular Formalisation and Verification of STV Algorithms. In: Sun, J., Sun, M. (eds) Formal Methods and Software Engineering. ICFEM 2018. Lecture Notes in Computer Science(), vol 11232. Springer, Cham. https://doi.org/10.1007/978-3-030-02450-5_35
Download citation
DOI: https://doi.org/10.1007/978-3-030-02450-5_35
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-02449-9
Online ISBN: 978-3-030-02450-5
eBook Packages: Computer ScienceComputer Science (R0)