7,444 research outputs found
A Process Calculus for Dynamic Networks
In this paper we propose a process calculus framework for dynamic networks in which the network topology may change as computation proceeds. The proposed calculus allows one to abstract away from neighborhood-discovery computations and it contains features for broadcasting at multiple transmission ranges and for viewing networks at different levels of abstraction. We develop a theory of confluence for the calculus and we use the machinery developed towards
the verification of a leader-election algorithm for mobile ad hoc networks
Recommended from our members
Gaining assurance in a voter-verifiable voting system
The literature on e-voting systems has many examples of discussion of the correctness of the computer and communication algorithms of such systems, as well as discussions of their vulnerabilities. However, a gap in the literature concerns the practical need (before adoption of a specific e-voting system) for a complete case demonstrating that the system as a whole has sufficiently high probability of exhibiting the desired properties when in use in an actual election. This paper discusses the problem of producing such a case, with reference to a specific system: a version of the PrĂȘt Ă Voter scheme for voter-verifiable e-voting. We show a possible organisation of a case in terms of four main requirements â accuracy, privacy, termination and âtrustednessââ and show some of the detailed organisation that such a case should have, the diverse kinds of evidence that needs to be gathered and some of the interesting difficulties that arise
Overview of Final Exchange Regulations
Summarizes rules and regulations for establishing and operating state health insurance exchanges, as well as implications for eligibility determinations, verification rules, qualified health plans, and user fees and financial support for exchanges
No Match, No Vote
Responding to the loud wake-up call sounded in the 2000 election, Congress passed the Help America Vote Act (HAVA) in 2002, including provisions to streamline and modernize voter registration databases and establish identification requirements. However, in direct contravention of the intent of HAVA -- to impose fair and more uniform standards for state election administration -- some states have misinterpreted the law and passed onerous"No Match, No Vote" laws.Under such statutes, if a state is unable to match the information on a voter's registration application with information in an existing government database, the application is denied outright. Many of these non-matches, however, can be the result of errors outside of the applicant's control such as typographical data entry errors, flaws in existing governmental databases, and poor database matching protocols. By making it more difficult and sometimes impossible for applicants to register to vote, No Match, No Vote laws can and do disenfranchise qualified citizens. Shortly before the 2008 election, Time magazinedeclared the "Database Dilemma" number one on their list of "Things That Could Go Wrong on Election Day."As this paper will demonstrate, plenty of research exists to show that matching voter data with other government databases -- though required by HAVA -- is an unreliable, error-laden process, and that conditioning the right to vote on such a flawed system will inevitably disenfranchise eligible citizens. HAVA's verification provisions were put into place to improve state database management and facilitate accurate record keeping. These provisions were written to ensure that every voter's registration record has a unique number associated with it to allow states to easily identify duplicate registration records with greater confidence and determine and eliminate voters no longer eligible to vote in that jurisdiction.2 As the legislative history points out, it was not HAVA's intent in requiringa match to disenfranchise those otherwise eligible applicants whose data does not match exactly. Therefore, in order to comply with federal law while maintaining the rights of its citizens to vote, states should follow the best practices discussed below
Using SPIN to Analyse the Tree Identification Phase of the IEEE 1394 High-Performance Serial Bus(FireWire)Protocol
We describe how the tree identification phase of the IEEE 1394 high-performance serial bus (FireWire) protocol is modelled in Promela and verified using SPIN. The verification of arbitrary system configurations is discussed
- âŠ