This work is sponsored by the
Deploy Project
This work is sponsored by the
ADVANCE Project
This work is licensed under a Creative Commons Attribution 3.0 Unported License
Index
Rodin User’s Handbook v.2.8
| |
|
|
|
Rodin User’s Handbook v.2.8 |
|
|
|
Index
Symbols
-
(conjunction),
1
-
(disjunction),
1
-
(negation),
1
-
(implication),
1
|
-
(equivalence),
1
-
(true),
1
-
(false),
1
|
A
-
abstract machine,
1
-
abstract machine notation,
1
-
action,
1
-
addition (),
1
-
anticipated,
1
-
arithmetic,
1
-
assignment,
1, 2
-
become element of (),
1
-
become such (),
1
-
deterministic (),
1
-
non-deterministic,
1
|
-
Atelier B provers,
1
-
auto prover,
1
-
auto-tactic,
1, 2
-
axiom,
1, 2
-
using a wizard to create an axiom,
1
|
B
-
become element of assignment (),
1
-
become such assignment (),
1
-
before-after predicate,
1, 2
-
bijection (),
1
-
boolean,
1
-
as type,
1
-
the operator ,
1
|
|
C
-
cardinality (),
1
-
carrier set,
1, 2, 3
-
using a wizard to create a carrier set,
1
-
Cartesian product (),
1
-
combinator,
1
-
comment,
1
-
component,
1
-
composition,
-
backward composition of relations (),
1
-
forward composition of relations (),
1
|
-
conjunction (),
1
-
consistency of a machine,
1
-
constant,
1, 2
-
using a wizard to create a constant,
1
-
context,
1, 2, 3
-
creation of,
1
-
dependencies,
1
-
synthesis,
1
-
convergent,
1
|
D
-
data type,
1, 2
-
Boolean,
1
-
carrier set,
1
-
integer,
1
-
user defined,
1
-
deadlock,
1
-
derived,
1
|
-
discharged,
1
-
disjunction (),
1
-
division (),
1
-
domain (),
1
-
domain restriction (),
1
-
domain subtraction (),
1
|
E
-
Eclipse,
1, 2
-
editor,
-
Camille text editor,
1
-
default editor,
1
-
structural editor,
1
-
EQL (equality of preserved variable proof obligation),
1
-
equality (),
1
-
equivalence (),
1
-
establishment of the invariant,
1
-
event,
1, 2, 3
-
merging events,
1
-
using a wizard to create an event,
1
|
-
Event-B,
1, 2
-
explorer,
1
-
perspective,
1
-
exists (),
1
-
exponentation (),
1
-
extending,
-
extends,
1
|
F
-
false,
-
as expression (),
1
-
as predicate (),
1
-
fast view bar,
1
-
feasibility,
-
of actions,
1
-
of witnesses,
1
|
-
FIN (finiteness proof obligation),
1
-
FIS (feasibility proof obligation),
1
-
Font,
1
-
for all (),
1
-
free identifiers,
1
-
function (, ),
1
-
function application,
1
|
G
-
gluing invariant,
1, 2
-
goal,
1
-
GRD (guard-strengthening proof obligation),
1
|
|
I
-
identifier,
1
-
identity relation (),
1
-
implication (),
1
-
import project,
1
-
proof by induction,
1
-
initialisation,
1, 2
-
injection (,),
1
-
integer,
1
-
as set (),
1
-
as type,
1
|
-
intersection,
-
generalized intersection (),
1
-
intersection (),
1
-
quantified intersection (),
1
-
INV (invariant proof obligation),
1
-
invariant,
1, 2, 3
-
using a wizard to add an invariant,
1
-
inverse (),
1
|
L
-
-operator,
1
-
lamba expression (),
1
|
|
M
-
machine,
1, 2
-
dependencies,
1
-
synthesis,
1
-
mailing list,
1
-
maplet (),
1
-
mathematical notation,
1
-
mathematical symbols,
1
-
maximum (),
1
|
-
membership (),
1
-
merging events,
1
-
minimum (),
1
-
minus (),
1
-
modelling,
1
-
modulo (),
1
-
MRG (guard-strengthening (merge) proof obligation),
1
-
multiplication (),
1
|
N
-
NAT (natural number proof obligation),
1
-
natural numbers (),
1
-
negation (),
1
|
-
notation,
-
Event-B,
1
-
mathematical,
1
|
O
-
oftype operator (),
1
|
|
P
-
pair,
1, 2
-
parameter,
1, 2
-
partition,
1
-
pending,
1
-
perspective,
-
customisation,
1
-
Event-B,
1
-
proving,
1
-
plus (),
1
-
post-tactic,
1
-
post-tactics,
1
-
predicate,
1
-
predicate logic,
1
-
preferences,
1
-
prefix,
1
-
profile,
1
-
tactics,
1, 2
-
pretty print,
1
-
ProB,
1, 2
-
product,
-
direct product of relations (),
1
-
of integers (),
1
-
parallel product of relations (),
1
-
project,
1, 2, 3
-
projection (,),
1
-
proof control view,
1
-
proof obligation,
1
-
action feasibility (FIS),
1
-
action simulation (SIM),
1
-
axiom as theorem (THM),
1
-
equality of a preserved variable (EQL),
1
-
generation,
1
-
guard as theorem (THM),
1
-
guard strengthening (GRD),
1
-
invariant as theorem (THM),
1
-
invariant preservation (INV),
1
-
merging events (MRG),
1
-
well-definedness of a guard (WD),
1
-
well-definedness of a variant (VWD),
1
-
well-definedness of a witness (WWD),
1
-
well-definedness in an action (WD),
1
-
well-definedness of an axiom (WD),
1
-
well-def. of an invariant (WD),
1
-
witness feasibility (WFIS),
1
|
-
ProR Requirements Tool,
1
-
proving,
1, 2, 3
-
perspective,
1
-
proof obligation,
1
-
proof rule,
1
-
proof tactics,
1
-
provers,
1
-
pruning,
1
-
purging,
1
-
simplifying,
1
-
the proof tree,
1
-
purging proofs,
1
|
Q
-
quantification,
-
existential (),
1
-
universal (),
1
| |
R
-
range (),
1
-
range restriction (),
1
-
range subtraction (),
1
-
reasoner,
1
-
refinement,
1, 2
-
data refinement,
1
-
horizontal,
1
-
superposition,
1, 2
-
vertical,
1
-
refines,
1
-
relation,
1
-
backward composition (),
1
-
direct product (),
1
-
forward composition (),
1
-
identity (),
1
-
image,
1
-
inverse (),
1
-
parallel product (),
1
|
-
relation (,,,),
1
-
relational image,
1
-
reminder,
see modulo
-
requirements,
1
-
reviewed,
1
-
Rodin,
1, 2
-
Rodin problems view,
1
|
S
-
sees,
1
-
selected hypotheses,
1
-
sequent,
1
-
set,
1
-
as type,
1
-
cardinality (),
1
-
comprehension set,
1
-
difference set (),
1
-
empty set (),
1
-
finite,
1
-
operations,
1
-
partition,
1
-
power set (),
1
-
set extension,
1
-
set subtraction (),
1
|
-
SIM (simulation proof obligation),
1
-
simplifying proofs,
1
-
skip,
1
-
specification,
1
-
status of an event,
1
-
strengthening of a guard,
1
-
subset (),
1
-
subtraction,
-
of integers (),
1
-
of sets (),
1
-
superposition refinement,
1
-
surjection (,),
1
-
symbols,
1
-
Symbols view,
1
|
T
-
tactic combinator,
1
-
tactics,
1
-
auto-tactic,
1, 2
-
post-tactic,
1, 2
-
theorem,
1, 2
-
THM (theorem proof obligation),
1
|
-
traceabililty,
1
-
true,
-
as expression (),
1
-
as predicate (),
1
-
type,
see data type
-
type expression,
1
|
U
-
union,
-
generalized union,
1
-
quantified union (),
1
-
union (),
1
| |
V
-
VAR (decreasing of variant proof obligation),
1
-
variable,
1, 2
-
common variable,
1
-
creating a variable,
1
-
variant,
1
-
view,
-
Proof Control,
1
-
Rodin Problems view,
1
-
Search Hypotheses,
1
-
Symbols View,
1
|
-
VWD (well-definedness of variant proof obligation),
1
|
W
-
warnings,
1
-
WD (well-definedness proof obligation),
1
-
well-definedness,
1
-
WFIS (witness feasibility proof obligation),
1
-
when,
1
-
where,
1
-
witness,
1, 2, 3, 4
-
wizard,
-
New Axioms Wizard,
1
-
New Carrier Sets Wizard,
1
-
New Constants Wizard,
1
-
New Enumerated Set Wizard,
1, 2
-
New Event Wizard,
1
-
New Invariants Wizard,
1
-
New Variable Wizard,
1
|
-
WWD (well-definedness of witness proof obligation),
1
|
|