Mon, 23 Sep 1996 18:21:31 +0200 Correction of protocol; addition of Reveal message; proofs of
paulson [Mon, 23 Sep 1996 18:21:31 +0200] rev 2014
Correction of protocol; addition of Reveal message; proofs of correctness in its presence
Mon, 23 Sep 1996 18:20:43 +0200 Proof of Says_imp_old_keys is now more robust
paulson [Mon, 23 Sep 1996 18:20:43 +0200] rev 2013
Proof of Says_imp_old_keys is now more robust
Mon, 23 Sep 1996 18:19:38 +0200 Removal of the Notes constructor
paulson [Mon, 23 Sep 1996 18:19:38 +0200] rev 2012
Removal of the Notes constructor
Mon, 23 Sep 1996 18:19:02 +0200 New laws for messages
paulson [Mon, 23 Sep 1996 18:19:02 +0200] rev 2011
New laws for messages
Mon, 23 Sep 1996 18:18:18 +0200 Simplification of definition of synth
paulson [Mon, 23 Sep 1996 18:18:18 +0200] rev 2010
Simplification of definition of synth
Mon, 23 Sep 1996 18:12:45 +0200 Addition of le_refl to default simpset/claset
paulson [Mon, 23 Sep 1996 18:12:45 +0200] rev 2009
Addition of le_refl to default simpset/claset
Mon, 23 Sep 1996 18:10:48 +0200 Removal of reference Nipkow-LICS-93
paulson [Mon, 23 Sep 1996 18:10:48 +0200] rev 2008
Removal of reference Nipkow-LICS-93
Mon, 23 Sep 1996 18:09:53 +0200 Proof of mult_le_mono is now more robust
paulson [Mon, 23 Sep 1996 18:09:53 +0200] rev 2007
Proof of mult_le_mono is now more robust
Mon, 23 Sep 1996 17:47:49 +0200 New infix syntax: breaks line BEFORE operator
paulson [Mon, 23 Sep 1996 17:47:49 +0200] rev 2006
New infix syntax: breaks line BEFORE operator
Mon, 23 Sep 1996 17:46:12 +0200 Optimized version of SELECT_GOAL, up to 10% faster
paulson [Mon, 23 Sep 1996 17:46:12 +0200] rev 2005
Optimized version of SELECT_GOAL, up to 10% faster
Mon, 23 Sep 1996 17:45:43 +0200 New operations on cterms. Now same names as in Logic
paulson [Mon, 23 Sep 1996 17:45:43 +0200] rev 2004
New operations on cterms. Now same names as in Logic
Mon, 23 Sep 1996 17:42:56 +0200 Addition of gensym
paulson [Mon, 23 Sep 1996 17:42:56 +0200] rev 2003
Addition of gensym
Mon, 23 Sep 1996 17:41:57 +0200 Bad version of Otway-Rees and the new attack on it
paulson [Mon, 23 Sep 1996 17:41:57 +0200] rev 2002
Bad version of Otway-Rees and the new attack on it
Fri, 13 Sep 1996 18:49:43 +0200 Reformatting; proved B_gets_secure_key
paulson [Fri, 13 Sep 1996 18:49:43 +0200] rev 2001
Reformatting; proved B_gets_secure_key
Fri, 13 Sep 1996 18:48:25 +0200 Abstraction of enemy_analz_tac over its argument
paulson [Fri, 13 Sep 1996 18:48:25 +0200] rev 2000
Abstraction of enemy_analz_tac over its argument
Fri, 13 Sep 1996 18:47:01 +0200 Reformatting
paulson [Fri, 13 Sep 1996 18:47:01 +0200] rev 1999
Reformatting
Fri, 13 Sep 1996 18:46:08 +0200 Reordering of premises for cut theorems, and new law MPair_synth_analz
paulson [Fri, 13 Sep 1996 18:46:08 +0200] rev 1998
Reordering of premises for cut theorems, and new law MPair_synth_analz
Fri, 13 Sep 1996 13:22:08 +0200 No longer assumes Alice is not the Enemy in NS3.
paulson [Fri, 13 Sep 1996 13:22:08 +0200] rev 1997
No longer assumes Alice is not the Enemy in NS3. Proofs do not need it, and the assumption complicated the liveness argument
Fri, 13 Sep 1996 13:20:22 +0200 Uses the improved enemy_analz_tac of Shared.ML, with simpler proofs
paulson [Fri, 13 Sep 1996 13:20:22 +0200] rev 1996
Uses the improved enemy_analz_tac of Shared.ML, with simpler proofs Weak liveness
Fri, 13 Sep 1996 13:16:57 +0200 Addition of Yahalom protocol
paulson [Fri, 13 Sep 1996 13:16:57 +0200] rev 1995
Addition of Yahalom protocol
Fri, 13 Sep 1996 13:15:48 +0200 Removal of obsolete thm Fake_parts_insert
paulson [Fri, 13 Sep 1996 13:15:48 +0200] rev 1994
Removal of obsolete thm Fake_parts_insert
Fri, 13 Sep 1996 13:15:00 +0200 Addition of enemy_analz_tac and safe_solver
paulson [Fri, 13 Sep 1996 13:15:00 +0200] rev 1993
Addition of enemy_analz_tac and safe_solver Use of AddIffs for theorems about keys
Thu, 12 Sep 1996 18:12:09 +0200 added flat_eq,
oheimb [Thu, 12 Sep 1996 18:12:09 +0200] rev 1992
added flat_eq, renamed adm_disj_lemma11 to adm_lemma11, localized adm_disj_lemma1, ..., adm_disj_lemma10, adm_disj_lemma12, modularized proof of admI
Thu, 12 Sep 1996 18:05:33 +0200 renamed adm_disj_lemma11 to adm_lemma11
oheimb [Thu, 12 Sep 1996 18:05:33 +0200] rev 1991
renamed adm_disj_lemma11 to adm_lemma11
Thu, 12 Sep 1996 17:28:06 +0200 added comment on is_flat
oheimb [Thu, 12 Sep 1996 17:28:06 +0200] rev 1990
added comment on is_flat
Thu, 12 Sep 1996 17:18:00 +0200 added stric
oheimb [Thu, 12 Sep 1996 17:18:00 +0200] rev 1989
added stric tI
Thu, 12 Sep 1996 15:22:52 +0200 undo last revision
oheimb [Thu, 12 Sep 1996 15:22:52 +0200] rev 1988
undo last revision
Thu, 12 Sep 1996 15:17:41 +0200 bin/isa2latex: copy the binary to bin/isa2latex instead of linking it there
oheimb [Thu, 12 Sep 1996 15:17:41 +0200] rev 1987
bin/isa2latex: copy the binary to bin/isa2latex instead of linking it there
Thu, 12 Sep 1996 11:47:42 +0200 new \subsubsection{Configuring conversion tables and keyboard bindings}
oheimb [Thu, 12 Sep 1996 11:47:42 +0200] rev 1986
new \subsubsection{Configuring conversion tables and keyboard bindings} (by Franz Regensburger) added to the manual.
Thu, 12 Sep 1996 10:40:05 +0200 Tidied many proofs, using AddIffs to let equivalences take
paulson [Thu, 12 Sep 1996 10:40:05 +0200] rev 1985
Tidied many proofs, using AddIffs to let equivalences take the place of separate Intr and Elim rules. Also deleted most named clasets.
(0) -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 +3000 +10000 +30000 tip