Search results

Create the page "' + t + '" on this wiki! See also the search results found.

• Proof Obligation Names (Rodin User Manual)
  |Well-definedness of an event Guard||<math>t</math> / <math>d</math> / WD |<math>t</math> is the event name
  4 KB (575 words) - 15:09, 15 September 2011
• Datatype Rules
  list(T) ::= | cons( head : T, tail : list(T) )
  8 KB (1,199 words) - 13:37, 7 September 2010
• AnimB roadmap
  |Today the predicate evaluator doesn't use type information to infer a set that allow iteration of variable. |Today, the predicate evaluator doesn't allow the variable quantification with function sets (injection, bijection,
  1 KB (160 words) - 20:27, 10 March 2009
• Relation Rewrite Rules
  ...DOMRES_ID}}||<math> S \domres (T \domres \id) \;\;\defi\;\; (S \binter T) \domres \id </math>|| || A ...MSUB_ID}}||<math> S \domres (T \domsub \id) \;\;\defi\;\; (S \setminus T) \domres \id </math>|| || A
  33 KB (4,853 words) - 16:17, 8 March 2024
• Template:Warning
  <nowiki>{{warning}}</nowiki> Don't do that! {{warning}} Don't do that!
  1 KB (187 words) - 09:13, 9 December 2010
• Set Rewrite Rules
  ...||<math> S \binter \ldots \binter \emptyset \binter \ldots \binter T \;\;\defi\;\; \emptyset </math>|| || A ...Ty} \binter \ldots \binter T \;\;\defi\;\; S \binter \ldots \binter T </math>|| where <math>\mathit{Ty}</math> is a type expression || A
  29 KB (4,188 words) - 14:33, 13 April 2023
• Help:Starting a new page
  ...|Links]]). If you (or anyone else) creates a link to an article that doesn't exist yet, the link will be coloured red, <span style="color: #ba0000">like ...b8;">blue</span> (<span style="color: #5a3696;">purple</span> for pages you've visited) indicating that the article now exists.
  3 KB (522 words) - 22:57, 4 July 2008
• EMF Compare Editor Investigation
  Colin's Notes ...s to get the EMF compare one (good!) but the EMF compare editor still didn't open.
  4 KB (623 words) - 19:48, 24 September 2009
• Arithmetic Rewrite Rules
  ...\bunion \ldots \bunion U) \\ \defi & \min (S \bunion \ldots \bunion T \bunion \ldots \bunion U) \\ \end{array} </math>|| || A ...\bunion \ldots \bunion U) \\ \defi & \max (S \bunion \ldots \bunion T \bunion \ldots \bunion U) \\ \end{array} </math>|| || A
  14 KB (2,054 words) - 16:50, 19 February 2024
• Rewriting rules for event model decomposition
  ...ed with the <math>\rightsquigarrow</math> symbol. <math>s</math> and <math>t</math> are assumed to be variables shared between <math>M_i</math> and <mat <br>Let's first establish a transformation rule for generic Event-B assignments. It
  10 KB (1,604 words) - 09:19, 27 October 2011
• Inference Rules
  ...{Q} \land \ldots \land \textbf{R} \limp \textbf{S} \;\;\vdash \;\; \textbf{T} }</math> || || A {{RRRow}}| ||{{Rulename|SUBSET_INTER}}|| <math>\frac{\textbf{H},\;\textbf{T} \subseteq \textbf{U} \;\;\vdash \;\;
  36 KB (5,611 words) - 10:22, 1 February 2024
• Exporting and importing archives containing theories
  ...the problem, let's say we have developed an Event-B project P and a theory T and want to make an archive in order to share them. The workspace looks lik - T.tuf
  3 KB (539 words) - 14:57, 14 June 2021
• Improved WD Lemma Generation
  <math>f\in S\pfun T\land x\in\dom(f)\land f\in S\pfun T\land y\in\dom(f)</math> ...sub-optimal as it contains twice the same sub-predicate (<math>f\in S\pfun T</math>). Consequently, when the prover is fed with the generated lemma, it
  4 KB (617 words) - 09:43, 19 June 2012
• Help:Namespaces
  ...se are typically the bulk of the content pages in a wiki. Pages which aren't directly related to this core content, may go in other namespaces. These pa ;Image: For descriptions of uploaded files or media files. You shouldn't create these directly; they are created when you click the [[special:upload
  2 KB (347 words) - 08:55, 5 July 2008
• Talk:The Celebrity Problem (Rodin Tutorial)
  Where ? Can't see any warning (using Celebrity-2007-10-26.zip)... ...ter to post a message on one the devel [[Mailing lists|mailling list]] as I'm not sure there is a lot of people following those pages. [[User:Mathieu|ma
  553 bytes (95 words) - 19:20, 24 June 2009
• EMF Compare Editor installation
  ...l the EMF Compare feature (it should have installed automatically but didn't for me - maybe I forgot to add a dependency) ...l the EMF Compare feature (it should have installed automatically but didn't for me - maybe I forgot to add a dependency)
  3 KB (469 words) - 14:17, 21 October 2009
• Template:Hidden
  ==== You can't get here from the table of contents ====
  3 KB (462 words) - 12:51, 3 October 2008
• UML-B notes for 0.4.4
  ...licking on the transition name inside the statemachine figure. (This dosen't work for nested statemachines because they do not appear on the class diagr
  778 bytes (122 words) - 12:15, 4 March 2009
• Empty Set Rewrite Rules
  ...L_EMPTY}}||<math> S \cprod T = \emptyset \;\;\defi\;\; S = \emptyset \lor T = \emptyset </math>|| || A ...PE}}||<math> S \cprod T = \mathit{Ty} \;\;\defi\;\; S = \mathit{Ta} \land T = \mathit{Tb} </math>|| where <math>\mathit{Ty}</math> is a type expression
  10 KB (1,400 words) - 16:39, 12 May 2014
• New Proof Rules
  ==Automatically Apply De Morgan's Laws== The work is related to the following rewriting rules (De Morgan's Laws):
  4 KB (738 words) - 12:53, 12 August 2009

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)