Sciweavers

426 search results - page 64 / 86
» Specification, Abduction, and Proof
Sort
View
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
14 years 10 months ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...
PKC
2009
Springer
180views Cryptology» more  PKC 2009»
14 years 10 months ago
Security of Sanitizable Signatures Revisited
Sanitizable signature schemes, as defined by Ateniese et al. (ESORICS 2005), allow a signer to partly delegate signing rights to another party, called the sanitizer. That is, the s...
Anja Lehmann, Christina Brzuska, Dominique Schr&ou...
CADE
2008
Springer
14 years 10 months ago
Model Stack for the Pervasive Verification of a Microkernel-based Operating System
Abstract. Operating-system verification gains increasing research interest. The complexity of such systems is, however, challenging and many endeavors are limited in some respect: ...
Jan Dörrenbächer, Matthias Daum, Sebasti...
CADE
2005
Springer
14 years 10 months ago
Temporal Logics over Transitive States
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
Boris Konev, Frank Wolter, Michael Zakharyaschev
ESOP
2010
Springer
14 years 7 months ago
Generative Operational Semantics for Relaxed Memory Models
The specification of the Java Memory Model (JMM) is phrased in terms of acceptors of execution sequences rather than the standard generative view of operational semantics. This cre...
Radha Jagadeesan, Corin Pitcher and James Riely