Repository navigation
tpp 0.2.0
-dump dot FILEwrites the state graph toFILE.dotas TLC does;
-dump dot,actionlabels FILElabels each step with its action. It wrote
an empty file before.-nowarningturns off TLC's warnings, and-metadir DIRis accepted and
ignored, so TLC's command lines run unchanged. Liveness checking with a
state or action constraint prints TLC's warning about it.- A union of sets TLC keeps as their definitions, such as
[a : S] \cup [b : S] \cup [c : S], crashed with a stack overflow. - A primed expression may be applied or have a field selected:
x'[1],
r'.f. - As TLC: a tuple equals a string that spells it,
<<"a", "b">> = "ab",
and no value is in an empty interval,"a" \in 1..0beingFALSE. - A nested module may not redeclare or redefine a name of a module it is
in; SANY's warnings for a redeclared constant or variable are printed. - Simulation checks a temporal property on the graph TLC builds from the
behavior, so it reports a violation where TLC does, under fairness and
for properties such asP ~> Q. UNION Sis kept as its definition when an element ofSis infinite,
so1 \in {} \ UNION {{-1}, Nat}isFALSE, as in TLC.- Instances, as TLC treats them: the configuration may name an instance's
definitions (SPECIFICATION I!Spec); an instance's actions and the
parts of a property are named as TLC names them; a constant operator is
substituted implicitly;ENABLEDand<<A>>_vcompare an instance's
variables by name. - A temporal
IF, a definition given a value inCONSTANTS, and an
operator applied to a primed variable (Op(x')assigningx) are
checked. - The configuration is read as TLC reads it, before the spec: its syntax
errors are TLC's, with their lines;INIT,NEXT,SPECIFICATION,
SYMMETRY,VIEWandCHECK_DEADLOCKtake one name, once;ALIAS
andPOSTCONDITION, which TLC 2.19 does not know, are errors; and
D = [M] vgives a definition of moduleMa value. - A subscript may name an instance's definition:
WF_I!vars(A). SYMMETRYis the group its permutations generate, as TLC closes it,
and under symmetry a property's actions are checked on the steps
themselves; both reported wrong state counts or violations before.\A x \in S : Ain an action is the conjunction ofAfor eachx,
so a disjunction in it is a choice, counted as TLC counts states
generated.Any,TLCSetandTLCGet;CONSTANT D <- [M] Op, which was ignored;
PrintandToStringof an infinite union or difference fail as in
TLC.- Bound variables are enumerated in TLC's order, and errors raised in Java
by TLC end the run with TLC's message and exit status. - More benchmarks: liveness, symmetry, partition, recursion, refinement.
Binaries: macOS (arm64, x86_64), Linux (x86_64, arm64; static), Windows
(x86_64, built with Cygwin, cygwin1.dll beside tpp.exe; it runs on
Windows on Arm too, emulated). In a Cygwin shell, delete the bundled
cygwin1.dll: two in one session conflict.