-
1
-
-
0031637195
-
On SDSI's linked local name spaces
-
M. Abadi. On SDSI's linked local name spaces. Journal of Computer Security, 6(1-2):3-21, 1998.
-
(1998)
Journal of Computer Security
, vol.6
, Issue.1-2
, pp. 3-21
-
-
Abadi, M.1
-
3
-
-
0032218204
-
Model checking of hierarchical state machines
-
New York, Nov. 3-5 ACM Press
-
R. Alur and M. Yannakakis. Model checking of hierarchical state machines. volume 23, 6 of Softw. Eng. Notes, pages 175-188, New York, Nov. 3-5 1998. ACM Press.
-
(1998)
Softw. Eng. Notes
, vol.23
, Issue.6
, pp. 175-188
-
-
Alur, R.1
Yannakakis, M.2
-
4
-
-
24144484286
-
Model checking of unrestricted hierarchical state machines
-
M. Benedikt, P. Godefroid, and T. Reps. Model checking of unrestricted hierarchical state machines. In ICALP '01, 2001.
-
(2001)
ICALP '01
-
-
Benedikt, M.1
Godefroid, P.2
Reps, T.3
-
6
-
-
84982899264
-
The role of trust management in distributed systems security
-
Vitek and Jensen, editors, Secure Internet Programming: Security Issues for Mobile and Distributed Objects
-
M. Blaze, J. Feigenbaum, J. Ioannidis, and A. D. Keromytis. The role of trust management in distributed systems security. In Vitek and Jensen, editors, Secure Internet Programming: Security Issues for Mobile and Distributed Objects, pages 185-210, 1999. LNCS 1603.
-
(1999)
LNCS
, vol.1603
, pp. 185-210
-
-
Blaze, M.1
Feigenbaum, J.2
Ioannidis, J.3
Keromytis, A.D.4
-
7
-
-
84944409047
-
Reachability analysis of pushdown automata: Application to model checking
-
Proc. CONCUR, Springer-Verlag
-
A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model checking. In Proc. CONCUR, volume 1243 of Lec. Notes in Comp. Sci., pages 135-150. Springer-Verlag, 1997.
-
(1997)
Lec. Notes in Comp. Sci.
, vol.1243
, pp. 135-150
-
-
Bouajjani, A.1
Esparza, J.2
Maler, O.3
-
8
-
-
85029621995
-
Model checking for context-free processes
-
Proc. CONCUR
-
O. Burkart and B. Steffen. Model checking for context-free processes. In Proc. CONCUR, volume 630 of Lec. Notes in Comp. Sci., pages 123-137, 1992.
-
(1992)
Lec. Notes in Comp. Sci.
, vol.630
, pp. 123-137
-
-
Burkart, O.1
Steffen, B.2
-
9
-
-
0035680371
-
Certificate chain discovery in SPKI/SDSI
-
D. Clarke, J.-E. Elien, C. Ellison, M. Fredette, A. Morcos, and R. L. Rivest. Certificate chain discovery in SPKI/SDSI. JCS, 2001. To appear.
-
(2001)
JCS
-
-
Clarke, D.1
Elien, J.-E.2
Ellison, C.3
Fredette, M.4
Morcos, A.5
Rivest, R.L.6
-
10
-
-
0003556051
-
-
Nov
-
D. Clarke, J.-E. Elien, C. M. Ellison, M. Fredette, A. Morcos, and R. L. Rivest. Certficate chain discovery in SPKI/SDSI. Available at http//theory.lcs.mit.edu/~rivest/, Nov. 1999.
-
(1999)
Certficate Chain Discovery in SPKI/SDSI
-
-
Clarke, D.1
Elien, J.-E.2
Ellison, C.M.3
Fredette, M.4
Morcos, A.5
Rivest, R.L.6
-
13
-
-
0003593599
-
-
RFC 2693, Sept
-
C. M. Ellison, B. Frantz, B. Lampson, R. L. Rivest, B. M. Thomas, and T. Ylonen. SPKI certificate theory. RFC 2693, Sept. 1999.
-
(1999)
SPKI Certificate Theory
-
-
Ellison, C.M.1
Frantz, B.2
Lampson, B.3
Rivest, R.L.4
Thomas, B.M.5
Ylonen, T.6
-
14
-
-
84944409009
-
Efficient algorithms for model checking pushdown systems
-
Proc. Computer-Aided Verif., July
-
J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In Proc. Computer-Aided Verif., volume 1855 of Lec. Notes in Comp. Sci., pages 232-247, July 2000.
-
(2000)
Lec. Notes in Comp. Sci.
, vol.1855
, pp. 232-247
-
-
Esparza, J.1
Hansel, D.2
Rossmanith, P.3
Schwoon, S.4
-
15
-
-
0002147440
-
Simple on-the-fly automatic verification of linear temporal logic
-
Warsaw, Poland, Chapman & Hall
-
R. Gerth, D. Peled, M. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Protocol Specification Testing and Verification, pages 3-18, Warsaw, Poland, 1995. Chapman & Hall.
-
(1995)
Protocol Specification Testing and Verification
, pp. 3-18
-
-
Gerth, R.1
Peled, D.2
Vardi, M.3
Wolper, P.4
-
17
-
-
0003623954
-
-
Technical Report Department of Computer Science, Dartmouth College, Hanover, NH, Mar
-
J. Howell and D. Kotz. A formal semantics for SPKI. Technical Report 2000-363, Department of Computer Science, Dartmouth College, Hanover, NH, Mar. 2000.
-
(2000)
A Formal Semantics for SPKI
-
-
Howell, J.1
Kotz, D.2
-
18
-
-
3042686374
-
Demand-driven model checking for context-free processes
-
P. Thiagarajan and R. Yap, editors, Proc. Asian Comp. Sci. Conf., Dec
-
J. Knoop. Demand-driven model checking for context-free processes. In P. Thiagarajan and R. Yap, editors, Proc. Asian Comp. Sci. Conf., volume 1742 of Lec. Notes in Comp. Sci., pages 201-213, Dec. 1999.
-
(1999)
Lec. Notes in Comp. Sci.
, vol.1742
, pp. 201-213
-
-
Knoop, J.1
-
20
-
-
0034835799
-
Understanding trust management systems
-
Research in Security and Privacy, Oakland, CA, May IEEE Computer Society, Technical Committee on Security and Privacy, IEEE Computer Society Press
-
S. Weeks. Understanding trust management systems. In Proceedings of the IEEE Symposium on Research in Security and Privacy, Research in Security and Privacy, Oakland, CA, May 2001. IEEE Computer Society, Technical Committee on Security and Privacy, IEEE Computer Society Press.
-
(2001)
Proceedings of the IEEE Symposium on Research in Security and Privacy
-
-
Weeks, S.1
|