Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Machine-checked reasoning about complex voting schemes using higher-order logic

Simple item page
dc.contributor.authorDawson, Jeremy
dc.contributor.authorGore, Rajeev
dc.contributor.authorMeumann, Tom
dc.coverage.spatialBern, Switzerland
dc.date.accessioned2016-06-14T23:20:21Z
dc.date.createdSeptember 2-4, 2015
dc.date.issued2015
dc.date.updated2016-06-14T08:48:25Z
dc.description.abstractWe describe how we first formally encoded the Englishlanguage Parliamentary Act for the Hare-Clark Single Transferable Vote-counting scheme used in the Australian state of Tasmania into higher-order logic, producing SPECHOL. Based on this logical specification, we then encoded an SML program to count ballots according to this specification inside the interactive theorem prover HOL4, giving us IMPHOL. We then manually transliterated the program as a real SML program IMP. We are currently verifying that the formalisation of the implementation implies the formalisation of the specification: that is, we are using the HOL4 interactive theorem prover to prove the implication IMPHOL→ SPECHOL.
dc.identifier.isbn9783319222691
dc.identifier.urihttp://hdl.handle.net/1885/103340
dc.publisherSpringer International Publishing Switzerland
dc.relation.ispartofseries5th International Conference on E-Voting and Identity, VoteID 2015
dc.sourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.titleMachine-checked reasoning about complex voting schemes using higher-order logic
dc.typeConference paper
local.bibliographicCitation.lastpage158
local.bibliographicCitation.startpage142
local.contributor.affiliationDawson, Jeremy, College of Engineering and Computer Science, ANU
local.contributor.affiliationGore, Rajeev, College of Engineering and Computer Science, ANU
local.contributor.affiliationMeumann, Tom, College of Engineering and Computer Science, ANU
local.contributor.authoruidDawson, Jeremy, u8413080
local.contributor.authoruidGore, Rajeev, u9409448
local.contributor.authoruidMeumann, Tom, u5028081
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor080201 - Analysis of Algorithms and Complexity
local.identifier.absfor160601 - Australian Government and Politics
local.identifier.absseo940202 - Electoral Systems
local.identifier.absseo970108 - Expanding Knowledge in the Information and Computing Sciences
local.identifier.ariespublicationU3488905xPUB6568
local.identifier.doi10.1007/978-3-319-22270-7_9
local.identifier.scopusID2-s2.0-84944710102
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
01_Dawson_Machine-checked_reasoning_2015.pdf
Size:
318.99 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS