equal
deleted
inserted
replaced
25 @string{JFP="Journal of Functional Programming"} |
25 @string{JFP="Journal of Functional Programming"} |
26 @string{JLC="Journal of Logic and Computation"} |
26 @string{JLC="Journal of Logic and Computation"} |
27 @string{JLP="Journal of Logic Programming"} |
27 @string{JLP="Journal of Logic Programming"} |
28 @string{JSC="Journal of Symbolic Computation"} |
28 @string{JSC="Journal of Symbolic Computation"} |
29 @string{JSL="Journal of Symbolic Logic"} |
29 @string{JSL="Journal of Symbolic Logic"} |
|
30 @string{PROYAL="Proceedings of the Royal Society of London"} |
30 @string{SIGPLAN="{SIGPLAN} Notices"} |
31 @string{SIGPLAN="{SIGPLAN} Notices"} |
|
32 @string{TISSEC="ACM Transactions on Information and System Security"} |
31 |
33 |
32 %conferences |
34 %conferences |
33 @string{CADE="International Conference on Automated Deduction"} |
35 @string{CADE="International Conference on Automated Deduction"} |
34 @string{POPL="Symposium on Principles of Programming Languages"} |
36 @string{POPL="Symposium on Principles of Programming Languages"} |
35 @string{TYPES="Types for Proofs and Programs"} |
37 @string{TYPES="Types for Proofs and Programs"} |
179 journal = {Indag. Math.}, |
181 journal = {Indag. Math.}, |
180 volume = 34, |
182 volume = 34, |
181 pages = {381-392}, |
183 pages = {381-392}, |
182 year = 1972} |
184 year = 1972} |
183 |
185 |
|
186 @Article{ban89, |
|
187 author = {M. Burrows and M. Abadi and R. M. Needham}, |
|
188 title = {A Logic of Authentication}, |
|
189 journal = PROYAL, |
|
190 year = 1989, |
|
191 volume = 426, |
|
192 pages = {233-271}} |
|
193 |
184 %C |
194 %C |
185 |
195 |
186 @TechReport{camilleri92, |
196 @TechReport{camilleri92, |
187 author = {J. Camilleri and T. F. Melham}, |
197 author = {J. Camilleri and T. F. Melham}, |
188 title = {Reasoning with Inductively Defined Relations in the |
198 title = {Reasoning with Inductively Defined Relations in the |
483 author = {Kenneth Kunen}, |
493 author = {Kenneth Kunen}, |
484 title = {Set Theory: An Introduction to Independence Proofs}, |
494 title = {Set Theory: An Introduction to Independence Proofs}, |
485 publisher = NH, |
495 publisher = NH, |
486 year = 1980} |
496 year = 1980} |
487 |
497 |
|
498 %L |
|
499 |
|
500 @InProceedings{lowe-fdr, |
|
501 author = {Gavin Lowe}, |
|
502 title = {Breaking and Fixing the {Needham}-{Schroeder} Public-Key |
|
503 Protocol using {CSP} and {FDR}}, |
|
504 booktitle = {Tools and Algorithms for the Construction and Analysis |
|
505 of Systems: second international workshop, TACAS '96}, |
|
506 editor = {T. Margaria and B. Steffen}, |
|
507 series = {LNCS 1055}, |
|
508 year = 1996, |
|
509 publisher = {Springer}, |
|
510 pages = {147-166}} |
|
511 |
|
512 |
488 %M |
513 %M |
489 |
514 |
490 @Article{mw81, |
515 @Article{mw81, |
491 author = {Zohar Manna and Richard Waldinger}, |
516 author = {Zohar Manna and Richard Waldinger}, |
492 title = {Deductive Synthesis of the Unification Algorithm}, |
517 title = {Deductive Synthesis of the Unification Algorithm}, |
589 author = {Dieter Nazareth and Tobias Nipkow}, |
614 author = {Dieter Nazareth and Tobias Nipkow}, |
590 title = {Formal Verification of Algorithm {W}: The Monomorphic Case}, |
615 title = {Formal Verification of Algorithm {W}: The Monomorphic Case}, |
591 crossref = {tphols96}, |
616 crossref = {tphols96}, |
592 pages = {331-345}, |
617 pages = {331-345}, |
593 year = 1996} |
618 year = 1996} |
|
619 |
|
620 @Article{needham-schroeder, |
|
621 author = "Roger M. Needham and Michael D. Schroeder", |
|
622 title = "Using Encryption for Authentication in Large Networks |
|
623 of Computers", |
|
624 journal = cacm, |
|
625 volume = 21, |
|
626 number = 12, |
|
627 pages = "993-999", |
|
628 month = dec, |
|
629 year = 1978} |
594 |
630 |
595 @inproceedings{nipkow-W, |
631 @inproceedings{nipkow-W, |
596 author = {Wolfgang Naraschewski and Tobias Nipkow}, |
632 author = {Wolfgang Naraschewski and Tobias Nipkow}, |
597 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}}, |
633 title = {Type Inference Verified: Algorithm {W} in {Isabelle/HOL}}, |
598 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96}, |
634 booktitle = {Types for Proofs and Programs: Intl. Workshop TYPES '96}, |
870 journal = JCS, |
906 journal = JCS, |
871 year = 1998, |
907 year = 1998, |
872 volume = 6, |
908 volume = 6, |
873 pages = {85-128}} |
909 pages = {85-128}} |
874 |
910 |
|
911 @Article{paulson-tls, |
|
912 author = {Lawrence C. Paulson}, |
|
913 title = {Inductive Analysis of the {Internet} Protocol {TLS}}, |
|
914 journal = TISSEC, |
|
915 month = aug, |
|
916 year = 1999, |
|
917 volume = 2, |
|
918 number = 3, |
|
919 pages = {332-351}} |
|
920 |
|
921 |
875 @article{pelletier86, |
922 @article{pelletier86, |
876 author = {F. J. Pelletier}, |
923 author = {F. J. Pelletier}, |
877 title = {Seventy-five Problems for Testing Automatic Theorem |
924 title = {Seventy-five Problems for Testing Automatic Theorem |
878 Provers}, |
925 Provers}, |
879 journal = JAR, |
926 journal = JAR, |