Paper Info
Title
Linear logical voting protocols
Abstract
Current approaches to electronic implementations of voting protocols involve translating legal text to source code of an imperative programming language. Because the gap between legal text and source code is very large, it is difficult to trust that the program meets its legal specification. In response, we promote linear logic as a high-level language for both specifying and implementing voting protocols. Our linear logical specifications of the single-winner first-past-the-post (SW-FPTP) and single transferable vote (STV) protocols demonstrate that this approach leads to concise implementations that closely correspond to their legal specification, thereby increasing trust.
Year
DOI
Venue
2011
10.1007/978-3-642-32747-6_4
VOTE-ID
Keywords
Field
DocType
imperative programming language,voting protocol,linear logical specification,legal specification,linear logic,source code,legal text,linear logical voting protocol,electronic implementation,high-level language,current approach
Single transferable vote,Voting,Source code,Computer science,Imperative programming,Implementation,Theoretical computer science,Linear logic,Logic programming
Conference
Citations 
PageRank 
References 
3
0.67
12
Authors
2
Name
Order
Citations
PageRank
Henry DeYoung1694.74
Carsten Schürmann262549.63