tla-ts 0.0.3 → 0.0.4-dev.1a3acf6

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 (381) hide show
  1. package/README.md +46 -115
  2. package/dist/cli.cjs +1 -1
  3. package/dist/cli.js +1 -1
  4. package/dist/deciders.cjs +366 -0
  5. package/dist/deciders.js +366 -0
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +194 -8
  8. package/dist/index.d.ts +194 -8
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -4
  11. package/dist/parallel-worker.js +1 -4
  12. package/dist/prove-worker.cjs +9 -0
  13. package/dist/prove-worker.d.cts +9 -0
  14. package/dist/prove-worker.d.ts +9 -0
  15. package/dist/prove-worker.js +9 -0
  16. package/dist/prove.cjs +1006 -0
  17. package/dist/prove.js +1006 -0
  18. package/dist/run.cjs +45 -0
  19. package/dist/run.js +45 -0
  20. package/dist/tlapm.cjs +10 -0
  21. package/dist/tlapm.js +10 -0
  22. package/dist/transfer.cjs +1377 -18
  23. package/dist/transfer.js +1377 -18
  24. package/dist/worker.cjs +21 -0
  25. package/dist/worker.js +21 -0
  26. package/package.json +24 -11
  27. package/src/ast.ts +149 -8
  28. package/src/bags.ts +26 -30
  29. package/src/builtins.ts +45 -19
  30. package/src/bundled-modules.ts +3 -3
  31. package/src/check.ts +1182 -900
  32. package/src/cli/options.ts +109 -0
  33. package/src/cli/run.ts +63 -0
  34. package/src/cli/shared.ts +106 -0
  35. package/src/cli/tlapm.ts +374 -0
  36. package/src/cli/tlc.ts +941 -0
  37. package/src/cli/xml-exporter.ts +221 -0
  38. package/src/cli.ts +9 -2
  39. package/src/codegen.ts +112 -51
  40. package/src/config.ts +254 -181
  41. package/src/dependencies.ts +5 -7
  42. package/src/environment.ts +579 -184
  43. package/src/errors.ts +287 -4
  44. package/src/evaluate.ts +1095 -365
  45. package/src/exit-codes.ts +22 -43
  46. package/src/fingerprints.ts +49 -14
  47. package/src/index.ts +11 -0
  48. package/src/instances.ts +73 -60
  49. package/src/java-overrides.ts +183 -66
  50. package/src/json.ts +31 -36
  51. package/src/levels.ts +197 -54
  52. package/src/lexer.ts +127 -30
  53. package/src/liveness-checker.ts +894 -0
  54. package/src/liveness.ts +246 -596
  55. package/src/{obligation-action.ts → obligations/action.ts} +248 -74
  56. package/src/{obligation-anon.ts → obligations/anonymize.ts} +55 -57
  57. package/src/obligations/equality.ts +260 -0
  58. package/src/obligations/expression.ts +618 -0
  59. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  60. package/src/obligations/generate.ts +457 -0
  61. package/src/{obligations.ts → obligations/index.ts} +46 -32
  62. package/src/{obligation-levels.ts → obligations/levels.ts} +44 -40
  63. package/src/obligations/module.ts +445 -0
  64. package/src/obligations/normalize.ts +554 -0
  65. package/src/obligations/operators.ts +176 -0
  66. package/src/obligations/pragma.ts +195 -0
  67. package/src/{obligation-printer.ts → obligations/printer.ts} +65 -230
  68. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
  69. package/src/obligations/regroup.ts +100 -0
  70. package/src/{obligation-generate.ts → obligations/simplify.ts} +130 -536
  71. package/src/{obligation-source.ts → obligations/source.ts} +174 -216
  72. package/src/{obligation-deref.ts → obligations/subexpression.ts} +84 -115
  73. package/src/obligations/substitution.ts +261 -0
  74. package/src/obligations/temporal.ts +321 -0
  75. package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
  76. package/src/parallel-worker.ts +184 -235
  77. package/src/parallel.ts +156 -91
  78. package/src/parser.ts +490 -188
  79. package/src/pcal/ast.ts +755 -0
  80. package/src/pcal/parse.ts +1487 -0
  81. package/src/pcal/tokenize.ts +487 -0
  82. package/src/pcal/translate.ts +1151 -0
  83. package/src/pcal/validate.ts +444 -0
  84. package/src/prover/decide-pool.ts +95 -0
  85. package/src/prover/deciders.ts +33 -0
  86. package/src/prover/first-order.ts +175 -0
  87. package/src/prover/isabelle/LICENSE +36 -0
  88. package/src/prover/isabelle/LICENSE-tlapm +26 -0
  89. package/src/prover/isabelle/decide.ts +44 -0
  90. package/src/prover/isabelle/encode.ts +445 -0
  91. package/src/prover/isabelle/isar/inner-syntax.ts +579 -0
  92. package/src/prover/isabelle/isar/method.ts +367 -0
  93. package/src/prover/isabelle/isar/proof.ts +28 -0
  94. package/src/prover/isabelle/isar/statement.ts +57 -0
  95. package/src/prover/isabelle/isar/theory.ts +192 -0
  96. package/src/prover/isabelle/isar/type-check.ts +278 -0
  97. package/src/prover/isabelle/provers/blast/blast.ts +258 -0
  98. package/src/prover/isabelle/provers/blast/branch.ts +322 -0
  99. package/src/prover/isabelle/provers/blast/prove.ts +347 -0
  100. package/src/prover/isabelle/provers/blast/rules.ts +330 -0
  101. package/src/prover/isabelle/provers/blast/state.ts +180 -0
  102. package/src/prover/isabelle/provers/blast/term.ts +546 -0
  103. package/src/prover/isabelle/provers/clasimp.ts +150 -0
  104. package/src/prover/isabelle/provers/classical.ts +389 -0
  105. package/src/prover/isabelle/provers/hypsubst.ts +433 -0
  106. package/src/prover/isabelle/pure/bicompose.ts +174 -0
  107. package/src/prover/isabelle/pure/consts.ts +32 -0
  108. package/src/prover/isabelle/pure/conv.ts +79 -0
  109. package/src/prover/isabelle/pure/drule.ts +264 -0
  110. package/src/prover/isabelle/pure/envir.ts +331 -0
  111. package/src/prover/isabelle/pure/goal.ts +53 -0
  112. package/src/prover/isabelle/pure/interrupt.ts +16 -0
  113. package/src/prover/isabelle/pure/list.ts +12 -0
  114. package/src/prover/isabelle/pure/logic.ts +330 -0
  115. package/src/prover/isabelle/pure/name.ts +98 -0
  116. package/src/prover/isabelle/pure/net.ts +215 -0
  117. package/src/prover/isabelle/pure/object-logic.ts +41 -0
  118. package/src/prover/isabelle/pure/pattern.ts +631 -0
  119. package/src/prover/isabelle/pure/raw-simplifier.ts +338 -0
  120. package/src/prover/isabelle/pure/rewriter.ts +602 -0
  121. package/src/prover/isabelle/pure/search.ts +68 -0
  122. package/src/prover/isabelle/pure/seq.ts +133 -0
  123. package/src/prover/isabelle/pure/simplifier.ts +106 -0
  124. package/src/prover/isabelle/pure/table.ts +201 -0
  125. package/src/prover/isabelle/pure/tactic.ts +168 -0
  126. package/src/prover/isabelle/pure/tactical.ts +264 -0
  127. package/src/prover/isabelle/pure/term-ord.ts +105 -0
  128. package/src/prover/isabelle/pure/term.ts +688 -0
  129. package/src/prover/isabelle/pure/thm.ts +783 -0
  130. package/src/prover/isabelle/pure/type.ts +121 -0
  131. package/src/prover/isabelle/pure/unify.ts +753 -0
  132. package/src/prover/isabelle/pure/variable.ts +25 -0
  133. package/src/prover/isabelle/tla/classical-setup.ts +101 -0
  134. package/src/prover/isabelle/tla/context.ts +74 -0
  135. package/src/prover/isabelle/tla/logic-data.ts +5 -0
  136. package/src/prover/isabelle/tla/logic.ts +215 -0
  137. package/src/prover/isabelle/tla/simpdata.ts +241 -0
  138. package/src/prover/isabelle/tools/intuitionistic.ts +132 -0
  139. package/src/prover/ocaml.ts +22 -0
  140. package/src/prover/prep/action.ts +508 -0
  141. package/src/prover/prep/enabled-axioms.ts +189 -0
  142. package/src/prover/prep/fingerprint.ts +388 -0
  143. package/src/prover/prep/level-comparison.ts +529 -0
  144. package/src/prover/prep/md5.ts +60 -0
  145. package/src/prover/prep/methods.ts +221 -0
  146. package/src/prover/prep/normalize.ts +309 -0
  147. package/src/prover/prove-worker.ts +22 -0
  148. package/src/prover/prove.ts +492 -0
  149. package/src/prover/ptl/decide.ts +68 -0
  150. package/src/prover/ptl/encode.ts +244 -0
  151. package/src/prover/ptl/sat.ts +151 -0
  152. package/src/prover/ptl/tableau.ts +276 -0
  153. package/src/prover/smt/axioms.ts +209 -0
  154. package/src/prover/smt/context.ts +108 -0
  155. package/src/prover/smt/data.ts +636 -0
  156. package/src/prover/smt/encode.ts +275 -0
  157. package/src/prover/smt/extensionality.ts +65 -0
  158. package/src/prover/smt/flatten.ts +112 -0
  159. package/src/prover/smt/format.ts +154 -0
  160. package/src/prover/smt/instances.ts +181 -0
  161. package/src/prover/smt/rewrite.ts +766 -0
  162. package/src/prover/smt/solver/act-cache.ts +265 -0
  163. package/src/prover/smt/solver/arith-rewriter.ts +962 -0
  164. package/src/prover/smt/solver/array.ts +22 -0
  165. package/src/prover/smt/solver/asserted-formulas.ts +469 -0
  166. package/src/prover/smt/solver/ast-lt.ts +157 -0
  167. package/src/prover/smt/solver/ast-util.ts +91 -0
  168. package/src/prover/smt/solver/ast.ts +1315 -0
  169. package/src/prover/smt/solver/auf-solver.ts +572 -0
  170. package/src/prover/smt/solver/case-split-queue.ts +178 -0
  171. package/src/prover/smt/solver/cg-table.ts +175 -0
  172. package/src/prover/smt/solver/clause.ts +276 -0
  173. package/src/prover/smt/solver/conflict-resolution.ts +343 -0
  174. package/src/prover/smt/solver/context.ts +1292 -0
  175. package/src/prover/smt/solver/ctx-simplify.ts +334 -0
  176. package/src/prover/smt/solver/der.ts +224 -0
  177. package/src/prover/smt/solver/dyn-ack.ts +141 -0
  178. package/src/prover/smt/solver/e-matching.ts +659 -0
  179. package/src/prover/smt/solver/enode.ts +259 -0
  180. package/src/prover/smt/solver/expr-ref.ts +21 -0
  181. package/src/prover/smt/solver/expr-safe-replace.ts +172 -0
  182. package/src/prover/smt/solver/fingerprints.ts +92 -0
  183. package/src/prover/smt/solver/flat-literals.ts +51 -0
  184. package/src/prover/smt/solver/goal.ts +138 -0
  185. package/src/prover/smt/solver/hash.ts +173 -0
  186. package/src/prover/smt/solver/hashtable.ts +166 -0
  187. package/src/prover/smt/solver/internalizer.ts +1381 -0
  188. package/src/prover/smt/solver/lbool.ts +5 -0
  189. package/src/prover/smt/solver/literal.ts +24 -0
  190. package/src/prover/smt/solver/lp/bound-propagator.ts +391 -0
  191. package/src/prover/smt/solver/lp/constraints.ts +78 -0
  192. package/src/prover/smt/solver/lp/containers.ts +296 -0
  193. package/src/prover/smt/solver/lp/core-solver.ts +504 -0
  194. package/src/prover/smt/solver/lp/cross-nested.ts +224 -0
  195. package/src/prover/smt/solver/lp/dep-intervals.ts +642 -0
  196. package/src/prover/smt/solver/lp/dependency.ts +51 -0
  197. package/src/prover/smt/solver/lp/dioph-eq.ts +1181 -0
  198. package/src/prover/smt/solver/lp/explanation.ts +46 -0
  199. package/src/prover/smt/solver/lp/gomory.ts +255 -0
  200. package/src/prover/smt/solver/lp/hnf-cutter.ts +125 -0
  201. package/src/prover/smt/solver/lp/hnf.ts +281 -0
  202. package/src/prover/smt/solver/lp/int-cube.ts +295 -0
  203. package/src/prover/smt/solver/lp/int-solver.ts +514 -0
  204. package/src/prover/smt/solver/lp/lar-solver.ts +816 -0
  205. package/src/prover/smt/solver/lp/lar-term.ts +62 -0
  206. package/src/prover/smt/solver/lp/lp-settings.ts +91 -0
  207. package/src/prover/smt/solver/lp/maximize-term.ts +347 -0
  208. package/src/prover/smt/solver/lp/nex-creator.ts +381 -0
  209. package/src/prover/smt/solver/lp/nex.ts +120 -0
  210. package/src/prover/smt/solver/lp/nla-backoff.ts +43 -0
  211. package/src/prover/smt/solver/lp/nla-basics.ts +398 -0
  212. package/src/prover/smt/solver/lp/nla-core.ts +968 -0
  213. package/src/prover/smt/solver/lp/nla-divisions.ts +332 -0
  214. package/src/prover/smt/solver/lp/nla-emonics.ts +373 -0
  215. package/src/prover/smt/solver/lp/nla-factorization.ts +30 -0
  216. package/src/prover/smt/solver/lp/nla-grobner.ts +904 -0
  217. package/src/prover/smt/solver/lp/nla-horner.ts +126 -0
  218. package/src/prover/smt/solver/lp/nla-intervals.ts +265 -0
  219. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  220. package/src/prover/smt/solver/lp/nla-monotone.ts +59 -0
  221. package/src/prover/smt/solver/lp/nla-order.ts +307 -0
  222. package/src/prover/smt/solver/lp/nla-patcher.ts +112 -0
  223. package/src/prover/smt/solver/lp/nla-tangents.ts +251 -0
  224. package/src/prover/smt/solver/lp/nla-throttle.ts +85 -0
  225. package/src/prover/smt/solver/lp/nla-types.ts +124 -0
  226. package/src/prover/smt/solver/lp/nla-var-eqs.ts +141 -0
  227. package/src/prover/smt/solver/lp/nra-solver.ts +440 -0
  228. package/src/prover/smt/solver/lp/numeric-pair.ts +65 -0
  229. package/src/prover/smt/solver/lp/pdd-interval.ts +31 -0
  230. package/src/prover/smt/solver/lp/pdd-simplifier.ts +184 -0
  231. package/src/prover/smt/solver/lp/pdd-solver.ts +408 -0
  232. package/src/prover/smt/solver/lp/pdd.ts +971 -0
  233. package/src/prover/smt/solver/lp/random-updater.ts +138 -0
  234. package/src/prover/smt/solver/lp/static-matrix.ts +246 -0
  235. package/src/prover/smt/solver/lp/union-find.ts +96 -0
  236. package/src/prover/smt/solver/mam-compiler.ts +847 -0
  237. package/src/prover/smt/solver/mam-interpreter.ts +400 -0
  238. package/src/prover/smt/solver/maximize-ac-sharing.ts +118 -0
  239. package/src/prover/smt/solver/model-checker.ts +347 -0
  240. package/src/prover/smt/solver/model-evaluator.ts +262 -0
  241. package/src/prover/smt/solver/model-finder.ts +155 -0
  242. package/src/prover/smt/solver/model-generator.ts +97 -0
  243. package/src/prover/smt/solver/model-macro-solver.ts +728 -0
  244. package/src/prover/smt/solver/nlsat/algebraic.ts +1161 -0
  245. package/src/prover/smt/solver/nlsat/atoms.ts +238 -0
  246. package/src/prover/smt/solver/nlsat/evaluator.ts +303 -0
  247. package/src/prover/smt/solver/nlsat/explain.ts +607 -0
  248. package/src/prover/smt/solver/nlsat/interval-set.ts +351 -0
  249. package/src/prover/smt/solver/nlsat/levelwise.ts +737 -0
  250. package/src/prover/smt/solver/nlsat/mpbq.ts +161 -0
  251. package/src/prover/smt/solver/nlsat/polynomial.ts +1722 -0
  252. package/src/prover/smt/solver/nlsat/solver.ts +911 -0
  253. package/src/prover/smt/solver/nlsat/types.ts +43 -0
  254. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  255. package/src/prover/smt/solver/nlsat/upolynomial.ts +996 -0
  256. package/src/prover/smt/solver/nnf.ts +469 -0
  257. package/src/prover/smt/solver/pattern-inference.ts +351 -0
  258. package/src/prover/smt/solver/poly-rewriter.ts +477 -0
  259. package/src/prover/smt/solver/propagate-values.ts +83 -0
  260. package/src/prover/smt/solver/proto-model.ts +551 -0
  261. package/src/prover/smt/solver/pull-quant.ts +139 -0
  262. package/src/prover/smt/solver/qe-lite-der.ts +526 -0
  263. package/src/prover/smt/solver/qe-lite-fm.ts +576 -0
  264. package/src/prover/smt/solver/qe-lite.ts +381 -0
  265. package/src/prover/smt/solver/qi-queue.ts +362 -0
  266. package/src/prover/smt/solver/quant-tactics.ts +117 -0
  267. package/src/prover/smt/solver/quantifier-analyzer.ts +562 -0
  268. package/src/prover/smt/solver/quantifier-manager.ts +186 -0
  269. package/src/prover/smt/solver/random-gen.ts +10 -0
  270. package/src/prover/smt/solver/rational.ts +165 -0
  271. package/src/prover/smt/solver/ref-vector.ts +62 -0
  272. package/src/prover/smt/solver/relevancy.ts +247 -0
  273. package/src/prover/smt/solver/rewriter-tpl.ts +1159 -0
  274. package/src/prover/smt/solver/rewriter.ts +843 -0
  275. package/src/prover/smt/solver/rlimit.ts +79 -0
  276. package/src/prover/smt/solver/smtlib-parser.ts +526 -0
  277. package/src/prover/smt/solver/solver.ts +71 -0
  278. package/src/prover/smt/solver/sort.ts +35 -0
  279. package/src/prover/smt/solver/sticky-generations.ts +69 -0
  280. package/src/prover/smt/solver/theory-lra-axioms.ts +340 -0
  281. package/src/prover/smt/solver/theory-lra-bounds.ts +226 -0
  282. package/src/prover/smt/solver/theory-lra-final-check.ts +252 -0
  283. package/src/prover/smt/solver/theory-lra-internalize.ts +476 -0
  284. package/src/prover/smt/solver/theory-lra-model.ts +243 -0
  285. package/src/prover/smt/solver/theory-lra-propagate.ts +405 -0
  286. package/src/prover/smt/solver/theory-lra-state.ts +43 -0
  287. package/src/prover/smt/solver/theory-lra.ts +56 -0
  288. package/src/prover/smt/solver/var-subst.ts +258 -0
  289. package/src/prover/smt/solver/z3-license.txt +10 -0
  290. package/src/prover/smt/table.ts +170 -0
  291. package/src/prover/tlapm/cache.ts +236 -0
  292. package/src/prover/tlapm/ocaml-marshal.ts +166 -0
  293. package/src/prover/tlapm/tlapm.ts +96 -0
  294. package/src/prover/tlaps-module.ts +510 -0
  295. package/src/prover/verdict.ts +13 -0
  296. package/src/prover/zenon/LICENSE +32 -0
  297. package/src/prover/zenon/check/check.ts +105 -0
  298. package/src/prover/zenon/check/definitions.ts +144 -0
  299. package/src/prover/zenon/check/equality.ts +182 -0
  300. package/src/prover/zenon/check/functions.ts +62 -0
  301. package/src/prover/zenon/check/keys.ts +125 -0
  302. package/src/prover/zenon/check/propositional.ts +104 -0
  303. package/src/prover/zenon/check/records.ts +188 -0
  304. package/src/prover/zenon/check/relations.ts +121 -0
  305. package/src/prover/zenon/check/rewrites.ts +224 -0
  306. package/src/prover/zenon/check/sets.ts +302 -0
  307. package/src/prover/zenon/check/terms.ts +127 -0
  308. package/src/prover/zenon/check/tla.ts +126 -0
  309. package/src/prover/zenon/decide.ts +107 -0
  310. package/src/prover/zenon/encode.ts +378 -0
  311. package/src/prover/zenon/eqrel.ts +300 -0
  312. package/src/prover/zenon/equality-rules.ts +435 -0
  313. package/src/prover/zenon/expr.ts +551 -0
  314. package/src/prover/zenon/index-table.ts +350 -0
  315. package/src/prover/zenon/isar-case.ts +513 -0
  316. package/src/prover/zenon/isar.ts +1249 -0
  317. package/src/prover/zenon/limits.ts +15 -0
  318. package/src/prover/zenon/llproof.ts +173 -0
  319. package/src/prover/zenon/mltoll.ts +1566 -0
  320. package/src/prover/zenon/node.ts +297 -0
  321. package/src/prover/zenon/ocaml.ts +169 -0
  322. package/src/prover/zenon/parse.ts +247 -0
  323. package/src/prover/zenon/phrase.ts +191 -0
  324. package/src/prover/zenon/proof.ts +198 -0
  325. package/src/prover/zenon/propositional-rules.ts +387 -0
  326. package/src/prover/zenon/rules.ts +94 -0
  327. package/src/prover/zenon/search.ts +288 -0
  328. package/src/prover/zenon/tla/functions.ts +151 -0
  329. package/src/prover/zenon/tla/llproof.ts +480 -0
  330. package/src/prover/zenon/tla/records.ts +225 -0
  331. package/src/prover/zenon/tla/rewrites.ts +447 -0
  332. package/src/prover/zenon/tla/sets.ts +304 -0
  333. package/src/prover/zenon/tla/terms.ts +162 -0
  334. package/src/prover/zenon/tla/tla.ts +506 -0
  335. package/src/randomization.ts +39 -27
  336. package/src/resolve.ts +1474 -426
  337. package/src/runtime.ts +25 -7
  338. package/src/sany/builtins.ts +147 -0
  339. package/src/sany/generator.ts +3111 -0
  340. package/src/sany/levels.ts +1205 -0
  341. package/src/sany/lexer.ts +544 -0
  342. package/src/sany/linter.ts +122 -0
  343. package/src/sany/modules.ts +1398 -0
  344. package/src/sany/nodes.ts +463 -0
  345. package/src/sany/parse-error.ts +2161 -0
  346. package/src/sany/report.ts +355 -0
  347. package/src/sany/selectors.ts +736 -0
  348. package/src/sany/source.ts +247 -0
  349. package/src/sany/xml.ts +1016 -0
  350. package/src/search.ts +969 -0
  351. package/src/spec-description.ts +66 -29
  352. package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
  353. package/src/standard-modules.ts +215 -164
  354. package/src/state-graph.ts +181 -0
  355. package/src/subexpressions.ts +231 -171
  356. package/src/substitution-levels.ts +40 -19
  357. package/src/successors.ts +253 -125
  358. package/src/symmetry.ts +194 -54
  359. package/src/tableau.ts +60 -32
  360. package/src/tlc/fingerprint.ts +214 -0
  361. package/src/{tlc-modules.ts → tlc/jar-data.ts} +4 -0
  362. package/src/tlc/messages.ts +441 -0
  363. package/src/{tlc-order.ts → tlc/order.ts} +84 -16
  364. package/src/{tlc-random.ts → tlc/random.ts} +30 -189
  365. package/src/tlc/replay.ts +659 -0
  366. package/src/{tlc-summary.ts → tlc/summary.ts} +20 -5
  367. package/src/{tlc-module.ts → tlc/tlc-operators.ts} +59 -50
  368. package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +63 -45
  369. package/src/tlc/version.ts +19 -0
  370. package/src/transfer.ts +44 -32
  371. package/src/values.ts +843 -241
  372. package/src/worker.ts +62 -0
  373. package/dist/parallel.cjs +0 -12
  374. package/dist/parallel.js +0 -12
  375. package/dist/run-cli.cjs +0 -28
  376. package/dist/run-cli.js +0 -28
  377. package/src/canonical.ts +0 -39
  378. package/src/cli-options.ts +0 -58
  379. package/src/obligation-expression.ts +0 -1060
  380. package/src/obligation-module.ts +0 -1042
  381. package/src/run-cli.ts +0 -478
@@ -1,10 +1,11 @@
1
1
  // TLC orders strings and model values by when it first interned their text, and compares a
2
2
  // state's variables in the order of SANY's symbol table. This reproduces both orders.
3
- import type { Module, SourceLocation } from "./ast";
4
- import type { ConfigValue, ModelConfig } from "./config";
5
- import { tokenize, type Token } from "./lexer";
6
- import { extractModule, parseModule } from "./parser";
7
- import { isBefore } from "./resolve";
3
+ import type { Module, SourceLocation } from "../ast";
4
+ import type { ConfigValue, ModelConfig } from "../config";
5
+ import { createMissingModuleError } from "../errors";
6
+ import { tokenize, type Token } from "../lexer";
7
+ import { extractModule, parseModule } from "../parser";
8
+ import { isBefore } from "../resolve";
8
9
  import {
9
10
  SANY_BUILTINS,
10
11
  SANY_NODE_NAMES,
@@ -12,7 +13,8 @@ import {
12
13
  TLC_MODULE_SOURCES,
13
14
  TLC_RUNTIME_STRINGS,
14
15
  TLC_STARTUP_STRINGS,
15
- } from "./tlc-modules";
16
+ USER_STANDARD_MODULES,
17
+ } from "./jar-data";
16
18
 
17
19
  type SymbolKind = "builtin" | "constant" | "variable" | "definition" | "theorem" | "module";
18
20
 
@@ -166,6 +168,9 @@ const getModuleReferences = (
166
168
  innerModules.set(name, inner.references);
167
169
  references.inner.push(inner.references);
168
170
  index = inner.end;
171
+ } else if (tokens[index - 1]?.text === ".") {
172
+ // A record field named EXTENDS or INSTANCE, as in r.EXTENDS or [r EXCEPT !.INSTANCE = 0].
173
+ continue;
169
174
  } else if (token.text === "EXTENDS") {
170
175
  const names = getDeclarations(tokens, index + 1);
171
176
  references.extends.push(...names);
@@ -184,9 +189,18 @@ const isAdjacent = (left: Token, right: Token | undefined) =>
184
189
  right.line === left.line &&
185
190
  right.column === left.column + left.text.length;
186
191
 
192
+ const STRING_ESCAPES: Record<string, string> = {
193
+ "\\": "\\\\",
194
+ '"': '\\"',
195
+ "\n": "\\n",
196
+ "\t": "\\t",
197
+ "\r": "\\r",
198
+ "\f": "\\f",
199
+ };
200
+
187
201
  // The texts SANY interns while parsing, in order. SANY reads a proof step label such as <1>2 and
188
- // a module header such as ---- MODULE as one token, and interns a string literal's contents only
189
- // during semantic analysis.
202
+ // a module header such as ---- MODULE as one token. It interns a string literal as written, quotes
203
+ // included, and interns the literal's contents only during semantic analysis.
190
204
  const getParsedTexts = (tokens: Token[]) => {
191
205
  const texts: string[] = [];
192
206
  for (let index = 0; index < tokens.length; index++) {
@@ -202,11 +216,19 @@ const getParsedTexts = (tokens: Token[]) => {
202
216
  continue;
203
217
  }
204
218
  const isHeader = token.text === "MODULE" && tokens[index - 1]?.kind === "Separator";
205
- if (token.kind !== "String" && !isHeader) texts.push(token.text);
219
+ if (isHeader) continue;
220
+ texts.push(
221
+ token.kind === "String"
222
+ ? `"${token.text.replace(/[\\"\n\t\r\f]/g, (character) => STRING_ESCAPES[character])}"`
223
+ : token.text,
224
+ );
206
225
  }
207
226
  return texts;
208
227
  };
209
228
 
229
+ // A module starts with ---- MODULE Name, so its third token is its name.
230
+ const getModuleName = (tokens: Token[]) => tokens[2]?.text;
231
+
210
232
  const getRanges = (tokens: Token[]) => {
211
233
  const ranges = new Map<string, { start: number; end: number }>();
212
234
  const open: { name: string; start: number }[] = [];
@@ -238,10 +260,13 @@ const createModuleSet = (source: string, loadModule: ModuleLoader) => {
238
260
  const text =
239
261
  name === undefined
240
262
  ? source
241
- : (TLC_MODULE_SOURCES.get(name) ?? loadModule?.(name) ?? extractModule(source, name));
263
+ : ((USER_STANDARD_MODULES.has(name) ? loadModule?.(name) : undefined) ??
264
+ TLC_MODULE_SOURCES.get(name) ??
265
+ loadModule?.(name) ??
266
+ extractModule(source, name));
242
267
  const tokens = text === undefined ? [] : tokenize(text);
243
268
  const ranges = getRanges(tokens);
244
- const range = ranges.get(tokens[2]?.text ?? "") ?? { start: 0, end: 0 };
269
+ const range = ranges.get(getModuleName(tokens) ?? "") ?? { start: 0, end: 0 };
245
270
  const parsed = { module: undefined as Module | undefined };
246
271
  const file = {
247
272
  tokens,
@@ -264,9 +289,8 @@ const createModuleSet = (source: string, loadModule: ModuleLoader) => {
264
289
  (name === undefined ? undefined : nestedModules.get(name)) ?? getFile(name);
265
290
  };
266
291
 
267
- // The variables in the order TLC compares them: the reverse of the root module's context
268
- // enumeration, as ModuleNode.getVariableDecls returns them.
269
- export const getTlcVariableOrder = (source: string, loadModule: ModuleLoader): string[] => {
292
+ // SANY's Context of each module, which the root module has under undefined.
293
+ const createContexts = (source: string, loadModule: ModuleLoader) => {
270
294
  const getParsed = createModuleSet(source, loadModule);
271
295
  const getUnits = (unit: ParsedModule) => {
272
296
  const tokens = unit.tokens;
@@ -367,6 +391,8 @@ export const getTlcVariableOrder = (source: string, loadModule: ModuleLoader): s
367
391
  };
368
392
 
369
393
  const contexts = new Map<string, SymbolTable>();
394
+ // Where the entries a module adds itself start, after those of the modules it extends.
395
+ const ownStarts = new Map<SymbolTable, number>();
370
396
  const getContext = (name: string | undefined): SymbolTable => {
371
397
  const cached = contexts.get(name ?? "");
372
398
  if (cached) return cached;
@@ -381,16 +407,53 @@ export const getTlcVariableOrder = (source: string, loadModule: ModuleLoader): s
381
407
  if (!entry.isLocal) table.put(entry);
382
408
  }),
383
409
  );
410
+ ownStarts.set(table, table.inserted.length);
384
411
  getUnits(unit).forEach((item) => item.apply(table));
385
412
  return table;
386
413
  };
387
- return getContext(undefined)
414
+ return {
415
+ getContext,
416
+ getOwnEntries: (name: string | undefined) => {
417
+ const table = getContext(name);
418
+ return table.inserted.slice(ownStarts.get(table));
419
+ },
420
+ };
421
+ };
422
+
423
+ // The variables or constants of the root module in the reverse of its context enumeration, as
424
+ // ModuleNode.getVariableDecls and getConstantDecls return them. TLC compares variables in this
425
+ // order, and checks that the configuration assigns each constant in it.
426
+ export const getTlcDeclarationOrder = (
427
+ source: string,
428
+ loadModule: ModuleLoader,
429
+ kind: "variable" | "constant",
430
+ ): string[] =>
431
+ createContexts(source, loadModule)
432
+ .getContext(undefined)
388
433
  .enumerate()
389
- .filter((entry) => entry.kind === "variable")
434
+ .filter((entry) => entry.kind === kind)
390
435
  .map((entry) => entry.name)
391
436
  .reverse();
437
+
438
+ // The names of the definitions each module adds to its context, in the order of
439
+ // ModuleNode.getOpDefs, in which TLC computes the constant definitions as it starts. An INSTANCE
440
+ // adds the definitions of the module it instantiates in the order that module's Hashtable
441
+ // enumerates them.
442
+ export const createTlcDefinitionOrder = (source: string, loadModule: ModuleLoader) => {
443
+ const contexts = createContexts(source, loadModule);
444
+ // The root module's context reads every file of the spec, and so finds the modules nested in
445
+ // the files it extends or instantiates.
446
+ contexts.getContext(undefined);
447
+ return (name: string | undefined) =>
448
+ contexts
449
+ .getOwnEntries(name)
450
+ .filter((entry) => entry.kind === "definition")
451
+ .map((entry) => entry.name);
392
452
  };
393
453
 
454
+ export const getTlcVariableOrder = (source: string, loadModule: ModuleLoader) =>
455
+ getTlcDeclarationOrder(source, loadModule, "variable");
456
+
394
457
  // Every string TLC interns before model checking starts, in order: values in the config, TLC's
395
458
  // startup strings, each module's tokens in the order SpecObj.loadSpec parses the modules, string
396
459
  // literals in semantic analysis order, and the names TLC interns for TLCGet.
@@ -474,6 +537,11 @@ export const getTlcStringOrder = (
474
537
  dependencies.set(module.unit, [...(dependencies.get(module.unit) ?? []), name]);
475
538
  if (parsedUnits.has(name)) continue;
476
539
  parsedUnits.add(name);
540
+ // SANY stops at the first module it can't find, in the order it reads them.
541
+ if (getParsed(name).tokens.length === 0) {
542
+ const importer = module.unit ?? getModuleName(getParsed(undefined).tokens);
543
+ throw createMissingModuleError(name, importer);
544
+ }
477
545
  getParsedTexts(getUnitTokens(name)).forEach(intern);
478
546
  }
479
547
  SEMANTIC_PRELUDE.forEach(intern);
@@ -1,17 +1,14 @@
1
- import { TlaEvaluationError } from "./errors";
1
+ import { TlaEvaluationError } from "../errors";
2
+ import type { TlcVersion } from "./version";
2
3
  import {
3
4
  createRecord,
4
5
  createSortedFunction,
5
6
  createTuple,
6
7
  getFunctionDomain,
7
- getStringRank,
8
8
  isEmptySet,
9
- isFunctionValue,
10
- isModelValue,
11
- toFiniteFunction,
12
9
  toFiniteSet,
13
10
  type Value,
14
- } from "./values";
11
+ } from "../values";
15
12
 
16
13
  export interface JavaRandom {
17
14
  setSeed: (seed: bigint) => void;
@@ -49,186 +46,6 @@ export const createJavaRandom = (seed: bigint): JavaRandom => {
49
46
  };
50
47
  };
51
48
 
52
- // FP64 with TLC's first irreducible polynomial, FP64.Polys[0], which `-fp 0` selects.
53
- const IRREDUCIBLE_POLYNOMIAL = 0x911498ae0e66bad6n;
54
-
55
- const BYTE_MOD_TABLE = (() => {
56
- const powers: bigint[] = [];
57
- for (let power = 1n << 63n; powers.length < 72;) {
58
- powers.push(power);
59
- power = (power >> 1n) ^ ((power & 1n) === 0n ? 0n : IRREDUCIBLE_POLYNOMIAL);
60
- }
61
- return Array.from({ length: 256 }, (_, byte) =>
62
- powers
63
- .slice(64, 72)
64
- .reverse()
65
- .reduce((value, power, bit) => ((byte >> bit) & 1 ? value ^ power : value), 0n),
66
- );
67
- })();
68
-
69
- const BYTE_MOD_HIGH = Int32Array.from(BYTE_MOD_TABLE, (entry) =>
70
- Number(BigInt.asIntN(32, entry >> 32n)),
71
- );
72
- const BYTE_MOD_LOW = Int32Array.from(BYTE_MOD_TABLE, (entry) => Number(BigInt.asIntN(32, entry)));
73
-
74
- // The fingerprint being extended, as its high and low 32 bits, which avoids a BigInt operation
75
- // for every byte.
76
- const INITIAL_HIGH = Number(BigInt.asIntN(32, IRREDUCIBLE_POLYNOMIAL >> 32n));
77
- const INITIAL_LOW = Number(BigInt.asIntN(32, IRREDUCIBLE_POLYNOMIAL));
78
- let high = INITIAL_HIGH;
79
- let low = INITIAL_LOW;
80
-
81
- const extendByte = (byte: number) => {
82
- const index = (byte ^ low) & 0xff;
83
- low = ((low >>> 8) | (high << 24)) ^ BYTE_MOD_LOW[index];
84
- high = (high >>> 8) ^ BYTE_MOD_HIGH[index];
85
- };
86
-
87
- const extendInt = (value: number) => {
88
- for (let shift = 0; shift < 32; shift += 8) extendByte(value >>> shift);
89
- };
90
-
91
- const BOOL_VALUE = 0;
92
- const INT_VALUE = 1;
93
- const STRING_VALUE = 3;
94
- const SET_ENUM_VALUE = 5;
95
- const FCN_RCD_VALUE = 9;
96
- const MODEL_VALUE = 21;
97
-
98
- // Value#fingerPrint for each of TLC's value classes. A model value extends the fingerprint with
99
- // its UniqueString token, and TLC numbers tokens from 1 in intern order.
100
- const extendValue = (value: Value) => {
101
- if (typeof value === "boolean") {
102
- extendByte(BOOL_VALUE);
103
- extendByte(value ? 116 : 102);
104
- } else if (typeof value === "number") {
105
- extendByte(INT_VALUE);
106
- extendInt(value);
107
- } else if (typeof value === "string") {
108
- extendByte(STRING_VALUE);
109
- extendInt(value.length);
110
- for (let index = 0; index < value.length; index++) {
111
- extendByte(value.charCodeAt(index));
112
- }
113
- } else if (isModelValue(value)) {
114
- extendByte(MODEL_VALUE);
115
- extendInt(getStringRank(value.name) + 1);
116
- } else if (isFunctionValue(value)) {
117
- const functionValue = toFiniteFunction(value);
118
- extendByte(FCN_RCD_VALUE);
119
- extendInt(functionValue.domain.length);
120
- for (let index = 0; index < functionValue.domain.length; index++) {
121
- extendValue(functionValue.domain[index]);
122
- extendValue(functionValue.range[index]);
123
- }
124
- } else {
125
- const elements = toFiniteSet(value).elements;
126
- extendByte(SET_ENUM_VALUE);
127
- extendInt(elements.length);
128
- for (const element of elements) extendValue(element);
129
- }
130
- };
131
-
132
- // TLCStateMut#fingerPrint of variable values in TLC's variable order. Evaluating a lazy value can
133
- // fingerprint another, so this restores the fingerprint it interrupts.
134
- export const getTlcFingerprint = (state: Value[]) => {
135
- const outer = { high, low };
136
- high = INITIAL_HIGH;
137
- low = INITIAL_LOW;
138
- for (const value of state) extendValue(value);
139
- const fingerprint = (BigInt(high >>> 0) << 32n) | BigInt(low >>> 0);
140
- high = outer.high;
141
- low = outer.low;
142
- return fingerprint;
143
- };
144
-
145
- const getFingerprintLength = (value: Value): number => {
146
- if (typeof value === "boolean") return 2;
147
- if (typeof value === "number" || isModelValue(value)) return 5;
148
- if (typeof value === "string") return 5 + value.length;
149
- if (isFunctionValue(value)) {
150
- const functionValue = toFiniteFunction(value);
151
- return functionValue.domain.reduce<number>(
152
- (length, key, index) =>
153
- length + getFingerprintLength(key) + getFingerprintLength(functionValue.range[index]),
154
- 5,
155
- );
156
- }
157
- return toFiniteSet(value).elements.reduce<number>(
158
- (length, element) => length + getFingerprintLength(element),
159
- 5,
160
- );
161
- };
162
-
163
- // The fingerprint after `length` zero bytes, as one table per byte of the fingerprint it shifts.
164
- const createShiftTable = (length: number) => {
165
- const table = new Int32Array(8 * 256 * 2);
166
- for (let bit = 0; bit < 64; bit++) {
167
- high = bit < 32 ? 0 : 1 << (bit - 32);
168
- low = bit < 32 ? 1 << bit : 0;
169
- for (let step = 0; step < length; step++) extendByte(0);
170
- const position = bit >> 3;
171
- const mask = 1 << (bit & 7);
172
- for (let byte = mask; byte < 2 * mask; byte++) {
173
- const entry = (position * 256 + byte) * 2;
174
- const rest = (position * 256 + byte - mask) * 2;
175
- table[entry] = table[rest] ^ high;
176
- table[entry + 1] = table[rest + 1] ^ low;
177
- }
178
- }
179
- return table;
180
- };
181
-
182
- // Extending a fingerprint by a byte is linear over GF(2), so extending it by a value's bytes
183
- // XORs the value's own fingerprint from zero into the fingerprint shifted by their length.
184
- // The fingerprinter caches each distinct variable value for one pass over the stored states.
185
- export const createTlcFingerprinter = () => {
186
- const shiftTables = new Map<number, Int32Array>();
187
- const indices = new Map<Value, number>();
188
- const contributions: number[] = [];
189
- const getContribution = (value: Value) => {
190
- const cached = indices.get(value);
191
- if (cached !== undefined) return cached;
192
- const length = getFingerprintLength(value);
193
- high = 0;
194
- low = 0;
195
- extendValue(value);
196
- indices.set(value, contributions.length);
197
- contributions.push(length, high, low);
198
- return contributions.length - 3;
199
- };
200
- const getShiftTable = (length: number) => {
201
- const cached = shiftTables.get(length);
202
- if (cached) return cached;
203
- const table = createShiftTable(length);
204
- shiftTables.set(length, table);
205
- return table;
206
- };
207
- return (state: Value[]) => {
208
- const outer = { high, low };
209
- const fingerprint = { high: INITIAL_HIGH, low: INITIAL_LOW };
210
- for (const value of state) {
211
- const contribution = getContribution(value);
212
- const table = getShiftTable(contributions[contribution]);
213
- const extended = {
214
- high: contributions[contribution + 1],
215
- low: contributions[contribution + 2],
216
- };
217
- for (let position = 0; position < 8; position++) {
218
- const word = position < 4 ? fingerprint.low : fingerprint.high;
219
- const entry = (position * 256 + ((word >>> ((position & 3) * 8)) & 0xff)) * 2;
220
- extended.high ^= table[entry];
221
- extended.low ^= table[entry + 1];
222
- }
223
- fingerprint.high = extended.high;
224
- fingerprint.low = extended.low;
225
- }
226
- high = outer.high;
227
- low = outer.low;
228
- return (BigInt(fingerprint.high >>> 0) << 32n) | BigInt(fingerprint.low >>> 0);
229
- };
230
- };
231
-
232
49
  // RandomGenerator.primes holds the 1341 consecutive primes from 1277011 to 1295953.
233
50
  const PRIMES: number[] = [];
234
51
 
@@ -286,7 +103,7 @@ const getModulusAndMultiplier = (size: number) => {
286
103
 
287
104
  // EnumerableValue.SubsetEnumerator: count indices below size from a full-period linear
288
105
  // congruential generator that starts at random.nextInt(size).
289
- const getSubsetIndices = (count: number, size: number, random: JavaRandom) => {
106
+ const getSubsetIndicesMaster = (count: number, size: number, random: JavaRandom) => {
290
107
  if (size <= 0) return [];
291
108
  const generator = getModulusAndMultiplier(size);
292
109
  const state = { index: BigInt(random.nextInt(size)) };
@@ -299,6 +116,18 @@ const getSubsetIndices = (count: number, size: number, random: JavaRandom) => {
299
116
  });
300
117
  };
301
118
 
119
+ // TLC 1.7.4's EnumerableValue.SubsetEnumerator: the i-th index is (x * i + a) mod size, for a
120
+ // prime x above size and a = random.nextInt(size), so the first size indices are distinct.
121
+ const getSubsetIndices174 = (count: number, size: number, random: JavaRandom) => {
122
+ if (size <= 0) return [];
123
+ const stride = BigInt(size < 191 ? 191 : MAXIMUM_INT);
124
+ const offset = BigInt(random.nextInt(size));
125
+ return Array.from(
126
+ { length: Math.min(count, size) },
127
+ (_, index) => (stride * BigInt(index) + offset) % BigInt(size),
128
+ );
129
+ };
130
+
302
131
  const LARGE_STRIDE = (1n << 63n) - 1n - 24n;
303
132
 
304
133
  // SetOfFcnsOrRcdsValue.BigIntegerSubsetEnumerator, for products with more than 2^31 - 1
@@ -352,15 +181,27 @@ const getProduct = (set: Value): Product | undefined => {
352
181
  return undefined;
353
182
  };
354
183
 
184
+ // TLC 1.7.4 enumerates a set of tuples to draw from it.
185
+ export const getEnumeratedFactors = (set: Value, version: TlcVersion) =>
186
+ version === "1.7.4" && typeof set === "object" && set.kind === "ProductSet"
187
+ ? set.factors
188
+ : undefined;
189
+
355
190
  // Enumerable#getRandomSubset, which Randomization's RandomSubset calls.
356
- export const getRandomSubset = (count: number, set: Value, random: JavaRandom): Value[] => {
191
+ export const getRandomSubset = (
192
+ count: number,
193
+ set: Value,
194
+ random: JavaRandom,
195
+ version: TlcVersion,
196
+ ): Value[] => {
357
197
  if (isEmptySet(set)) return [];
198
+ const getSubsetIndices = version === "1.7.4" ? getSubsetIndices174 : getSubsetIndicesMaster;
358
199
  if (typeof set === "object" && set.kind === "Interval") {
359
200
  return getSubsetIndices(count, Math.max(0, set.high - set.low + 1), random).map(
360
201
  (index) => set.low + Number(index),
361
202
  );
362
203
  }
363
- const product = getProduct(set);
204
+ const product = getEnumeratedFactors(set, version) ? undefined : getProduct(set);
364
205
  if (product) {
365
206
  const size = product.lists.reduce((total, list) => total * BigInt(list.length), 1n);
366
207
  const indices =