New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols
- 18 June 2003
- book chapter
- Published by Springer Nature
- p. 148-164
- https://doi.org/10.1007/3-540-44881-0_12
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Security Properties: Two Agents Are SufficientPublished by Springer Nature ,2003
- TAPS: a first-order verifier for cryptographic protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Abstracting Cryptographic Protocols by Prolog RulesPublished by Springer Nature ,2001
- Resolution Decision ProceduresPublished by Elsevier ,2001
- RewritingPublished by Elsevier ,2001
- Resolution Theorem ProvingPublished by Elsevier ,2001
- Strand spaces: proving security protocols correctJournal of Computer Security, 1999
- Proof Theory and Automated DeductionPublished by Springer Nature ,1997
- Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDRPublished by Springer Nature ,1996
- Automatic recognition of tractability in inference relationsJournal of the ACM, 1993