Skip to content

tpp 0.2.0

Choose a tag to compare

@github-actions github-actions released this 06 Nov 02:38
· 381 commits to main since this release
  • -dump dot FILE writes the state graph to FILE.dot as TLC does;
    -dump dot,actionlabels FILE labels each step with its action. It wrote
    an empty file before.
  • -nowarning turns off TLC's warnings, and -metadir DIR is 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..0 being FALSE.
  • 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 as P ~> Q.
  • UNION S is kept as its definition when an element of S is infinite,
    so 1 \in {} \ UNION {{-1}, Nat} is FALSE, 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; ENABLED and <<A>>_v compare an instance's
    variables by name.
  • A temporal IF, a definition given a value in CONSTANTS, and an
    operator applied to a primed variable (Op(x') assigning x) 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, VIEW and CHECK_DEADLOCK take one name, once; ALIAS
    and POSTCONDITION, which TLC 2.19 does not know, are errors; and
    D = [M] v gives a definition of module M a value.
  • A subscript may name an instance's definition: WF_I!vars(A).
  • SYMMETRY is 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 : A in an action is the conjunction of A for each x,
    so a disjunction in it is a choice, counted as TLC counts states
    generated.
  • Any, TLCSet and TLCGet; CONSTANT D <- [M] Op, which was ignored;
    Print and ToString of 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.