Sciweavers

37 search results - page 2 / 8
» Specifying and verifying requirements for election processes
Sort
View
WDAG
2000
Springer
87views Algorithms» more  WDAG 2000»
13 years 11 months ago
A Probabilistically Correct Leader Election Protocol for Large Groups
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...
Indranil Gupta, Robbert van Renesse, Kenneth P. Bi...
ICISS
2010
Springer
13 years 5 months ago
Stamp-It: A Method for Enhancing the Universal Verifiability of E2E Voting Systems
Existing proposals for end-to-end independently-verifiable (E2E) voting systems require that voters check the presence of a "receipt" on a secure bulletin board. The tall...
Mridul Nandi, Stefan Popoveniuc, Poorvi L. Vora
CCS
2009
ACM
13 years 11 months ago
On voting machine design for verification and testability
We present an approach for the design and analysis of an electronic voting machine based on a novel combination of formal verification and systematic testing. The system was desig...
Cynthia Sturton, Susmit Jha, Sanjit A. Seshia, Dav...
MODELS
2010
Springer
13 years 5 months ago
Automatically Discovering Properties That Specify the Latent Behavior of UML Models
Formal analysis can be used to verify that a model of the system adheres to its requirements. As such, traditional formal analysis focuses on whether known (desired) system propert...
Heather Goldsby, Betty H. C. Cheng
ICWS
2008
IEEE
13 years 8 months ago
A Framework for Verifying SLA Compliance in Composed Services
Service level agreements (SLAs) impose many nonfunctional requirements on services. Business analysts specify and check these requirements in business process models using tools s...
Hua Xiao, Brian Chan, Ying Zou, Jay W. Benayon, Bi...