Sciweavers

338 search results - page 56 / 68
» Locally checkable proofs
Sort
View
CSL
2000
Springer
14 years 1 months ago
Composition and Submachine Concepts for Sequential ASMs
We define three composition and structuring concepts which reflect frequently used refinements of ASMs and integrate standard structuring constructs into the global state based ...
Egon Börger, Joachim Schmid
FM
1999
Springer
109views Formal Methods» more  FM 1999»
14 years 1 months ago
Compositional Symmetric Sharing in B
Sharing between B constructs is limited, both on the specification and the implementation level. The limitations stem from the single writer/multiple readers paradigm, restricted ...
Martin Büchi, Ralph-Johan Back
USS
2008
13 years 11 months ago
VoteBox: A Tamper-evident, Verifiable Electronic Voting System
Commercial electronic voting systems have experienced many high-profile software, hardware, and usability failures in real elections. While it is tempting to abandon electronic vo...
Daniel Sandler, Kyle Derr, Dan S. Wallach
IWFM
2003
13 years 10 months ago
Using Admissible Interference to Detect Denial of Service Vulnerabilities
Meadows recently proposed a formal cost-based framework for analysis of denial of service. It was showed how some principles that have already been used to make cryptographic prot...
Stéphane Lafrance, John Mullins
UAI
2003
13 years 10 months ago
Large-Sample Learning of Bayesian Networks is NP-Hard
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a ...
David Maxwell Chickering, Christopher Meek, David ...