paulson [Tue, 05 Nov 1996 11:20:52 +0100] rev 2160
Simplified new_keys_not_seen, etc.: replaced the
union over all
agents by the Spy alone. Proofs run faster and they do not have to be
set up in terms of a previous lemma.
nipkow [Mon, 04 Nov 1996 17:23:37 +0100] rev 2159
Used nat_trans_tac. New Eta. various smaller changes.
paulson [Mon, 04 Nov 1996 10:56:15 +0100] rev 2158
Renamed SELECT_GOAL's new parameter from x to selct to avoid clashes
paulson [Mon, 04 Nov 1996 10:54:26 +0100] rev 2157
Removal of now unused sum, max, min. Use foldl op+, Int.max, Int.min
paulson [Fri, 01 Nov 1996 18:34:34 +0100] rev 2156
Minor changes to comments
paulson [Fri, 01 Nov 1996 18:28:19 +0100] rev 2155
New version with simpler disambiguation in YM3,
Oops message, and no encryption in YM2
paulson [Fri, 01 Nov 1996 18:27:38 +0100] rev 2154
New, purely illustrative result Crypt_synth_analz
paulson [Fri, 01 Nov 1996 15:46:56 +0100] rev 2153
Proof of antisym_less_lift now simpler and more robust
paulson [Fri, 01 Nov 1996 15:45:50 +0100] rev 2152
Now uses Int.max instead of max
paulson [Fri, 01 Nov 1996 15:42:40 +0100] rev 2151
Changes tabs found in .thy files to spaces
paulson [Fri, 01 Nov 1996 15:41:09 +0100] rev 2150
Replaced "sum" (only usage?) by foldl op+
paulson [Fri, 01 Nov 1996 15:39:37 +0100] rev 2149
Now uses Int.max instead of max
paulson [Fri, 01 Nov 1996 15:37:30 +0100] rev 2148
maxidx_of_typs replaces max o map maxidx_of_typ
paulson [Fri, 01 Nov 1996 15:35:28 +0100] rev 2147
Now uses Int.max instead of max
nodup_Vars now updates maxidx
paulson [Fri, 01 Nov 1996 15:32:03 +0100] rev 2146
maxidx_of_typs replaces max o map maxidx_of_typ
Now uses Int.max instead of max
paulson [Fri, 01 Nov 1996 15:30:49 +0100] rev 2145
asm_rewrite_goal_tac now calls SELECT_GOAL.
Replaced min by Int.min
paulson [Fri, 01 Nov 1996 15:25:21 +0100] rev 2144
Replaced foldl nodup_TVars by nodup_TVars_list -- for a big speedup on Poly/ML
paulson [Fri, 01 Nov 1996 15:15:39 +0100] rev 2143
Replaced min by Int.min
paulson [Fri, 01 Nov 1996 15:14:25 +0100] rev 2142
Deleted Olist constructor. Replaced minidx by "above" function
paulson [Fri, 01 Nov 1996 15:12:21 +0100] rev 2141
Now defines structure Int
paulson [Wed, 30 Oct 1996 11:21:24 +0100] rev 2140
Changed some mem calls to mem_int for greater efficiency (not that it could matter)
paulson [Wed, 30 Oct 1996 11:20:27 +0100] rev 2139
Only calls nodup_Vars if really necessary. We get a speedup of nearly 6%
paulson [Wed, 30 Oct 1996 11:19:09 +0100] rev 2138
Changed some mem calls to mem_string for greater efficiency (not that it could matter)
paulson [Wed, 30 Oct 1996 11:17:54 +0100] rev 2137
Minor updates
paulson [Wed, 30 Oct 1996 11:15:09 +0100] rev 2136
Updated references
paulson [Mon, 28 Oct 1996 15:59:39 +0100] rev 2135
Minor corrections
nipkow [Mon, 28 Oct 1996 15:36:18 +0100] rev 2134
Renamed and shuffled a few thms.
paulson [Mon, 28 Oct 1996 13:02:37 +0100] rev 2133
Simplified proofs
paulson [Mon, 28 Oct 1996 13:01:25 +0100] rev 2132
Tidied up a big mess in UN_parts_sees_Says
paulson [Mon, 28 Oct 1996 12:55:24 +0100] rev 2131
Changing from the Reveal to the Oops rule
nipkow [Sun, 27 Oct 1996 13:47:02 +0100] rev 2130
Simplifid proofs.
nipkow [Fri, 25 Oct 1996 15:02:09 +0200] rev 2129
Added (? x. t=x) = True
paulson [Thu, 24 Oct 1996 11:41:43 +0200] rev 2128
Documents the use of negative arguments to choplev and prlev
paulson [Thu, 24 Oct 1996 10:43:38 +0200] rev 2127
Changed comment to illustrate use of pathname
paulson [Thu, 24 Oct 1996 10:42:42 +0200] rev 2126
Allowing negative levels (as offsets) in prlev and choplev
paulson [Thu, 24 Oct 1996 10:38:35 +0200] rev 2125
New Oops message, with Server as source to ensure
correct nonces
paulson [Thu, 24 Oct 1996 10:36:29 +0200] rev 2124
New theorem Crypt_Spy_analz_lost; improvements to spy_analz_tac; ex_strip_tac
paulson [Thu, 24 Oct 1996 10:33:27 +0200] rev 2123
Two new protocol variants
paulson [Thu, 24 Oct 1996 10:31:17 +0200] rev 2122
Moved ex_strip_tac to the common part
paulson [Thu, 24 Oct 1996 10:30:43 +0200] rev 2121
Removal of unused predicate isSpy
paulson [Thu, 24 Oct 1996 10:30:17 +0200] rev 2120
Handles pathnames in ISABELLECOMP
paulson [Mon, 21 Oct 1996 11:37:21 +0200] rev 2119
Mentions the possibility of pathnames in ISABELLECOMP;
paulson [Mon, 21 Oct 1996 11:36:57 +0200] rev 2118
Creates a bigger main window
paulson [Mon, 21 Oct 1996 11:18:34 +0200] rev 2117
ISABELLECOMP may now have a leading pathname
nipkow [Mon, 21 Oct 1996 09:51:18 +0200] rev 2116
Used trans_tac (see Provers/nat_transitive.ML) to automate arithmetic.
nipkow [Mon, 21 Oct 1996 09:50:50 +0200] rev 2115
Added trans_tac (see Provers/nat_transitive.ML)
nipkow [Mon, 21 Oct 1996 09:49:41 +0200] rev 2114
Solves simple arithmetic goals.
paulson [Fri, 18 Oct 1996 12:54:19 +0200] rev 2113
Subst as modified by Konrad Slind
paulson [Fri, 18 Oct 1996 12:41:04 +0200] rev 2112
Konrad Slind's TFL
paulson [Fri, 18 Oct 1996 11:43:14 +0200] rev 2111
New version of Yahalom, as recommended on p 259 of BAN paper
paulson [Fri, 18 Oct 1996 11:42:41 +0200] rev 2110
Addition of Reveal message
paulson [Fri, 18 Oct 1996 11:42:17 +0200] rev 2109
Deleted obsolete rewrites (they are now in HOL/simpdata)
paulson [Fri, 18 Oct 1996 11:41:41 +0200] rev 2108
Reveal -> Revl
paulson [Fri, 18 Oct 1996 11:41:04 +0200] rev 2107
The new proof of the lemma for new_nonces_not_seen is faster
paulson [Fri, 18 Oct 1996 11:39:55 +0200] rev 2106
Generaly tidying up
paulson [Fri, 18 Oct 1996 11:39:10 +0200] rev 2105
Important correction to comment
paulson [Fri, 18 Oct 1996 11:38:17 +0200] rev 2104
Replaced excluded_middle_tac by case_tac; tidied proofs
paulson [Fri, 18 Oct 1996 11:37:19 +0200] rev 2103
Tidied up the proof of A_trust_NS4
paulson [Fri, 18 Oct 1996 11:33:02 +0200] rev 2102
Replaced excluded_middle_tac by case_tac
paulson [Fri, 18 Oct 1996 11:32:38 +0200] rev 2101
Moving the CPUtimer declaration into cond_timeit should
prevent the problems that caused exn TIME to be raised