-
2
-
-
84947720399
-
A bisimulation method for cryptographic protocols
-
Martín Abadi and Andrew D. Gordon. A bisimulation method for cryptographic protocols. Nordic Journal of Computing, 5:267-303, 1998. Preliminary version appeared in Programming Languages and Systems - ESOP'98, 7th European Symposium on Programming, Lecture Notes in Computer Science, Springer-Verlag, vol. 1381, pages 12-26, 1998.
-
(1998)
Nordic Journal of Computing
, vol.5
, pp. 267-303
-
-
Abadi, M.1
Gordon, A.D.2
-
3
-
-
84947720399
-
-
Preliminary version appeared in Springer-Verlag
-
Martín Abadi and Andrew D. Gordon. A bisimulation method for cryptographic protocols. Nordic Journal of Computing, 5:267-303, 1998. Preliminary version appeared in Programming Languages and Systems - ESOP'98, 7th European Symposium on Programming, Lecture Notes in Computer Science, Springer-Verlag, vol. 1381, pages 12-26, 1998.
-
(1998)
Programming Languages and Systems - ESOP'98, 7th European Symposium on Programming, Lecture Notes in Computer Science
, vol.1381
, pp. 12-26
-
-
-
4
-
-
0003092378
-
A calculus for cryptographic protocols: The spi calculus
-
Martín Abadi and Andrew D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Compulation, 148(1):1-70, 1999. Preliminary version appeared in Proceedings of the 4th ACM Conference on Computer and Communications Security, pp. 36-47, 1997.
-
(1999)
Information and Compulation
, vol.148
, Issue.1
, pp. 1-70
-
-
Abadi, M.1
Gordon, A.D.2
-
5
-
-
0003092378
-
-
Preliminary version appeared in
-
Martín Abadi and Andrew D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Compulation, 148(1):1-70, 1999. Preliminary version appeared in Proceedings of the 4th ACM Conference on Computer and Communications Security, pp. 36-47, 1997.
-
(1997)
Proceedings of the 4th ACM Conference on Computer and Communications Security
, pp. 36-47
-
-
-
6
-
-
0002534194
-
The lazy lambda calculus
-
David A. Turner, editor, Addison Wesley
-
Samson Abramsky. The lazy lambda calculus. In David A. Turner, editor, Research Topics in Functional Programming, pages 65-117. Addison Wesley, 1990.
-
(1990)
Research Topics in Functional Programming
, pp. 65-117
-
-
Abramsky, S.1
-
7
-
-
0036308321
-
Proof techniques for cryptographic processes
-
Michele Boreale, Rocco De Nicola, and Rosario Pugliese. Proof techniques for cryptographic processes. SIAM Journal on Computing, 31(3):947-986, 2002. Preliminary version appeared in 14th Annual IEEE Symposium on Logic in Computer Science, pp. 157-166, 1999.
-
(2002)
SIAM Journal on Computing
, vol.31
, Issue.3
, pp. 947-986
-
-
Boreale, M.1
De Nicola, R.2
Pugliese, R.3
-
8
-
-
0036308321
-
-
Preliminary version appeared in
-
Michele Boreale, Rocco De Nicola, and Rosario Pugliese. Proof techniques for cryptographic processes. SIAM Journal on Computing, 31(3):947-986, 2002. Preliminary version appeared in 14th Annual IEEE Symposium on Logic in Computer Science, pp. 157-166, 1999.
-
(1999)
14th Annual IEEE Symposium on Logic in Computer Science
, pp. 157-166
-
-
-
11
-
-
0000865197
-
Syntactic type abstraction
-
Dan Grossman, Greg Morrisett, and Steve Zdancewic. Syntactic type abstraction. ACM Transactions on Programming Languages and Systems, 22(6): 1037-1080, 2000.
-
(2000)
ACM Transactions on Programming Languages and Systems
, vol.22
, Issue.6
, pp. 1037-1080
-
-
Grossman, D.1
Morrisett, G.2
Zdancewic, S.3
-
12
-
-
0000627561
-
Proving congruence of bisimulation in functional programming languages
-
Douglas J. Howe. Proving congruence of bisimulation in functional programming languages. Information and Computation, 124(2), 1996.
-
(1996)
Information and Computation
, vol.124
, Issue.2
-
-
Howe, D.J.1
-
14
-
-
0033700291
-
A theory of bisimulation for a fragment of concurrent ML with local names
-
To appear
-
Alan Jeffrey and Julian Rathke. A theory of bisimulation for a fragment of concurrent ML with local names. Theoretical Computer Science, 2003. To appear. An extended abstract appeared in 15th Annual IEEE Symposium on Logic in Computer Science, pp. 311-321, 2000.
-
(2003)
Theoretical Computer Science
-
-
Jeffrey, A.1
Rathke, J.2
-
15
-
-
0033700291
-
-
An extended abstract appeared in
-
Alan Jeffrey and Julian Rathke. A theory of bisimulation for a fragment of concurrent ML with local names. Theoretical Computer Science, 2003. To appear. An extended abstract appeared in 15th Annual IEEE Symposium on Logic in Computer Science, pp. 311-321, 2000.
-
(2000)
15th Annual IEEE Symposium on Logic in Computer Science
, pp. 311-321
-
-
-
16
-
-
1442288659
-
Global abstraction-safe marshalling with hash types
-
James J. Leifer, Gilles Peskine, Peter Sewell, and Keith Wansbrough. Global abstraction-safe marshalling with hash types. In Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, pages 87-98, 2003.
-
(2003)
Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming
, pp. 87-98
-
-
Leifer, J.J.1
Peskine, G.2
Sewell, P.3
Wansbrough, K.4
-
18
-
-
28144456308
-
An attack on the Needham-Schroeder public-key authentication protocol
-
Gavin Lowe. An attack on the Needham-Schroeder public-key authentication protocol. Information Processing Letters, 56(3):131-133, 1995.
-
(1995)
Information Processing Letters
, vol.56
, Issue.3
, pp. 131-133
-
-
Lowe, G.1
-
20
-
-
0024038082
-
Abstract types have existential types
-
John C. Mitchell and Gordon D. Plotkin. Abstract types have existential types. ACM Transactions on Programming Languages and Systems, 10(3):470-502, 1988. Preliminary version appeared in Proceedings of the 12th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 37-51, 1985.
-
(1988)
ACM Transactions on Programming Languages and Systems
, vol.10
, Issue.3
, pp. 470-502
-
-
Mitchell, J.C.1
Plotkin, G.D.2
-
23
-
-
0015561577
-
Protection in programming languages
-
James H. Morris Jr. Protection in programming languages. Communications of the ACM, 16(1):15-21, 1973.
-
(1973)
Communications of the ACM
, vol.16
, Issue.1
, pp. 15-21
-
-
Morris Jr., J.H.1
-
25
-
-
0018048246
-
Using encryption for authentication in large networks of computers
-
Roger Needham and Michael Schroeder. Using encryption for authentication in large networks of computers. Communications of the ACM, 21(12):993-999, 1978.
-
(1978)
Communications of the ACM
, vol.21
, Issue.12
, pp. 993-999
-
-
Needham, R.1
Schroeder, M.2
-
28
-
-
0001233777
-
Parametric polymorphism and operational equivalence
-
Andrew M. Pitts. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science, 10:321-359, 2000. Preliminary version appeared in HOOTS II Second Workshop on Higher-Order Operational Techniques in Semantics, Electronic Notes in Theoretical Computer Science, vol. 10, 1998.
-
(2000)
Mathematical Structures in Computer Science
, vol.10
, pp. 321-359
-
-
Pitts, A.M.1
-
30
-
-
85029606643
-
Observable properties of higher order functions that dynamically create local names, or: What's new?
-
Springer-Verlag
-
Andrew M. Pitts and Ian Stark. Observable properties of higher order functions that dynamically create local names, or: what's new? In Mathematical Foundations of Computer Science, volume 711 of Lecture Notes in Computer Science, pages 122-141. Springer-Verlag, 1993.
-
(1993)
Mathematical Foundations of Computer Science, Volume 711 of Lecture Notes in Computer Science
, vol.711
, pp. 122-141
-
-
Pitts, A.M.1
Stark, I.2
-
33
-
-
84955567248
-
The problem of "weak bisimulation up to"
-
Springer-Verlag
-
Davide Sangiorgi and Robin Milner. The problem of "weak bisimulation up to". In CONCUR '92, Third International Conference on Concurrency Theory, volume 630 of Lecture Notes in Computer Science, pages 32-46. Springer-Verlag, 1992.
-
(1992)
CONCUR '92, Third International Conference on Concurrency Theory, Volume 630 of Lecture Notes in Computer Science
, vol.630
, pp. 32-46
-
-
Sangiorgi, D.1
Milner, R.2
-
35
-
-
0003768829
-
-
PhD thesis, University of Cambridge
-
Ian Stark. Names and Higher-Order Functions. PhD thesis, University of Cambridge, 1994. http://www.des.ed.ac.uk/home/stark/publications/thesis.html.
-
(1994)
Names and Higher-order Functions
-
-
Stark, I.1
-
37
-
-
0034837908
-
-
Long version to appear in the
-
Eijiro Sumii and Benjamin C. Pierce. Logical relations for encryption. In 14th IEEE Computer Security Foundations Workshop, pages 256-269, 2001. Long version to appear in the Journal of Computer Security.
-
Journal of Computer Security
-
-
|