tla-ts 0.0.4-dev.702eb98 → 0.0.4-dev.7714e32
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.
- package/README.md +32 -6
- package/dist/cli.cjs +1 -1
- package/dist/cli.js +1 -1
- package/dist/deciders.cjs +27 -27
- package/dist/deciders.js +34 -34
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +12 -14
- package/dist/index.d.ts +12 -14
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +516 -25
- package/dist/prove.js +518 -27
- package/dist/run.cjs +45 -0
- package/dist/run.js +45 -0
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +76 -86
- package/dist/transfer.js +73 -83
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +1 -1
- package/src/ast.ts +2 -2
- package/src/bags.ts +22 -23
- package/src/builtins.ts +16 -8
- package/src/check.ts +131 -1154
- package/src/{cli-options.ts → cli/options.ts} +54 -9
- package/src/cli/run.ts +63 -0
- package/src/cli/shared.ts +106 -0
- package/src/cli/tlapm.ts +374 -0
- package/src/{run-cli.ts → cli/tlc.ts} +112 -761
- package/src/cli/xml-exporter.ts +221 -0
- package/src/cli.ts +1 -1
- package/src/codegen.ts +17 -15
- package/src/config.ts +5 -5
- package/src/dependencies.ts +4 -6
- package/src/environment.ts +55 -60
- package/src/errors.ts +12 -36
- package/src/evaluate.ts +81 -101
- package/src/exit-codes.ts +1 -1
- package/src/fingerprints.ts +3 -3
- package/src/index.ts +2 -2
- package/src/instances.ts +56 -46
- package/src/java-overrides.ts +79 -41
- package/src/json.ts +31 -36
- package/src/levels.ts +10 -13
- package/src/{live-check.ts → liveness-checker.ts} +169 -142
- package/src/liveness.ts +38 -34
- package/src/obligations/action.ts +58 -105
- package/src/obligations/{anon.ts → anonymize.ts} +44 -52
- package/src/obligations/equality.ts +260 -0
- package/src/obligations/expression.ts +42 -530
- package/src/obligations/format.ts +7 -8
- package/src/obligations/generate.ts +93 -783
- package/src/obligations/index.ts +23 -23
- package/src/obligations/levels.ts +38 -44
- package/src/obligations/module.ts +106 -729
- package/src/obligations/normalize.ts +554 -0
- package/src/obligations/operators.ts +176 -0
- package/src/obligations/pragma.ts +35 -29
- package/src/obligations/printer.ts +98 -209
- package/src/obligations/proof.ts +0 -1
- package/src/obligations/regroup.ts +100 -0
- package/src/obligations/simplify.ts +668 -0
- package/src/obligations/source.ts +92 -192
- package/src/obligations/{deref.ts → subexpression.ts} +82 -113
- package/src/obligations/substitution.ts +261 -0
- package/src/obligations/temporal.ts +32 -30
- package/src/obligations/tuples.ts +37 -53
- package/src/parallel-worker.ts +37 -33
- package/src/parallel.ts +30 -24
- package/src/parser.ts +67 -74
- package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
- package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
- package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
- package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
- package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
- package/src/{prove → prover}/decide-pool.ts +14 -19
- package/src/{prove → prover}/deciders.ts +7 -1
- package/src/{obligations/pickle.ts → prover/first-order.ts} +79 -4
- package/src/{prove → prover}/isabelle/decide.ts +3 -6
- package/src/{prove → prover}/isabelle/encode.ts +106 -138
- package/src/{prove → prover}/isabelle/isar/inner-syntax.ts +1 -1
- package/src/{prove → prover}/isabelle/isar/method.ts +3 -3
- package/src/{prove → prover}/isabelle/isar/type-check.ts +1 -1
- package/src/{prove → prover}/isabelle/provers/blast/blast.ts +1 -1
- package/src/{prove → prover}/isabelle/provers/blast/branch.ts +1 -1
- package/src/{prove → prover}/isabelle/provers/blast/term.ts +3 -4
- package/src/{prove → prover}/isabelle/provers/clasimp.ts +1 -1
- package/src/{prove → prover}/isabelle/provers/classical.ts +3 -3
- package/src/{prove → prover}/isabelle/provers/hypsubst.ts +1 -9
- package/src/{prove → prover}/isabelle/pure/conv.ts +1 -1
- package/src/{prove → prover}/isabelle/pure/drule.ts +2 -2
- package/src/{prove → prover}/isabelle/pure/envir.ts +3 -35
- package/src/{prove → prover}/isabelle/pure/logic.ts +4 -76
- package/src/{prove → prover}/isabelle/pure/name.ts +1 -13
- package/src/{prove → prover}/isabelle/pure/net.ts +2 -49
- package/src/{prove → prover}/isabelle/pure/pattern.ts +3 -22
- package/src/{prove → prover}/isabelle/pure/raw-simplifier.ts +3 -18
- package/src/{prove → prover}/isabelle/pure/seq.ts +0 -23
- package/src/{prove → prover}/isabelle/pure/simplifier.ts +2 -8
- package/src/{prove → prover}/isabelle/pure/table.ts +1 -8
- package/src/{prove → prover}/isabelle/pure/tactic.ts +5 -113
- package/src/{prove → prover}/isabelle/pure/tactical.ts +1 -84
- package/src/{prove → prover}/isabelle/pure/term-ord.ts +1 -55
- package/src/{prove → prover}/isabelle/pure/term.ts +8 -128
- package/src/{prove → prover}/isabelle/pure/thm.ts +4 -27
- package/src/{prove → prover}/isabelle/pure/type.ts +0 -12
- package/src/{prove → prover}/isabelle/pure/unify.ts +1 -1
- package/src/{prove → prover}/isabelle/tla/classical-setup.ts +1 -1
- package/src/{prove → prover}/ocaml.ts +1 -1
- package/src/{prove → prover}/prep/action.ts +54 -66
- package/src/{prove → prover}/prep/enabled-axioms.ts +2 -2
- package/src/{prove → prover}/prep/fingerprint.ts +3 -3
- package/src/{prove → prover}/prep/level-comparison.ts +15 -38
- package/src/{prove → prover}/prep/md5.ts +2 -9
- package/src/{prove/prep/pragma.ts → prover/prep/methods.ts} +4 -4
- package/src/prover/prep/normalize.ts +309 -0
- package/src/{prove → prover}/prove-worker.ts +4 -11
- package/src/prover/prove.ts +492 -0
- package/src/{prove → prover}/ptl/encode.ts +19 -31
- package/src/{prove → prover}/smt/axioms.ts +78 -79
- package/src/{prove → prover}/smt/data.ts +16 -45
- package/src/{prove → prover}/smt/encode.ts +134 -28
- package/src/{prove → prover}/smt/extensionality.ts +14 -12
- package/src/{prove → prover}/smt/flatten.ts +3 -18
- package/src/{prove → prover}/smt/format.ts +14 -3
- package/src/{prove → prover}/smt/instances.ts +4 -5
- package/src/{prove → prover}/smt/rewrite.ts +41 -59
- package/src/{prove → prover}/smt/solver/ast-util.ts +0 -56
- package/src/{prove → prover}/smt/solver/case-split-queue.ts +1 -1
- package/src/{prove → prover}/smt/solver/enode.ts +1 -1
- package/src/{prove → prover}/smt/solver/lp/dep-intervals.ts +0 -14
- package/src/{prove → prover}/smt/solver/model-macro-solver.ts +1 -1
- package/src/{prove → prover}/smt/solver/nlsat/algebraic.ts +3 -3
- package/src/{prove → prover}/smt/solver/nlsat/atoms.ts +1 -1
- package/src/{prove → prover}/smt/solver/nlsat/explain.ts +1 -1
- package/src/{prove → prover}/smt/solver/nlsat/interval-set.ts +1 -1
- package/src/{prove → prover}/smt/solver/nlsat/levelwise.ts +4 -7
- package/src/{prove → prover}/smt/solver/nlsat/polynomial.ts +4 -4
- package/src/{prove → prover}/smt/solver/nlsat/upolynomial.ts +2 -2
- package/src/{prove → prover}/smt/solver/pattern-inference.ts +1 -1
- package/src/{prove → prover}/smt/solver/relevancy.ts +2 -2
- package/src/{prove → prover}/smt/solver/rewriter.ts +1 -1
- package/src/{prove → prover}/smt/solver/solver.ts +2 -2
- package/src/prover/tlapm/cache.ts +236 -0
- package/src/prover/tlapm/ocaml-marshal.ts +166 -0
- package/src/{prove → prover}/tlapm/tlapm.ts +1 -2
- package/src/prover/verdict.ts +13 -0
- package/src/{prove → prover}/zenon/decide.ts +5 -11
- package/src/{prove → prover}/zenon/encode.ts +40 -106
- package/src/{prove → prover}/zenon/eqrel.ts +1 -1
- package/src/{prove → prover}/zenon/equality-rules.ts +1 -1
- package/src/{prove → prover}/zenon/expr.ts +2 -2
- package/src/{prove → prover}/zenon/index-table.ts +1 -1
- package/src/{prove → prover}/zenon/isar.ts +1 -1
- package/src/{prove → prover}/zenon/llproof.ts +1 -1
- package/src/{prove → prover}/zenon/mltoll.ts +1 -1
- package/src/{prove → prover}/zenon/node.ts +1 -1
- package/src/{prove → prover}/zenon/search.ts +1 -1
- package/src/{prove → prover}/zenon/tla/terms.ts +1 -20
- package/src/{prove → prover}/zenon/tla/tla.ts +1 -1
- package/src/randomization.ts +19 -24
- package/src/resolve.ts +15 -22
- package/src/runtime.ts +8 -8
- package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
- package/src/{sany-generator.ts → sany/generator.ts} +38 -55
- package/src/{sany-levels.ts → sany/levels.ts} +45 -48
- package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
- package/src/{sany-linter.ts → sany/linter.ts} +1 -1
- package/src/{sany-modules.ts → sany/modules.ts} +2 -2
- package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
- package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
- package/src/{sany-report.ts → sany/report.ts} +16 -17
- package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
- package/src/{sany-source.ts → sany/source.ts} +6 -7
- package/src/{sany-xml.ts → sany/xml.ts} +5 -6
- package/src/search.ts +969 -0
- package/src/spec-description.ts +26 -20
- package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
- package/src/standard-modules.ts +16 -20
- package/src/state-graph.ts +9 -8
- package/src/substitution-levels.ts +2 -2
- package/src/successors.ts +16 -19
- package/src/symmetry.ts +1 -1
- package/src/tableau.ts +6 -7
- package/src/tlc/fingerprint.ts +214 -0
- package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
- package/src/{tlc-order.ts → tlc/order.ts} +7 -7
- package/src/{tlc-random.ts → tlc/random.ts} +3 -213
- package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
- package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
- package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
- package/src/transfer.ts +32 -32
- package/src/values.ts +72 -67
- package/src/worker.ts +1 -4
- package/dist/run-cli.cjs +0 -38
- package/dist/run-cli.js +0 -38
- package/src/canonical.ts +0 -40
- package/src/obligations/ctx.ts +0 -64
- package/src/prove/prep/defs.ts +0 -27
- package/src/prove/prep/elab.ts +0 -156
- package/src/prove/prep/enabled.ts +0 -43
- package/src/prove/prep/flatten.ts +0 -70
- package/src/prove/prep/trivial.ts +0 -22
- package/src/prove/prove.ts +0 -417
- package/src/prove/smt/axiomatize.ts +0 -69
- package/src/prove/smt/simplify.ts +0 -57
- package/src/prove/verdict.ts +0 -13
- package/src/standard-ranges.ts +0 -116
- package/src/value-sources.ts +0 -29
- /package/src/{prove → prover}/isabelle/LICENSE +0 -0
- /package/src/{prove → prover}/isabelle/LICENSE-tlapm +0 -0
- /package/src/{prove → prover}/isabelle/isar/proof.ts +0 -0
- /package/src/{prove → prover}/isabelle/isar/statement.ts +0 -0
- /package/src/{prove → prover}/isabelle/isar/theory.ts +0 -0
- /package/src/{prove → prover}/isabelle/provers/blast/prove.ts +0 -0
- /package/src/{prove → prover}/isabelle/provers/blast/rules.ts +0 -0
- /package/src/{prove → prover}/isabelle/provers/blast/state.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/bicompose.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/consts.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/goal.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/interrupt.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/list.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/object-logic.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/rewriter.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/search.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/variable.ts +0 -0
- /package/src/{prove → prover}/isabelle/tla/context.ts +0 -0
- /package/src/{prove → prover}/isabelle/tla/logic-data.ts +0 -0
- /package/src/{prove → prover}/isabelle/tla/logic.ts +0 -0
- /package/src/{prove → prover}/isabelle/tla/simpdata.ts +0 -0
- /package/src/{prove → prover}/isabelle/tools/intuitionistic.ts +0 -0
- /package/src/{prove → prover}/ptl/decide.ts +0 -0
- /package/src/{prove → prover}/ptl/sat.ts +0 -0
- /package/src/{prove → prover}/ptl/tableau.ts +0 -0
- /package/src/{prove → prover}/smt/context.ts +0 -0
- /package/src/{prove → prover}/smt/solver/act-cache.ts +0 -0
- /package/src/{prove → prover}/smt/solver/arith-rewriter.ts +0 -0
- /package/src/{prove → prover}/smt/solver/array.ts +0 -0
- /package/src/{prove → prover}/smt/solver/asserted-formulas.ts +0 -0
- /package/src/{prove → prover}/smt/solver/ast-lt.ts +0 -0
- /package/src/{prove → prover}/smt/solver/ast.ts +0 -0
- /package/src/{prove → prover}/smt/solver/auf-solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/cg-table.ts +0 -0
- /package/src/{prove → prover}/smt/solver/clause.ts +0 -0
- /package/src/{prove → prover}/smt/solver/conflict-resolution.ts +0 -0
- /package/src/{prove → prover}/smt/solver/context.ts +0 -0
- /package/src/{prove → prover}/smt/solver/ctx-simplify.ts +0 -0
- /package/src/{prove → prover}/smt/solver/der.ts +0 -0
- /package/src/{prove → prover}/smt/solver/dyn-ack.ts +0 -0
- /package/src/{prove → prover}/smt/solver/e-matching.ts +0 -0
- /package/src/{prove → prover}/smt/solver/expr-ref.ts +0 -0
- /package/src/{prove → prover}/smt/solver/expr-safe-replace.ts +0 -0
- /package/src/{prove → prover}/smt/solver/fingerprints.ts +0 -0
- /package/src/{prove → prover}/smt/solver/flat-literals.ts +0 -0
- /package/src/{prove → prover}/smt/solver/goal.ts +0 -0
- /package/src/{prove → prover}/smt/solver/hash.ts +0 -0
- /package/src/{prove → prover}/smt/solver/hashtable.ts +0 -0
- /package/src/{prove → prover}/smt/solver/internalizer.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lbool.ts +0 -0
- /package/src/{prove → prover}/smt/solver/literal.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/bound-propagator.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/constraints.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/containers.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/core-solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/cross-nested.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/dependency.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/dioph-eq.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/explanation.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/gomory.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/hnf-cutter.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/hnf.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/int-cube.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/int-solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/lar-solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/lar-term.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/lp-settings.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/maximize-term.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nex-creator.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nex.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-backoff.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-basics.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-core.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-divisions.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-emonics.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-factorization.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-grobner.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-horner.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-intervals.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-monomial-bounds.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-monotone.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-order.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-patcher.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-tangents.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-throttle.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-types.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-var-eqs.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nra-solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/numeric-pair.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/pdd-interval.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/pdd-simplifier.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/pdd-solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/pdd.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/random-updater.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/static-matrix.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/union-find.ts +0 -0
- /package/src/{prove → prover}/smt/solver/mam-compiler.ts +0 -0
- /package/src/{prove → prover}/smt/solver/mam-interpreter.ts +0 -0
- /package/src/{prove → prover}/smt/solver/maximize-ac-sharing.ts +0 -0
- /package/src/{prove → prover}/smt/solver/model-checker.ts +0 -0
- /package/src/{prove → prover}/smt/solver/model-evaluator.ts +0 -0
- /package/src/{prove → prover}/smt/solver/model-finder.ts +0 -0
- /package/src/{prove → prover}/smt/solver/model-generator.ts +0 -0
- /package/src/{prove → prover}/smt/solver/nlsat/evaluator.ts +0 -0
- /package/src/{prove → prover}/smt/solver/nlsat/mpbq.ts +0 -0
- /package/src/{prove → prover}/smt/solver/nlsat/solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/nlsat/types.ts +0 -0
- /package/src/{prove → prover}/smt/solver/nlsat/upolynomial-factorization.ts +0 -0
- /package/src/{prove → prover}/smt/solver/nnf.ts +0 -0
- /package/src/{prove → prover}/smt/solver/poly-rewriter.ts +0 -0
- /package/src/{prove → prover}/smt/solver/propagate-values.ts +0 -0
- /package/src/{prove → prover}/smt/solver/proto-model.ts +0 -0
- /package/src/{prove → prover}/smt/solver/pull-quant.ts +0 -0
- /package/src/{prove → prover}/smt/solver/qe-lite-der.ts +0 -0
- /package/src/{prove → prover}/smt/solver/qe-lite-fm.ts +0 -0
- /package/src/{prove → prover}/smt/solver/qe-lite.ts +0 -0
- /package/src/{prove → prover}/smt/solver/qi-queue.ts +0 -0
- /package/src/{prove → prover}/smt/solver/quant-tactics.ts +0 -0
- /package/src/{prove → prover}/smt/solver/quantifier-analyzer.ts +0 -0
- /package/src/{prove → prover}/smt/solver/quantifier-manager.ts +0 -0
- /package/src/{prove → prover}/smt/solver/random-gen.ts +0 -0
- /package/src/{prove → prover}/smt/solver/rational.ts +0 -0
- /package/src/{prove → prover}/smt/solver/ref-vector.ts +0 -0
- /package/src/{prove → prover}/smt/solver/rewriter-tpl.ts +0 -0
- /package/src/{prove → prover}/smt/solver/rlimit.ts +0 -0
- /package/src/{prove → prover}/smt/solver/smtlib-parser.ts +0 -0
- /package/src/{prove → prover}/smt/solver/sort.ts +0 -0
- /package/src/{prove → prover}/smt/solver/sticky-generations.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-axioms.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-bounds.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-final-check.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-internalize.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-model.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-propagate.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-state.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra.ts +0 -0
- /package/src/{prove → prover}/smt/solver/var-subst.ts +0 -0
- /package/src/{prove → prover}/smt/solver/z3-license.txt +0 -0
- /package/src/{prove → prover}/smt/table.ts +0 -0
- /package/src/{prove → prover}/tlaps-module.ts +0 -0
- /package/src/{prove → prover}/zenon/LICENSE +0 -0
- /package/src/{prove → prover}/zenon/check/check.ts +0 -0
- /package/src/{prove → prover}/zenon/check/definitions.ts +0 -0
- /package/src/{prove → prover}/zenon/check/equality.ts +0 -0
- /package/src/{prove → prover}/zenon/check/functions.ts +0 -0
- /package/src/{prove → prover}/zenon/check/keys.ts +0 -0
- /package/src/{prove → prover}/zenon/check/propositional.ts +0 -0
- /package/src/{prove → prover}/zenon/check/records.ts +0 -0
- /package/src/{prove → prover}/zenon/check/relations.ts +0 -0
- /package/src/{prove → prover}/zenon/check/rewrites.ts +0 -0
- /package/src/{prove → prover}/zenon/check/sets.ts +0 -0
- /package/src/{prove → prover}/zenon/check/terms.ts +0 -0
- /package/src/{prove → prover}/zenon/check/tla.ts +0 -0
- /package/src/{prove → prover}/zenon/isar-case.ts +0 -0
- /package/src/{prove → prover}/zenon/limits.ts +0 -0
- /package/src/{prove → prover}/zenon/ocaml.ts +0 -0
- /package/src/{prove → prover}/zenon/parse.ts +0 -0
- /package/src/{prove → prover}/zenon/phrase.ts +0 -0
- /package/src/{prove → prover}/zenon/proof.ts +0 -0
- /package/src/{prove → prover}/zenon/propositional-rules.ts +0 -0
- /package/src/{prove → prover}/zenon/rules.ts +0 -0
- /package/src/{prove → prover}/zenon/tla/functions.ts +0 -0
- /package/src/{prove → prover}/zenon/tla/llproof.ts +0 -0
- /package/src/{prove → prover}/zenon/tla/records.ts +0 -0
- /package/src/{prove → prover}/zenon/tla/rewrites.ts +0 -0
- /package/src/{prove → prover}/zenon/tla/sets.ts +0 -0
- /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
- /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
- /package/src/{tlc-version.ts → tlc/version.ts} +0 -0
package/src/prove/prove.ts
DELETED
|
@@ -1,417 +0,0 @@
|
|
|
1
|
-
// Proves a module's obligations with tla-ts's own backends, in tlapm's order, or with tlapm.
|
|
2
|
-
|
|
3
|
-
import { TlaProverError, TlaUnsupportedError } from "../errors";
|
|
4
|
-
import { getChildren, mapHyp, type Expr, type Hyp, type Sequent } from "../obligations/expression";
|
|
5
|
-
import { getObligations, type PrintedObligation } from "../obligations";
|
|
6
|
-
import { isWorkerSupported } from "../worker";
|
|
7
|
-
import { DECIDERS } from "./deciders";
|
|
8
|
-
import { createDecidePool } from "./decide-pool";
|
|
9
|
-
import { encodeIsabelle } from "./isabelle/encode";
|
|
10
|
-
import { processObligation } from "./prep/action";
|
|
11
|
-
import { expandDefs } from "./prep/defs";
|
|
12
|
-
import { normalizeSequent } from "./prep/elab";
|
|
13
|
-
import { expandEnabledCdot } from "./prep/enabled";
|
|
14
|
-
import { getFingerprint } from "./prep/fingerprint";
|
|
15
|
-
import { flatten } from "./prep/flatten";
|
|
16
|
-
import { findMethods, type Method } from "./prep/pragma";
|
|
17
|
-
import { isTrivial } from "./prep/trivial";
|
|
18
|
-
import { encodePtl } from "./ptl/encode";
|
|
19
|
-
import { encodeSmt } from "./smt/encode";
|
|
20
|
-
import type { EncodingSession } from "./smt/rewrite";
|
|
21
|
-
import { encodeZenon } from "./zenon/encode";
|
|
22
|
-
import type { TlapmResult } from "./tlapm/tlapm";
|
|
23
|
-
import { TLAPS_MODULE } from "./tlaps-module";
|
|
24
|
-
import type { DecideOptions, Verdict } from "./verdict";
|
|
25
|
-
|
|
26
|
-
interface ObligationBase {
|
|
27
|
-
id: number;
|
|
28
|
-
location: string;
|
|
29
|
-
text: string;
|
|
30
|
-
}
|
|
31
|
-
|
|
32
|
-
export interface ProvedObligation extends ObligationBase {
|
|
33
|
-
status: "proved";
|
|
34
|
-
prover: string;
|
|
35
|
-
}
|
|
36
|
-
|
|
37
|
-
export interface TrivialObligation extends ObligationBase {
|
|
38
|
-
status: "trivial";
|
|
39
|
-
}
|
|
40
|
-
|
|
41
|
-
export interface UnprovedObligation extends ObligationBase {
|
|
42
|
-
status: "failed" | "unsupported";
|
|
43
|
-
reason: string;
|
|
44
|
-
}
|
|
45
|
-
|
|
46
|
-
export type ProofObligation = ProvedObligation | TrivialObligation | UnprovedObligation;
|
|
47
|
-
|
|
48
|
-
export type ProofStatus = ProofObligation["status"];
|
|
49
|
-
|
|
50
|
-
export interface ProveResult {
|
|
51
|
-
obligations: ProofObligation[];
|
|
52
|
-
missingProofCount: number;
|
|
53
|
-
omittedProofCount: number;
|
|
54
|
-
}
|
|
55
|
-
|
|
56
|
-
// tla-ts runs its own backends, and tlapm runs tlapm on the module.
|
|
57
|
-
export const PROVE_BACKENDS = ["tla-ts", "tlapm"] as const;
|
|
58
|
-
|
|
59
|
-
export type ProveBackend = (typeof PROVE_BACKENDS)[number];
|
|
60
|
-
|
|
61
|
-
export const isProveBackend = (name: string | undefined): name is ProveBackend =>
|
|
62
|
-
PROVE_BACKENDS.some((backend) => backend === name);
|
|
63
|
-
|
|
64
|
-
export interface ProveOptions {
|
|
65
|
-
source: string;
|
|
66
|
-
loadModule?: (name: string) => string | undefined;
|
|
67
|
-
backend?: ProveBackend;
|
|
68
|
-
signal?: AbortSignal;
|
|
69
|
-
onObligation?: (obligation: ProofObligation) => void;
|
|
70
|
-
workers?: number;
|
|
71
|
-
}
|
|
72
|
-
|
|
73
|
-
// What one prover concluded about an obligation, as Fpfile keeps it. Fpfile keeps one Isabelle
|
|
74
|
-
// result, which only a method with the same tactic reuses.
|
|
75
|
-
interface PriorResult {
|
|
76
|
-
isProved: boolean;
|
|
77
|
-
timeLimitMs: number;
|
|
78
|
-
tactic: string | undefined;
|
|
79
|
-
}
|
|
80
|
-
|
|
81
|
-
// An obligation being proved. The SMT encoder numbers the CASE errors it standardizes across the
|
|
82
|
-
// run, so an obligation it encodes one in waits for every earlier obligation and keeps a session
|
|
83
|
-
// from the count they leave.
|
|
84
|
-
interface ObligationTask {
|
|
85
|
-
done: Promise<void>;
|
|
86
|
-
session: { initial: number; current: EncodingSession } | undefined;
|
|
87
|
-
}
|
|
88
|
-
|
|
89
|
-
// What tlapm keeps across the obligations of one run: the SMT encoder's counter, and what each
|
|
90
|
-
// prover concluded for each fingerprint. An obligation waits for the last earlier one with its
|
|
91
|
-
// fingerprint, so obligations prove concurrently as they would in turn.
|
|
92
|
-
interface ProveRun {
|
|
93
|
-
tasks: ObligationTask[];
|
|
94
|
-
results: Map<string, Map<string, PriorResult>>;
|
|
95
|
-
lastByFingerprint: Map<string, Promise<void>>;
|
|
96
|
-
decide: (
|
|
97
|
-
prover: string,
|
|
98
|
-
text: string,
|
|
99
|
-
options: DecideOptions,
|
|
100
|
-
priority: number,
|
|
101
|
-
) => Promise<Verdict>;
|
|
102
|
-
}
|
|
103
|
-
|
|
104
|
-
interface Backend {
|
|
105
|
-
// The text tlapm sends the backend for an obligation after Prep.normalize_expand, through the
|
|
106
|
-
// frontend and Prep.flatten that Prep.ship applies first. It throws a TlaUnsupportedError for
|
|
107
|
-
// what tla-ts can't encode.
|
|
108
|
-
encode: (id: number, sequent: Sequent, method: Method, session: EncodingSession) => string;
|
|
109
|
-
}
|
|
110
|
-
|
|
111
|
-
// Action.process_obligation, the frontend for every backend but LS4, Isabelle included, then
|
|
112
|
-
// Prep.flatten.
|
|
113
|
-
const shipFirstOrder = (sequent: Sequent) => flatten(processObligation(sequent));
|
|
114
|
-
|
|
115
|
-
const SMT: Backend = {
|
|
116
|
-
// Prep.gen_smt_solve writes the resource budget before the encoding.
|
|
117
|
-
encode: (_id, sequent, method, session) =>
|
|
118
|
-
(method.rlimit === undefined ? "" : `(set-option :rlimit ${method.rlimit})\n`) +
|
|
119
|
-
encodeSmt(shipFirstOrder(sequent), session),
|
|
120
|
-
};
|
|
121
|
-
|
|
122
|
-
// tla-ts's backends, by the prover of the method that selects each.
|
|
123
|
-
const BACKENDS: Record<string, Backend> = {
|
|
124
|
-
smt: SMT,
|
|
125
|
-
z3: SMT,
|
|
126
|
-
zenon: { encode: (id, sequent) => encodeZenon(id, shipFirstOrder(sequent)) },
|
|
127
|
-
// tlapm names the theory after its temporary file, and tla-ts after the obligation.
|
|
128
|
-
isabelle: {
|
|
129
|
-
encode: (id, sequent, method) =>
|
|
130
|
-
encodeIsabelle(id, shipFirstOrder(sequent), method.tactic ?? "auto", `tlapm_${id}`),
|
|
131
|
-
},
|
|
132
|
-
// Pltl.process_obligation is LS4's frontend.
|
|
133
|
-
ls4: { encode: (_id, sequent) => encodePtl(sequent) },
|
|
134
|
-
};
|
|
135
|
-
|
|
136
|
-
// Whether an expression has a CASE with no OTHER. The frontends and Prep.flatten add none, so the
|
|
137
|
-
// SMT encoder standardizes one only in an obligation that has one after Prep.normalize_expand.
|
|
138
|
-
const hasIncompleteCase = (expression: Expr): boolean =>
|
|
139
|
-
(expression.kind === "Case" && expression.other === undefined) ||
|
|
140
|
-
getChildren(expression).some(hasIncompleteCase);
|
|
141
|
-
|
|
142
|
-
const incompleteCaseHyps = new WeakMap<Hyp, boolean>();
|
|
143
|
-
|
|
144
|
-
const isIncompleteCaseHyp = (hyp: Hyp) => {
|
|
145
|
-
const known = incompleteCaseHyps.get(hyp);
|
|
146
|
-
if (known !== undefined) return known;
|
|
147
|
-
const expressions: Expr[] = [];
|
|
148
|
-
mapHyp(
|
|
149
|
-
hyp,
|
|
150
|
-
(inner) => {
|
|
151
|
-
expressions.push(inner);
|
|
152
|
-
return inner;
|
|
153
|
-
},
|
|
154
|
-
"all",
|
|
155
|
-
);
|
|
156
|
-
const isIncomplete = expressions.some(hasIncompleteCase);
|
|
157
|
-
incompleteCaseHyps.set(hyp, isIncomplete);
|
|
158
|
-
return isIncomplete;
|
|
159
|
-
};
|
|
160
|
-
|
|
161
|
-
const getModuleName = (source: string) => /-{4,}\s*MODULE\s+(\w+)/.exec(source)?.[1] ?? "Main";
|
|
162
|
-
|
|
163
|
-
const getBase = (obligation: PrintedObligation): ObligationBase => ({
|
|
164
|
-
id: obligation.id,
|
|
165
|
-
location: obligation.location,
|
|
166
|
-
text: obligation.text,
|
|
167
|
-
});
|
|
168
|
-
|
|
169
|
-
const getUnproved = (
|
|
170
|
-
obligation: PrintedObligation,
|
|
171
|
-
status: "failed" | "unsupported",
|
|
172
|
-
reason: string,
|
|
173
|
-
): ProofObligation => ({ ...getBase(obligation), status, reason });
|
|
174
|
-
|
|
175
|
-
// Prep.normalize_expand: expand_defs, Elab.normalize, then the frontends the step cites.
|
|
176
|
-
const normalizeExpand = (sequent: Sequent, frontends: Set<string>) =>
|
|
177
|
-
expandEnabledCdot(normalizeSequent(expandDefs(sequent)), frontends);
|
|
178
|
-
|
|
179
|
-
// The text one backend receives for an obligation, for comparing with tlapm's.
|
|
180
|
-
export const encodeForBackend = (
|
|
181
|
-
obligation: PrintedObligation,
|
|
182
|
-
prover: string,
|
|
183
|
-
session: EncodingSession,
|
|
184
|
-
) => {
|
|
185
|
-
const backend = BACKENDS[prover];
|
|
186
|
-
if (!backend) throw new TlaUnsupportedError(`the ${prover} backend`);
|
|
187
|
-
const methods = findMethods(obligation);
|
|
188
|
-
const method = methods.provers.find((candidate) => candidate.prover === prover) ?? {
|
|
189
|
-
prover,
|
|
190
|
-
timeLimitMs: Infinity,
|
|
191
|
-
};
|
|
192
|
-
return backend.encode(
|
|
193
|
-
obligation.id,
|
|
194
|
-
normalizeExpand(obligation.sequent, methods.frontends),
|
|
195
|
-
method,
|
|
196
|
-
session,
|
|
197
|
-
);
|
|
198
|
-
};
|
|
199
|
-
|
|
200
|
-
// The SMT encoder's session for an obligation, from the count of CASE errors every earlier
|
|
201
|
-
// obligation leaves.
|
|
202
|
-
const getSession = async (run: ProveRun, index: number) => {
|
|
203
|
-
const task = run.tasks[index];
|
|
204
|
-
if (task.session) return task.session.current;
|
|
205
|
-
const earlier = run.tasks.slice(0, index);
|
|
206
|
-
await Promise.all(earlier.map((innerTask) => innerTask.done));
|
|
207
|
-
const initial = earlier.reduce(
|
|
208
|
-
(total, innerTask) =>
|
|
209
|
-
total +
|
|
210
|
-
(innerTask.session ? innerTask.session.current.caseErrors - innerTask.session.initial : 0),
|
|
211
|
-
0,
|
|
212
|
-
);
|
|
213
|
-
task.session = { initial, current: { caseErrors: initial } };
|
|
214
|
-
return task.session.current;
|
|
215
|
-
};
|
|
216
|
-
|
|
217
|
-
// Prep.ship: the provers the step cites, or tlapm's default ones when it cites none, each tried in
|
|
218
|
-
// turn until one proves the obligation. Prep.already_processed reuses what a prover concluded for
|
|
219
|
-
// an earlier obligation with the same fingerprint: a proof, or a failure within at least as much
|
|
220
|
-
// time. Unless the first prover's proof is reused, a trivial obligation needs no prover.
|
|
221
|
-
const proveWithBackends = async (
|
|
222
|
-
obligation: PrintedObligation,
|
|
223
|
-
index: number,
|
|
224
|
-
run: ProveRun,
|
|
225
|
-
signal: AbortSignal | undefined,
|
|
226
|
-
): Promise<ProofObligation> => {
|
|
227
|
-
if (obligation.kind.kind === "Error")
|
|
228
|
-
return getUnproved(obligation, "failed", obligation.kind.message);
|
|
229
|
-
const methods = findMethods(obligation);
|
|
230
|
-
const fingerprint = getFingerprint(obligation.sequent);
|
|
231
|
-
const earlier = run.lastByFingerprint.get(fingerprint);
|
|
232
|
-
run.lastByFingerprint.set(fingerprint, run.tasks[index].done);
|
|
233
|
-
await earlier;
|
|
234
|
-
const results = run.results.get(fingerprint) ?? new Map<string, PriorResult>();
|
|
235
|
-
run.results.set(fingerprint, results);
|
|
236
|
-
const getProved = (prover: string): ProofObligation => ({
|
|
237
|
-
...getBase(obligation),
|
|
238
|
-
status: "proved",
|
|
239
|
-
prover,
|
|
240
|
-
});
|
|
241
|
-
const getPrior = (method: Method) => {
|
|
242
|
-
const prior = results.get(method.prover);
|
|
243
|
-
return prior?.tactic === method.tactic ? prior : undefined;
|
|
244
|
-
};
|
|
245
|
-
const setPrior = (method: Method, isProved: boolean) =>
|
|
246
|
-
results.set(method.prover, {
|
|
247
|
-
isProved,
|
|
248
|
-
timeLimitMs: method.timeLimitMs,
|
|
249
|
-
tactic: method.tactic,
|
|
250
|
-
});
|
|
251
|
-
if (getPrior(methods.provers[0])?.isProved) return getProved(methods.provers[0].prover);
|
|
252
|
-
const sequent = normalizeExpand(obligation.sequent, methods.frontends);
|
|
253
|
-
if (obligation.kind.kind === "Support" && isTrivial(sequent))
|
|
254
|
-
return { ...getBase(obligation), status: "trivial" };
|
|
255
|
-
const reasons: string[] = [];
|
|
256
|
-
const state = { isDecided: false };
|
|
257
|
-
for (const method of methods.provers) {
|
|
258
|
-
const prior = getPrior(method);
|
|
259
|
-
if (prior?.isProved) return getProved(method.prover);
|
|
260
|
-
if (prior && prior.timeLimitMs >= method.timeLimitMs) {
|
|
261
|
-
state.isDecided = true;
|
|
262
|
-
reasons.push(`${method.prover} failed on an obligation with the same fingerprint`);
|
|
263
|
-
continue;
|
|
264
|
-
}
|
|
265
|
-
// Prep.prove_with: the Trivial method proves anything.
|
|
266
|
-
if (method.prover === "trivial") return getProved(method.prover);
|
|
267
|
-
const backend = BACKENDS[method.prover];
|
|
268
|
-
if (!backend) {
|
|
269
|
-
reasons.push(`tla-ts has no ${method.prover} backend`);
|
|
270
|
-
continue;
|
|
271
|
-
}
|
|
272
|
-
try {
|
|
273
|
-
const isCaseNumbered =
|
|
274
|
-
backend === SMT &&
|
|
275
|
-
(sequent.context.some(isIncompleteCaseHyp) || hasIncompleteCase(sequent.active));
|
|
276
|
-
const session = isCaseNumbered ? await getSession(run, index) : { caseErrors: 0 };
|
|
277
|
-
const text = backend.encode(obligation.id, sequent, method, session);
|
|
278
|
-
const verdict = await run.decide(
|
|
279
|
-
method.prover,
|
|
280
|
-
text,
|
|
281
|
-
{ timeLimitMs: method.timeLimitMs, signal },
|
|
282
|
-
index,
|
|
283
|
-
);
|
|
284
|
-
setPrior(method, verdict === "unsat");
|
|
285
|
-
if (verdict === "unsat") return getProved(method.prover);
|
|
286
|
-
state.isDecided = true;
|
|
287
|
-
reasons.push(`${method.prover} answered ${verdict}`);
|
|
288
|
-
} catch (error) {
|
|
289
|
-
if (error instanceof TlaProverError) {
|
|
290
|
-
setPrior(method, false);
|
|
291
|
-
state.isDecided = true;
|
|
292
|
-
reasons.push(`${method.prover} failed: ${error.message}`);
|
|
293
|
-
continue;
|
|
294
|
-
}
|
|
295
|
-
if (!(error instanceof TlaUnsupportedError)) throw error;
|
|
296
|
-
reasons.push(`${method.prover} can't encode ${error.message}`);
|
|
297
|
-
}
|
|
298
|
-
}
|
|
299
|
-
return getUnproved(obligation, state.isDecided ? "failed" : "unsupported", reasons.join(", "));
|
|
300
|
-
};
|
|
301
|
-
|
|
302
|
-
// The one place an error becomes a result: what tla-ts can't handle is unsupported, and what tlapm
|
|
303
|
-
// refuses, as a frontend's soundness check, fails.
|
|
304
|
-
const getResult = async (
|
|
305
|
-
obligation: PrintedObligation,
|
|
306
|
-
getProved: () => Promise<ProofObligation>,
|
|
307
|
-
) => {
|
|
308
|
-
try {
|
|
309
|
-
return await getProved();
|
|
310
|
-
} catch (error) {
|
|
311
|
-
if (error instanceof TlaUnsupportedError)
|
|
312
|
-
return getUnproved(obligation, "unsupported", error.message);
|
|
313
|
-
if (error instanceof TlaProverError) return getUnproved(obligation, "failed", error.message);
|
|
314
|
-
throw error;
|
|
315
|
-
}
|
|
316
|
-
};
|
|
317
|
-
|
|
318
|
-
const getFromTlapm = (obligation: PrintedObligation, result: TlapmResult | undefined) =>
|
|
319
|
-
result
|
|
320
|
-
? { ...getBase(obligation), ...result }
|
|
321
|
-
: getUnproved(obligation, "unsupported", "tlapm reported no result");
|
|
322
|
-
|
|
323
|
-
export const prove = async (options: ProveOptions): Promise<ProveResult> => {
|
|
324
|
-
const name = getModuleName(options.source);
|
|
325
|
-
const modules = new Map<string, string>();
|
|
326
|
-
const results = getObligations(
|
|
327
|
-
[{ file: `${name}.tla`, source: options.source }],
|
|
328
|
-
(moduleName) => {
|
|
329
|
-
const source = options.loadModule?.(moduleName);
|
|
330
|
-
if (source !== undefined) modules.set(moduleName, source);
|
|
331
|
-
const loaded = source ?? (moduleName === "TLAPS" ? TLAPS_MODULE : undefined);
|
|
332
|
-
return loaded === undefined ? undefined : { file: `${moduleName}.tla`, source: loaded };
|
|
333
|
-
},
|
|
334
|
-
);
|
|
335
|
-
const obligations = results.flatMap((result) => result.obligations);
|
|
336
|
-
const counts = {
|
|
337
|
-
missingProofCount: results.reduce((total, result) => total + result.summary.absent.length, 0),
|
|
338
|
-
omittedProofCount: results.reduce((total, result) => total + result.summary.omitted.length, 0),
|
|
339
|
-
};
|
|
340
|
-
if (options.backend === "tlapm") {
|
|
341
|
-
if (typeof process === "undefined" || process.versions?.node === undefined)
|
|
342
|
-
throw new TlaUnsupportedError("The tlapm backend runs only in Node and Bun.");
|
|
343
|
-
const tlapm = await import("./tlapm/tlapm");
|
|
344
|
-
const byId = new Map(obligations.map((obligation) => [obligation.id, obligation]));
|
|
345
|
-
const reported = await tlapm.proveWithTlapm(
|
|
346
|
-
name,
|
|
347
|
-
new Map([[name, options.source], ...modules]),
|
|
348
|
-
{
|
|
349
|
-
signal: options.signal,
|
|
350
|
-
onResult: (id, result) => {
|
|
351
|
-
const obligation = byId.get(id);
|
|
352
|
-
if (obligation) options.onObligation?.(getFromTlapm(obligation, result));
|
|
353
|
-
},
|
|
354
|
-
},
|
|
355
|
-
);
|
|
356
|
-
return {
|
|
357
|
-
obligations: obligations.map((obligation) =>
|
|
358
|
-
getFromTlapm(obligation, reported.get(obligation.id)),
|
|
359
|
-
),
|
|
360
|
-
...counts,
|
|
361
|
-
};
|
|
362
|
-
}
|
|
363
|
-
const count = options.workers ?? 1;
|
|
364
|
-
const pool = count > 1 && isWorkerSupported() ? await createDecidePool(count) : undefined;
|
|
365
|
-
const onAbort = () => pool?.terminate(options.signal?.reason);
|
|
366
|
-
options.signal?.addEventListener("abort", onAbort);
|
|
367
|
-
const run: ProveRun = {
|
|
368
|
-
tasks: [],
|
|
369
|
-
results: new Map(),
|
|
370
|
-
lastByFingerprint: new Map(),
|
|
371
|
-
decide:
|
|
372
|
-
pool?.decide ??
|
|
373
|
-
(async (prover, text, decideOptions) => DECIDERS[prover](text, decideOptions)),
|
|
374
|
-
};
|
|
375
|
-
// A few obligations per worker prove at once, and each reports once every earlier one has.
|
|
376
|
-
const limit = pool ? count * 4 : 1;
|
|
377
|
-
const pending: Promise<ProofObligation>[] = [];
|
|
378
|
-
const isSettled: boolean[] = [];
|
|
379
|
-
const running = new Set<Promise<void>>();
|
|
380
|
-
const proved: ProofObligation[] = [];
|
|
381
|
-
const reportSettled = async () => {
|
|
382
|
-
while (isSettled[proved.length]) {
|
|
383
|
-
options.signal?.throwIfAborted();
|
|
384
|
-
const result = await pending[proved.length];
|
|
385
|
-
proved.push(result);
|
|
386
|
-
options.onObligation?.(result);
|
|
387
|
-
// HACK: backends on this thread run synchronously, so yield to let an abort land.
|
|
388
|
-
await new Promise((resolve) => setTimeout(resolve));
|
|
389
|
-
}
|
|
390
|
-
};
|
|
391
|
-
try {
|
|
392
|
-
for (const [index, obligation] of obligations.entries()) {
|
|
393
|
-
options.signal?.throwIfAborted();
|
|
394
|
-
const done = Promise.withResolvers<void>();
|
|
395
|
-
run.tasks.push({ done: done.promise, session: undefined });
|
|
396
|
-
const result = getResult(obligation, () =>
|
|
397
|
-
proveWithBackends(obligation, index, run, options.signal),
|
|
398
|
-
);
|
|
399
|
-
pending.push(result);
|
|
400
|
-
running.add(done.promise);
|
|
401
|
-
const settle = () => {
|
|
402
|
-
isSettled[index] = true;
|
|
403
|
-
running.delete(done.promise);
|
|
404
|
-
done.resolve();
|
|
405
|
-
};
|
|
406
|
-
void result.then(settle, settle);
|
|
407
|
-
if (running.size >= limit) await Promise.race(running);
|
|
408
|
-
await reportSettled();
|
|
409
|
-
}
|
|
410
|
-
await Promise.all(running);
|
|
411
|
-
await reportSettled();
|
|
412
|
-
} finally {
|
|
413
|
-
options.signal?.removeEventListener("abort", onAbort);
|
|
414
|
-
pool?.terminate(new TlaProverError("prove stopped"));
|
|
415
|
-
}
|
|
416
|
-
return { obligations: proved, ...counts };
|
|
417
|
-
};
|
|
@@ -1,69 +0,0 @@
|
|
|
1
|
-
// encode/n_axiomatize.ml: the symbols and axioms an encoding needs.
|
|
2
|
-
|
|
3
|
-
import { compareStrings } from "../ocaml";
|
|
4
|
-
import { getSymbolSpec, type CollectState, type SymbolSpec } from "./data";
|
|
5
|
-
import type { Entry, Flattened } from "./flatten";
|
|
6
|
-
import { getTlaName } from "./format";
|
|
7
|
-
import { getAxiomKey, type Axiom } from "./table";
|
|
8
|
-
|
|
9
|
-
// N_axiomatize.collect: each symbol the obligation uses, in the order tlapm visits them, brings
|
|
10
|
-
// the symbols and axioms it depends on, smallest name first.
|
|
11
|
-
export const collectSymbols = (
|
|
12
|
-
entries: Entry[],
|
|
13
|
-
flattened: Map<string, Flattened>,
|
|
14
|
-
anonymous: Map<string, number>,
|
|
15
|
-
recordFields: Map<string, string[]>,
|
|
16
|
-
) => {
|
|
17
|
-
const state: CollectState = {
|
|
18
|
-
recordFields,
|
|
19
|
-
strings: [],
|
|
20
|
-
isFunConstr: false,
|
|
21
|
-
isFunSet: false,
|
|
22
|
-
isExcept: false,
|
|
23
|
-
tuples: [],
|
|
24
|
-
records: [],
|
|
25
|
-
anonymous,
|
|
26
|
-
};
|
|
27
|
-
const symbols = new Map<string, SymbolSpec>();
|
|
28
|
-
const axioms = new Map<string, Axiom>();
|
|
29
|
-
const add = (name: string) => {
|
|
30
|
-
const work = new Set([name]);
|
|
31
|
-
while (work.size > 0) {
|
|
32
|
-
const next = [...work].toSorted(compareStrings)[0];
|
|
33
|
-
work.delete(next);
|
|
34
|
-
if (symbols.has(next)) continue;
|
|
35
|
-
const spec = getSymbolSpec(next, state);
|
|
36
|
-
symbols.set(next, spec);
|
|
37
|
-
spec.deps.forEach((dep) => work.add(dep));
|
|
38
|
-
spec.axioms.forEach((entry) => axioms.set(getAxiomKey(entry), entry));
|
|
39
|
-
}
|
|
40
|
-
};
|
|
41
|
-
// A flattened symbol stands for a builtin applied to its first-order arguments and then its
|
|
42
|
-
// higher-order ones, so its higher-order text is visited after its arguments.
|
|
43
|
-
const visit = (text: string) => {
|
|
44
|
-
const tokens = text.match(/[()]|[^\s()]+/g) ?? [];
|
|
45
|
-
const pending: { depth: number; text: string }[] = [];
|
|
46
|
-
tokens.reduce((depth, token, index) => {
|
|
47
|
-
if (token === "(") return depth + 1;
|
|
48
|
-
if (token === ")") {
|
|
49
|
-
if (pending.at(-1)?.depth === depth) visit(pending.pop()?.text ?? "");
|
|
50
|
-
return depth - 1;
|
|
51
|
-
}
|
|
52
|
-
const flat = flattened.get(token);
|
|
53
|
-
if (!flat) {
|
|
54
|
-
const builtin = getTlaName(token);
|
|
55
|
-
if (builtin !== undefined) add(builtin);
|
|
56
|
-
return depth;
|
|
57
|
-
}
|
|
58
|
-
if (flat.kind !== "") add(flat.kind);
|
|
59
|
-
if (tokens[index - 1] === "(") pending.push({ depth, text: flat.visit });
|
|
60
|
-
else visit(flat.visit);
|
|
61
|
-
return depth;
|
|
62
|
-
}, 0);
|
|
63
|
-
};
|
|
64
|
-
entries.forEach((entry) => {
|
|
65
|
-
if (typeof entry === "string") visit(entry);
|
|
66
|
-
else if ("omitted" in entry) visit(entry.omitted);
|
|
67
|
-
});
|
|
68
|
-
return { symbols, axioms };
|
|
69
|
-
};
|
|
@@ -1,57 +0,0 @@
|
|
|
1
|
-
// The rewrites of encode/n_rewrite.ml that run on the sequent before Type.Synthesize.
|
|
2
|
-
|
|
3
|
-
import { applyBuiltin, at, mapChildren, type Expr } from "../../obligations/expression";
|
|
4
|
-
import { compareStrings } from "../ocaml";
|
|
5
|
-
|
|
6
|
-
type RecordExpr = Extract<Expr, { kind: "Record" }>;
|
|
7
|
-
|
|
8
|
-
const isSameFieldSet = (left: RecordExpr, right: RecordExpr) =>
|
|
9
|
-
left.fields.length === right.fields.length &&
|
|
10
|
-
left.fields.every((field) => right.fields.some((other) => other.name === field.name)) &&
|
|
11
|
-
right.fields.every((field) => left.fields.some((other) => other.name === field.name));
|
|
12
|
-
|
|
13
|
-
// mk_conj: e1 /\ (e2 /\ ...).
|
|
14
|
-
const conjoinRight = (items: Expr[]): Expr =>
|
|
15
|
-
items.length === 1
|
|
16
|
-
? items[0]
|
|
17
|
-
: applyBuiltin("Conj", [items[0], conjoinRight(items.slice(1))], items[0]);
|
|
18
|
-
|
|
19
|
-
const decompose = (left: Expr, right: Expr, from: Expr): Expr => {
|
|
20
|
-
if (left.kind !== "Record" || right.kind !== "Record" || !isSameFieldSet(left, right))
|
|
21
|
-
return applyBuiltin("Eq", [left, right], from);
|
|
22
|
-
return conjoinRight(
|
|
23
|
-
left.fields.map((field) =>
|
|
24
|
-
decompose(
|
|
25
|
-
field.value,
|
|
26
|
-
right.fields.find((other) => other.name === field.name)?.value ?? field.value,
|
|
27
|
-
from,
|
|
28
|
-
),
|
|
29
|
-
),
|
|
30
|
-
);
|
|
31
|
-
};
|
|
32
|
-
|
|
33
|
-
// simpl_receq: an equality of two record constructors with the same fields is the conjunction of
|
|
34
|
-
// the equalities of their fields, paired by name.
|
|
35
|
-
export const simplifyRecordEqualities = (expression: Expr): Expr => {
|
|
36
|
-
const inner = mapChildren(expression, simplifyRecordEqualities);
|
|
37
|
-
const isRecordEquality =
|
|
38
|
-
inner.kind === "Apply" &&
|
|
39
|
-
inner.operator.kind === "Internal" &&
|
|
40
|
-
inner.operator.builtin === "Eq" &&
|
|
41
|
-
inner.args.length === 2 &&
|
|
42
|
-
inner.args[0].kind === "Record" &&
|
|
43
|
-
inner.args[1].kind === "Record";
|
|
44
|
-
return isRecordEquality && inner.kind === "Apply"
|
|
45
|
-
? at(decompose(inner.args[0], inner.args[1], inner), inner)
|
|
46
|
-
: inner;
|
|
47
|
-
};
|
|
48
|
-
|
|
49
|
-
// sort_recfields: a record's or a record set's fields in order. Like tlapm, it doesn't visit the
|
|
50
|
-
// field values, so a record inside a record keeps the order it's written in.
|
|
51
|
-
export const sortRecordFields = (expression: Expr): Expr =>
|
|
52
|
-
expression.kind === "Record" || expression.kind === "Rect"
|
|
53
|
-
? {
|
|
54
|
-
...expression,
|
|
55
|
-
fields: expression.fields.toSorted((left, right) => compareStrings(left.name, right.name)),
|
|
56
|
-
}
|
|
57
|
-
: mapChildren(expression, sortRecordFields);
|
package/src/prove/verdict.ts
DELETED
|
@@ -1,13 +0,0 @@
|
|
|
1
|
-
// A backend's answer to an obligation. tlapm frames an obligation as unsatisfiable when the backend
|
|
2
|
-
// proves it.
|
|
3
|
-
export type Verdict = "unsat" | "sat" | "unknown";
|
|
4
|
-
|
|
5
|
-
export interface DecideOptions {
|
|
6
|
-
timeLimitMs: number;
|
|
7
|
-
signal?: AbortSignal;
|
|
8
|
-
}
|
|
9
|
-
|
|
10
|
-
// V8's error when a recursion runs out of stack. The backends run as their own processes, which grow
|
|
11
|
-
// their stacks or fail the obligation alone, so a backend ported in process answers unknown instead.
|
|
12
|
-
export const isStackOverflow = (error: unknown) =>
|
|
13
|
-
error instanceof RangeError && error.message === "Maximum call stack size exceeded";
|
package/src/standard-ranges.ts
DELETED
|
@@ -1,116 +0,0 @@
|
|
|
1
|
-
import type { SourceRange } from "./ast";
|
|
2
|
-
|
|
3
|
-
// Where the modules in TLC's tla2sany/StandardModules define the operators that tla-ts implements
|
|
4
|
-
// natively, which SANY reports when a spec defines one of them again.
|
|
5
|
-
const RANGES: Record<string, Record<string, [number, number, number, number]>> = {
|
|
6
|
-
Naturals: {
|
|
7
|
-
Nat: [14, 1, 14, 16],
|
|
8
|
-
"+": [15, 1, 15, 19],
|
|
9
|
-
"-": [17, 1, 17, 33],
|
|
10
|
-
"*": [18, 1, 18, 17],
|
|
11
|
-
"^": [19, 1, 19, 19],
|
|
12
|
-
"<": [20, 1, 20, 19],
|
|
13
|
-
">": [21, 1, 21, 19],
|
|
14
|
-
"<=": [22, 1, 22, 19],
|
|
15
|
-
">=": [23, 1, 23, 19],
|
|
16
|
-
"%": [33, 1, 33, 20],
|
|
17
|
-
"\\div": [34, 1, 34, 20],
|
|
18
|
-
"..": [35, 1, 35, 20],
|
|
19
|
-
},
|
|
20
|
-
Integers: {
|
|
21
|
-
Int: [18, 1, 18, 12],
|
|
22
|
-
"-.": [22, 1, 22, 13],
|
|
23
|
-
},
|
|
24
|
-
Sequences: {
|
|
25
|
-
Seq: [20, 1, 20, 41],
|
|
26
|
-
Len: [25, 1, 25, 44],
|
|
27
|
-
"\\o": [30, 1, 31, 76],
|
|
28
|
-
Append: [36, 1, 36, 26],
|
|
29
|
-
Head: [41, 1, 41, 15],
|
|
30
|
-
Tail: [42, 1, 42, 61],
|
|
31
|
-
SubSeq: [48, 1, 48, 50],
|
|
32
|
-
SelectSeq: [53, 1, 65, 14],
|
|
33
|
-
},
|
|
34
|
-
FiniteSets: {
|
|
35
|
-
IsFiniteSet: [14, 1, 19, 68],
|
|
36
|
-
Cardinality: [21, 1, 27, 11],
|
|
37
|
-
},
|
|
38
|
-
Bags: {
|
|
39
|
-
IsABag: [20, 1, 24, 41],
|
|
40
|
-
BagToSet: [26, 1, 26, 23],
|
|
41
|
-
SetToBag: [31, 1, 31, 30],
|
|
42
|
-
BagIn: [36, 1, 36, 31],
|
|
43
|
-
EmptyBag: [41, 1, 41, 24],
|
|
44
|
-
"\\oplus": [43, 1, 49, 46],
|
|
45
|
-
"\\ominus": [51, 1, 60, 50],
|
|
46
|
-
BagUnion: [74, 1, 79, 58],
|
|
47
|
-
"\\sqsubseteq": [81, 1, 87, 42],
|
|
48
|
-
SubBag: [89, 1, 110, 11],
|
|
49
|
-
BagOfAll: [122, 1, 130, 66],
|
|
50
|
-
BagCardinality: [132, 1, 138, 8],
|
|
51
|
-
CopiesIn: [140, 1, 145, 33],
|
|
52
|
-
},
|
|
53
|
-
TLC: {
|
|
54
|
-
Print: [17, 1, 17, 22],
|
|
55
|
-
PrintT: [18, 1, 18, 19],
|
|
56
|
-
Assert: [24, 1, 25, 54],
|
|
57
|
-
JavaTime: [26, 1, 26, 32],
|
|
58
|
-
TLCGet: [75, 1, 75, 28],
|
|
59
|
-
TLCSet: [76, 1, 76, 20],
|
|
60
|
-
":>": [78, 1, 78, 27],
|
|
61
|
-
"@@": [79, 1, 80, 50],
|
|
62
|
-
Permutations: [81, 1, 82, 54],
|
|
63
|
-
SortSeq: [88, 1, 92, 40],
|
|
64
|
-
RandomElement: [110, 1, 110, 41],
|
|
65
|
-
Any: [119, 1, 119, 22],
|
|
66
|
-
ToString: [121, 1, 121, 58],
|
|
67
|
-
TLCEval: [145, 1, 145, 15],
|
|
68
|
-
},
|
|
69
|
-
TLCExt: {
|
|
70
|
-
AssertEq: [14, 1, 20, 14],
|
|
71
|
-
AssertError: [23, 1, 26, 72],
|
|
72
|
-
TLCGetOrDefault: [30, 1, 31, 17],
|
|
73
|
-
TLCGetAndSet: [33, 1, 35, 57],
|
|
74
|
-
Trace: [41, 1, 57, 6],
|
|
75
|
-
CounterExample: [61, 1, 75, 8],
|
|
76
|
-
ToTrace: [77, 1, 87, 12],
|
|
77
|
-
TLCModelValue: [91, 1, 120, 29],
|
|
78
|
-
TLCDefer: [122, 1, 134, 6],
|
|
79
|
-
TLCNoOp: [138, 1, 145, 5],
|
|
80
|
-
PickSuccessor: [148, 1, 162, 37],
|
|
81
|
-
TLCCache: [166, 1, 173, 12],
|
|
82
|
-
TLCFP: [175, 1, 181, 24],
|
|
83
|
-
TLCEvalDefinition: [185, 1, 190, 6],
|
|
84
|
-
},
|
|
85
|
-
Randomization: {
|
|
86
|
-
RandomSubset: [30, 1, 30, 64],
|
|
87
|
-
RandomSetOfSubsets: [48, 1, 49, 67],
|
|
88
|
-
TestRandomSetOfSubsets: [61, 1, 62, 71],
|
|
89
|
-
},
|
|
90
|
-
Json: {
|
|
91
|
-
ToJson: [46, 1, 55, 37],
|
|
92
|
-
ToJsonArray: [57, 1, 64, 42],
|
|
93
|
-
ToJsonObject: [66, 1, 73, 43],
|
|
94
|
-
JsonSerialize: [75, 1, 80, 6],
|
|
95
|
-
JsonDeserialize: [82, 1, 87, 19],
|
|
96
|
-
ndJsonSerialize: [89, 1, 95, 6],
|
|
97
|
-
ndJsonDeserialize: [97, 1, 103, 19],
|
|
98
|
-
},
|
|
99
|
-
_Possible: {
|
|
100
|
-
_Track: [10, 1, 17, 38],
|
|
101
|
-
_Counts: [24, 1, 30, 14],
|
|
102
|
-
_CheckName: [32, 1, 35, 35],
|
|
103
|
-
_PrintCounts: [37, 1, 37, 31],
|
|
104
|
-
},
|
|
105
|
-
};
|
|
106
|
-
|
|
107
|
-
export const getStandardRange = (module: string, name: string): SourceRange | undefined => {
|
|
108
|
-
const range = RANGES[module]?.[name];
|
|
109
|
-
return (
|
|
110
|
-
range && {
|
|
111
|
-
module,
|
|
112
|
-
start: { line: range[0], column: range[1] },
|
|
113
|
-
end: { line: range[2], column: range[3] },
|
|
114
|
-
}
|
|
115
|
-
);
|
|
116
|
-
};
|