2137 search results - page 206 / 428 » Proving Abstract Non-interference |
117
Voted
SAT
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
122
click to vote
SAT
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
125
click to vote
TCC
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the well-known simulatability approach of modern cryptography...
123
Voted
TYPES
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
112
click to vote
VMCAI
2004
Springer
15 years 8 months ago
2004
Springer
The method of Invisible Invariants was developed originally in order to verify safety properties of parameterized systems fully automatically. Roughly speaking, the method is based...