Tue, 01 Jul 1997 17:37:42 +0200 More realistic model: the Spy can compute clientK and serverK
paulson [Tue, 01 Jul 1997 17:37:42 +0200] rev 3480
More realistic model: the Spy can compute clientK and serverK
Tue, 01 Jul 1997 17:36:42 +0200 Reordered rules in analz_image_freshK_ss to improve clarity
paulson [Tue, 01 Jul 1997 17:36:42 +0200] rev 3479
Reordered rules in analz_image_freshK_ss to improve clarity
Tue, 01 Jul 1997 17:35:09 +0200 Removal of the obsolete newN function
paulson [Tue, 01 Jul 1997 17:35:09 +0200] rev 3478
Removal of the obsolete newN function
Tue, 01 Jul 1997 17:34:42 +0200 New theorem priK_inj_eq, injectivity of priK
paulson [Tue, 01 Jul 1997 17:34:42 +0200] rev 3477
New theorem priK_inj_eq, injectivity of priK
Tue, 01 Jul 1997 17:34:13 +0200 spy_analz_tac: Restored iffI to the list of rules used to break down
paulson [Tue, 01 Jul 1997 17:34:13 +0200] rev 3476
spy_analz_tac: Restored iffI to the list of rules used to break down the subgoal
Tue, 01 Jul 1997 17:32:12 +0200 New theory TLS
paulson [Tue, 01 Jul 1997 17:32:12 +0200] rev 3475
New theory TLS
Tue, 01 Jul 1997 11:11:42 +0200 Baby TLS. Proofs work, but model seems unrealistic
paulson [Tue, 01 Jul 1997 11:11:42 +0200] rev 3474
Baby TLS. Proofs work, but model seems unrealistic
Tue, 01 Jul 1997 10:45:59 +0200 New and stronger lemmas; more default simp/cla rules
paulson [Tue, 01 Jul 1997 10:45:59 +0200] rev 3473
New and stronger lemmas; more default simp/cla rules
Tue, 01 Jul 1997 10:39:28 +0200 Deleted the obsolete operators newK, newN and nPair
paulson [Tue, 01 Jul 1997 10:39:28 +0200] rev 3472
Deleted the obsolete operators newK, newN and nPair
Tue, 01 Jul 1997 10:38:11 +0200 Now the possibility proof calls the appropriate tactic
paulson [Tue, 01 Jul 1997 10:38:11 +0200] rev 3471
Now the possibility proof calls the appropriate tactic
Tue, 01 Jul 1997 10:37:42 +0200 Added a comment
paulson [Tue, 01 Jul 1997 10:37:42 +0200] rev 3470
Added a comment
Tue, 01 Jul 1997 10:37:03 +0200 Now Collect_mem_eq is a default simprule (how could it have ever been omitted?
paulson [Tue, 01 Jul 1997 10:37:03 +0200] rev 3469
Now Collect_mem_eq is a default simprule (how could it have ever been omitted?
Tue, 01 Jul 1997 10:34:30 +0200 New laws for the "lists" operator
paulson [Tue, 01 Jul 1997 10:34:30 +0200] rev 3468
New laws for the "lists" operator
Mon, 30 Jun 1997 12:08:19 +0200 More concat lemmas.
nipkow [Mon, 30 Jun 1997 12:08:19 +0200] rev 3467
More concat lemmas.
Fri, 27 Jun 1997 10:47:13 +0200 Corrected indentations and margins after the renaming of "set_of_list"
paulson [Fri, 27 Jun 1997 10:47:13 +0200] rev 3466
Corrected indentations and margins after the renaming of "set_of_list"
Thu, 26 Jun 1997 13:20:50 +0200 set_of_list -> set
nipkow [Thu, 26 Jun 1997 13:20:50 +0200] rev 3465
set_of_list -> set
Thu, 26 Jun 1997 11:58:05 +0200 Trivial changes in connection with the Yahalom paper.
paulson [Thu, 26 Jun 1997 11:58:05 +0200] rev 3464
Trivial changes in connection with the Yahalom paper. Changed the order of the premises in no_nonce_YM1_YM2. Installed B_trusts_YM4_newK using bind_thm. Improved some comments.
Thu, 26 Jun 1997 11:15:55 +0200 oops;
wenzelm [Thu, 26 Jun 1997 11:15:55 +0200] rev 3463
oops;
Thu, 26 Jun 1997 11:14:46 +0200 rearrange pages of ps file to be printed as booklet (duplex);
wenzelm [Thu, 26 Jun 1997 11:14:46 +0200] rev 3462
rearrange pages of ps file to be printed as booklet (duplex);
Thu, 26 Jun 1997 10:43:15 +0200 amdI -> admI2
nipkow [Thu, 26 Jun 1997 10:43:15 +0200] rev 3461
amdI -> admI2
Thu, 26 Jun 1997 10:42:50 +0200 Tuned Franz's proofs.
nipkow [Thu, 26 Jun 1997 10:42:50 +0200] rev 3460
Tuned Franz's proofs.
Mon, 23 Jun 1997 11:33:59 +0200 Removal of structure Context and its replacement by a theorem list of
paulson [Mon, 23 Jun 1997 11:33:59 +0200] rev 3459
Removal of structure Context and its replacement by a theorem list of congruence rules for use in CONTEXT_REWRITE_RULE (where definitions are processed)
Mon, 23 Jun 1997 11:30:35 +0200 Removal of COND_CONG, which is just if_cong RS eq_reflection
paulson [Mon, 23 Jun 1997 11:30:35 +0200] rev 3458
Removal of COND_CONG, which is just if_cong RS eq_reflection
Mon, 23 Jun 1997 10:42:03 +0200 Ran expandshort
paulson [Mon, 23 Jun 1997 10:42:03 +0200] rev 3457
Ran expandshort
Mon, 23 Jun 1997 10:35:49 +0200 New "congs" keyword for recdef theory section
paulson [Mon, 23 Jun 1997 10:35:49 +0200] rev 3456
New "congs" keyword for recdef theory section
Fri, 20 Jun 1997 13:19:31 +0200 removed old Makefile;
wenzelm [Fri, 20 Jun 1997 13:19:31 +0200] rev 3455
removed old Makefile;
Fri, 20 Jun 1997 11:37:53 +0200 removed;
wenzelm [Fri, 20 Jun 1997 11:37:53 +0200] rev 3454
removed;
Fri, 20 Jun 1997 11:34:05 +0200 removed old Makefile;
wenzelm [Fri, 20 Jun 1997 11:34:05 +0200] rev 3453
removed old Makefile;
Fri, 20 Jun 1997 11:19:39 +0200 removed old Makefile and compat files;
wenzelm [Fri, 20 Jun 1997 11:19:39 +0200] rev 3452
removed old Makefile and compat files;
Thu, 19 Jun 1997 11:31:14 +0200 Made proofs more concise by replacing calls to spy_analz_tac by uses of
paulson [Thu, 19 Jun 1997 11:31:14 +0200] rev 3451
Made proofs more concise by replacing calls to spy_analz_tac by uses of analz_insert_eq in rewriting
Thu, 19 Jun 1997 11:28:55 +0200 Proof tidying and variable renaming (NA->na, NB->nb when of type msg)
paulson [Thu, 19 Jun 1997 11:28:55 +0200] rev 3450
Proof tidying and variable renaming (NA->na, NB->nb when of type msg)
Thu, 19 Jun 1997 11:24:37 +0200 New comments; a tidied proof
paulson [Thu, 19 Jun 1997 11:24:37 +0200] rev 3449
New comments; a tidied proof
Thu, 19 Jun 1997 11:23:31 +0200 Two new rewrite rules--NOT included by default\!
paulson [Thu, 19 Jun 1997 11:23:31 +0200] rev 3448
Two new rewrite rules--NOT included by default\!
Wed, 18 Jun 1997 15:38:35 +0200 Defines KeyWithNonce, which is used to prove the secrecy of NB
paulson [Wed, 18 Jun 1997 15:38:35 +0200] rev 3447
Defines KeyWithNonce, which is used to prove the secrecy of NB
Wed, 18 Jun 1997 15:31:31 +0200 Addition of not_imp (which pushes negation into implication) as a default
paulson [Wed, 18 Jun 1997 15:31:31 +0200] rev 3446
Addition of not_imp (which pushes negation into implication) as a default simprule
Wed, 18 Jun 1997 15:30:32 +0200 Corrected Title in header lines
paulson [Wed, 18 Jun 1997 15:30:32 +0200] rev 3445
Corrected Title in header lines
Wed, 18 Jun 1997 15:28:03 +0200 Streamlined proofs of the secrecy of NB and added authentication of A and B
paulson [Wed, 18 Jun 1997 15:28:03 +0200] rev 3444
Streamlined proofs of the secrecy of NB and added authentication of A and B
Wed, 18 Jun 1997 15:24:21 +0200 Removed Says_Crypt_lost and Says_Crypt_not_lost.
paulson [Wed, 18 Jun 1997 15:24:21 +0200] rev 3443
Removed Says_Crypt_lost and Says_Crypt_not_lost. Installed not_lost_tac. Deleted unused theorems initState_subset and seesD
Wed, 18 Jun 1997 15:23:29 +0200 Removed Says_Crypt_lost and Says_Crypt_not_lost.
paulson [Wed, 18 Jun 1997 15:23:29 +0200] rev 3442
Removed Says_Crypt_lost and Says_Crypt_not_lost. Installed not_lost_tac
Wed, 18 Jun 1997 15:21:30 +0200 Adapted proofs to the removal of Says_Crypt_lost and Says_Crypt_not_lost
paulson [Wed, 18 Jun 1997 15:21:30 +0200] rev 3441
Adapted proofs to the removal of Says_Crypt_lost and Says_Crypt_not_lost
Wed, 18 Jun 1997 15:19:37 +0200 Deleted spurious reference to Spy_not_see_NB, which by chance was defined
paulson [Wed, 18 Jun 1997 15:19:37 +0200] rev 3440
Deleted spurious reference to Spy_not_see_NB, which by chance was defined in Yahalom.ML\!
Tue, 17 Jun 1997 09:01:56 +0200 converse -> ^-1
nipkow [Tue, 17 Jun 1997 09:01:56 +0200] rev 3439
converse -> ^-1
Mon, 16 Jun 1997 14:25:33 +0200 Type constraint added to ensure that "length" refers to lists. Maybe should
paulson [Mon, 16 Jun 1997 14:25:33 +0200] rev 3438
Type constraint added to ensure that "length" refers to lists. Maybe should not be needed, but the translation length->size happens irrespective of types
Mon, 16 Jun 1997 14:24:11 +0200 Replacing the primrec definition of "length" by a translation to the built-in
paulson [Mon, 16 Jun 1997 14:24:11 +0200] rev 3437
Replacing the primrec definition of "length" by a translation to the built-in "size" function
Fri, 13 Jun 1997 10:35:13 +0200 Tuned wf_iff_no_infinite_down_chain proof, based on Konrads ideas.
nipkow [Fri, 13 Jun 1997 10:35:13 +0200] rev 3436
Tuned wf_iff_no_infinite_down_chain proof, based on Konrads ideas. Added selectI2EX.
Fri, 13 Jun 1997 10:04:37 +0200 changed compatible definition;
mueller [Fri, 13 Jun 1997 10:04:37 +0200] rev 3435
changed compatible definition;
Thu, 12 Jun 1997 16:48:03 +0200 added deadlock
mueller [Thu, 12 Jun 1997 16:48:03 +0200] rev 3434
added deadlock
Thu, 12 Jun 1997 16:47:15 +0200 added deadlock freedom, polished definitions and proofs
mueller [Thu, 12 Jun 1997 16:47:15 +0200] rev 3433
added deadlock freedom, polished definitions and proofs
Mon, 09 Jun 1997 10:21:38 +0200 Strengthened and streamlined the Yahalom proofs
paulson [Mon, 09 Jun 1997 10:21:38 +0200] rev 3432
Strengthened and streamlined the Yahalom proofs
Mon, 09 Jun 1997 10:21:05 +0200 Useful new lemma
paulson [Mon, 09 Jun 1997 10:21:05 +0200] rev 3431
Useful new lemma
Fri, 06 Jun 1997 21:49:47 +0200 eliminated non-ASCII;
wenzelm [Fri, 06 Jun 1997 21:49:47 +0200] rev 3430
eliminated non-ASCII;
Fri, 06 Jun 1997 19:30:06 +0200 Added
nipkow [Fri, 06 Jun 1997 19:30:06 +0200] rev 3429
Added AddIffs [Pair_eq]; which made AddSEs [Pair_inject]; redundant.
Fri, 06 Jun 1997 16:02:13 +0200 improved function 'nonreserved'
oheimb [Fri, 06 Jun 1997 16:02:13 +0200] rev 3428
improved function 'nonreserved'
Fri, 06 Jun 1997 13:28:40 +0200 Removed a few redundant additions of simprules or classical rules
paulson [Fri, 06 Jun 1997 13:28:40 +0200] rev 3427
Removed a few redundant additions of simprules or classical rules
Fri, 06 Jun 1997 13:26:41 +0200 The name bex_conj_distrib was WRONG
paulson [Fri, 06 Jun 1997 13:26:41 +0200] rev 3426
The name bex_conj_distrib was WRONG
Fri, 06 Jun 1997 12:48:21 +0200 Better miniscoping for bounded quantifiers
paulson [Fri, 06 Jun 1997 12:48:21 +0200] rev 3425
Better miniscoping for bounded quantifiers
Fri, 06 Jun 1997 10:47:16 +0200 Tidying and simplification of declarations
paulson [Fri, 06 Jun 1997 10:47:16 +0200] rev 3424
Tidying and simplification of declarations
Fri, 06 Jun 1997 10:46:26 +0200 Much polishing of proofs
paulson [Fri, 06 Jun 1997 10:46:26 +0200] rev 3423
Much polishing of proofs
Fri, 06 Jun 1997 10:22:13 +0200 New miniscoping rules for ALL
paulson [Fri, 06 Jun 1997 10:22:13 +0200] rev 3422
New miniscoping rules for ALL
Fri, 06 Jun 1997 10:21:10 +0200 New facts about In0/1 by Burkhart Wolff
paulson [Fri, 06 Jun 1997 10:21:10 +0200] rev 3421
New facts about In0/1 by Burkhart Wolff
(0) -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip