Sciweavers

4224 search results - page 666 / 845
» Reasoning about Choice
Sort
View
DIM
2007
ACM
15 years 9 months ago
Receipt management- transaction history based trust establishment
In a history-based trust-management system, users and service providers use information about past transactions to make trust-based decisions concerning current transactions. One ...
Abhilasha Bhargav-Spantzel, Jungha Woo, Elisa Bert...
CAV
2010
Springer
192views Hardware» more  CAV 2010»
15 years 9 months ago
Invariant Synthesis for Programs Manipulating Lists with Unbounded Data
We address the issue of automatic invariant synthesis for sequential programs manipulating singly-linked lists carrying data over infinite data doe define for that a framework ba...
Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, A...
CAV
2010
Springer
239views Hardware» more  CAV 2010»
15 years 9 months ago
Model Checking of Linearizability of Concurrent List Implementations
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...
Pavol Cerný, Arjun Radhakrishna, Damien Zuf...
CSFW
2010
IEEE
15 years 9 months ago
A Machine-Checked Formalization of Sigma-Protocols
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
Gilles Barthe, Daniel Hedin, Santiago Zanella B&ea...
CSFW
2010
IEEE
15 years 9 months ago
Approximation and Randomization for Quantitative Information-Flow Analysis
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...
Boris Köpf, Andrey Rybalchenko