-
1
-
-
0030643343
-
A calculus for cryptographic protocols: The spi calculus
-
ACM Press
-
M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. In Proceedings of CCS, pages 36-47. ACM Press, 1997.
-
(1997)
Proceedings of CCS
, pp. 36-47
-
-
Abadi, M.1
Gordon, A.D.2
-
2
-
-
0002034059
-
Associative-commutative discrimination nets
-
L. Bachmair, T. Chen, and I.V. Ramakrishnan. Associative-commutative discrimination nets. In TAPSOFT, pages 61-74, 1993.
-
(1993)
TAPSOFT
, pp. 61-74
-
-
Bachmair, L.1
Chen, T.2
Ramakrishnan, I.V.3
-
3
-
-
0036041250
-
Types as models: Model checking message-passing programs
-
S. Chaki, S.K.Rajamani, and J. Rehof. Types as models: model checking message-passing programs. In Proceedings of POPL, pages 45-57, 2002.
-
(2002)
Proceedings of POPL
, pp. 45-57
-
-
Chaki, S.1
Rajamani, S.K.2
Rehof, J.3
-
4
-
-
0029695436
-
Tabled evaluation with delaying for general logic programs
-
January
-
W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20-74, January 1996.
-
(1996)
Journal of the ACM
, vol.43
, Issue.1
, pp. 20-74
-
-
Chen, W.1
Warren, D.S.2
-
6
-
-
33645400902
-
Transforming a proof system into Prolog for verifying security protocols
-
G. Delzanno and S. Etalle. Transforming a proof system into Prolog for verifying security protocols. In LOPSTR, 2001.
-
(2001)
LOPSTR
-
-
Delzanno, G.1
Etalle, S.2
-
8
-
-
84896694182
-
Fighting livelock in the i-Protocol: A case study in explicit-state model checking
-
Y. Dong, X. Du, G. Holzmann, and S. A. Smolka. Fighting livelock in the i-Protocol: A case study in explicit-state model checking. Software Tools for Technology Transfer, 4(2), 2003.
-
(2003)
Software Tools for Technology Transfer
, vol.4
, Issue.2
-
-
Dong, Y.1
Du, X.2
Holzmann, G.3
Smolka, S.A.4
-
9
-
-
0006103517
-
An optimizing compiler for efficient model checking
-
Y. Dong and C. R. Ramakrishnan. An optimizing compiler for efficient model checking. In Proceedings of FORTE, pages 241-256, 1999.
-
(1999)
Proceedings of FORTE
, pp. 241-256
-
-
Dong, Y.1
Ramakrishnan, C.R.2
-
11
-
-
0031337405
-
A constraint based approach for specification and verification of real-time systems
-
G. Gupta and E. Pontelli. A constraint based approach for specification and verification of real-time systems. In IEEE Real-Time Systems Symposium, 1997.
-
(1997)
IEEE Real-time Systems Symposium
-
-
Gupta, G.1
Pontelli, E.2
-
13
-
-
0346969701
-
A generic type system for the pi-calculus
-
A. Igarashi and N. Kobayashi. A generic type system for the pi-calculus. Theoretical Computer Science, 311(1-3):121-163, 2004.
-
(2004)
Theoretical Computer Science
, vol.311
, Issue.1-3
, pp. 121-163
-
-
Igarashi, A.1
Kobayashi, N.2
-
14
-
-
0035644347
-
Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories
-
H. Kirchner and P.-E. Moreau. Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories. J. Functional Prog., 11(2):207-251, 2001.
-
(2001)
J. Functional Prog.
, vol.11
, Issue.2
, pp. 207-251
-
-
Kirchner, H.1
Moreau, P.-E.2
-
15
-
-
0002734357
-
Symbolic bisimulation and proof systems for the π-calculus
-
School of Cognitive and Computer Science, U. of Sussex, UK
-
H. Lin. Symbolic bisimulation and proof systems for the π-calculus. Technical report, School of Cognitive and Computer Science, U. of Sussex, UK, 1994.
-
(1994)
Technical Report
-
-
Lin, H.1
-
17
-
-
44049113210
-
A calculus of mobile processes, parts I and II
-
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Parts I and II. Information and Computation, 100(1):1-77, 1992.
-
(1992)
Information and Computation
, vol.100
, Issue.1
, pp. 1-77
-
-
Milner, R.1
Parrow, J.2
Walker, D.3
-
20
-
-
0000555116
-
Efficient model checking using tabled resolution
-
Springer
-
Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. L. Swift, and D. S. Warren. Efficient model checking using tabled resolution. In Proceedings of CAV. Springer, 1997.
-
(1997)
Proceedings of CAV
-
-
Ramakrishna, Y.S.1
Ramakrishnan, C.R.2
Ramakrishnan, I.V.3
Smolka, S.A.4
Swift, T.L.5
Warren, D.S.6
-
21
-
-
23944509986
-
Verifying pi-calculus processes by Promela translation
-
Univ. of Michigan
-
H. Song and K. J. Compton. Verifying pi-calculus processes by Promela translation. Technical Report CSE-TR-472-03, Univ. of Michigan, 2003.
-
(2003)
Technical Report
, vol.CSE-TR-472-03
-
-
Song, H.1
Compton, K.J.2
-
22
-
-
84976741234
-
A unification algorithm for associative-commutative unification
-
M. E. Stickel. A unification algorithm for associative-commutative unification. Journal of the ACM, 28(3):423-434, 1981.
-
(1981)
Journal of the ACM
, vol.28
, Issue.3
, pp. 423-434
-
-
Stickel, M.E.1
-
24
-
-
19044388279
-
The mobility workbench user's guide
-
Department of Computer Systems, Uppsala University, Sweden
-
B. Victor. The Mobility Workbench user's guide. Technical report, Department of Computer Systems, Uppsala University, Sweden, 1995.
-
(1995)
Technical Report
-
-
Victor, B.1
-
26
-
-
33645384725
-
A logical encoding of the π-calculus: Model checking mobile processes using tabled resolution
-
P. Yang, C. R. Ramakrishnan, and S. A. Smolka. A logical encoding of the π-calculus: Model checking mobile processes using tabled resolution. In Proceedings of VMCAI, 2003.
-
(2003)
Proceedings of VMCAI
-
-
Yang, P.1
Ramakrishnan, C.R.2
Smolka, S.A.3
|