wenzelm [Fri, 11 Dec 2009 22:31:24 +0100] rev 34078
removed unique ids -- now in session.scala;
wenzelm [Fri, 11 Dec 2009 20:44:33 +0100] rev 34077
merged
wenzelm [Fri, 11 Dec 2009 20:44:15 +0100] rev 34076
Subgoal.FOCUS (and variants): resulting goal state is normalized as usual for resolution;
tuned;
wenzelm [Fri, 11 Dec 2009 20:43:41 +0100] rev 34075
Subgoal.FOCUS etc.: resulting goal state is normalized as usual for resolution;
haftmann [Fri, 11 Dec 2009 20:32:58 +0100] rev 34074
merged
haftmann [Fri, 11 Dec 2009 20:32:49 +0100] rev 34073
repaired accident: do not forget module contents if there are no imports
haftmann [Fri, 11 Dec 2009 20:32:49 +0100] rev 34072
option width for Code_Target.code_of
haftmann [Fri, 11 Dec 2009 20:32:49 +0100] rev 34071
default_code_width is now proper theory data
boehmes [Fri, 11 Dec 2009 15:36:24 +0100] rev 34070
merged
boehmes [Fri, 11 Dec 2009 15:36:05 +0100] rev 34069
updated dependencies
boehmes [Fri, 11 Dec 2009 15:35:29 +0100] rev 34068
make assertion labels unique already when loading a verification condition,
keep abstract view on verification conditions and provide various splitting operations on verification conditions,
allow to discharge only parts of a verification condition,
extended the command "boogie_vc" with options to consider only some assertions or to split a verification condition into its paths,
added a narrowing option to "boogie_status" (a divide-and-conquer approach for identifying the "hard" subset of assertions of a verification conditions),
added tactics "boogie", "boogie_all" and "boogie_cases",
dropped tactic "split_vc",
split example Boogie_Max into Boogie_Max (proof based on SMT) and Boogie_Max_Stepwise (proof based on metis and auto with documentation of the available Boogie commands),
dropped (mostly unused) abbreviations
boehmes [Fri, 11 Dec 2009 15:06:12 +0100] rev 34067
depend on HOL-SMT instead of HOL (makes tactic "smt" available for proofs)
haftmann [Fri, 11 Dec 2009 14:44:08 +0100] rev 34066
merged
haftmann [Fri, 11 Dec 2009 14:43:56 +0100] rev 34065
moved predicate rules to Predicate.thy; weakened default dest rule predicate1D (is not that reliable wrt. sets)
haftmann [Fri, 11 Dec 2009 14:43:55 +0100] rev 34064
avoid dependency on implicit dest rule predicate1D in proofs
haftmann [Fri, 11 Dec 2009 14:32:37 +0100] rev 34063
merged
haftmann [Fri, 11 Dec 2009 14:32:24 +0100] rev 34062
NEWS
haftmann [Fri, 11 Dec 2009 08:47:16 +0100] rev 34061
merged
haftmann [Wed, 09 Dec 2009 21:38:21 +0100] rev 34060
merged
haftmann [Wed, 09 Dec 2009 21:38:12 +0100] rev 34059
take and drop as projections of chop
haftmann [Wed, 09 Dec 2009 21:38:12 +0100] rev 34058
explicit lower bound for index
paulson [Fri, 11 Dec 2009 09:25:45 +0000] rev 34057
merged
paulson [Thu, 10 Dec 2009 17:34:50 +0000] rev 34056
merged
paulson [Thu, 10 Dec 2009 17:34:18 +0000] rev 34055
streamlined proofs
paulson [Thu, 10 Dec 2009 17:34:09 +0000] rev 34054
fixed typo
wenzelm [Thu, 10 Dec 2009 22:28:55 +0100] rev 34053
merged
boehmes [Thu, 10 Dec 2009 18:10:59 +0100] rev 34052
only invoke metisFT if metis failed
bulwahn [Thu, 10 Dec 2009 11:58:26 +0100] rev 34051
added Imperative_HOL examples; added tail-recursive combinator for monadic heap functions; adopted code generation of references; added lemmas
haftmann [Wed, 09 Dec 2009 21:33:50 +0100] rev 34050
merged
haftmann [Wed, 09 Dec 2009 16:46:04 +0100] rev 34049
each import resides in its own line