Sciweavers

79 search results - page 3 / 16
» Verifying Reference Counting Implementations
Sort
View
EEE
2005
IEEE
15 years 3 months ago
Who Counts Your Votes?
Open and fair elections are paramount to modern democracy. Although some people claim that the penciland-paper systems used in countries such as Canada and UK are still the best m...
Halina Kaminski, Lila Kari, Mark Perry
PODC
1993
ACM
15 years 1 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
FM
2009
Springer
104views Formal Methods» more  FM 2009»
15 years 4 months ago
Verifying Information Flow Control over Unbounded Processes
Abstract. Decentralized Information Flow Control (DIFC) systems enable programmers to express a desired DIFC policy, and to have the policy enforced via a reference monitor that re...
William R. Harris, Nicholas Kidd, Sagar Chaki, Som...
VMCAI
2010
Springer
15 years 6 months ago
Model-Checking In-Lined Reference Monitors
Abstract. A technique for elegantly expressing In-lined Reference Monitor (IRM) certification as model-checking is presented and implemented. In-lined Reference Monitors (IRM'...
Meera Sridhar, Kevin W. Hamlen
USS
2008
14 years 11 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...