Search results

From Event-B
Jump to navigationJump to search
  • ...ow_to_extend_Rodin_Tutorial)|8 Generating proof obligations (Extending the Proof Obligation Generator)}}
    4 KB (487 words) - 14:27, 5 September 2013
  • === Theory and Proof === * [[Isabelle for Rodin]]: Prove proof obligations with Isabelle/HOL. Export proof obligations to Isabelle/HOL theories.
    5 KB (757 words) - 16:19, 13 February 2020
  • ** New proof obligations: '''PRV''', '''BND''', '''FINACT'''. === Proof Obligations ===
    6 KB (749 words) - 17:54, 21 March 2018
  • This plug-in provides an automated proof tactic based on the theorem prover [http://isabelle.in.tum.de/index.html Is It also allows users to export proof obligations to Isabelle theories for later inspection with Isabelle.
    9 KB (1,317 words) - 10:07, 29 April 2013
  • Bug 2999977: Can not save proof after functional image simplification
    651 bytes (84 words) - 18:41, 22 February 2011
  • ...(given properties about the constants) and Theorems (assertions requiring proof) may be attached to the ClassTypes. ClassTypes either define ‘carrier’
    606 bytes (84 words) - 20:27, 10 September 2008
  • ...ive laws result in a more natural and compact model with fewer and simpler proof obligations. ...sequential composition through refinement steps may result in unmanageable proof obligations. It is also more difficult to conduct subsequent refinement of
    5 KB (777 words) - 23:20, 6 December 2010
  • ...within the work package 3: ''Methods and Tools for Model Construction and Proof'', during the second period of the ADVANCE project (Sept 2012 - Sept 2013), ...work package tasks: general platform maintenance, improvement of automated proof, model checking, language extension, model composition and decomposition.
    2 KB (325 words) - 17:32, 29 November 2013
  • ...ule-based prover plug-in offers a uniform mechanism to define and validate proof rules which can then be used in proofs. *Theory construct, where rules are defined and validated by means of proof obligations. Defining a rule includes stating whether it should be applied
    5 KB (796 words) - 11:44, 8 January 2010
  • ...et shows that the addition of new tactics, and enhancement of the existing proof tooling is a continuous duty which has to be carried on until the end of th ...out in WP4. However, they may require some evolution of the modelling and proof tools to be performed within WP3.
    4 KB (677 words) - 16:41, 2 December 2013
  • The aim of this extension is to allow defining proof rules for the Rule Based Prover using meta-variables as predicate placehold For example, one will then be able to write a proof rule involving P and Q directly by using such naming letters.
    3 KB (431 words) - 15:14, 18 February 2010
  • ...formal method and provides natural support for refinement and mathematical proof. To improve your proof experience, please install the third-party provers from Atelier B. This is
    2 KB (322 words) - 16:45, 20 April 2010
  • * [[Proof Purger Design|Proof Purger]] allows to delete unused proofs. * [[Proof Skeleton Design]] is a view that displays skeletons of existing proofs
    8 KB (1,260 words) - 12:45, 30 July 2015
  • ...ent to define rewrite rules to a versatile platform to define and validate proof and language extensions. ...n be defined and validated once, and can then be imported into sequents of proof obligations if a suitable type instantiation is available.
    7 KB (958 words) - 14:53, 14 June 2021
  • ...types. Along with these additional notations, the user can also define new proof rules (prover extensions). ...es and new proof rules. Theories are developed in the Rodin workspace, and proof obligations are generated to validate prover and mathematical extensions. W
    7 KB (1,095 words) - 14:40, 21 December 2010
  • ...within the work package 3: ''Methods and Tools for Model Construction and Proof'', during the first ten months of the ADVANCE project (Oct 2011 - Jul 2011) ...ed into four parts: general platform maintenance, improvement of automated proof, language extension, model checking, and model composition and decompositio
    2 KB (371 words) - 16:27, 13 July 2012
  • ...imes the expression ''x''. If this expression is big, then it can make the proof rule hard to read. ...te of the conjunction is provable. Indeed, if this check was not done, the proof obligation may be unprovable since there are a loss of informations by writ
    5 KB (824 words) - 16:05, 18 March 2014
  • * Proof replay on undischarged POs (since release 1.3) ...e slightly changed and need to be discharged again. However, replaying the proof for these POs could most of the time be enough to discharge it. Hence, a co
    9 KB (1,423 words) - 16:28, 14 November 2011
  • ...from the instantiated machines where it is avoided the re-proof of pattern proof obligations. Afterwards <math>GI_n</math> can be further refined to <math>P
    5 KB (720 words) - 15:20, 4 July 2013
  • The resulting proof step is The resulting proof step is
    8 KB (1,199 words) - 13:37, 7 September 2010
  • |<tt>.bpo</tt> || {{class|IPORoot}} || Event-B Proof Obligations || Event-B Core |<tt>.bps</tt> || {{class|IPSRoot}} || Event-B Proof Statuses || Event-B Core
    3 KB (449 words) - 14:55, 12 March 2019
  • ...et for Event-B that provides effective support for modelling and automated proof. The platform is open source and is further extendable with plug-ins. A ran * How to create and use custom/parameterized proof tactics (Systerel/Jean-Raymond Abrial), 30 mins
    4 KB (530 words) - 15:34, 23 March 2012
  • ...instance that if we change an invariant, that not the whole prooftree of a proof is invalidated, but only a subtree. ...sions.) There are, however, still issues with how to manage the individual proof files in case of changes to the model (renaming of some files, deletion of
    4 KB (670 words) - 14:38, 29 January 2009
  • ...ected to be easier to handle, with less variables and less events and less proof obligations. This partition is done in a way that the sub-models (also refe ...be seen as a refinement step where the original properties and respective proof obligations should remain valid. With shared event and shared variable deco
    5 KB (780 words) - 11:22, 21 December 2010
  • ...volve in time, to fix bugs or modify the behaviour, or to match additional proof rules, even after the old implementation was used to prove models. This lea ...ion will be left unnoticed. Thus, if we clean a project in order to update proof statuses, these proofs will be considered reusable (in the sense of org.eve
    4 KB (642 words) - 10:29, 27 October 2011
  • ...the ADVANCE Deliverable D3.3 (Methods and tools for model construction and proof II) which will be delivered to the European Commission at month 24 (2013-09 #to provide expert formal proof support to the industrial partners;
    6 KB (830 words) - 13:21, 7 October 2013
  • ...tract variables and events retained solely for the needs of the refinement proof and those preserved as an integral part of an overall specification in the ...by auxiliary variables) but rather taken into the account when generating proof obligations.
    7 KB (1,109 words) - 15:33, 31 August 2010
  • ...nc=detail&aid=3370087&group_id=108850&atid=651669 Bug 3370087: Cannot save proof with ae] :fixed proof loading (and replay) problems
    4 KB (515 words) - 08:41, 1 August 2011
  • ...ncludes the achievements of the pattern and is correct without proving any proof obligation. ...he current development again. Reusing proofs, especially manual discharged proof obligations, saves a lot of time for the developer. The drawback reflects i
    6 KB (1,034 words) - 14:43, 27 January 2010
  • ...'' reasoner no longer considers hidden hypotheses. This avoids leading the proof to a dead-end. === Better proof reuse ===
    7 KB (1,079 words) - 13:54, 12 July 2017
  • ...Event-B assignments. Two actions are considered as being equivalent if the proof obligations generated for these actions are logically equivalent. ...o be proved (see the section related to the [[Event_Model_Decomposition#po|proof obligations]] in the event model decomposition).
    10 KB (1,604 words) - 09:19, 27 October 2011
  • ...sh the soundness of provers and improve the generation of well-definedness proof obligations,
    3 KB (415 words) - 17:03, 24 November 2010
  • * There is a bug in showing interface proof obligations - these are not refreshed automtically in the project explorer. * No proof obligations are generated to ensure deadlock freeness of event groups reali
    4 KB (601 words) - 23:58, 13 October 2009
  • ...tronger types of connectives. Let us see what it means to provide a formal proof for the various cases of sequential event composition. ...g "immediately after" <math>m</math> times there would be <math>m*n</math> proof obligations. Even if only a small fraction of these result in interactive p
    11 KB (1,869 words) - 23:48, 21 January 2011
  • ...provided architecture for static checking is really similar to the one for proof obligation generation. Thus, it can be useful for the reader to understand ...oof obligation, which is described in the paper. This PO overrides the FIN proof obligation. Thus we will see here, how to :
    13 KB (1,755 words) - 07:19, 7 September 2010
  • effective support for modelling and automated proof. The platform is open * Proof automation for Event-B theories — ''P. Rivière, N. K. Singh, Y. Aït-Ame
    3 KB (375 words) - 15:36, 26 May 2023
  • ...valid reasoner (old version or not installed) is properly displayed in the Proof Skeleton View. ...been used; running 'Proof Replay on Undischarged POs' will replay the old proof with the current version of the reasoner.
    6 KB (909 words) - 13:48, 17 December 2014
  • *A comprehensive specification of the logic (abstract syntax, semantics, proof calculus, core theories) is available as [ftp://ftp.inf.ethz.ch/pub/publica
    1 KB (203 words) - 11:28, 23 January 2014
  • ..._Proof_Obligation_Generator(How_to_extend_Rodin_Tutorial) | Generating the proof obligations]] | Up= [[Plug-in_Tutorial|How to extend Rodin Tutorial (Index) ...I that paint their applications in red on formulas) in case of interactive proof.<br>
    13 KB (2,012 words) - 15:43, 21 September 2021
  • ...e the diversity of predicates and increase the automated proofs of trivial proof obligations often encountered in degenerated cases (that is not interesting The proportion of automatically discharged proof obligations heavily depends on the auto-tactic configuration. Sometimes, th
    7 KB (1,145 words) - 10:05, 8 October 2013
  • ...uent prover is a plug-in for the Eclipse platform which provides different proof rules to be used within the Rodin Tool. The following sections discuss the == Proof Rules ==
    17 KB (2,378 words) - 09:48, 17 June 2010
  • 805 IAE when loading proof 807 Proof information view text cut off
    5 KB (775 words) - 12:00, 4 April 2023
  • ...domains and observed that his tactic significantly increases the number of proof obligations proved automatically. ...nstruction, and a methodology for reasoning about the soundness of Event-B proof rules within Event-B. The document also allows users to look-up definitions
    11 KB (1,699 words) - 15:25, 27 January 2011
  • ...to deal with a growing number of events, state variables, and consequently proof obligations. ...management. In other words, it alleviates the complexity by splitting the proof obligations over the sub-models.
    6 KB (825 words) - 13:27, 27 January 2010
  • ** A proof obligation is generated for the well-definedness condition of recursive ope ** Theorems instantiated during proof are now correctly typed (in some cases, some type information was missing)
    8 KB (1,015 words) - 13:50, 1 April 2022
  • ...renaming an element doesn't modify their existing proof state (no loss of proof). Since there are proof obligations associated with Event-B files, while renaming the goal would be
    11 KB (1,773 words) - 07:41, 12 January 2016
  • When proof obligations (POs) are not discharged automatically the user can attempt to ...es, the Proof Control, the Search Hypotheses, the Cache Hypotheses and the Proof Information. In the discussion that follows we look at each of these views
    27 KB (4,348 words) - 08:56, 26 September 2011
  • When proof obligations (POs) are not discharged automatically the user can attempt to ...es, the Proof Control, the Search Hypotheses, the Cache Hypotheses and the Proof Information. In the discussion that follows we look at each of these views
    27 KB (4,348 words) - 18:45, 28 September 2011
  • ...[Extending_the_Static_Checker(How_to_extend_Rodin_Tutorial)|Generating the proof obligations]]}} ...provided architecture for static checking is really similar to the one for proof obligation generation. Thus, it can be useful for the reader to understand
    13 KB (1,774 words) - 13:57, 5 September 2013
  • ...ns the abstract Event-B development, however the implementation refinement proof is ongoing. The slides outline the use of Rodin in the proof of Well-ordering theorem. The archive contains the
    9 KB (1,283 words) - 13:58, 5 July 2017

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