|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
15th IEEE Computer Security Foundations Workshop (CSFW'02)
Strand Spaces and Rank Functions: More than Distant Cousins
Cape Breton, Nova Scotia, Canada
June 24-June 26
ISBN: 0-7695-1689-0
| ASCII Text | x | ||
| James Heather, "Strand Spaces and Rank Functions: More than Distant Cousins," Computer Security Foundations Workshop, IEEE, pp. 104, 15th IEEE Computer Security Foundations Workshop (CSFW'02), 2002. | |||
| BibTex | x | ||
| @article{ 10.1109/CSFW.2002.1021810, author = {James Heather}, title = {Strand Spaces and Rank Functions: More than Distant Cousins}, journal ={Computer Security Foundations Workshop, IEEE}, volume = {0}, year = {2002}, issn = {1063-6900}, pages = {104}, doi = {http://doi.ieeecomputersociety.org/10.1109/CSFW.2002.1021810}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Computer Security Foundations Workshop, IEEE TI - Strand Spaces and Rank Functions: More than Distant Cousins SN - 1063-6900 SP EP A1 - James Heather, PY - 2002 KW - null VL - 0 JA - Computer Security Foundations Workshop, IEEE ER - | |||
The strand spaces model and the rank functions model have both been used successfully to analyse and verify security protocols running on unbounded networks. At first sight, these two approaches appear rather different; however, close inspection reveals that there are strong links between strand spaces and rank functions.
Citation:
James Heather, "Strand Spaces and Rank Functions: More than Distant Cousins," csfw, pp.104, 15th IEEE Computer Security Foundations Workshop (CSFW'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.