325 search results - page 31 / 65 » Proofs of Restricted Shuffles |
ICTCS
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
CCS
2001
ACM
14 years 2 months ago
2001
ACM
The events of a security protocol and their causal dependency can play an important role in the analysis of security properties. This insight underlies both strand spaces and the ...
CSL
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
TAPSOFT
1997
Springer
14 years 2 months ago
1997
Springer
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...
CCS
2008
ACM
13 years 12 months ago
2008
ACM
A recent development in formal security protocol analysis is the Protocol Composition Logic (PCL). We identify a number of problems with this logic as well as with extensions of t...