共查询到20条相似文献,搜索用时 453 毫秒
1.
2.
3.
A methodology for plane tree enumeration 总被引:2,自引:0,他引:2
Elena Barcucci Alberto Del Lungo Elisa Pergola Renzo Pinzani 《Discrete Mathematics》1998,180(1-3):45-64
4.
5.
6.
7.
8.
9.
MULTISCALE ISSUES IN DNS OF MULTIPHASE FLOWS 总被引:1,自引:0,他引:1
10.
11.
12.
13.
14.
A Formal Language for Cryptographic Protocol Requirements 总被引:4,自引:0,他引:4
In this paper we present a formal language for specifying and reasoning about cryptographic protocol requirements. We give sets of requirements for key distribution protocols and for key agreement protocols in that language. We look at a key agreement protocol due to Aziz and Diffie that might meet those requirements and show how to specify it in the language of the NRL Protocol Analyzer. We also show how to map our formal requirements to the language of the NRL Protocol Analyzer and use the Analyzer to show that the protocol meets those requirements. In other words, we use the Analyzer to assess the validity of the formulae that make up the requirements in models of the protocol. Our analysis reveals an implicit assumption about implementations of the protocol and reveals subtleties in the kinds of requirements one might specify for similar protocols. 相似文献
15.
16.
17.
18.
19.
20.
Elizabeth Goode 《Discrete Applied Mathematics》2007,155(8):989-1006
We use syntactic monoid methods, together with an enhanced pumping lemma, to investigate the structure of splicing languages. We obtain an algorithm for deciding whether a regular language is a reflexive splicing language, but the general question remains open. 相似文献