Skip to content

tpp 0.5.0

Choose a tag to compare

@github-actions github-actions released this 06 Nov 23:44
· 340 commits to main since this release
  • Faster set operations: S \cap T and S \ T keep S's order instead
    of sorting again, sets of atoms compare inline, and SUBSET S is
    enumerated in the standard order (partition bench 0.27 → 0.19 s).
  • Liveness checking keeps each state's product nodes beside it instead of
    in a hash table over the whole product, and their edges in an arena; it
    no longer leaks them from one property to the next (liveness bench
    0.26 → 0.22 s; 30% less memory on larger models).
  • UNION S stays lazy, as in TLC, when an element of S is not an
    enumerated set: membership no longer enumerates it, and iterating it
    visits each element set in turn, duplicates included, in TLC's order
    (MCDisruptor_MPMC now matches TLC, in 0.6 s; it timed out after 60 s).
  • Cartesian products, record sets and function sets are generated in
    order instead of sorted afterwards (GameOfLife 11.9 → 6.1 s).
  • Each string has one value, made once, instead of a new one each time a
    literal or a record field is evaluated, and a set of literals such as
    {"ncs", "e1"} is computed once (MCBakery 4.5 → 2.6 s).
  • Under symmetry, a successor's fingerprint reuses the permuted hashes of
    the values it shares with the state before it (symmetry bench and
    MultiPaxos_MC_small 5% faster).
  • A product, SUBSET, set of functions or set of records written with
    constants and literals alone is computed once in the search, and keeps
    its elements once enumerated (GameOfLife 6.1 → 3.1 s).
  • Membership in a product of intervals checks each part instead of
    searching its elements, and applying a function compares atom keys
    inline (GameOfLife 3.0 → 2.8 s, PaxosCommit 3% faster).
  • Computing a constant definition or an assumption keeps only its value:
    what each iteration of a quantifier made is dropped after it, unless a
    value made before took a part of it (MCReachabilityTestAllGraphs: 5 GB
    → 3 MB, 1.29 → 1.0 s). The functions of an enumerated [D -> R] share
    their domain.
  • Fixed: ENABLED computed the spec's constant definitions again instead
    of using their value, so one drawn with RandomElement could differ
    inside it (SpanTreeRandom reported a false violation of Safety).
  • Comparing a set with a set that cannot be enumerated, as sorting
    UNION {Nat, {-1}} does, reports TLC's "Attempted to compare the set"
    error.
  • Errors name the sets TLC names in its fingerprint stack trace. A value
    computed from a constant definition before the search names none, while
    a definition TLC cannot normalize then is computed again where it is
    used, and named. An infinite set on the right of \in in an action
    gives TLC's "not enumerable" report.
  • A state holding an infinite set gives TLC's error: the one enumerating
    the set fails with, or that the state contains Nat, STRING or
    Seq(S), and a filter of it prints as TLC prints it.