Proving the monotonicity criterion for a plurality vote-counting program as a step towards verified vote-counting

Rajeev Gore, Thomas Meumann

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Citations (Scopus)

    Abstract

    We show how modern interactive verification tools can be used to prove complex properties of vote-counting software. Specifically, we give an ML implementation of a votecounting program for plurality voting; we give an encoding of this program into the higher-order logic of the HOL4 theorem prover; we give an encoding of the monotonicity property in the same higher-order logic; we then show how we proved that the encoding of the program satisfies the encoding of the monotonicity property using the interactive theorem prover HOL4. As an aside, we also show how to prove the correctness of the vote-counting program. We then discuss the robustness of our approach.

    Original languageEnglish
    Title of host publication2014 6th International Conference on Electronic Voting
    Subtitle of host publicationVerifying the Vote - IEEE Proceedings EVOTE 2014
    EditorsRobert Krimmer, Melanie Volkamer
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    ISBN (Electronic)9783200036970
    DOIs
    Publication statusPublished - 1 Jan 2015
    Event6th International Conference on Electronic Voting, EVOTE 2014 - Lochau / Bregenz, Austria
    Duration: 28 Oct 201431 Oct 2014

    Publication series

    Name2014 6th International Conference on Electronic Voting: Verifying the Vote - IEEE Proceedings EVOTE 2014

    Conference

    Conference6th International Conference on Electronic Voting, EVOTE 2014
    Country/TerritoryAustria
    CityLochau / Bregenz
    Period28/10/1431/10/14

    Fingerprint

    Dive into the research topics of 'Proving the monotonicity criterion for a plurality vote-counting program as a step towards verified vote-counting'. Together they form a unique fingerprint.

    Cite this