tla-ts 0.0.4-dev.a297123 → 0.0.4-dev.b254db0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (313) hide show
  1. package/README.md +33 -143
  2. package/dist/deciders.cjs +366 -0
  3. package/dist/deciders.js +366 -0
  4. package/dist/index.cjs +1 -1
  5. package/dist/index.d.cts +35 -1
  6. package/dist/index.d.ts +35 -1
  7. package/dist/index.js +1 -1
  8. package/dist/parallel-worker.cjs +1 -4
  9. package/dist/parallel-worker.js +1 -4
  10. package/dist/prove-worker.cjs +9 -0
  11. package/dist/prove-worker.d.cts +9 -0
  12. package/dist/prove-worker.d.ts +9 -0
  13. package/dist/prove-worker.js +9 -0
  14. package/dist/prove.cjs +996 -0
  15. package/dist/prove.js +996 -0
  16. package/dist/run-cli.cjs +37 -47
  17. package/dist/run-cli.js +37 -47
  18. package/dist/tlapm.cjs +10 -0
  19. package/dist/tlapm.js +10 -0
  20. package/dist/transfer.cjs +38 -44
  21. package/dist/transfer.js +38 -44
  22. package/dist/worker.cjs +21 -0
  23. package/dist/worker.js +21 -0
  24. package/package.json +21 -12
  25. package/src/check.ts +1 -0
  26. package/src/codegen.ts +5 -3
  27. package/src/errors.ts +86 -0
  28. package/src/evaluate.ts +54 -19
  29. package/src/index.ts +10 -0
  30. package/src/{obligation-action.ts → obligations/action.ts} +265 -55
  31. package/src/{obligation-anon.ts → obligations/anon.ts} +47 -37
  32. package/src/obligations/ctx.ts +64 -0
  33. package/src/{obligation-deref.ts → obligations/deref.ts} +38 -61
  34. package/src/{obligation-expression.ts → obligations/expression.ts} +78 -45
  35. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  36. package/src/{obligation-generate.ts → obligations/generate.ts} +147 -74
  37. package/src/{obligations.ts → obligations/index.ts} +29 -13
  38. package/src/{obligation-levels.ts → obligations/levels.ts} +14 -5
  39. package/src/{obligation-module.ts → obligations/module.ts} +56 -33
  40. package/src/obligations/pickle.ts +98 -0
  41. package/src/obligations/pragma.ts +189 -0
  42. package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
  43. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
  44. package/src/{obligation-source.ts → obligations/source.ts} +159 -97
  45. package/src/obligations/temporal.ts +319 -0
  46. package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
  47. package/src/ocaml-marshal.ts +166 -0
  48. package/src/parallel-worker.ts +2 -18
  49. package/src/parallel.ts +10 -43
  50. package/src/prove/decide-pool.ts +100 -0
  51. package/src/prove/deciders.ts +33 -0
  52. package/src/prove/isabelle/LICENSE +36 -0
  53. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  54. package/src/prove/isabelle/decide.ts +47 -0
  55. package/src/prove/isabelle/encode.ts +503 -0
  56. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  57. package/src/prove/isabelle/isar/method.ts +367 -0
  58. package/src/prove/isabelle/isar/proof.ts +28 -0
  59. package/src/prove/isabelle/isar/statement.ts +57 -0
  60. package/src/prove/isabelle/isar/theory.ts +192 -0
  61. package/src/prove/isabelle/isar/type-check.ts +278 -0
  62. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  63. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  64. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  65. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  66. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  67. package/src/prove/isabelle/provers/blast/term.ts +547 -0
  68. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  69. package/src/prove/isabelle/provers/classical.ts +389 -0
  70. package/src/prove/isabelle/provers/hypsubst.ts +441 -0
  71. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  72. package/src/prove/isabelle/pure/consts.ts +32 -0
  73. package/src/prove/isabelle/pure/conv.ts +79 -0
  74. package/src/prove/isabelle/pure/drule.ts +264 -0
  75. package/src/prove/isabelle/pure/envir.ts +363 -0
  76. package/src/prove/isabelle/pure/goal.ts +53 -0
  77. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  78. package/src/prove/isabelle/pure/list.ts +12 -0
  79. package/src/prove/isabelle/pure/logic.ts +402 -0
  80. package/src/prove/isabelle/pure/name.ts +110 -0
  81. package/src/prove/isabelle/pure/net.ts +262 -0
  82. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  83. package/src/prove/isabelle/pure/pattern.ts +650 -0
  84. package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
  85. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  86. package/src/prove/isabelle/pure/search.ts +68 -0
  87. package/src/prove/isabelle/pure/seq.ts +156 -0
  88. package/src/prove/isabelle/pure/simplifier.ts +112 -0
  89. package/src/prove/isabelle/pure/table.ts +208 -0
  90. package/src/prove/isabelle/pure/tactic.ts +276 -0
  91. package/src/prove/isabelle/pure/tactical.ts +347 -0
  92. package/src/prove/isabelle/pure/term-ord.ts +159 -0
  93. package/src/prove/isabelle/pure/term.ts +808 -0
  94. package/src/prove/isabelle/pure/thm.ts +806 -0
  95. package/src/prove/isabelle/pure/type.ts +133 -0
  96. package/src/prove/isabelle/pure/unify.ts +753 -0
  97. package/src/prove/isabelle/pure/variable.ts +25 -0
  98. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  99. package/src/prove/isabelle/tla/context.ts +74 -0
  100. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  101. package/src/prove/isabelle/tla/logic.ts +215 -0
  102. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  103. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  104. package/src/prove/ocaml.ts +22 -0
  105. package/src/prove/prep/action.ts +521 -0
  106. package/src/prove/prep/defs.ts +33 -0
  107. package/src/prove/prep/elab.ts +156 -0
  108. package/src/prove/prep/enabled-axioms.ts +189 -0
  109. package/src/prove/prep/enabled.ts +43 -0
  110. package/src/prove/prep/fingerprint.ts +388 -0
  111. package/src/prove/prep/flatten.ts +70 -0
  112. package/src/prove/prep/level-comparison.ts +557 -0
  113. package/src/prove/prep/md5.ts +67 -0
  114. package/src/prove/prep/pragma.ts +221 -0
  115. package/src/prove/prep/trivial.ts +22 -0
  116. package/src/prove/prove-worker.ts +25 -0
  117. package/src/prove/prove.ts +505 -0
  118. package/src/prove/ptl/decide.ts +68 -0
  119. package/src/prove/ptl/encode.ts +256 -0
  120. package/src/prove/ptl/sat.ts +151 -0
  121. package/src/prove/ptl/tableau.ts +276 -0
  122. package/src/prove/smt/axiomatize.ts +69 -0
  123. package/src/prove/smt/axioms.ts +222 -0
  124. package/src/prove/smt/context.ts +108 -0
  125. package/src/prove/smt/data.ts +636 -0
  126. package/src/prove/smt/encode.ts +166 -0
  127. package/src/prove/smt/extensionality.ts +65 -0
  128. package/src/prove/smt/flatten.ts +112 -0
  129. package/src/prove/smt/format.ts +154 -0
  130. package/src/prove/smt/instances.ts +182 -0
  131. package/src/prove/smt/rewrite.ts +773 -0
  132. package/src/prove/smt/simplify.ts +57 -0
  133. package/src/prove/smt/solver/act-cache.ts +265 -0
  134. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  135. package/src/prove/smt/solver/array.ts +22 -0
  136. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  137. package/src/prove/smt/solver/ast-lt.ts +157 -0
  138. package/src/prove/smt/solver/ast-util.ts +147 -0
  139. package/src/prove/smt/solver/ast.ts +1315 -0
  140. package/src/prove/smt/solver/auf-solver.ts +572 -0
  141. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  142. package/src/prove/smt/solver/cg-table.ts +175 -0
  143. package/src/prove/smt/solver/clause.ts +276 -0
  144. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  145. package/src/prove/smt/solver/context.ts +1292 -0
  146. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  147. package/src/prove/smt/solver/der.ts +224 -0
  148. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  149. package/src/prove/smt/solver/e-matching.ts +659 -0
  150. package/src/prove/smt/solver/enode.ts +259 -0
  151. package/src/prove/smt/solver/expr-ref.ts +21 -0
  152. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  153. package/src/prove/smt/solver/fingerprints.ts +92 -0
  154. package/src/prove/smt/solver/flat-literals.ts +51 -0
  155. package/src/prove/smt/solver/goal.ts +138 -0
  156. package/src/prove/smt/solver/hash.ts +173 -0
  157. package/src/prove/smt/solver/hashtable.ts +166 -0
  158. package/src/prove/smt/solver/internalizer.ts +1381 -0
  159. package/src/prove/smt/solver/lbool.ts +5 -0
  160. package/src/prove/smt/solver/literal.ts +24 -0
  161. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  162. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  163. package/src/prove/smt/solver/lp/containers.ts +296 -0
  164. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  165. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  166. package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
  167. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  168. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  169. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  170. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  171. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  172. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  173. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  174. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  175. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  176. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  177. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  178. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  179. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  180. package/src/prove/smt/solver/lp/nex.ts +120 -0
  181. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  182. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  183. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  184. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  185. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  186. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  187. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  188. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  189. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  190. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  191. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  192. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  193. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  194. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  195. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  196. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  197. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  198. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  199. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  200. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  201. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  202. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  203. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  204. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  205. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  206. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  207. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  208. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  209. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  210. package/src/prove/smt/solver/model-checker.ts +347 -0
  211. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  212. package/src/prove/smt/solver/model-finder.ts +155 -0
  213. package/src/prove/smt/solver/model-generator.ts +97 -0
  214. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  215. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  216. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  217. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  218. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  219. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  220. package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
  221. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  222. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  223. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  224. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  225. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  226. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  227. package/src/prove/smt/solver/nnf.ts +469 -0
  228. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  229. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  230. package/src/prove/smt/solver/propagate-values.ts +83 -0
  231. package/src/prove/smt/solver/proto-model.ts +551 -0
  232. package/src/prove/smt/solver/pull-quant.ts +139 -0
  233. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  234. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  235. package/src/prove/smt/solver/qe-lite.ts +381 -0
  236. package/src/prove/smt/solver/qi-queue.ts +362 -0
  237. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  238. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  239. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  240. package/src/prove/smt/solver/random-gen.ts +10 -0
  241. package/src/prove/smt/solver/rational.ts +165 -0
  242. package/src/prove/smt/solver/ref-vector.ts +62 -0
  243. package/src/prove/smt/solver/relevancy.ts +247 -0
  244. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  245. package/src/prove/smt/solver/rewriter.ts +843 -0
  246. package/src/prove/smt/solver/rlimit.ts +79 -0
  247. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  248. package/src/prove/smt/solver/solver.ts +71 -0
  249. package/src/prove/smt/solver/sort.ts +35 -0
  250. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  251. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  252. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  253. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  254. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  255. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  256. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  257. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  258. package/src/prove/smt/solver/theory-lra.ts +56 -0
  259. package/src/prove/smt/solver/var-subst.ts +258 -0
  260. package/src/prove/smt/solver/z3-license.txt +10 -0
  261. package/src/prove/smt/table.ts +170 -0
  262. package/src/prove/tlapm/tlapm.ts +96 -0
  263. package/src/prove/tlaps-module.ts +510 -0
  264. package/src/prove/verdict.ts +18 -0
  265. package/src/prove/zenon/LICENSE +32 -0
  266. package/src/prove/zenon/check/check.ts +105 -0
  267. package/src/prove/zenon/check/definitions.ts +144 -0
  268. package/src/prove/zenon/check/equality.ts +182 -0
  269. package/src/prove/zenon/check/functions.ts +62 -0
  270. package/src/prove/zenon/check/keys.ts +125 -0
  271. package/src/prove/zenon/check/propositional.ts +104 -0
  272. package/src/prove/zenon/check/records.ts +188 -0
  273. package/src/prove/zenon/check/relations.ts +121 -0
  274. package/src/prove/zenon/check/rewrites.ts +224 -0
  275. package/src/prove/zenon/check/sets.ts +302 -0
  276. package/src/prove/zenon/check/terms.ts +127 -0
  277. package/src/prove/zenon/check/tla.ts +126 -0
  278. package/src/prove/zenon/decide.ts +113 -0
  279. package/src/prove/zenon/encode.ts +437 -0
  280. package/src/prove/zenon/eqrel.ts +300 -0
  281. package/src/prove/zenon/equality-rules.ts +435 -0
  282. package/src/prove/zenon/expr.ts +551 -0
  283. package/src/prove/zenon/index-table.ts +350 -0
  284. package/src/prove/zenon/isar-case.ts +513 -0
  285. package/src/prove/zenon/isar.ts +1249 -0
  286. package/src/prove/zenon/limits.ts +15 -0
  287. package/src/prove/zenon/llproof.ts +173 -0
  288. package/src/prove/zenon/mltoll.ts +1566 -0
  289. package/src/prove/zenon/node.ts +297 -0
  290. package/src/prove/zenon/ocaml.ts +169 -0
  291. package/src/prove/zenon/parse.ts +247 -0
  292. package/src/prove/zenon/phrase.ts +191 -0
  293. package/src/prove/zenon/proof.ts +198 -0
  294. package/src/prove/zenon/propositional-rules.ts +387 -0
  295. package/src/prove/zenon/rules.ts +94 -0
  296. package/src/prove/zenon/search.ts +288 -0
  297. package/src/prove/zenon/tla/functions.ts +151 -0
  298. package/src/prove/zenon/tla/llproof.ts +480 -0
  299. package/src/prove/zenon/tla/records.ts +225 -0
  300. package/src/prove/zenon/tla/rewrites.ts +447 -0
  301. package/src/prove/zenon/tla/sets.ts +304 -0
  302. package/src/prove/zenon/tla/terms.ts +181 -0
  303. package/src/prove/zenon/tla/tla.ts +506 -0
  304. package/src/run-cli.ts +334 -75
  305. package/src/standard-modules.ts +5 -2
  306. package/src/successors.ts +24 -5
  307. package/src/tlapm-cache.ts +236 -0
  308. package/src/tlc-random.ts +55 -32
  309. package/src/tlc-version.ts +8 -7
  310. package/src/values.ts +80 -35
  311. package/src/worker.ts +65 -0
  312. package/dist/parallel.cjs +0 -12
  313. package/dist/parallel.js +0 -12
@@ -0,0 +1,319 @@
1
+ // tlapm's expansions of temporal operators (Expr.Tla_norm), constant detection (Expr.Constness), and
2
+ // the time of a fact (Expr.Temporal_props): a fact holds always when it is closed under [].
3
+
4
+ import {
5
+ adjoin,
6
+ applyBuiltin,
7
+ at,
8
+ getFresh,
9
+ getScopeAt,
10
+ mapChildren,
11
+ type Builtin,
12
+ type Expr,
13
+ type Hyp,
14
+ type Scope,
15
+ type Time,
16
+ } from "./expression";
17
+
18
+ const isApplied = (expression: Expr, builtins: Builtin[]) =>
19
+ expression.kind === "Apply" &&
20
+ expression.operator.kind === "Internal" &&
21
+ builtins.includes(expression.operator.builtin);
22
+
23
+ const unchanged = (expression: Expr) => applyBuiltin("UNCHANGED", [expression], expression);
24
+
25
+ // Each visitor rewrites the outermost match and leaves the rest of the tree as it is.
26
+ const rewrite =
27
+ (match: (expression: Expr, recurse: (inner: Expr) => Expr) => Expr | undefined) =>
28
+ (expression: Expr): Expr => {
29
+ const recurse = rewrite(match);
30
+ return match(expression, recurse) ?? mapChildren(expression, recurse);
31
+ };
32
+
33
+ export const expandLeadsto = rewrite((expression, recurse) =>
34
+ expression.kind === "Apply" && isApplied(expression, ["Leadsto"])
35
+ ? applyBuiltin(
36
+ "BoxTrue",
37
+ [
38
+ applyBuiltin(
39
+ "Implies",
40
+ [
41
+ recurse(expression.args[0]),
42
+ applyBuiltin("Diamond", [recurse(expression.args[1])], expression),
43
+ ],
44
+ expression,
45
+ ),
46
+ ],
47
+ expression,
48
+ )
49
+ : undefined,
50
+ );
51
+
52
+ export const expandFairness = rewrite((expression) => {
53
+ if (expression.kind !== "Fair") return undefined;
54
+ const action = expression.action;
55
+ const subscript = expression.subscript;
56
+ const enabled = applyBuiltin(
57
+ "ENABLED",
58
+ [at({ kind: "Sub", modal: "Dia", action, subscript }, action)],
59
+ action,
60
+ );
61
+ const outer = expression.fairness === "Weak" ? "Diamond" : "BoxTrue";
62
+ const inner = expression.fairness === "Weak" ? "BoxTrue" : "Diamond";
63
+ return applyBuiltin(
64
+ "Implies",
65
+ [
66
+ applyBuiltin(outer, [applyBuiltin(inner, [enabled], action)], action),
67
+ applyBuiltin(
68
+ "BoxTrue",
69
+ [at({ kind: "Tsub", modal: "Dia", action, subscript }, action)],
70
+ action,
71
+ ),
72
+ ],
73
+ action,
74
+ );
75
+ });
76
+
77
+ export const expandAction = rewrite((expression, recurse) => {
78
+ if (expression.kind !== "Sub" && expression.kind !== "Tsub") return undefined;
79
+ const action = recurse(expression.action);
80
+ const subscript = recurse(expression.subscript);
81
+ const step =
82
+ expression.modal === "Box"
83
+ ? applyBuiltin("Disj", [action, unchanged(subscript)], expression)
84
+ : applyBuiltin(
85
+ "Conj",
86
+ [action, applyBuiltin("Neg", [unchanged(subscript)], expression)],
87
+ expression,
88
+ );
89
+ if (expression.kind === "Sub") return step;
90
+ return applyBuiltin(expression.modal === "Box" ? "BoxTrue" : "Diamond", [step], expression);
91
+ });
92
+
93
+ const flattenTuple = (expression: Expr): Expr[] =>
94
+ expression.kind === "Tuple" ? expression.elements.flatMap(flattenTuple) : [expression];
95
+
96
+ const expandUnchanged = rewrite((expression) => {
97
+ if (expression.kind !== "Apply" || !isApplied(expression, ["UNCHANGED"])) return undefined;
98
+ const equalities = flattenTuple(expression.args[0]).map((element) =>
99
+ applyBuiltin("Eq", [applyBuiltin("Prime", [element], element), element], element),
100
+ );
101
+ if (equalities.length === 0) return at({ kind: "Internal", builtin: "TRUE" }, expression);
102
+ if (equalities.length === 1) return equalities[0];
103
+ return at({ kind: "List", bullet: "And", items: equalities }, expression);
104
+ });
105
+
106
+ const TEMPORAL_BUILTINS: Builtin[] = [
107
+ "Prime",
108
+ "StrongPrime",
109
+ "Leadsto",
110
+ "ENABLED",
111
+ "UNCHANGED",
112
+ "Cdot",
113
+ "Actplus",
114
+ "BoxTrue",
115
+ "BoxFalse",
116
+ "Diamond",
117
+ ];
118
+
119
+ const constantBodies = new WeakMap<Expr, boolean>();
120
+
121
+ const isConstantHyp = (scope: Scope | undefined, hyp: Hyp) => {
122
+ switch (hyp.kind) {
123
+ case "Fresh":
124
+ return hyp.level === "Constant";
125
+ case "Defn":
126
+ return hyp.definition.kind === "Operator" && isConstant(scope, hyp.definition.body);
127
+ case "Fact":
128
+ return isConstant(scope, hyp.expression);
129
+ case "Flex":
130
+ return false;
131
+ }
132
+ };
133
+
134
+ const bindConstants = (scope: Scope | undefined, names: string[]) =>
135
+ names.reduce<Scope | undefined>(
136
+ (inner, name) => adjoin(inner, getFresh(name, "Constant")),
137
+ scope,
138
+ );
139
+
140
+ export const isConstant = (scope: Scope | undefined, expression: Expr): boolean => {
141
+ const recurse = (inner: Expr) => isConstant(scope, inner);
142
+ switch (expression.kind) {
143
+ case "Ix": {
144
+ const found = getScopeAt(scope, expression.index - 1);
145
+ const hyp = found?.hyp;
146
+ if (hyp?.kind === "Fresh") return hyp.level === "Constant";
147
+ if (hyp?.kind !== "Defn" || hyp.definition.kind !== "Operator" || hyp.isConstnessUnset)
148
+ return false;
149
+ const body = hyp.definition.body;
150
+ const cached = constantBodies.get(body);
151
+ if (cached !== undefined) return cached;
152
+ const result = isConstant(found?.rest, body);
153
+ constantBodies.set(body, result);
154
+ return result;
155
+ }
156
+ case "Opaque":
157
+ case "String":
158
+ case "Num":
159
+ case "At":
160
+ return true;
161
+ case "Internal":
162
+ return !TEMPORAL_BUILTINS.includes(expression.builtin);
163
+ case "Tquant":
164
+ case "Sub":
165
+ case "Tsub":
166
+ case "Fair":
167
+ return false;
168
+ case "Lambda":
169
+ return isConstant(
170
+ bindConstants(
171
+ scope,
172
+ expression.params.map((param) => param.name),
173
+ ),
174
+ expression.body,
175
+ );
176
+ case "Sequent": {
177
+ const inner = expression.sequent.context.reduce<{
178
+ scope: Scope | undefined;
179
+ isGood: boolean;
180
+ }>(
181
+ (state, hyp) => ({
182
+ scope: adjoin(state.scope, hyp),
183
+ isGood: state.isGood && isConstantHyp(state.scope, hyp),
184
+ }),
185
+ { scope, isGood: true },
186
+ );
187
+ return inner.isGood && isConstant(inner.scope, expression.sequent.active);
188
+ }
189
+ case "Bang":
190
+ case "With":
191
+ case "Dot":
192
+ case "Parens":
193
+ return recurse(expression.expression);
194
+ case "Apply":
195
+ return recurse(expression.operator) && expression.args.every(recurse);
196
+ case "Let": {
197
+ const inner = expression.definitions.reduce<{ scope: Scope | undefined; isGood: boolean }>(
198
+ (state, definition) => ({
199
+ scope: adjoin(state.scope, {
200
+ kind: "Defn",
201
+ definition,
202
+ whereDefined: "User",
203
+ visibility: "Visible",
204
+ isLocal: true,
205
+ }),
206
+ isGood:
207
+ state.isGood &&
208
+ definition.kind === "Operator" &&
209
+ isConstant(state.scope, definition.body),
210
+ }),
211
+ { scope, isGood: true },
212
+ );
213
+ return inner.isGood && isConstant(inner.scope, expression.body);
214
+ }
215
+ case "Quant":
216
+ case "Fcn":
217
+ case "SetOf": {
218
+ const body = expression.kind === "SetOf" ? expression.element : expression.body;
219
+ return (
220
+ expression.bounds.every(
221
+ (bound) => bound.domain.kind !== "Domain" || recurse(bound.domain.expression),
222
+ ) &&
223
+ isConstant(
224
+ bindConstants(
225
+ scope,
226
+ expression.bounds.map((bound) => bound.name),
227
+ ),
228
+ body,
229
+ )
230
+ );
231
+ }
232
+ case "Choose":
233
+ case "SetSt":
234
+ return (
235
+ (expression.domain === undefined || recurse(expression.domain)) &&
236
+ isConstant(bindConstants(scope, [expression.name]), expression.body)
237
+ );
238
+ case "If":
239
+ return (
240
+ recurse(expression.condition) &&
241
+ recurse(expression.consequent) &&
242
+ recurse(expression.alternative)
243
+ );
244
+ case "List":
245
+ return expression.items.every(recurse);
246
+ case "Tuple":
247
+ case "SetEnum":
248
+ return expression.elements.every(recurse);
249
+ case "Product":
250
+ return expression.factors.every(recurse);
251
+ case "FcnApp":
252
+ return recurse(expression.function) && expression.args.every(recurse);
253
+ case "Rect":
254
+ case "Record":
255
+ return expression.fields.every((field) => recurse(field.value));
256
+ case "Arrow":
257
+ return recurse(expression.domain) && recurse(expression.range);
258
+ case "Except":
259
+ return (
260
+ recurse(expression.function) &&
261
+ expression.specs.every(
262
+ (spec) =>
263
+ spec.trail.every((point) => point.kind === "Dot" || recurse(point.expression)) &&
264
+ recurse(spec.value),
265
+ )
266
+ );
267
+ case "Case":
268
+ return (
269
+ expression.arms.every((arm) => recurse(arm.condition) && recurse(arm.body)) &&
270
+ (expression.other === undefined || recurse(expression.other))
271
+ );
272
+ }
273
+ };
274
+
275
+ // Temporal_props.box_closure: whether the formula is equivalent to [] of itself, judged by its
276
+ // shape. Under a negation or on the left of =>, <> takes the place of [].
277
+ const isClosed = (scope: Scope | undefined, expression: Expr, isBox: boolean): boolean => {
278
+ if (isConstant(scope, expression)) return true;
279
+ if (expression.kind === "Internal")
280
+ return ["Eq", "Neq", "UNCHANGED", "TRUE", "FALSE"].includes(expression.builtin);
281
+ if (expression.kind === "List")
282
+ return expression.items.every((item) => isClosed(scope, item, isBox));
283
+ if (expression.kind === "Sequent") {
284
+ const inner = expression.sequent.context.reduce<Scope | undefined>(adjoin, scope);
285
+ return isClosed(inner, expression.sequent.active, isBox);
286
+ }
287
+ if (expression.kind !== "Apply") return false;
288
+ const args = expression.args;
289
+ if (isApplied(expression, ["BoxTrue", "BoxFalse"]) && isBox) return true;
290
+ if (isApplied(expression, ["Diamond"]) && !isBox) return true;
291
+ if (args.length === 1 && isApplied(expression, ["BoxTrue", "BoxFalse", "Diamond", "Prime"]))
292
+ return isClosed(scope, args[0], isBox);
293
+ if (args.length === 1 && isApplied(expression, ["Neg"])) return isClosed(scope, args[0], !isBox);
294
+ if (args.length === 2 && isApplied(expression, ["Conj", "Disj"]))
295
+ return isClosed(scope, args[0], isBox) && isClosed(scope, args[1], isBox);
296
+ if (args.length === 2 && isApplied(expression, ["Implies"]))
297
+ return isClosed(scope, args[0], !isBox) && isClosed(scope, args[1], isBox);
298
+ if (args.length === 2 && isApplied(expression, ["Equiv"]))
299
+ return [true, false].every(
300
+ (isFlipped) =>
301
+ isClosed(scope, args[0], isBox !== isFlipped) &&
302
+ isClosed(scope, args[1], isBox === isFlipped),
303
+ );
304
+ return (
305
+ isClosed(scope, expression.operator, isBox) && args.every((arg) => isClosed(scope, arg, isBox))
306
+ );
307
+ };
308
+
309
+ export const getTime = (scope: Scope | undefined, expression: Expr): Time =>
310
+ isClosed(scope, expandLeadsto(expandFairness(expandAction(expandUnchanged(expression)))), true)
311
+ ? "Always"
312
+ : "Now";
313
+
314
+ // Temporal_props.check_time_change: a proof stays in the always scope while no fact it assumes
315
+ // holds only now.
316
+ export const getScopeTime = (context: Hyp[], time: Time): Time =>
317
+ time === "Always" && context.some((hyp) => hyp.kind === "Fact" && hyp.time === "Now")
318
+ ? "Now"
319
+ : time;
@@ -1,6 +1,6 @@
1
1
  // tlapm's E_tuply_declarations: declarations such as <<x, y>> \in S become declarations of names.
2
2
 
3
- import type { Bound, BoundDomain, Defn, Expr } from "./obligation-expression";
3
+ import type { Bound, BoundDomain, Defn, Expr } from "./expression";
4
4
 
5
5
  export type TuplyBound =
6
6
  | { kind: "Name"; name: string; domain: BoundDomain }
@@ -0,0 +1,166 @@
1
+ // OCaml's Marshal format, ported from runtime/intern.c and runtime/extern.c, for the values in
2
+ // tlapm's fingerprints file. It writes no sharing, which OCaml reads the same.
3
+
4
+ import { TlaProofError } from "./errors";
5
+
6
+ interface OcamlBlock {
7
+ tag: number;
8
+ fields: OcamlValue[];
9
+ }
10
+
11
+ interface OcamlFloat {
12
+ float: number;
13
+ }
14
+
15
+ export type OcamlValue = number | string | OcamlBlock | OcamlFloat;
16
+
17
+ const MAGIC_NUMBER_SMALL = 0x8495a6be;
18
+
19
+ const CODE = {
20
+ int8: 0x0,
21
+ int16: 0x1,
22
+ int32: 0x2,
23
+ shared8: 0x4,
24
+ shared16: 0x5,
25
+ shared32: 0x6,
26
+ block32: 0x8,
27
+ string8: 0x9,
28
+ string32: 0xa,
29
+ doubleLittle: 0xc,
30
+ };
31
+
32
+ const PREFIX = { smallInt: 0x40, smallString: 0x20, smallBlock: 0x80 };
33
+
34
+ const HEADER_SIZE = 20;
35
+
36
+ export const block = (tag: number, ...fields: OcamlValue[]): OcamlBlock => ({ tag, fields });
37
+
38
+ export const isBlock = (value: OcamlValue): value is OcamlBlock =>
39
+ typeof value === "object" && "tag" in value;
40
+
41
+ // Returns the value marshaled at offset, and where the next one starts.
42
+ export const readMarshaled = (bytes: Uint8Array, offset: number) => {
43
+ const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);
44
+ if (bytes.length < offset + HEADER_SIZE || view.getUint32(offset) !== MAGIC_NUMBER_SMALL)
45
+ throw new TlaProofError("corrupted fingerprint file");
46
+ const end = offset + HEADER_SIZE + view.getUint32(offset + 4);
47
+ const objects: OcamlValue[] = [];
48
+ const state = { position: offset + HEADER_SIZE };
49
+ const take = (length: number) => {
50
+ const start = state.position;
51
+ state.position += length;
52
+ if (state.position > end) throw new TlaProofError("corrupted fingerprint file");
53
+ return start;
54
+ };
55
+ const decoder = new TextDecoder();
56
+ const readString = (length: number) => {
57
+ const start = take(length);
58
+ const value = decoder.decode(bytes.subarray(start, start + length));
59
+ objects.push(value);
60
+ return value;
61
+ };
62
+ const readBlock = (tag: number, size: number): OcamlBlock => {
63
+ const value = block(tag);
64
+ if (size > 0) objects.push(value);
65
+ for (let index = 0; index < size; index++) value.fields.push(read());
66
+ return value;
67
+ };
68
+ const readShared = (distance: number) => objects[objects.length - distance];
69
+ const read = (): OcamlValue => {
70
+ const code = bytes[take(1)];
71
+ if (code >= PREFIX.smallBlock) return readBlock(code & 0xf, (code >> 4) & 0x7);
72
+ if (code >= PREFIX.smallInt) return code & 0x3f;
73
+ if (code >= PREFIX.smallString) return readString(code & 0x1f);
74
+ switch (code) {
75
+ case CODE.int8:
76
+ return view.getInt8(take(1));
77
+ case CODE.int16:
78
+ return view.getInt16(take(2));
79
+ case CODE.int32:
80
+ return view.getInt32(take(4));
81
+ case CODE.shared8:
82
+ return readShared(view.getUint8(take(1)));
83
+ case CODE.shared16:
84
+ return readShared(view.getUint16(take(2)));
85
+ case CODE.shared32:
86
+ return readShared(view.getUint32(take(4)));
87
+ case CODE.block32: {
88
+ const header = view.getUint32(take(4));
89
+ return readBlock(header & 0xff, header >>> 10);
90
+ }
91
+ case CODE.string8:
92
+ return readString(view.getUint8(take(1)));
93
+ case CODE.string32:
94
+ return readString(view.getUint32(take(4)));
95
+ case CODE.doubleLittle: {
96
+ const value = { float: view.getFloat64(take(8), true) };
97
+ objects.push(value);
98
+ return value;
99
+ }
100
+ }
101
+ throw new TlaProofError("corrupted fingerprint file");
102
+ };
103
+ return { value: read(), next: end };
104
+ };
105
+
106
+ export const writeMarshaled = (value: OcamlValue) => {
107
+ const bytes: number[] = [];
108
+ const sizes = { objects: 0, words32: 0, words64: 0 };
109
+ const pushInteger = (integer: number, length: number) => {
110
+ for (let shift = (length - 1) * 8; shift >= 0; shift -= 8)
111
+ bytes.push((integer >>> shift) & 0xff);
112
+ };
113
+ const encoder = new TextEncoder();
114
+ const write = (inner: OcamlValue) => {
115
+ if (typeof inner === "number") {
116
+ if (inner >= 0 && inner < 0x40) return bytes.push(PREFIX.smallInt + inner);
117
+ if (inner >= -0x80 && inner < 0x80) return bytes.push(CODE.int8, inner & 0xff);
118
+ if (inner >= -0x8000 && inner < 0x8000) {
119
+ bytes.push(CODE.int16);
120
+ return pushInteger(inner, 2);
121
+ }
122
+ bytes.push(CODE.int32);
123
+ return pushInteger(inner, 4);
124
+ }
125
+ sizes.objects++;
126
+ if (typeof inner === "string") {
127
+ const encoded = encoder.encode(inner);
128
+ if (encoded.length < 0x20) bytes.push(PREFIX.smallString + encoded.length);
129
+ else if (encoded.length < 0x100) bytes.push(CODE.string8, encoded.length);
130
+ else {
131
+ bytes.push(CODE.string32);
132
+ pushInteger(encoded.length, 4);
133
+ }
134
+ bytes.push(...encoded);
135
+ sizes.words32 += 1 + Math.floor((encoded.length + 4) / 4);
136
+ sizes.words64 += 1 + Math.floor((encoded.length + 8) / 8);
137
+ return;
138
+ }
139
+ if (!isBlock(inner)) {
140
+ const float = new DataView(new ArrayBuffer(8));
141
+ float.setFloat64(0, inner.float, true);
142
+ bytes.push(CODE.doubleLittle, ...new Uint8Array(float.buffer));
143
+ sizes.words32 += 3;
144
+ sizes.words64 += 2;
145
+ return;
146
+ }
147
+ const size = inner.fields.length;
148
+ if (size === 0) sizes.objects--;
149
+ else {
150
+ sizes.words32 += 1 + size;
151
+ sizes.words64 += 1 + size;
152
+ }
153
+ if (inner.tag < 16 && size < 8) bytes.push(PREFIX.smallBlock + inner.tag + (size << 4));
154
+ else {
155
+ bytes.push(CODE.block32);
156
+ pushInteger(size * 1024 + inner.tag, 4);
157
+ }
158
+ inner.fields.forEach(write);
159
+ };
160
+ write(value);
161
+ const header = new DataView(new ArrayBuffer(HEADER_SIZE));
162
+ [MAGIC_NUMBER_SMALL, bytes.length, sizes.objects, sizes.words32, sizes.words64].forEach(
163
+ (field, index) => header.setUint32(index * 4, field),
164
+ );
165
+ return new Uint8Array([...new Uint8Array(header.buffer), ...bytes]);
166
+ };
@@ -7,20 +7,14 @@ import {
7
7
  isSharedFingerprintsFull,
8
8
  writeStateFingerprint,
9
9
  } from "./fingerprints";
10
- import type {
11
- CoordinatorMessage,
12
- LevelMessage,
13
- Port,
14
- StartMessage,
15
- WorkerMessage,
16
- } from "./parallel";
10
+ import type { CoordinatorMessage, LevelMessage, StartMessage, WorkerMessage } from "./parallel";
17
11
  import { getSuccessors, type Successor } from "./successors";
18
12
  import { getTlcStringOrder, getTlcDeclarationOrder } from "./tlc-order";
19
13
  import { OUT_DEGREE_BUCKETS } from "./tlc-summary";
20
14
  import { createStateDecoder, createStateEncoder, type EncodedStates } from "./transfer";
21
15
  import { getRankedStringCount, setStringOrder, setValueVersion, type Value } from "./values";
16
+ import { getParentPort, type Port } from "./worker";
22
17
 
23
- const WORKER_THREADS_MODULE = "node:worker_threads";
24
18
  const LOCKED = -1;
25
19
 
26
20
  interface Expansion {
@@ -36,16 +30,6 @@ interface Expansion {
36
30
  fingerprintStates: Value[][];
37
31
  }
38
32
 
39
- const getParentPort = async () => {
40
- if (typeof (globalThis as { postMessage?: unknown }).postMessage === "function") {
41
- return globalThis as unknown as Port;
42
- }
43
- const threads: typeof import("node:worker_threads") = await import(
44
- /* @vite-ignore */ /* webpackIgnore: true */ WORKER_THREADS_MODULE
45
- );
46
- return threads.parentPort as unknown as Port;
47
- };
48
-
49
33
  const run = (start: StartMessage, parent: Port) => {
50
34
  const modules = new Map(start.modules);
51
35
  const loadModule = (name: string) => modules.get(name);
package/src/parallel.ts CHANGED
@@ -29,15 +29,7 @@ import { getFingerprintDistance, OUT_DEGREE_BUCKETS } from "./tlc-summary";
29
29
  import { createStateEncoder, type EncodedStates } from "./transfer";
30
30
  import type { TlcVersion } from "./tlc-version";
31
31
  import { getRankedStringCount, setStringOrder, setValueVersion, type Value } from "./values";
32
-
33
- const WORKER_THREADS_MODULE = "node:worker_threads";
34
-
35
- export interface Port {
36
- postMessage: (message: unknown, transfer?: unknown[]) => void;
37
- addEventListener: (type: "message", listener: (event: { data: unknown }) => void) => void;
38
- removeEventListener?: (type: "message", listener: (event: { data: unknown }) => void) => void;
39
- start?: () => void;
40
- }
32
+ import { spawnWorker, type Port } from "./worker";
41
33
 
42
34
  export interface StartMessage {
43
35
  type: "start";
@@ -76,39 +68,6 @@ export type CoordinatorMessage =
76
68
  | { type: "level"; level: number }
77
69
  | { type: "resize"; fingerprints: SharedFingerprints };
78
70
 
79
- interface WorkerHandle {
80
- postMessage: (message: unknown, transfer?: unknown[]) => void;
81
- terminate: () => void;
82
- }
83
-
84
- interface WebWorker {
85
- postMessage: (message: unknown, transfer?: unknown[]) => void;
86
- addEventListener: (type: string, listener: (event: { data: unknown }) => void) => void;
87
- terminate: () => void;
88
- }
89
-
90
- declare const Worker: new (url: URL, options: { type: "module" }) => WebWorker;
91
-
92
- const spawnWorker = async (onMessage: (message: WorkerMessage) => void): Promise<WorkerHandle> => {
93
- if (typeof Worker === "function") {
94
- const worker = new Worker(new URL("./parallel-worker.js", import.meta.url), { type: "module" });
95
- worker.addEventListener("message", (event) => onMessage(event.data as WorkerMessage));
96
- worker.addEventListener("error", () => onMessage({ type: "abort" }));
97
- return worker;
98
- }
99
- const threads: typeof import("node:worker_threads") = await import(
100
- /* @vite-ignore */ /* webpackIgnore: true */ WORKER_THREADS_MODULE
101
- );
102
- const worker = new threads.Worker(new URL("./parallel-worker.js", import.meta.url));
103
- worker.on("message", onMessage);
104
- worker.on("error", () => onMessage({ type: "abort" }));
105
- return {
106
- postMessage: (message, transfer) =>
107
- worker.postMessage(message, transfer as Parameters<typeof worker.postMessage>[1]),
108
- terminate: () => void worker.terminate(),
109
- };
110
- };
111
-
112
71
  export const check = async (options: CheckOptions): Promise<CheckResult> => {
113
72
  const config =
114
73
  typeof options.config === "string"
@@ -290,7 +249,15 @@ export const check = async (options: CheckOptions): Promise<CheckResult> => {
290
249
  const ready = waitForReports(count);
291
250
  const requests = new Int32Array(new SharedArrayBuffer(count * 4));
292
251
  const remaining = new Int32Array(new SharedArrayBuffer(count * 4));
293
- const workers = await Promise.all(Array.from({ length: count }, () => spawnWorker(onMessage)));
252
+ const workers = await Promise.all(
253
+ Array.from({ length: count }, () =>
254
+ spawnWorker(
255
+ new URL("./parallel-worker.js", import.meta.url),
256
+ (message) => onMessage(message as WorkerMessage),
257
+ () => onMessage({ type: "abort" }),
258
+ ),
259
+ ),
260
+ );
294
261
  const terminate = () => workers.forEach((worker) => worker.terminate());
295
262
  const channels = new Map<string, MessageChannel>();
296
263
  const getPort = (from: number, to: number) => {