1999-09-07 wenzelm 1999-09-07 isatool expandshort;
1999-01-19 paulson 1999-01-19 a simplification by G Bella
1998-09-23 paulson 1998-09-23 deleted needless parentheses
1998-09-15 paulson 1998-09-15 From Compl(A) to -A
1998-09-11 paulson 1998-09-11 tidied
1998-09-10 paulson 1998-09-10 patch to stop failing proof
1998-09-08 paulson 1998-09-08 Got rid of not_Says_to_self and most uses of ~= in definitions and theorems
1998-09-02 paulson 1998-09-02 small simplification to not_Says_to_self
1998-08-21 paulson 1998-08-21 Tidying
1998-08-06 paulson 1998-08-06 even more tidying of Goal commands
1998-07-31 paulson 1998-07-31 Removal of obsolete "open" commands from heads of .ML files
1998-07-02 paulson 1998-07-02 Deleted leading parameters thanks to new Goal command
1998-06-24 paulson 1998-06-24 Ran isatool fixgoal
1998-06-19 paulson 1998-06-19 tidying
1998-04-27 nipkow 1998-04-27 Renamed expand_const -> split_const.
1998-01-08 paulson 1998-01-08 Expressed most Oops rules using Notes instead of Says, and other tidying
1998-01-02 paulson 1998-01-02 Making proofs faster, especially using keysFor_parts_insert
1997-12-24 paulson 1997-12-24 New Auto_tac (by Oheimb), and new syntax (without parens), and expandshort
1997-12-23 paulson 1997-12-23 Tidied using more default rules
1997-12-19 wenzelm 1997-12-19 tuned;
1997-12-16 paulson 1997-12-16 Simplified proofs using rewrites for f``A where f is injective
1997-12-01 paulson 1997-12-01 New guarantee B_trusts_NS5, and tidying
1997-11-21 paulson 1997-11-21 tidying
1997-11-18 paulson 1997-11-18 The dtac was discarding information, though apparently no proofs were hurt
1997-11-03 wenzelm 1997-11-03 isatool fixclasimp;
1997-10-21 paulson 1997-10-21 Many minor speedups: 1. Some use of rewriting with expand_ifs instead of addsplits[expand_if] 2. Faster proof of new_keys_not_used 3. New version of shrK_neq (no longer refers to "range")
1997-10-17 nipkow 1997-10-17 setloop split_tac -> addsplits
1997-09-29 paulson 1997-09-29 Step_tac -> Safe_tac
1997-09-18 paulson 1997-09-18 Global change: lost->bad and sees Spy->spies First change just gives a more sensible name. Second change eliminates the agent parameter of "sees" to simplify definitions and theorems
1997-09-17 paulson 1997-09-17 Fixed comments
1997-09-16 paulson 1997-09-16 Deleted the redundant simprule not_parts_not_analz
1997-08-21 paulson 1997-08-21 Simplified the statement of A_trusts_NS2
1997-07-14 paulson 1997-07-14 Changing "lost" from a parameter of protocol definitions to a constant. Advantages: no "lost" argument everywhere; fewer Vars in subgoals; less need for specially instantiated rules Disadvantage: can no longer prove "Agent_not_see_encrypted_key", but this theorem was never used, and its original proof was also broken the introduction of the "Notes" constructor.
1997-07-11 paulson 1997-07-11 Removal of monotonicity reasoning involving "lost" and the theorem Agent_not_see_encrypted_key, which (a) is never used and (b) becomes harder to prove when Notes is available.
1997-06-27 paulson 1997-06-27 Corrected indentations and margins after the renaming of "set_of_list"
1997-06-26 nipkow 1997-06-26 set_of_list -> set
1997-06-19 paulson 1997-06-19 Made proofs more concise by replacing calls to spy_analz_tac by uses of analz_insert_eq in rewriting
1997-06-18 paulson 1997-06-18 Adapted proofs to the removal of Says_Crypt_lost and Says_Crypt_not_lost
1997-05-07 paulson 1997-05-07 Conversion to use blast_tac (with other improvements)
1997-02-15 oheimb 1997-02-15 reflecting my recent changes of the simplifier and classical reasoner
1997-01-27 paulson 1997-01-27 Corrected faulty comment
1997-01-20 paulson 1997-01-20 Simplified Oops case of main theorem
1997-01-17 paulson 1997-01-17 Now with Andy Gordon's treatment of freshness to replace newN/K
1996-12-19 paulson 1996-12-19 Extensive tidying and simplification, largely stemming from changing newN and newK to take an integer argument
1996-12-13 paulson 1996-12-13 Streamlined many proofs
1996-12-05 paulson 1996-12-05 Trivial renamings
1996-11-29 paulson 1996-11-29 Swapped arguments of Crypt (for clarity and because it is conventional)
1996-11-28 paulson 1996-11-28 Weaking of injectivity assumptions for newK and newN: they are no longer assumed injective over all traces, merely over the length of a trace
1996-11-08 paulson 1996-11-08 Ran expandshort
1996-11-07 paulson 1996-11-07 Deleted bogus comment
1996-11-05 paulson 1996-11-05 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.
1996-10-28 paulson 1996-10-28 Changing from the Reveal to the Oops rule
1996-10-24 paulson 1996-10-24 Moved ex_strip_tac to the common part
1996-10-18 paulson 1996-10-18 Tidied up the proof of A_trust_NS4
1996-10-08 paulson 1996-10-08 New guarantees for each line of protocol
1996-10-01 paulson 1996-10-01 Moved sees_lost_agent_subset_sees_Spy to common file, and simplified main thm
1996-09-30 paulson 1996-09-30 Removed some dead wood. Transferred lemmas used to prove analz_image_newK to Shared.ML
1996-09-26 paulson 1996-09-26 Introduction of "lost" argument Changed Enemy -> Spy Ran expandshort
1996-09-25 paulson 1996-09-25 Last working version before "lost"
1996-09-23 paulson 1996-09-23 Simplification of proof of unique_session_keys