-
1
-
-
0031334956
-
Alternating-time temporal logic
-
IEEE Computer Society Press
-
R. Alur, T. Henzinger, and O. Kupferman. Alternating-time temporal logic. In FOCS'97, pages 100-109. IEEE Computer Society Press, 1997.
-
(1997)
FOCS'97
, pp. 100-109
-
-
Alur, R.1
Henzinger, T.2
Kupferman, O.3
-
2
-
-
0042908709
-
Alternating-time temporal logic
-
To appear Available from
-
R. Alur, T. Henzinger, and O. Kupferman. Alternating-time temporal logic. To appear in Journal of the ACM. Available from http://www.cis.upenn.edu/alur/ Jacm02.pdf, 2002.
-
(2002)
Journal of the ACM
-
-
Alur, R.1
Henzinger, T.2
Kupferman, O.3
-
3
-
-
26444497860
-
The AVISPA tool for the automated validation of internet security protocols and applications
-
Computer Aided Verification: 17th International Conference, CAV 2005. Proceedings
-
A. Armando, D. Basin, Y. Boichut, Y. Chevalier, L. Compagna, J. Cuéllar, P. Drielsma, P.-C. Héam, O. Kouchnarenko, J. Mantovani, S. Mödersheim, D. von Oheimb, M. Rusinowitch, J. Santiago, M. Turuani, L. Vigano, and L. Vigneron. The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications. In CAV2005, volume 3576 of LNCS, pages 281-285. Springer, 2005. (Pubitemid 41431740)
-
(2005)
Lecture Notes in Computer Science
, vol.3576
, pp. 281-285
-
-
Armando, A.1
Basin, D.2
Boichut, Y.3
Chevalier, Y.4
Compagna, L.5
Cuellar, J.6
Drielsma, P.H.7
Heam, P.C.8
Kouchnarenko, O.9
Mantovani, J.10
Modersheim, S.11
Von Oheimb, D.12
Rusinowitch, M.13
Santiago, J.14
Turuani, M.15
Vigano, L.16
Vigneron, L.17
-
4
-
-
0031650188
-
Asynchronous protocols for optimistic fair exchange
-
IEEE Computer Society
-
N. Asokan, V. Shoup, and M. Waidner. Asynchronous protocols for optimistic fair exchange. In S&P 1998, pages 86-99. IEEE Computer Society, 1998.
-
(1998)
S&P 1998
, pp. 86-99
-
-
Asokan, N.1
Shoup, V.2
Waidner, M.3
-
5
-
-
84879529172
-
Symbolic trace analysis of cryptographic protocols
-
Automata, Languages and Programming
-
M. Boreale. Symbolic trace analysis of cryptographic protocols. In ICALP 2001, volume 2076 of LNCS, pages 667-681. Springer, 2001. (Pubitemid 33300838)
-
(2001)
Lecture Notes in Computer Science
, Issue.2076
, pp. 667-681
-
-
Boreale, M.1
-
6
-
-
1142299776
-
View-based query containment
-
ACM Press
-
D. Calvanese, G. De Giacomo, M. Lenzerini, M.Y. Vardi. View-based query containment. In PODS 2003, pages 56-67. ACM Press, 2003.
-
(2003)
PODS 2003
, pp. 56-67
-
-
Calvanese, D.1
De Giacomo, G.2
Lenzerini, M.3
Vardi, M.Y.4
-
8
-
-
33751024861
-
A logic for constraint-based security protocol analysis
-
DOI 10.1109/SP.2006.3, 1624009, Proceedings - 2006 IEEE Symposium on Security and Privacy, S+P 2006
-
R. Corin, S. Etalle, and A. Saptawijaya. A Logic for Constraint-based Security Protocol Analysis. In S&P 2006, pages 155-168. IEEE Computer Society, 2006. (Pubitemid 44753720)
-
(2006)
Proceedings - IEEE Symposium on Security and Privacy
, vol.2006
, pp. 155-168
-
-
Corin, R.1
Saptawijaya, A.2
Etalle, S.3
-
9
-
-
4043061586
-
-
of LNCS. Springer
-
E. Grädel, W. Thomas, and T. Wilke, editors. Automata, Logics, and Infinite Games: A Guide to Current Research, volume 2500 of LNCS. Springer, 2002.
-
(2002)
Automata, Logics, and Infinite Games: A Guide to Current Research
, vol.2500
-
-
Grädel, E.1
Thomas, W.2
Wilke, T.3
-
10
-
-
27244431635
-
Constraint solving for contract-signing protocols
-
CONCUR 2005 - Concurrency Theory: 16th International Conference, CONCUR 2005. Proceedings
-
D. Kahler and R. Küsters. Constraint Solving for Contract-Signing Protocols. In CONCUR 2005, volume 3653 of LNCS, pages 233-247. Springer, 2005. (Pubitemid 41520744)
-
(2005)
Lecture Notes in Computer Science
, vol.3653
, pp. 233-247
-
-
Kahler, D.1
Kusters, R.2
-
11
-
-
82755187161
-
Infinite state AMC-model checking for cryptographic protocols
-
Germany Available from
-
D. Kahler, R. Küsters, and T. Truderung. Infinite State AMC-Model Checking for Cryptographic Protocols. Technical report IFI-0702, CAU Kiel, Germany, 2007. Available from http://www.informatik.unikiel.de/uploads/tx- publication/KKT-CAU-TR-0702.pdf
-
(2007)
Technical Report IFI-0702, CAU Kiel
-
-
Kahler, D.1
Küsters, R.2
Truderung, T.3
-
12
-
-
24144437134
-
Deciding properties of contract-signing protocols
-
STACS 2005 - 22nd Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
-
D. Kahler, R. Küsters, and T. Wilke. Deciding Properties of Contract-Signing Protocols. In STACS 2005, volume 3404 in LNCS, pages 158-169. Springer, 2005. (Pubitemid 41241244)
-
(2005)
Lecture Notes in Computer Science
, vol.3404
, pp. 158-169
-
-
Kahler, D.1
Kusters, R.2
Wilke, T.3
-
13
-
-
33746368726
-
A Dolev-Yao-based definition of abuse-free protocols
-
Automata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings
-
D. Kahler, R. Küsters, and T. Wilke. A Dolev-Yao-based Definition of Abuse-free Protocols. In ICALP 2006, volume 4052 of LNCS, pages 95-106. Springer, 2006. (Pubitemid 44113240)
-
(2006)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
, vol.LNCS4052
, pp. 95-106
-
-
Kahler, D.1
Kusters, R.2
Wilke, T.3
-
14
-
-
84944080333
-
A game-based verification of non-repudiation and fair exchange protocols
-
CONCUR 2001 - Concurrency Theory
-
S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In CONCUR 2001, volume 2154 of LNCS, pages 551-565. Springer, 2001. (Pubitemid 33326680)
-
(2001)
Lecture Notes in Computer Science
, Issue.2154
, pp. 551-565
-
-
Kremer, S.1
Raskin, J.-F.2
-
15
-
-
84948779843
-
Game analysis of abuse-free contract signing
-
IEEE Computer Society
-
S. Kremer and J.-F. Raskin. Game analysis of abuse-free contract signing. In CSFW 2002, pages 206-220. IEEE Computer Society, 2002.
-
(2002)
CSFW 2002
, pp. 206-220
-
-
Kremer, S.1
Raskin, J.-F.2
-
17
-
-
0034822801
-
Protocol insecurity with finite number of sessions is NP-complete
-
IEEE Computer Society
-
M. Rusinowitch and M. Turuani. Protocol Insecurity with Finite Number of Sessions is NP-complete. In CSFW-14, pages 174-190. IEEE Computer Society, 2001.
-
(2001)
CSFW-14
, pp. 174-190
-
-
Rusinowitch, M.1
Turuani, M.2
-
18
-
-
33750321377
-
Satisfiability and finite model property for the alternating-time μ-calculus
-
Computer Science Logic - 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Proceedings
-
S. Schewe, B. Finkbeiner. Satisfiability and Finite Model Property for the Alternating-Time mu-Calculus. In CSL 2006, volume 4207 of LNCS, pages 591-605. Springer 2006. (Pubitemid 44617584)
-
(2006)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
, vol.LNCS4207
, pp. 591-605
-
-
Schewe, S.1
Finkbeiner, B.2
-
19
-
-
0037076869
-
Finite-state analysis of two contract signing protocols
-
DOI 10.1016/S0304-3975(01)00141-4, PII S0304397501001414
-
V. Shmatikov and J. Mitchell. Finite-state analysis of two contract signing protocols. In TCS, 283(2):419-450, 2002. (Pubitemid 34624079)
-
(2002)
Theoretical Computer Science
, vol.283
, Issue.2
, pp. 419-450
-
-
Shmatikov, V.1
Mitchell, J.C.2
|