On the Specification and Verification of Voting Schemes

dc.contributor.authorBeckert, Bernhard
dc.contributor.authorGore, Rajeev
dc.contributor.authorSchurmann, Carsten
dc.coverage.spatialGuildford United Kingdom
dc.date.accessioned2015-12-10T23:20:08Z
dc.date.createdJuly 17-19 2013
dc.date.issued2013
dc.date.updated2016-02-24T10:58:05Z
dc.description.abstractThe ability to count ballots by computers 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
dc.identifier.urihttp://hdl.handle.net/1885/66190
dc.publisherSpringer
dc.relation.ispartofseriesVoteID 2013: The 4th International Conference on e-Voting and Identity
dc.sourceLecture Notes in Computer Science
dc.subjectKeywords: First order logic; Semantic criteria; Specification and verification; Voting schemes; Model checking; Semantics
dc.titleOn the Specification and Verification of Voting Schemes
dc.typeConference paper
local.bibliographicCitation.lastpage40
local.bibliographicCitation.startpage25
local.contributor.affiliationBeckert, Bernhard, Karlsruhe Institute of Technology
local.contributor.affiliationGore, Rajeev, College of Engineering and Computer Science, ANU
local.contributor.affiliationSchurmann, Carsten, IT University of Copenhagen
local.contributor.authoruidGore, Rajeev, u9409448
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.identifier.absfor080203 - Computational Logic and Formal Languages
local.identifier.absseo970108 - Expanding Knowledge in the Information and Computing Sciences
local.identifier.ariespublicationu4334215xPUB1239
local.identifier.doi10.1007/978-3-642-39185-9_2
local.identifier.scopusID2-s2.0-84880890582
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
01_Beckert_On_the_Specification_and_2013.pdf
Size:
237.8 KB
Format:
Adobe Portable Document Format