paulson [Tue, 01 Jul 1997 17:37:42 +0200] rev 3480
More realistic model: the Spy can compute clientK and serverK
paulson [Tue, 01 Jul 1997 17:36:42 +0200] rev 3479
Reordered rules in analz_image_freshK_ss to improve clarity
paulson [Tue, 01 Jul 1997 17:35:09 +0200] rev 3478
Removal of the obsolete newN function
paulson [Tue, 01 Jul 1997 17:34:42 +0200] rev 3477
New theorem priK_inj_eq, injectivity of priK
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
paulson [Tue, 01 Jul 1997 17:32:12 +0200] rev 3475
New theory TLS
paulson [Tue, 01 Jul 1997 11:11:42 +0200] rev 3474
Baby TLS. Proofs work, but model seems unrealistic
paulson [Tue, 01 Jul 1997 10:45:59 +0200] rev 3473
New and stronger lemmas; more default simp/cla rules
paulson [Tue, 01 Jul 1997 10:39:28 +0200] rev 3472
Deleted the obsolete operators newK, newN and nPair
paulson [Tue, 01 Jul 1997 10:38:11 +0200] rev 3471
Now the possibility proof calls the appropriate tactic
paulson [Tue, 01 Jul 1997 10:37:42 +0200] rev 3470
Added a comment
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?
paulson [Tue, 01 Jul 1997 10:34:30 +0200] rev 3468
New laws for the "lists" operator
nipkow [Mon, 30 Jun 1997 12:08:19 +0200] rev 3467
More concat lemmas.
paulson [Fri, 27 Jun 1997 10:47:13 +0200] rev 3466
Corrected indentations and margins after the renaming of "set_of_list"
nipkow [Thu, 26 Jun 1997 13:20:50 +0200] rev 3465
set_of_list -> set
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.
wenzelm [Thu, 26 Jun 1997 11:15:55 +0200] rev 3463
oops;
wenzelm [Thu, 26 Jun 1997 11:14:46 +0200] rev 3462
rearrange pages of ps file to be printed as booklet (duplex);
nipkow [Thu, 26 Jun 1997 10:43:15 +0200] rev 3461
amdI -> admI2
nipkow [Thu, 26 Jun 1997 10:42:50 +0200] rev 3460
Tuned Franz's proofs.
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)
paulson [Mon, 23 Jun 1997 11:30:35 +0200] rev 3458
Removal of COND_CONG, which is just if_cong RS eq_reflection
paulson [Mon, 23 Jun 1997 10:42:03 +0200] rev 3457
Ran expandshort
paulson [Mon, 23 Jun 1997 10:35:49 +0200] rev 3456
New "congs" keyword for recdef theory section
wenzelm [Fri, 20 Jun 1997 13:19:31 +0200] rev 3455
removed old Makefile;
wenzelm [Fri, 20 Jun 1997 11:37:53 +0200] rev 3454
removed;
wenzelm [Fri, 20 Jun 1997 11:34:05 +0200] rev 3453
removed old Makefile;
wenzelm [Fri, 20 Jun 1997 11:19:39 +0200] rev 3452
removed old Makefile and compat files;
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
paulson [Thu, 19 Jun 1997 11:28:55 +0200] rev 3450
Proof tidying and variable renaming (NA->na, NB->nb when of type msg)
paulson [Thu, 19 Jun 1997 11:24:37 +0200] rev 3449
New comments; a tidied proof
paulson [Thu, 19 Jun 1997 11:23:31 +0200] rev 3448
Two new rewrite rules--NOT included by default\!
paulson [Wed, 18 Jun 1997 15:38:35 +0200] rev 3447
Defines KeyWithNonce, which is used to prove the secrecy of NB
paulson [Wed, 18 Jun 1997 15:31:31 +0200] rev 3446
Addition of not_imp (which pushes negation into implication) as a default
simprule
paulson [Wed, 18 Jun 1997 15:30:32 +0200] rev 3445
Corrected Title in header lines
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
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
paulson [Wed, 18 Jun 1997 15:23:29 +0200] rev 3442
Removed Says_Crypt_lost and Says_Crypt_not_lost.
Installed not_lost_tac
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
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\!
nipkow [Tue, 17 Jun 1997 09:01:56 +0200] rev 3439
converse -> ^-1
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
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
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.
mueller [Fri, 13 Jun 1997 10:04:37 +0200] rev 3435
changed compatible definition;
mueller [Thu, 12 Jun 1997 16:48:03 +0200] rev 3434
added deadlock
mueller [Thu, 12 Jun 1997 16:47:15 +0200] rev 3433
added deadlock freedom, polished definitions and proofs
paulson [Mon, 09 Jun 1997 10:21:38 +0200] rev 3432
Strengthened and streamlined the Yahalom proofs
paulson [Mon, 09 Jun 1997 10:21:05 +0200] rev 3431
Useful new lemma
wenzelm [Fri, 06 Jun 1997 21:49:47 +0200] rev 3430
eliminated non-ASCII;
nipkow [Fri, 06 Jun 1997 19:30:06 +0200] rev 3429
Added
AddIffs [Pair_eq];
which made
AddSEs [Pair_inject];
redundant.
oheimb [Fri, 06 Jun 1997 16:02:13 +0200] rev 3428
improved function 'nonreserved'
paulson [Fri, 06 Jun 1997 13:28:40 +0200] rev 3427
Removed a few redundant additions of simprules or classical rules
paulson [Fri, 06 Jun 1997 13:26:41 +0200] rev 3426
The name bex_conj_distrib was WRONG
paulson [Fri, 06 Jun 1997 12:48:21 +0200] rev 3425
Better miniscoping for bounded quantifiers
paulson [Fri, 06 Jun 1997 10:47:16 +0200] rev 3424
Tidying and simplification of declarations
paulson [Fri, 06 Jun 1997 10:46:26 +0200] rev 3423
Much polishing of proofs
paulson [Fri, 06 Jun 1997 10:22:13 +0200] rev 3422
New miniscoping rules for ALL
paulson [Fri, 06 Jun 1997 10:21:10 +0200] rev 3421
New facts about In0/1 by Burkhart Wolff
paulson [Fri, 06 Jun 1997 10:20:38 +0200] rev 3420
New miniscoping rules ball_triv and bex_triv
paulson [Fri, 06 Jun 1997 10:19:53 +0200] rev 3419
Mended the definition of ack(0,n)
paulson [Fri, 06 Jun 1997 10:19:20 +0200] rev 3418
Two new examples; corrected a comment
paulson [Fri, 06 Jun 1997 10:18:46 +0200] rev 3417
New example theory: Recdef
nipkow [Thu, 05 Jun 1997 19:44:13 +0200] rev 3416
added finite_converse
nipkow [Thu, 05 Jun 1997 17:19:05 +0200] rev 3415
Moved image_is_empty from Finite.ML to equalities.ML
nipkow [Thu, 05 Jun 1997 14:40:35 +0200] rev 3414
Modified a few defs and proofs because of the changes to theory Finite.thy.
nipkow [Thu, 05 Jun 1997 14:39:22 +0200] rev 3413
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
Relation.ML Trancl.ML: more thms
WF.ML WF.thy: added `acyclic'
WF_Rel.ML: moved some thms back into WF and added some new ones.
paulson [Thu, 05 Jun 1997 14:06:23 +0200] rev 3412
New recdef examples
paulson [Thu, 05 Jun 1997 13:55:29 +0200] rev 3411
Removal of freeze_vars and thaw_vars. New freeze_thaw
paulson [Thu, 05 Jun 1997 13:53:59 +0200] rev 3410
freezeT now refers to Type.freeze_thaw
paulson [Thu, 05 Jun 1997 13:52:43 +0200] rev 3409
Tidying of signature. More robust renaming in freeze_thaw.
New tactic distinct_subgoals_tac
paulson [Thu, 05 Jun 1997 13:30:24 +0200] rev 3408
Removal of freeze_vars and thaw_vars (quite unused...)
paulson [Thu, 05 Jun 1997 13:29:41 +0200] rev 3407
Removal of radixstring from string_of_int; addition of string_of_indexname
paulson [Thu, 05 Jun 1997 13:28:32 +0200] rev 3406
There was never need for another copy of radixstring...
paulson [Thu, 05 Jun 1997 13:27:28 +0200] rev 3405
Numerous simplifications and removal of HOL-isms
Addition of the "simpset" feature (replacing references to \!simpset)
paulson [Thu, 05 Jun 1997 13:26:09 +0200] rev 3404
Now loads theory Recdef
paulson [Thu, 05 Jun 1997 13:22:25 +0200] rev 3403
A slight simplification of optstring
The new "simpset" keyword in the "recdef" declaration
paulson [Thu, 05 Jun 1997 13:21:41 +0200] rev 3402
Now extracts the predicate variable from induct0 insteead of trying to
predict its name. The new "freeze" function requires this.
paulson [Thu, 05 Jun 1997 13:20:18 +0200] rev 3401
Deleted the obsolete "pred_list" relation
paulson [Thu, 05 Jun 1997 13:19:27 +0200] rev 3400
Documented the new distinct_subgoals_tac
paulson [Thu, 05 Jun 1997 13:16:12 +0200] rev 3399
A slight simplification of optstring
paulson [Thu, 05 Jun 1997 13:15:36 +0200] rev 3398
Now extracts the predicate variable from induct0 insteead of trying to
predict its name
paulson [Thu, 05 Jun 1997 13:14:52 +0200] rev 3397
Made the pseudo-type of split_rule_var a separate argument
wenzelm [Wed, 04 Jun 1997 16:03:54 +0200] rev 3396
eliminated non-ASCII;
wenzelm [Wed, 04 Jun 1997 12:26:42 +0200] rev 3395
eliminated freeze_vars;
mueller [Wed, 04 Jun 1997 10:58:56 +0200] rev 3394
changed priority of -> from [6,5]5 to [1,0]0
wenzelm [Tue, 03 Jun 1997 16:38:58 +0200] rev 3393
is_blank: fixed space2;
paulson [Tue, 03 Jun 1997 12:03:38 +0200] rev 3392
No longer refers to internal TFL structures
paulson [Tue, 03 Jun 1997 11:08:08 +0200] rev 3391
More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
Changed the TFL functor to a structure (currently called Prim)
paulson [Tue, 03 Jun 1997 10:56:04 +0200] rev 3390
New theory "Power" of exponentiation (and binomial coefficients)
paulson [Tue, 03 Jun 1997 10:53:58 +0200] rev 3389
New theorem about the cardinality of the powerset (uses exponentiation)
paulson [Mon, 02 Jun 1997 12:19:01 +0200] rev 3388
Type inference makes a Const here, perhaps elsewhere?thry.sml
paulson [Mon, 02 Jun 1997 12:17:19 +0200] rev 3387
poly_tvars allows recdefs to be made without type constraints
paulson [Mon, 02 Jun 1997 12:16:24 +0200] rev 3386
Corrected banner: it is W0, not MiniML
paulson [Mon, 02 Jun 1997 12:15:13 +0200] rev 3385
New statement and proof of free_tv_subst_var in order to cope with new
rewrite rules Un_insert_left, Un_insert_right