normalize-languages 0.3.2

Tree-sitter language support and dynamic grammar loading
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60

---- MODULE Sample ----
EXTENDS Naturals, Sequences, TLC

CONSTANTS MaxCount, InitValue

VARIABLES counter, stack, active

(* Type invariant *)
TypeInvariant ==
    /\ counter \in Nat
    /\ stack \in Seq(Nat)
    /\ active \in BOOLEAN

(* Initial state *)
Init ==
    /\ counter = InitValue
    /\ stack = << >>
    /\ active = TRUE

(* Increment the counter *)
Increment ==
    /\ active = TRUE
    /\ counter < MaxCount
    /\ counter' = counter + 1
    /\ UNCHANGED << stack, active >>

(* Push a value onto the stack *)
Push(val) ==
    /\ active = TRUE
    /\ stack' = Append(stack, val)
    /\ UNCHANGED << counter, active >>

(* Pop the top value from the stack *)
Pop ==
    /\ Len(stack) > 0
    /\ stack' = SubSeq(stack, 1, Len(stack) - 1)
    /\ UNCHANGED << counter, active >>

(* Deactivate the system *)
Deactivate ==
    /\ active = TRUE
    /\ active' = FALSE
    /\ UNCHANGED << counter, stack >>

(* Next state relation *)
Next ==
    \/ Increment
    \/ Push(counter)
    \/ Pop
    \/ Deactivate

(* Safety: counter never exceeds MaxCount *)
Safety == counter <= MaxCount

(* Liveness: system eventually becomes inactive *)
Liveness == <>(active = FALSE)

Spec == Init /\ [][Next]_<<counter, stack, active>>

====