Search results

From Event-B
Jump to navigationJump to search

Page title matches

  • The proof key is the following theorem: The proof of the previous theorem is given by instantiating the key theorem with : <m
    711 bytes (121 words) - 14:11, 30 October 2008
  • 1. '''Description''': A brief description of the proof hints with the situation where this can be helpful. ...to select these hypotheses automatically when generating the corresponding proof obligation.
    4 KB (545 words) - 22:17, 5 March 2010
  • ...le for constructing proofs and maintaining existing proofs associated with proof obligations. Proof obligations are generated by the proof obligation generator and have the form of ''[http://handbook.cobra.cs.uni-d
    9 KB (1,478 words) - 10:33, 27 October 2011
  • #REDIRECT [[Proof Purger Design]]
    33 bytes (4 words) - 15:59, 6 January 2009
  • ...development aims at getting rid of this kind of needless data contained in proof files. ...t the structure of proof trees, one can have a look at the [[Proof_Manager|Proof Manager]] page.
    3 KB (496 words) - 12:58, 12 August 2009
  • #REDIRECT [[Proof Skeleton Design]]
    35 bytes (4 words) - 16:56, 6 January 2009
  • ''Proof trees'' are recursive structure based on ''Proof Tree Nodes''. Each node has three components: 2. '''rule''' A proof rule (possibly ''null'')
    2 KB (365 words) - 12:52, 12 August 2009
  • *IPSRoot: This root contains the statuses (IPSStatus) of the proof obligations. It is contained in a file with the extension .bps. *IPORoot: This root contains the sequents (IPOSequent) of the proof obligations. It is contained in a file with the extension .bpo.
    3 KB (443 words) - 12:53, 12 August 2009
  • 2 KB (307 words) - 15:38, 29 November 2019
  • [[Category:Proof]]
    4 KB (738 words) - 12:53, 12 August 2009
  • ...) to handle cases where their behaviour shall depend on the context of the proof obligation. Usually, as was the case until the Rule-Based Prover appeared, * rule-based prover needs to know whether the rules in a proof are still valid (reusable)
    4 KB (600 words) - 14:09, 15 December 2010
  • In this page are presented various proof obligations commands that can be run from the Event-B Explorer as follows: ...rer. The selection can be a whole project, a model (context/machine), the 'Proof Obligations' node (equivalent to selecting the corresponding model), an ele
    3 KB (457 words) - 10:43, 18 March 2010
  • ...sed proofs by selecting projects and/or files to purge. In addition, empty proof files are also proposed for purging. Integration of the proof purger as a popup menu is achieved in the manifest through the ''org.eclips
    3 KB (505 words) - 12:54, 12 August 2009
  • Proofs are stored in proof files. Each time a new proof obligation is generated by the tool, a corresponding (initially empty) proof is created. However,
    2 KB (400 words) - 10:20, 27 October 2011
  • This document aims at helping developers getting into the code of the proof skeleton viewer. ...eleton View gives the user the ability to quickly browse the skeleton of a proof, without having to prove it anew. Furthermore, it is intended to be a conve
    2 KB (254 words) - 12:54, 12 August 2009
  • ...can be used on any proof, independently of the presence of a corresponding proof obligation. Furthermore, this view allows user to see together proof rules and corresponding sequents.
    2 KB (299 words) - 12:50, 27 September 2011
  • This page contains descriptions of the available proof tactics within the RODIN Platform. ...ails explanation of the tactic, when it is applicable, give the associated proof rule. See [[Inference Rules|Inference rules]] list and [[All Rewrite Rules
    57 KB (6,150 words) - 17:25, 21 February 2012
  • ...le for constructing proofs and maintaining existing proofs associated with proof obligations. There are two ways for extending the Proof Manager:
    3 KB (400 words) - 10:27, 27 October 2011
  • ..., proof status is determined from proof dependencies on the one hand and a proof skeleton on the other hand. The skeleton is entirely visited, searching for ...e proofs to allow for quick access. This improves performances in updating proof statuses, which is by far the most time-consuming build operation.
    1 KB (175 words) - 14:49, 6 June 2011
  • ...h could be customized and parameterized tactics to discharge some specific proof obligations. The user can furthermore share and backup these defined tactic ...time frame of ADVANCE, and increases the rate of automatically discharged proof obligations.
    4 KB (596 words) - 13:21, 18 July 2012
  • ...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
  • ...e Environment) display some information which is associated to the current proof tree node, if any. However, in Rodin 2.3 these view do not always display t ...w does not refresh. One has to click on the current proof tree node in the Proof Tree view to force a refresh.
    4 KB (683 words) - 18:33, 16 December 2011
  • Next is a table describing the names of context proof obligations: Next is a table showing the name of machine proof obligations:
    4 KB (575 words) - 15:09, 15 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
  • ...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

Page text matches

  • ...can be used on any proof, independently of the presence of a corresponding proof obligation. Furthermore, this view allows user to see together proof rules and corresponding sequents.
    2 KB (299 words) - 12:50, 27 September 2011
  • ''Proof trees'' are recursive structure based on ''Proof Tree Nodes''. Each node has three components: 2. '''rule''' A proof rule (possibly ''null'')
    2 KB (365 words) - 12:52, 12 August 2009
  • ..., proof status is determined from proof dependencies on the one hand and a proof skeleton on the other hand. The skeleton is entirely visited, searching for ...e proofs to allow for quick access. This improves performances in updating proof statuses, which is by far the most time-consuming build operation.
    1 KB (175 words) - 14:49, 6 June 2011
  • This document aims at helping developers getting into the code of the proof skeleton viewer. ...eleton View gives the user the ability to quickly browse the skeleton of a proof, without having to prove it anew. Furthermore, it is intended to be a conve
    2 KB (254 words) - 12:54, 12 August 2009
  • ==[[Extension Proof Rules]]== {{:Extension Proof Rules}}
    739 bytes (98 words) - 13:29, 26 April 2013
  • ...ation to begin to understand the structural relationships within the RODIN proof tool. The diagrams were produced as an aid to visualising these relationshi Image:ProofStatus.png|Proof Status Diagram
    726 bytes (102 words) - 12:02, 12 August 2009
  • Proofs are stored in proof files. Each time a new proof obligation is generated by the tool, a corresponding (initially empty) proof is created. However,
    2 KB (400 words) - 10:20, 27 October 2011
  • On the one hand, the proof calculus devised in Chapter 9 allows one to prove <math>1\div 0 = 1\div0</m === Proof Calculus ===
    1 KB (188 words) - 11:10, 25 January 2012
  • #REDIRECT [[Extension Proof Rules]]
    35 bytes (4 words) - 10:23, 9 September 2010
  • #REDIRECT [[Proof Purger Design]]
    33 bytes (4 words) - 15:59, 6 January 2009
  • #REDIRECT [[Proof Skeleton Design]]
    35 bytes (4 words) - 16:56, 6 January 2009
  • #REDIRECT [[Proof Purger Interface]]
    36 bytes (4 words) - 16:04, 6 January 2009
  • == Merging of proof files == ...eat if two people work independtly on different proofs that the discharged proof obligations could be merged. A first version of
    1,010 bytes (157 words) - 10:00, 22 October 2009
  • ...e Environment) display some information which is associated to the current proof tree node, if any. However, in Rodin 2.3 these view do not always display t ...w does not refresh. One has to click on the current proof tree node in the Proof Tree view to force a refresh.
    4 KB (683 words) - 18:33, 16 December 2011
  • ...development aims at getting rid of this kind of needless data contained in proof files. ...t the structure of proof trees, one can have a look at the [[Proof_Manager|Proof Manager]] page.
    3 KB (496 words) - 12:58, 12 August 2009
  • *IPSRoot: This root contains the statuses (IPSStatus) of the proof obligations. It is contained in a file with the extension .bps. *IPORoot: This root contains the sequents (IPOSequent) of the proof obligations. It is contained in a file with the extension .bpo.
    3 KB (443 words) - 12:53, 12 August 2009
  • The proof key is the following theorem: The proof of the previous theorem is given by instantiating the key theorem with : <m
    711 bytes (121 words) - 14:11, 30 October 2008
  • Next is a table describing the names of context proof obligations: Next is a table showing the name of machine proof obligations:
    4 KB (575 words) - 15:09, 15 September 2011
  • 1. '''Description''': A brief description of the proof hints with the situation where this can be helpful. ...to select these hypotheses automatically when generating the corresponding proof obligation.
    4 KB (545 words) - 22:17, 5 March 2010
  • ...) to handle cases where their behaviour shall depend on the context of the proof obligation. Usually, as was the case until the Rule-Based Prover appeared, * rule-based prover needs to know whether the rules in a proof are still valid (reusable)
    4 KB (600 words) - 14:09, 15 December 2010
  • ...le for constructing proofs and maintaining existing proofs associated with proof obligations. There are two ways for extending the Proof Manager:
    3 KB (400 words) - 10:27, 27 October 2011
  • == Proof structure == With respect to the merging objective, a proof is made of:
    6 KB (1,046 words) - 10:34, 27 October 2011
  • ...xtending the instantiation to a chain of refinements. We define sufficient proof obligations to ensure that the proofs associated to a generic development r ...n the instantiation. In that sense our approach avoids re-proof of pattern proof obligations in the instantiation. The reusability of a development is expre
    2 KB (232 words) - 15:23, 4 July 2013
  • ...sed proofs by selecting projects and/or files to purge. In addition, empty proof files are also proposed for purging. Integration of the proof purger as a popup menu is achieved in the manifest through the ''org.eclips
    3 KB (505 words) - 12:54, 12 August 2009
  • ...le for constructing proofs and maintaining existing proofs associated with proof obligations. Proof obligations are generated by the proof obligation generator and have the form of ''[http://handbook.cobra.cs.uni-d
    9 KB (1,478 words) - 10:33, 27 October 2011
  • In this page are presented various proof obligations commands that can be run from the Event-B Explorer as follows: ...rer. The selection can be a whole project, a model (context/machine), the 'Proof Obligations' node (equivalent to selecting the corresponding model), an ele
    3 KB (457 words) - 10:43, 18 March 2010
  • ...). This renaming is not fully-functional at the moment and some discharged proof obligations may have to be discharged again. We intend to fix this problem ** Renaming of proofs would not save the proof files after renaming
    2 KB (357 words) - 12:18, 8 June 2010
  • Performance is measured by running the SMT solvers on a set of proof obligations coming from some Event-B projects. Each solver is run in the ex :contains proof obligations to test, organized in Event-B projects
    4 KB (652 words) - 08:48, 6 June 2014
  • ...html One point rule], arithmetic rules), have been added to discharge more proof obligations more easily. * Reducing proof storage space.
    5 KB (789 words) - 11:41, 27 January 2010
  • Real goal is to obtain a proof, not a model. The model is only our mean of choice to obtain a proof.
    1 KB (153 words) - 13:44, 28 October 2008
  • or proofs for a given proof obligation. ...ult. In this cases, the absence of a counter-example will be reported as a proof.
    1 KB (155 words) - 13:34, 2 May 2016
  • in the Proof Obligation Generator (POG) of Rodin 2.3 where one could have an event-B project containing two machines where all proof obligations are
    8 KB (1,284 words) - 18:33, 30 January 2012
  • ==How to read Proof Obligations== For information on reading proof obligations, have a look at [[Accessing Proof Obligations]].
    3 KB (314 words) - 14:12, 30 May 2009
  • * Proof automation * Proof reuse
    1 KB (150 words) - 13:31, 3 November 2009
  • ...with these additional notations, the user can also define new proof rules (proof extensions). ..., validating and using extensions while exploiting the benefits brought by proof obligations.
    4 KB (642 words) - 08:33, 29 June 2012
  • ...This entails potential problems: what happens if we try to reuse/replay a proof rule serialized by the old reasoner implementation ? There might be unexpec ...en trying to reuse them. Rather than adding yet another xml attribute into proof files, it has been decided to concatenate the version to the reasoner name,
    2 KB (308 words) - 17:01, 20 November 2009
  • ...as writing and maintaining deadlock-freedom and relative deadlock freedom proof obligations. Its core functionality is concerned with the verification of t ...rs and thus there will be always some delays between saving a diagram and proof status update.
    4 KB (630 words) - 22:31, 22 January 2011
  • As concerns generated files (e.g., statically checked files and proof obligation files), they contain formulas in the same language as the compon Proof status files do not contain any formula and are therefore independent on th
    4 KB (692 words) - 15:06, 20 November 2013
  • This has led to globally improve the rate of automatically discharged proof obligations (PO), thus reducing the remaining POs to prove manually. ...provers have individually improved their rate of automatically discharged proof obligations.
    2 KB (281 words) - 15:57, 11 September 2017
  • ...with these additional notations, the user can also define new proof rules (proof extensions). ..., validating and using extensions while exploiting the benefits brought by proof obligations.
    4 KB (648 words) - 14:52, 7 October 2013
  • ...the critical shortcomings of the previous version: generation of unwieldy proof obligations (a large disjunction in a goal comprising several hundreds of t ...isprover for these kind of proofs) and it was decided that the approach to proof generation requires a complete redesign.
    4 KB (699 words) - 17:36, 3 December 2010
  • ...of the Flows plug-in. The primary reason to offer such a weak guarantee is proof effort required for stronger types of connectives. ...and the proof obligations related to flow appear in the list of the model proof obligations.
    4 KB (609 words) - 11:37, 8 January 2010
  • ...h could be customized and parameterized tactics to discharge some specific proof obligations. The user can furthermore share and backup these defined tactic ...time frame of ADVANCE, and increases the rate of automatically discharged proof obligations.
    4 KB (596 words) - 13:21, 18 July 2012
  • * [[Accessing Proof Obligations]] * [[Extending the Proof Manager]]
    2 KB (179 words) - 09:17, 20 November 2013
  • ...''Obligation Explorer'' displays the proof obligations together with their proof state. ...original views into a single one that would display modelling elements and proof obligations together. This new single view should also take advantage of th
    5 KB (842 words) - 18:35, 26 March 2010
  • ...resent systems at different abstraction levels and the use of mathematical proof to verify consistency between refinement levels.
    306 bytes (47 words) - 09:57, 4 March 2009
  • ...s an open and extensible toolset for Event-B specification, refinement and proof. The flash file system is a complex system that is challenging to specify a === Modelling and proof of a Tree-structured File System===
    4 KB (656 words) - 13:06, 18 November 2010
  • ...[Event-B]] that provides effective support for refinement and mathematical proof. The platform is open source, contributes to the Eclipse framework and is f
    491 bytes (67 words) - 14:18, 19 September 2011
  • ...owing them to provide as many tactic applications as they will for a given proof node, even they apply to the same predicate and at the same position. ====Fixing Proof Obligations====
    6 KB (915 words) - 16:57, 27 February 2014
  • [[Rodin Proof Tactics]]
    310 bytes (38 words) - 10:51, 27 October 2011

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