Difference between pages "Rodin Proof Tactics" and "File:Steve Wright Quite Big Model Presentation.pdf"

From Event-B
(Difference between pages)
Jump to navigationJump to search
imported>Son
 
 
Line 1: Line 1:
This page contains descriptions of the available proof tactics within the RODIN Platform.
+
Slides from Steve Wright's presentation "Experiences with a Quite Big Event-b Model", given at the Rodin workshop, Southampton, July 16th 2009.
 
 
For each tactic, the descriptions is as follows:
 
 
 
* '''Description''': A high-level description of the tactic. This will be the description appeared in the RODIN Platform preferences.
 
 
 
* '''Additional details''': (Optional) Details explanation of the tactic.
 
 
 
* '''ID''': An unique ID associated with the tactic.
 
 
 
* '''Auto-tactic''': ''No'': the tactic cannot be added as an auto-tactic. ''Yes'': the tactic can be added as an auto-tactic. ''Default'': the tactic is a default auto-tactic.
 
 
 
* '''Post-tactic''': ''No'': the tactic cannot be added as a post-tactic. ''Yes'': the tactic can be added as a post-tactic. ''Default'': the tactic is a default post-tactic.
 
 
 
* '''Preference display''': Information on how an application of the tactic is displayed in the auto-tactic preference or the post-tactic preference.
 
 
 
* '''Interactive''': ''No'': the tactic cannot be invoked interactively. ''Global'': The tactic can be invoked from the Proof Control. ''Goal'': The tactic can be invoked from the goal view. ''Hypothesis'': The tactic can be invoked from the hypothesis view.  If the tactic can be invoked interactively (i.e. either ''Global'', ''Goal'' or ''Hypothesis''), more information about how this could be done will be given. Note that since the '''Post-tactics''' can be launched manually, any tactics that can be included in the post-tactic in principle can be invoked interactively via the post-tactic. Here ''No'' only means that there is no separate invocation for this specific tactic.
 
 
 
* '''Proving interface display''': Example(s) on how an application of this tactic can be seen from the proving interface of the RODIN Platform.
 
 
 
== True Goal ==
 
* '''Description''': Discharges any sequent whose goal is '⊤' (logical true).
 
 
 
* '''ID''': org.eventb.core.seqprover.trueGoalTac
 
 
 
* '''Auto-tactic''': ''Default''
 
 
 
* '''Post-tactic''': ''Default''
 
 
 
* '''Preference display''': True Goal (Discharge)
 
 
 
* '''Interactive''': ''No''
 
 
 
* '''Proving interface display''': ⊤ goal
 
 
 
[[Image:TrueGoalExp1.png]]
 
 
 
== False Hypothesis ==
 
* '''Description''': Discharges any sequent containing a '⊥' hypothesis
 
 
 
* '''ID''': org.eventb.core.seqprover.falseHypTac
 
 
 
* '''Auto-tactic''': ''Default''
 
 
 
* '''Post-tactic''': ''Default''
 
 
 
* '''Preference display''': False Hypothesis (Discharge)
 
 
 
* '''Interactive''': ''No''
 
 
 
* '''Proving interface display''': ⊥ hyp
 
 
 
[[Image: FalseHypExp1.png]]
 
 
 
== Goal in Hypotheses ==
 
* '''Description''': Discharges any sequent whose goal is contained in its hypotheses
 
 
 
* '''ID''': org.eventb.core.seqprover.goalInHypTac
 
 
 
* '''Auto-tactic''': ''Default''
 
 
 
* '''Post-tactic''': ''Default''
 
 
 
* '''Preference display''': Goal in Hypotheses (Discharge)
 
 
 
* '''Interactive''': ''No''
 
 
 
* '''Proving interface display''': hyp
 
 
 
[[Image: GoalInHypExp1.png]]
 
 
 
== Goal Disjunct in Hypothesis ==
 
* '''Description''': Discharges any sequent whose goal is a disjunction and one of whose disjuncts is present in the hypotheses.
 
 
 
* '''ID''': org.eventb.core.seqprover.goalDisjInHypTac
 
 
 
* '''Auto-tactic''': ''No''
 
 
 
* '''Post-tactic''': ''Default''
 
 
 
* '''Preference display''': Goal Disjunct in Hypotheses (Discharge)
 
 
 
* '''Interactive''': ''No''
 
 
 
* '''Proving interface display''': ∨ goal in hyp
 
 
 
[[Image: GoalDisjInHypExp1.png]]
 
 
 
== Functional Goal ==
 
* '''Description''': Tries to discharge a sequent whose goal states that an expression is a function (i.e. f ∈ T1 ⇸ T2, where T1 and T2 are type expressions).
 
 
 
* '''Additional details''': The sequent is discharged if there is a hypothesis specifying that f is a function of any kind (i.e. partial function, total function, partial injection, total injection, partial surjection,  total surjection, bijection). More information about type expressions in Event-B is in the [[FAQ#What are type expressions in Event-B?|FAQ]] page.
 
 
 
* '''ID''': org.eventb.core.seqprover.funGoalTac
 
 
 
* '''Auto-tactic''': ''Default''
 
 
 
* '''Post-tactic''': ''Default''
 
 
 
* '''Preference display''': Functional Goal (Discharge)
 
 
 
* '''Interactive''': ''No''
 
 
 
* '''Proving interface display''': functional goal
 
 
 
[[Image:FunctionalGoalExp1.png]]
 
 
 
== Simplification Rewriter ==
 
* '''Description''': Tries to simplify all predicates in a sequent using pre-defined simplification rewriting rules.
 
 
 
* '''Additional details''': The list of rewriting rules are in the following page [[All Rewrite Rules | http://wiki.event-b.org/index.php/All_Rewrite_Rules]], which are marked as ''Automatic''.
 
 
 
* '''ID''': org.eventb.core.seqprover.autoRewriteTac
 
 
 
* '''Auto-tactic''': ''Default''
 
 
 
* '''Post-tactic''': ''Default''
 
 
 
* '''Preference display''': Simplification Rewriter (Simplify)
 
 
 
* '''Interactive''': ''No''
 
 
 
* '''Proving interface display''': simplification rewrites
 
 
 
The example below shows the screen-shots of the step before the application of the tactic and the step just after the application of the tactic.  There are 3 rewritings have been done as follows.
 
 
 
<math>
 
\begin{array}{rcl}
 
a + 0  & \Longrightarrow & a \\
 
a = a & \Longrightarrow & \btrue \\
 
c * 1 & \Longrightarrow & c \\
 
\end{array}
 
</math>
 
 
 
Note that <math>\btrue</math> hypothesis is always ''dropped'' in the RODIN Platform.
 
 
 
Before [[Image:SimplifcationRewritesExp1.png]]
 
 
 
After [[Image:SimplifcationRewritesExp2.png]]
 
 
 
== Type Rewriter ==
 
* '''Description''': Simplifies predicates containing type expressions such as E ∈ T to ⊤ and T = ∅ to ⊥.
 
 
 
* '''Additional details''': More information about type expressions in Event-B is in the [[FAQ#What are type expressions in Event-B?|FAQ]] page.
 
 
 
* '''ID''': org.eventb.core.seqprover.typeRewriteTac
 
 
 
* '''Auto-tactic''': ''Default''
 
 
 
* '''Post-tactic''': ''Default''
 
 
 
* '''Preference display''': Type Rewriter (Simplify)
 
 
 
* '''Interactive''': ''No''
 
 
 
* '''Proving interface display''': type rewrites
 
 
 
The example below shows the screen-shots of the step before the application of the tactic and the step just after the application of the tactic.
 
 
 
Before [[Image: TypeRewritesExp1.png]]
 
 
 
After [[Image: TypeRewritesExp2.png]]
 
 
 
== Implication Goal ==
 
* '''Description''': Simplifies any sequent with an implicative goal by adding the left hand side of the implication to the hypotheses and making its right hand side the new goal.
 
 
 
* '''ID''': org.eventb.core.seqprover.impGoalTac
 
 
 
* '''Auto-tactic''': ''No''
 
 
 
* '''Post-tactic''': ''Default''
 
 
 
* '''Preference display''': Implicative Goal (Simplify)
 
 
 
* '''Interactive''': ''Goal''. The <math>\limp</math> symbol in the implicative goal is ''redden''. When the mouse hovers the red symbol, the label of the tactic in the context menu is ''Deduction''.
 
 
 
[[Image: ImpGoalInteractive1.png]]
 
 
 
* '''Proving interface display''': ⇒ goal
 
 
 
The example below shows the screen-shots of the step before the application of the tactic and the step just after the application of the tactic.
 
 
 
Before [[Image: ImpGoalExp1.png]]
 
 
 
After [[Image: ImpGoalExp2.png]]
 
 
 
== For-all Goal ==
 
* '''Description''': Simplifies any sequent with a universally quantified goal by freeing all its bound variables.
 
 
 
* '''ID''': org.eventb.core.seqprover.forallGoalTac
 
 
 
* '''Auto-tactic''': ''No''
 
 
 
* '''Post-tactic''': ''Yes''
 
 
 
* '''Preference display''': For-all Goal (Simplify)
 
 
 
* '''Interactive''': ''Goal''. The  symbol <textcolor=red><math>\forall</math></textcolor> in the universal quantified goal is redden. When the mouse hovers the red symbol, the label of the tactic in the context menu is ''Forall instantiation''.
 
 
 
[[Image: ForallGoalInteractive1.png]]
 
 
 
* '''Proving interface display''': ∀ goal (frees ''list-of-bounded-identifiers'')
 
 
 
Before [[Image: ForallGoalExp1.png]]
 
 
 
After [[Image: ForallGoalExp2.png]]
 
 
 
== Exists Hypothesis ==
 
* '''Description''': TODO
 
 
 
* '''ID''': TODO
 
 
 
* '''Display''': TODO
 
 
 
* '''Auto-tactic''': TODO
 
 
 
* '''Post-tactic''': TODO
 
 
 
* '''Interactive''': TODO
 
 
 
* '''Example''': TODO
 
 
 
== Find Contradictory Hypothesis ==
 
* '''Description''': TODO
 
 
 
* '''ID''': TODO
 
 
 
* '''Display''': TODO
 
 
 
* '''Auto-tactic''': TODO
 
 
 
* '''Post-tactic''': TODO
 
 
 
* '''Interactive''': TODO
 
 
 
* '''Example''': TODO
 
 
 
== Use Equality Hypothesis ==
 
* '''Description''': TODO
 
 
 
* '''ID''': TODO
 
 
 
* '''Display''': TODO
 
 
 
* '''Auto-tactic''': TODO
 
 
 
* '''Post-tactic''': TODO
 
 
 
* '''Interactive''': TODO
 
 
 
* '''Example''': TODO
 
 
 
== Shrink Implicative Hypothesis ==
 
* '''Description''': TODO
 
 
 
* '''ID''': TODO
 
 
 
* '''Display''': TODO
 
 
 
* '''Auto-tactic''': TODO
 
 
 
* '''Post-tactic''': TODO
 
 
 
* '''Interactive''': TODO
 
 
 
* '''Example''': TODO
 
 
 
== Shrink Enumerated Set ==
 
* '''Description''': TODO
 
 
 
* '''ID''': TODO
 
 
 
* '''Display''': TODO
 
 
 
* '''Auto-tactic''': TODO
 
 
 
* '''Post-tactic''': TODO
 
 
 
* '''Interactive''': TODO
 
 
 
* '''Example''': TODO
 
 
 
== Implicative Hypothesis with Conjunctive RHS ==
 
* '''Description''': TODO
 
 
 
* '''ID''': TODO
 
 
 
* '''Display''': TODO
 
 
 
* '''Auto-tactic''': TODO
 
 
 
* '''Post-tactic''': TODO
 
 
 
* '''Interactive''': TODO
 
 
 
* '''Example''': TODO
 
 
 
== Implicative Hypothesis with Disjunctive LHS ==
 
* '''Description''': TODO
 
 
 
* '''ID''': TODO
 
 
 
* '''Display''': TODO
 
 
 
* '''Auto-tactic''': TODO
 
 
 
* '''Post-tactic''': TODO
 
 
 
* '''Interactive''': TODO
 
 
 
* '''Example''': TODO
 
 
 
== Conjunctive Goal ==
 
* '''Description''': TODO
 
 
 
* '''ID''': TODO
 
 
 
* '''Display''': TODO
 
 
 
* '''Auto-tactic''': TODO
 
 
 
* '''Post-tactic''': TODO
 
 
 
* '''Interactive''': TODO
 
 
 
* '''Example''': TODO
 
 
 
== Clarify Goal ==
 
* '''Description''': TODO
 
 
 
* '''ID''': TODO
 
 
 
* '''Display''': TODO
 
 
 
* '''Auto-tactic''': TODO
 
 
 
* '''Post-tactic''': TODO
 
 
 
* '''Interactive''': TODO
 
 
 
* '''Example''': TODO
 
 
 
== Functional Overriding in Goal ==
 
* '''Description''': TODO
 
 
 
* '''ID''': TODO
 
 
 
* '''Display''': TODO
 
 
 
* '''Auto-tactic''': TODO
 
 
 
* '''Post-tactic''': TODO
 
 
 
* '''Interactive''': TODO
 
 
 
* '''Example''': TODO
 
 
 
== Functional Overriding in Hypothesis ==
 
* '''Description''': TODO
 
 
 
* '''ID''': TODO
 
 
 
* '''Display''': TODO
 
 
 
* '''Auto-tactic''': TODO
 
 
 
* '''Post-tactic''': TODO
 
 
 
* '''Interactive''': TODO
 
 
 
* '''Example''': TODO
 
 
 
== Partition Rewriter ==
 
* '''Description''': TODO
 
 
 
* '''ID''': TODO
 
 
 
* '''Display''': TODO
 
 
 
* '''Auto-tactic''': TODO
 
 
 
* '''Post-tactic''': TODO
 
 
 
* '''Interactive''': TODO
 
 
 
* '''Example''': TODO
 
 
 
== One-Point Rule in Goal ==
 
* '''Description''': TODO
 
 
 
* '''ID''': TODO
 
 
 
* '''Display''': TODO
 
 
 
* '''Auto-tactic''': TODO
 
 
 
* '''Post-tactic''': TODO
 
 
 
* '''Interactive''': TODO
 
 
 
* '''Example''': TODO
 
 
 
== One-Point Rule in Hypothesis ==
 
* '''Description''': TODO
 
 
 
* '''ID''': TODO
 
 
 
* '''Display''': TODO
 
 
 
* '''Auto-tactic''': TODO
 
 
 
* '''Post-tactic''': TODO
 
 
 
* '''Interactive''': TODO
 
 
 
* '''Example''': TODO
 
 
 
== Bounded Goal with Finite Hypothesis ==
 
* '''Description''': TODO
 
 
 
* '''ID''': TODO
 
 
 
* '''Display''': TODO
 
 
 
* '''Auto-tactic''': TODO
 
 
 
* '''Post-tactic''': TODO
 
 
 
* '''Interactive''': TODO
 
 
 
* '''Example''': TODO
 
 
 
== Falsify Goal ==
 
 
 
== conjI ==
 
 
 
== allI ==
 
 
 
== exI ==
 
 
 
== Remove Negation ==
 
 
 
== Review ==
 
 
 
== Proof by cases ==
 
 
 
== Add Hypothesis ==
 
 
 
== Abstract Expression ==
 
 
 
== Automatic Prover ==
 
 
 
== Post tactic ==
 
 
 
== Lasoo ==
 
 
 
== Back Tracking ==
 
 
 
== Prune ==
 
 
 
== Search Hypothesis ==
 
 
 
== Cache Hypothesis ==
 
 
 
== Previous ==
 
 
 
== Next ==
 
 
 
== Information ==
 
 
 
== Falsify Hypothesis ==
 
 
 
== Modus Ponens ==
 
 
 
== conjE ==
 
 
 
== disjE ==
 
 
 
== allE ==
 
 
 
== exE ==
 
 
 
== eq1 ==
 
 
 
== Double Implication Hypothesis ==
 
 
 
== cont Implication Hypothesis ==
 
 
 
== Functional Overriding ==
 
 
 
== Equality ==
 
 
 
== Modus Tollens ==
 
 
 
== Remove Membership ==
 
 
 
== Remove Inclusion ==
 
 
 
== Remove Strict-Inclusion ==
 
 
 
== Inclusion Set Minus Right ==
 
 
 
== Remove Inclusion Universal ==
 
 
 
== Implication Introduction ==
 
 
 
== Disjunction to Implication ==
 
 
 
== Forall Modus Ponens ==
 
 
 
== Next Pending Sub-goal ==
 
 
 
== Next Reviewed Sub-goal ==
 
 
 
== impAndHyp ==
 
 
 
== impAndGoal ==
 
 
 
== impOrHyp ==
 
 
 
== impOrGoal ==
 
 
 
== relImgUnionRight ==
 
 
 
== relImgUnionLeft ==
 
 
 
== Set Equality ==
 
 
 
== Equivalent ==
 
 
 
== Functional Intersection Image ==
 
 
 
== Functional Set Minus Image ==
 
 
 
== Functional Singleton Image ==
 
 
 
== Converse Relation ==
 
 
 
== Domain Distribution to the Left ==
 
 
 
== Domain Distribution to the Right ==
 
 
 
== Range Distribution to the Left ==
 
 
 
== Range Distribution to the Right ==
 
 
 
== Set Minus ==
 
 
 
== Conjunction and Disjunction Distribution ==
 
 
 
== Union Conjunction Distribution ==
 
 
 
== compUnionDist ==
 
 
 
== Domain/Range Union Distribution ==
 
 
 
== Relational Overriding ==
 
 
 
== Composition Image ==
 
 
 
== Domain Composition ==
 
 
 
== Range Composition ==
 
 
 
== Functional Composition Image ==
 
 
 
== Finite Set in Goal ==
 
 
 
== Finite Intersection in Goal ==
 
 
 
== Finite Set Minus in Goal ==
 
 
 
== Finite Relation in Goal ==
 
 
 
== Finite Relation Image in Goal ==
 
 
 
== Finite Domain in Goal ==
 
 
 
== Finite Range in Goal ==
 
 
 
== Finite Function in Goal ==
 
 
 
== Finite Function Converse in Goal ==
 
 
 
== Finite Functional Relational Image in Goal ==
 
 
 
== Finite Functional Range in Goal ==
 
 
 
== Finite Functional Domain in Goal ==
 
 
 
== Finite Minimum in Goal ==
 
 
 
== Finite Maximum in Goal ==
 
 
 
== Finite Negative in Goal ==
 
 
 
== Finite Positive in Goal ==
 
 
 
== Cardinality Comparison in Goal ==
 
 
 
== Cardinality Up to ==
 
 
 
== Partition Rewrite ==
 
 
 
== Arithmetic Rewrite ==
 
 
 
== Total Domain in Hypothesis / Goal ==
 

Latest revision as of 20:49, 30 April 2020

Slides from Steve Wright's presentation "Experiences with a Quite Big Event-b Model", given at the Rodin workshop, Southampton, July 16th 2009.