Fri, 04 Jul 1997 12:31:20 +0200 paulson Simplified the new proofs about division
Fri, 04 Jul 1997 11:57:33 +0200 paulson New comments on how to deal with unproved termination conditions
Fri, 04 Jul 1997 11:56:49 +0200 paulson Fixed comments
Fri, 04 Jul 1997 11:56:18 +0200 paulson Moved MLWorks.ML to its proper place, directory ML-Systems.
Fri, 04 Jul 1997 11:54:43 +0200 paulson Automatic update
Thu, 03 Jul 1997 17:21:14 +0200 paulson Modified the \tydx command to set types in italics instead of \tt
Thu, 03 Jul 1997 17:20:07 +0200 paulson Some LaTeX-2e primitives such as \texttt
Thu, 03 Jul 1997 17:17:45 +0200 paulson Added documentation for recdef, and tidied some other material
Thu, 03 Jul 1997 17:10:50 +0200 paulson Updated references
Thu, 03 Jul 1997 13:44:54 +0200 nipkow set_of_list -> set
Wed, 02 Jul 1997 16:53:14 +0200 paulson Now there are TWO spaces after each full stop, so that the Emacs sentence
Wed, 02 Jul 1997 16:46:36 +0200 paulson Now there are TWO spaces after each full stop, so that the Emacs sentence
Wed, 02 Jul 1997 11:59:10 +0200 nipkow Added the following lemmas tp Divides and a few others to Arith and NatDef:
Tue, 01 Jul 1997 17:59:36 +0200 paulson Tidying; also simplified the lemma Says_Server_not
Tue, 01 Jul 1997 17:42:36 +0200 paulson New theory TLS
Tue, 01 Jul 1997 17:38:49 +0200 paulson Deleted a redundant A~=B in rules that refer to a previous event
Tue, 01 Jul 1997 17:37:42 +0200 paulson More realistic model: the Spy can compute clientK and serverK
Tue, 01 Jul 1997 17:36:42 +0200 paulson Reordered rules in analz_image_freshK_ss to improve clarity
Tue, 01 Jul 1997 17:35:09 +0200 paulson Removal of the obsolete newN function
Tue, 01 Jul 1997 17:34:42 +0200 paulson New theorem priK_inj_eq, injectivity of priK
Tue, 01 Jul 1997 17:34:13 +0200 paulson spy_analz_tac: Restored iffI to the list of rules used to break down
Tue, 01 Jul 1997 17:32:12 +0200 paulson New theory TLS
Tue, 01 Jul 1997 11:11:42 +0200 paulson Baby TLS. Proofs work, but model seems unrealistic
Tue, 01 Jul 1997 10:45:59 +0200 paulson New and stronger lemmas; more default simp/cla rules
Tue, 01 Jul 1997 10:39:28 +0200 paulson Deleted the obsolete operators newK, newN and nPair
Tue, 01 Jul 1997 10:38:11 +0200 paulson Now the possibility proof calls the appropriate tactic
Tue, 01 Jul 1997 10:37:42 +0200 paulson Added a comment
Tue, 01 Jul 1997 10:37:03 +0200 paulson Now Collect_mem_eq is a default simprule (how could it have ever been omitted?
Tue, 01 Jul 1997 10:34:30 +0200 paulson New laws for the "lists" operator
Mon, 30 Jun 1997 12:08:19 +0200 nipkow More concat lemmas.
Fri, 27 Jun 1997 10:47:13 +0200 paulson Corrected indentations and margins after the renaming of "set_of_list"
Thu, 26 Jun 1997 13:20:50 +0200 nipkow set_of_list -> set
Thu, 26 Jun 1997 11:58:05 +0200 paulson Trivial changes in connection with the Yahalom paper.
Thu, 26 Jun 1997 11:15:55 +0200 wenzelm oops;
Thu, 26 Jun 1997 11:14:46 +0200 wenzelm rearrange pages of ps file to be printed as booklet (duplex);
Thu, 26 Jun 1997 10:43:15 +0200 nipkow amdI -> admI2
Thu, 26 Jun 1997 10:42:50 +0200 nipkow Tuned Franz's proofs.
Mon, 23 Jun 1997 11:33:59 +0200 paulson Removal of structure Context and its replacement by a theorem list of
Mon, 23 Jun 1997 11:30:35 +0200 paulson Removal of COND_CONG, which is just if_cong RS eq_reflection
Mon, 23 Jun 1997 10:42:03 +0200 paulson Ran expandshort
Mon, 23 Jun 1997 10:35:49 +0200 paulson New "congs" keyword for recdef theory section
Fri, 20 Jun 1997 13:19:31 +0200 wenzelm removed old Makefile;
Fri, 20 Jun 1997 11:37:53 +0200 wenzelm removed;
Fri, 20 Jun 1997 11:34:05 +0200 wenzelm removed old Makefile;
Fri, 20 Jun 1997 11:19:39 +0200 wenzelm removed old Makefile and compat files;
Thu, 19 Jun 1997 11:31:14 +0200 paulson Made proofs more concise by replacing calls to spy_analz_tac by uses of
Thu, 19 Jun 1997 11:28:55 +0200 paulson Proof tidying and variable renaming (NA->na, NB->nb when of type msg)
Thu, 19 Jun 1997 11:24:37 +0200 paulson New comments; a tidied proof
Thu, 19 Jun 1997 11:23:31 +0200 paulson Two new rewrite rules--NOT included by default\!
Wed, 18 Jun 1997 15:38:35 +0200 paulson Defines KeyWithNonce, which is used to prove the secrecy of NB
Wed, 18 Jun 1997 15:31:31 +0200 paulson Addition of not_imp (which pushes negation into implication) as a default
Wed, 18 Jun 1997 15:30:32 +0200 paulson Corrected Title in header lines
Wed, 18 Jun 1997 15:28:03 +0200 paulson Streamlined proofs of the secrecy of NB and added authentication of A and B
Wed, 18 Jun 1997 15:24:21 +0200 paulson Removed Says_Crypt_lost and Says_Crypt_not_lost.
Wed, 18 Jun 1997 15:23:29 +0200 paulson Removed Says_Crypt_lost and Says_Crypt_not_lost.
Wed, 18 Jun 1997 15:21:30 +0200 paulson Adapted proofs to the removal of Says_Crypt_lost and Says_Crypt_not_lost
Wed, 18 Jun 1997 15:19:37 +0200 paulson Deleted spurious reference to Spy_not_see_NB, which by chance was defined
Tue, 17 Jun 1997 09:01:56 +0200 nipkow converse -> ^-1
Mon, 16 Jun 1997 14:25:33 +0200 paulson Type constraint added to ensure that "length" refers to lists. Maybe should
Mon, 16 Jun 1997 14:24:11 +0200 paulson Replacing the primrec definition of "length" by a translation to the built-in
(0) -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip