Towards an Automatic Analysis of Security Protocols in First-Order Logic
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 314-328
- https://doi.org/10.1007/3-540-48660-7_29
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The Horn mu-calculusPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Proving properties of security protocols by inductionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- System Description: Spass Version 1.0.0Published by Springer Nature ,1999
- Unification in extensions of shallow equational theoriesPublished by Springer Nature ,1998
- Finite-state analysis of security protocolsPublished by Springer Nature ,1998
- Automatic verification of cryptographic protocols with SETHEOPublished by Springer Nature ,1997
- Equational Formulas with Membership ConstraintsInformation and Computation, 1994
- Rewrite-based Equational Theorem Proving with Selection and SimplificationJournal of Logic and Computation, 1994
- A note on the use of timestamps as noncesACM SIGOPS Operating Systems Review, 1993
- A logic of authenticationACM Transactions on Computer Systems, 1990