85 search results - page 14 / 17 » Towards Automatic Analysis of Election Verifiability Propert... |
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
APWEB
2009
Springer
13 years 11 months ago
2009
Springer
We present a new method to evaluate a search ontology, which relies on mapping ontology instances to textual documents. On the basis of this mapping, we evaluate the adequacy of on...
MICCAI
2009
Springer
14 years 8 months ago
2009
Springer
We propose a method for the analysis of Magnetic Resonance (MR) cardiac images with the goal of reconstructing the motion of the ventricular walls. The main feature of our method i...
FSTTCS
2003
Springer
14 years 18 days ago
2003
Springer
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...