On the Specification and Verification of Voting Schemes
The 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
|Collections||ANU Research Publications|
|Source:||Lecture Notes in Computer Science|
|01_Beckert_On_the_Specification_and_2013.pdf||237.8 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.