Name
Abstract | ||
|---|---|---|
We present a concise and natural encoding of the spi-calculus into the more basic 驴-calculus and establish its correctness with respect to a formal notion of testing.This is particularly relevant for security protocols modelled in spi since the tests ... |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/LICS.2004.5 | LICS |
Keywords | DocType | ISSN |
first order,encoding,artificial intelligence,computational complexity,arithmetic,polynomials,decision problem,computability,computer science,polynomial time,turing machines,second order,horn clauses,logic | Conference | 1043-6871 |
ISBN | Citations | PageRank |
0-7695-2192-4 | 4 | 0.49 |
References | Authors | |
4 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stephen Cook | 1 | 4864 | 2433.99 |
| Antonina Kolokolova | 2 | 50 | 10.09 |