154 search results - page 25 / 31 » Cryptographically Sound Theorem Proving |
JELIA
2010
Springer
13 years 6 months ago
2010
Springer
Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order form...
CONCUR
2012
Springer
11 years 10 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
CSFW
2000
IEEE
14 years 2 days ago
2000
IEEE
One protocol (called the primary protocol) is independent of other protocols (jointly called the secondary protocol) if the question whether the primary protocol achieves a securi...
SP
2009
IEEE
14 years 2 months ago
2009
IEEE
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
CCS
2000
ACM
14 years 8 hour ago
2000
ACM
We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the wellknown simulatability approach, i.e., the specification is an ...