3228 search results - page 238 / 646 » Computationally Sound Proofs |
160
click to vote
FM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Bounding resource usage is important for a number of areas, notably real-time embedded systems and safety-critical systems. In this paper, we present a fully automatic st...
159
click to vote
ACSAC
2006
IEEE
16 years 21 days ago
2006
IEEE
We propose an architecture of four complimentary technologies increasingly relevant to a growing number of home users and organizations: cryptography, separation kernels, formal v...
204
click to vote
PKC
2010
Springer
15 years 10 months ago
2010
Springer
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
136
click to vote
APAL
2002
15 years 6 months ago
2002
Whenever a structure with a particularly interesting computability-theoretic property is found, it is natural to ask whether similar examples can be found within well-known classe...
157
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We prove that no finite, sound axiomatization for BCCSP modulo impossible...