Sciweavers

1415 search results - page 13 / 283
» Verified systems by composition from verified components
Sort
View
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
EVOTING
2004
113views Hardware» more  EVOTING 2004»
13 years 9 months ago
Verifiability and Other Technical Requirements for Online Voting Systems
: When developing a catalogue of technical requirements for online voting systems to be used in legally ruled, non-parliamentary elections, major interdisciplinary problems arise w...
Nils Meißner, Volker Hartmann, Dieter Richte...
EMISA
2002
Springer
13 years 7 months ago
DAWN for component based systems - just a different perspective
DAWN is technique for modelling and verifying network algorithms, which is based on Petri nets and temporal logic. In this paper, we present a different perspective of DAWN that al...
Ekkart Kindler
RSP
2007
IEEE
139views Control Systems» more  RSP 2007»
14 years 1 months ago
Verifying Distributed Protocols using MSC-Assertions, Run-time Monitoring, and Automatic Test Generation
This paper addresses the need for formal specification and runtime verification of system-level requirements of distributed reactive systems. It describes a formalism for specifyi...
Doron Drusinsky, Man-tak Shing
USS
2008
13 years 10 months ago
Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes
We introduce Scantegrity II, a practical enhancement for optical scan voting systems that achieves increased election integrity through the novel use of confirmation codes printed...
David Chaum, Richard Carback, Jeremy Clark, Aleksa...