User Manual of the RODIN Platform

More documents

Recommendations

Info

In order to define the variant, use the variant wizard as shown below: After pressing that button, the following wizard will pop up You can enter the variant and then press ”OK”. The variant is either a natural number expression or a finite set expression. 4 Saving a Context or a Machine Once a machine or context is (possibly partly only) edited, you can save it by using the following button: 4.1 Automatic Tool Invocations Once a ”Save” is done, three tools are called automatically, these are: • the Static Checker, • the Proof Obligation Generator, • the Auto-Prover. This can take a certain time. A ”Progress” window can be opened at the bottom right of the screen to see which tools are working (most of the time, it is the auto-prover). 28
4.2 Errors. The Problems Window When the Static Checker discovers an error in a project, a little ”x” is added to this project and to the faulty component in the ”Project Explorer” window as shown in the following screen shot: The error itself is shown by opening the ”Problems” window. By double-clicking on the error statement, you are transferred automatically into the place where the error has been detected so that you can correct it easily as shown below: 29
Page 1 and 2: User Manual of the RODIN Platform O
Page 3 and 4: 3 Anatomy of a Machine 17 3.1 Depen
Page 5 and 6: Foreword The reader of this Manual
Page 7 and 8: In the remaining parts of this sect
Page 9 and 10: 1.6 Importing a Project A ”.zip
Page 11 and 12: ”AXIOMS”), or theorems (keyword
Page 13 and 14: As can be seen, we have created thr
Page 15 and 16: You can then enter the names of the
Page 17 and 18: Note that the ”Up” and ”Down
Page 19 and 20: 2.6 Adding Comments It is possible
Page 21 and 22: 3 Anatomy of a Machine Once a machi
Page 23 and 24: 3.3 Invariants 3.3.1 Invariants Cre
Page 25 and 26: You can then enter the theorems you
Page 27 and 28: Once an event is selected you can a
Page 29 and 30: 3.8 Dependencies: Refining a Machin
Page 31: The parameter x, being common to bo
Page 35 and 36: 5 The Proof Obligation Explorer The
Page 37 and 38: Next are the proof obligations conc
Page 39 and 40: Each line in the proof tree corresp
Page 41 and 42: 6.3 Goal and Selected Hypotheses Th
Page 43 and 44: The Proof Control window offers a n
Page 45 and 46: 6.8 The Automatic Post-tactic In th
Page 47 and 48: Equality E = E == ⊤ E ≠ E ==
Page 49 and 50: Finiteness finite (∅) == ⊤ fini
Page 51 and 52: 6.8.2 Automatic inference rules The
Page 53 and 54: Negation H, E ∈ {a, . . . , c}
Page 55 and 56: it has been decided to put the ”b
Page 57 and 58: E ∈ S ∪ T == E ∈ S ∨ E ∈
Page 59 and 60: (p ∪ q)[S] == p[S] ∪ q[S] dom(p
Page 61 and 62: H, G ∈ dom(g) ⊢ Q(g(G)) H, ¬ G
Page 63 and 64: For applying the previous rule, the
Page 65 and 66: B.1 Atomic Symbols ASCII Symbol ASC
Page 67: B.5 Quantifiers ASCII Symbol ASCII

User Manual of the RODIN Platform

Create successful ePaper yourself

Delete template?

Save as template?