tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.c92e6a4ea
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 +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +37 -0
- package/dist/index.d.ts +37 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +45 -44
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +44 -41
- package/dist/transfer.js +45 -42
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -41
- package/src/bags.ts +2 -5
- package/src/builtins.ts +5 -21
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +268 -0
- package/src/check.ts +578 -757
- package/src/cli/options.ts +6 -31
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +27 -62
- package/src/cli/shared.ts +1 -5
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +246 -240
- package/src/cli/tlc-output.ts +686 -0
- package/src/cli/tlc-usage.ts +3 -5
- package/src/cli/tlc.ts +59 -707
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +3 -10
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +73 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +34 -107
- package/src/exit-codes.ts +3 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -9
- package/src/json-reader.ts +1 -2
- package/src/json.ts +8 -18
- package/src/levels.ts +46 -57
- package/src/lexer.ts +76 -85
- package/src/liveness-checker.ts +634 -306
- package/src/liveness.ts +104 -120
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +17 -31
- package/src/parallel.ts +55 -80
- package/src/parser.ts +722 -385
- package/src/pcal/ast.ts +53 -65
- package/src/pcal/parse.ts +144 -191
- package/src/pcal/tokenize.ts +91 -115
- package/src/pcal/translate.ts +83 -98
- package/src/pcal/validate.ts +48 -50
- package/src/pretty-print.ts +7 -7
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +908 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +175 -15
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +110 -38
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +67 -16
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +165 -83
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -289
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +236 -45
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +11 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/randomization.ts +1 -4
- package/src/resolve.ts +67 -143
- package/src/runtime.ts +17 -18
- package/src/sany/builtins.ts +1 -3
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +160 -2683
- package/src/sany/levels.ts +5 -11
- package/src/sany/lexer.ts +57 -60
- package/src/sany/linter.ts +0 -3
- package/src/sany/nodes.ts +6 -13
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +244 -53
- package/src/simulate.ts +202 -184
- package/src/spec-description.ts +56 -82
- package/src/standard-definitions.ts +4 -3
- package/src/standard-modules.ts +17 -44
- package/src/state-graph.ts +3 -17
- package/src/subexpressions.ts +38 -47
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +20 -43
- package/src/symmetry.ts +6 -21
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +96 -30
- package/src/tlc/jar-data.ts +0 -1
- package/src/tlc/messages.ts +22 -36
- package/src/tlc/order.ts +36 -50
- package/src/tlc/random.ts +22 -34
- package/src/tlc/replay.ts +21 -48
- package/src/tlc/summary.ts +64 -58
- package/src/tlc/tlc-operators.ts +6 -17
- package/src/tlc/tlcext-operators.ts +70 -29
- package/src/tlc/trace-spec.ts +26 -51
- package/src/tlc/value-stream.ts +9 -13
- package/src/tlc/version.ts +0 -1
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +136 -338
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
package/src/fingerprints.ts
CHANGED
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
import { getValueFingerprint, getValueHash, type Value } from "./values";
|
|
1
|
+
import { combineHash, getValueFingerprint, getValueHash, isSameValue, type Value } from "./values";
|
|
2
2
|
|
|
3
3
|
const EMPTY = 0;
|
|
4
4
|
const INITIAL_CAPACITY = 1 << 12;
|
|
@@ -59,6 +59,70 @@ export const createFingerprintTable = (): FingerprintTable => {
|
|
|
59
59
|
};
|
|
60
60
|
};
|
|
61
61
|
|
|
62
|
+
export interface StateTable {
|
|
63
|
+
slots: Int32Array;
|
|
64
|
+
size: number;
|
|
65
|
+
shift: number;
|
|
66
|
+
states: Value[][];
|
|
67
|
+
}
|
|
68
|
+
|
|
69
|
+
// A Map holds at most 2^24 entries, so an open-addressing table keeps each hash and index + 1.
|
|
70
|
+
export const createStateTable = (states: Value[][]): StateTable => ({
|
|
71
|
+
slots: new Int32Array(1 << 17),
|
|
72
|
+
size: 0,
|
|
73
|
+
shift: 16,
|
|
74
|
+
states,
|
|
75
|
+
});
|
|
76
|
+
|
|
77
|
+
export const getStateHash = (state: Value[]) => {
|
|
78
|
+
let hash = 0x811c9dc5;
|
|
79
|
+
for (let index = 0; index < state.length; index++)
|
|
80
|
+
hash = combineHash(hash, getValueHash(state[index]));
|
|
81
|
+
return hash & 0x3fffffff;
|
|
82
|
+
};
|
|
83
|
+
|
|
84
|
+
export const isSameState = (stored: Value[], state: Value[]) => {
|
|
85
|
+
for (let position = 0; position < state.length; position++) {
|
|
86
|
+
if (!isSameValue(stored[position], state[position])) return false;
|
|
87
|
+
}
|
|
88
|
+
return true;
|
|
89
|
+
};
|
|
90
|
+
|
|
91
|
+
const getSlot = (table: StateTable, hash: number) =>
|
|
92
|
+
(Math.imul(hash, 0x9e3779b1) >>> table.shift) << 1;
|
|
93
|
+
|
|
94
|
+
export const findStateIndex = (table: StateTable, hash: number, state: Value[]) => {
|
|
95
|
+
const mask = table.slots.length - 1;
|
|
96
|
+
for (let slot = getSlot(table, hash); ; slot = (slot + 2) & mask) {
|
|
97
|
+
const entry = table.slots[slot + 1];
|
|
98
|
+
if (entry === 0) return -1;
|
|
99
|
+
if (table.slots[slot] === hash && isSameState(table.states[entry - 1], state)) {
|
|
100
|
+
return entry - 1;
|
|
101
|
+
}
|
|
102
|
+
}
|
|
103
|
+
};
|
|
104
|
+
|
|
105
|
+
const insertSeenState = (table: StateTable, hash: number, entry: number) => {
|
|
106
|
+
const mask = table.slots.length - 1;
|
|
107
|
+
let slot = getSlot(table, hash);
|
|
108
|
+
while (table.slots[slot + 1] !== 0) slot = (slot + 2) & mask;
|
|
109
|
+
table.slots[slot] = hash;
|
|
110
|
+
table.slots[slot + 1] = entry;
|
|
111
|
+
};
|
|
112
|
+
|
|
113
|
+
export const markSeenState = (table: StateTable, hash: number, index: number) => {
|
|
114
|
+
table.size++;
|
|
115
|
+
if (table.size * 4 > table.slots.length) {
|
|
116
|
+
const slots = table.slots;
|
|
117
|
+
table.slots = new Int32Array(slots.length * 2);
|
|
118
|
+
table.shift--;
|
|
119
|
+
for (let slot = 0; slot < slots.length; slot += 2) {
|
|
120
|
+
if (slots[slot + 1] !== 0) insertSeenState(table, slots[slot], slots[slot + 1]);
|
|
121
|
+
}
|
|
122
|
+
}
|
|
123
|
+
insertSeenState(table, hash, index + 1);
|
|
124
|
+
};
|
|
125
|
+
|
|
62
126
|
export interface SharedFingerprints {
|
|
63
127
|
slots: BigInt64Array;
|
|
64
128
|
used: Int32Array;
|
package/src/instances.ts
CHANGED
|
@@ -1,5 +1,6 @@
|
|
|
1
1
|
import {
|
|
2
2
|
getChildren,
|
|
3
|
+
getReferencedName,
|
|
3
4
|
isLocallyResolved,
|
|
4
5
|
type Bound,
|
|
5
6
|
type BoundPattern,
|
|
@@ -228,6 +229,16 @@ export const mapChildren = (
|
|
|
228
229
|
}
|
|
229
230
|
};
|
|
230
231
|
|
|
232
|
+
export const forEachChild = (
|
|
233
|
+
expression: Expression,
|
|
234
|
+
visit: (child: Expression, bound: string[]) => void,
|
|
235
|
+
): void => {
|
|
236
|
+
mapChildren(expression, (child, bound) => {
|
|
237
|
+
visit(child, bound);
|
|
238
|
+
return child;
|
|
239
|
+
});
|
|
240
|
+
};
|
|
241
|
+
|
|
231
242
|
interface Instantiation {
|
|
232
243
|
params: OperatorParam[];
|
|
233
244
|
substitutions: Map<string, Expression>;
|
|
@@ -280,19 +291,13 @@ const isBoundOnce = (replacement: Expression, instantiation: Instantiation) => {
|
|
|
280
291
|
};
|
|
281
292
|
|
|
282
293
|
const getFreeNames = (expression: Expression, bound = new Set<string>()): string[] => {
|
|
283
|
-
const name =
|
|
284
|
-
expression.kind === "Identifier"
|
|
285
|
-
? expression.name
|
|
286
|
-
: expression.kind === "Apply" || expression.kind === "OperatorReference"
|
|
287
|
-
? expression.operator
|
|
288
|
-
: undefined;
|
|
294
|
+
const name = getReferencedName(expression);
|
|
289
295
|
const names = name === undefined || bound.has(name) ? [] : [name];
|
|
290
|
-
|
|
296
|
+
forEachChild(expression, (child, childBound) =>
|
|
291
297
|
names.push(
|
|
292
298
|
...getFreeNames(child, childBound.length === 0 ? bound : new Set([...bound, ...childBound])),
|
|
293
|
-
)
|
|
294
|
-
|
|
295
|
-
});
|
|
299
|
+
),
|
|
300
|
+
);
|
|
296
301
|
return names;
|
|
297
302
|
};
|
|
298
303
|
|
|
@@ -487,6 +492,30 @@ export const createLocalIdentifier = (name: string, location: SourceLocation): E
|
|
|
487
492
|
export const createLocalArguments = (params: OperatorParam[], location: SourceLocation) =>
|
|
488
493
|
params.map((param) => createLocalIdentifier(param.name, location));
|
|
489
494
|
|
|
495
|
+
export const createLocalAlias = (
|
|
496
|
+
name: string,
|
|
497
|
+
key: string,
|
|
498
|
+
params: OperatorParam[],
|
|
499
|
+
forwarded: OperatorParam[],
|
|
500
|
+
location: SourceLocation,
|
|
501
|
+
): Definition => ({
|
|
502
|
+
kind: "Operator",
|
|
503
|
+
name,
|
|
504
|
+
params,
|
|
505
|
+
body:
|
|
506
|
+
forwarded.length === 0
|
|
507
|
+
? { kind: "Identifier", name: key, location }
|
|
508
|
+
: {
|
|
509
|
+
kind: "Apply",
|
|
510
|
+
operator: key,
|
|
511
|
+
args: createLocalArguments(forwarded, location),
|
|
512
|
+
location,
|
|
513
|
+
},
|
|
514
|
+
isLocal: true,
|
|
515
|
+
isRecursive: false,
|
|
516
|
+
location,
|
|
517
|
+
});
|
|
518
|
+
|
|
490
519
|
const getInstanceOperator = (
|
|
491
520
|
key: string,
|
|
492
521
|
params: OperatorParam[],
|
|
@@ -640,6 +669,14 @@ const substitute = (
|
|
|
640
669
|
};
|
|
641
670
|
}
|
|
642
671
|
if (expression.kind === "OperatorReference" && isFree(expression.operator)) {
|
|
672
|
+
const replacement = instantiation.substitutions.get(expression.operator);
|
|
673
|
+
if (
|
|
674
|
+
replacement?.kind === "Identifier" ||
|
|
675
|
+
replacement?.kind === "OperatorReference" ||
|
|
676
|
+
replacement?.kind === "Lambda"
|
|
677
|
+
) {
|
|
678
|
+
return withSubstitutionFrames(replacement, [expression]);
|
|
679
|
+
}
|
|
643
680
|
const copy = getCopy(rewrite, expression.operator);
|
|
644
681
|
if (copy === undefined) return expression;
|
|
645
682
|
const definition = instantiation.getDefinition(expression.operator);
|
package/src/java-hash.ts
ADDED
package/src/java-overrides.ts
CHANGED
|
@@ -35,7 +35,6 @@ const ACCESS_PUBLIC = 0x0001;
|
|
|
35
35
|
const ACCESS_STATIC = 0x0008;
|
|
36
36
|
const VALUE_PACKAGE = "tlc2/value/impl/";
|
|
37
37
|
|
|
38
|
-
// The constant pool tags of the JVM specification, section 4.4.
|
|
39
38
|
const POOL_TAG = {
|
|
40
39
|
utf8: 1,
|
|
41
40
|
integer: 3,
|
|
@@ -68,10 +67,10 @@ const OPCODE = {
|
|
|
68
67
|
|
|
69
68
|
const createReader = (bytes: Uint8Array) => {
|
|
70
69
|
const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);
|
|
71
|
-
|
|
70
|
+
let offset = 0;
|
|
72
71
|
const advance = (length: number) => {
|
|
73
|
-
const start =
|
|
74
|
-
|
|
72
|
+
const start = offset;
|
|
73
|
+
offset += length;
|
|
75
74
|
return start;
|
|
76
75
|
};
|
|
77
76
|
return {
|
|
@@ -79,7 +78,7 @@ const createReader = (bytes: Uint8Array) => {
|
|
|
79
78
|
readUint16: () => view.getUint16(advance(2)),
|
|
80
79
|
readUint32: () => view.getUint32(advance(4)),
|
|
81
80
|
readInt32: () => view.getInt32(advance(4)),
|
|
82
|
-
readBytes: (length: number) => bytes.subarray(advance(length),
|
|
81
|
+
readBytes: (length: number) => bytes.subarray(advance(length), offset),
|
|
83
82
|
};
|
|
84
83
|
};
|
|
85
84
|
|
|
@@ -95,7 +94,6 @@ const PRIMITIVE_TYPES = new Map([
|
|
|
95
94
|
["V", "void"],
|
|
96
95
|
]);
|
|
97
96
|
|
|
98
|
-
// The modifiers Method#toString prints, in the order of Modifier#toString.
|
|
99
97
|
const METHOD_MODIFIERS: [number, string][] = [
|
|
100
98
|
[0x0001, "public"],
|
|
101
99
|
[0x0004, "protected"],
|
|
@@ -119,8 +117,6 @@ const getClassName = (pool: PoolEntry[], index: number) => pool[pool[index].firs
|
|
|
119
117
|
const getJavaClassName = (pool: PoolEntry[], index: number) =>
|
|
120
118
|
getClassName(pool, index).replaceAll("/", ".");
|
|
121
119
|
|
|
122
|
-
// In the order of the class file. Class#getDeclaredMethods orders them by where HotSpot allocated
|
|
123
|
-
// the symbols of their names.
|
|
124
120
|
const readClassFile = (bytes: Uint8Array) => {
|
|
125
121
|
const reader = createReader(bytes);
|
|
126
122
|
if (reader.readUint32() !== CLASS_MAGIC)
|
|
@@ -181,7 +177,6 @@ const readClassFile = (bytes: Uint8Array) => {
|
|
|
181
177
|
const isOverride = (access & ACCESS_PUBLIC) !== 0 && (access & ACCESS_STATIC) !== 0;
|
|
182
178
|
if (!isOverride) continue;
|
|
183
179
|
const code = attributes.find((attribute) => attribute.name === "Code")?.reader;
|
|
184
|
-
// A Code attribute holds max_stack and max_locals before the length of the bytecode.
|
|
185
180
|
code?.readBytes(4);
|
|
186
181
|
const thrown = attributes.find((attribute) => attribute.name === "Exceptions")?.reader;
|
|
187
182
|
const exceptions = thrown
|
package/src/json-reader.ts
CHANGED
|
@@ -78,8 +78,7 @@ const NON_EXECUTE_PREFIX = ")]}'\n";
|
|
|
78
78
|
const MALFORMED_JSON_GUIDE =
|
|
79
79
|
"\nSee https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json";
|
|
80
80
|
|
|
81
|
-
// Gson's JsonParser.parseReader: a lenient JsonReader reads one element,
|
|
82
|
-
// again, then rejects anything but whitespace after it. An empty document reads as JSON null.
|
|
81
|
+
// Gson's JsonParser.parseReader: a lenient JsonReader reads one element, then, strict again, rejects anything but whitespace after it.
|
|
83
82
|
export const readJson = (text: string): JsonElement => {
|
|
84
83
|
const byteOrderMarkLength = text.startsWith("") ? 1 : 0;
|
|
85
84
|
let pos = byteOrderMarkLength;
|
package/src/json.ts
CHANGED
|
@@ -98,12 +98,9 @@ const toJson = (value: Value): string => {
|
|
|
98
98
|
if (typeof value === "string") return toJsonString(value);
|
|
99
99
|
if (typeof value !== "object") return String(value);
|
|
100
100
|
if (value.kind === "ModelValue") return toJsonString(value.name);
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
if (isFunctionClass(className)) return toFunctionJson(value);
|
|
105
|
-
if (isTlcEnumerable(value)) return toArrayJson(toFiniteSet(value).elements);
|
|
106
|
-
throw createUnsupportedError(value);
|
|
101
|
+
return getJavaClassName(value) === "RecordValue"
|
|
102
|
+
? toObjectJson(toFiniteFunction(value))
|
|
103
|
+
: toJsonArray(value);
|
|
107
104
|
};
|
|
108
105
|
|
|
109
106
|
const toJsonArray = (value: Value) => {
|
|
@@ -114,6 +111,8 @@ const toJsonArray = (value: Value) => {
|
|
|
114
111
|
throw createUnsupportedError(value);
|
|
115
112
|
};
|
|
116
113
|
|
|
114
|
+
const toNdJson = (elements: Value[]) => elements.map((element) => `${toJson(element)}\n`).join("");
|
|
115
|
+
|
|
117
116
|
const toJsonObject = (value: Value) => {
|
|
118
117
|
const className = getJavaClassName(value);
|
|
119
118
|
if (className === "RecordValue") return toObjectJson(toFiniteFunction(value));
|
|
@@ -174,8 +173,7 @@ const checkCharset = (charset: string) => {
|
|
|
174
173
|
);
|
|
175
174
|
};
|
|
176
175
|
|
|
177
|
-
// Files.newBufferedWriter
|
|
178
|
-
// start of a file that it neither truncates nor appends to.
|
|
176
|
+
// Files.newBufferedWriter writes the text over the start of a file that it neither truncates nor appends to.
|
|
179
177
|
const writeWithOptions = (files: FileSystem, path: string, names: string[], text: string) => {
|
|
180
178
|
const unknown = names.find((name) => !OPEN_OPTIONS.has(name));
|
|
181
179
|
if (unknown !== undefined) {
|
|
@@ -212,7 +210,6 @@ const writeWithOptions = (files: FileSystem, path: string, names: string[], text
|
|
|
212
210
|
);
|
|
213
211
|
};
|
|
214
212
|
|
|
215
|
-
// Java's File#getParentFile has no parent for a file name without a directory.
|
|
216
213
|
const makeParentDirectory = (files: FileSystem, path: string) => {
|
|
217
214
|
const separator = path.lastIndexOf("/");
|
|
218
215
|
if (separator !== -1) files.makeDirectory?.(path.slice(0, Math.max(separator, 1)));
|
|
@@ -263,7 +260,7 @@ export const createJsonOperators = (files: FileSystem): Builtin[] => [
|
|
|
263
260
|
throw createModuleArgumentError("second", "ndJsonSerialize", "sequence", value);
|
|
264
261
|
}
|
|
265
262
|
makeParentDirectory(files, path);
|
|
266
|
-
files.writeFile?.(path, elements
|
|
263
|
+
files.writeFile?.(path, toNdJson(elements));
|
|
267
264
|
return true;
|
|
268
265
|
}),
|
|
269
266
|
"public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException",
|
|
@@ -289,8 +286,6 @@ export const createJsonOperators = (files: FileSystem): Builtin[] => [
|
|
|
289
286
|
),
|
|
290
287
|
];
|
|
291
288
|
|
|
292
|
-
// TLC's Json overrides IOUtils!Serialize, as the CommunityModules define it, for the NDJSON format
|
|
293
|
-
// and falls back to its definition for any other.
|
|
294
289
|
export const createIoUtilsOperators = (
|
|
295
290
|
files: FileSystem,
|
|
296
291
|
evaluateReplaced: (name: string, args: BuiltinArgument[], context: Context | undefined) => Value,
|
|
@@ -320,12 +315,7 @@ export const createIoUtilsOperators = (
|
|
|
320
315
|
return option;
|
|
321
316
|
});
|
|
322
317
|
checkCharset(charset);
|
|
323
|
-
writeWithOptions(
|
|
324
|
-
files,
|
|
325
|
-
path,
|
|
326
|
-
names,
|
|
327
|
-
elements.map((element) => `${toJson(element)}\n`).join(""),
|
|
328
|
-
);
|
|
318
|
+
writeWithOptions(files, path, names, toNdJson(elements));
|
|
329
319
|
return true;
|
|
330
320
|
}),
|
|
331
321
|
"public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)",
|
package/src/levels.ts
CHANGED
|
@@ -16,7 +16,7 @@ import {
|
|
|
16
16
|
TlaSyntaxError,
|
|
17
17
|
type SanyError,
|
|
18
18
|
} from "./errors";
|
|
19
|
-
import {
|
|
19
|
+
import { forEachChild } from "./instances";
|
|
20
20
|
import { collectSemanticErrors, getBoundNames, getPatternNames } from "./resolve";
|
|
21
21
|
import { STANDARD_LEVELS } from "./standard-definitions";
|
|
22
22
|
|
|
@@ -55,11 +55,10 @@ type Resolved =
|
|
|
55
55
|
| { kind: "Declared"; name: string; level: number; arity: number }
|
|
56
56
|
| { kind: "Defined"; levels: OperatorLevels };
|
|
57
57
|
|
|
58
|
-
|
|
59
|
-
data: LevelData
|
|
60
|
-
|
|
61
|
-
declared
|
|
62
|
-
}
|
|
58
|
+
type Operand =
|
|
59
|
+
| { kind: "Value"; data: LevelData }
|
|
60
|
+
| { kind: "Operator"; data: OperatorLevels }
|
|
61
|
+
| { kind: "Declared"; data: LevelData; declared: OperatorParam };
|
|
63
62
|
|
|
64
63
|
export const CONSTANT_LEVEL = 0;
|
|
65
64
|
export const VARIABLE_LEVEL = 1;
|
|
@@ -96,6 +95,12 @@ export const putConstraint = (constraints: Map<string, number>, name: string, le
|
|
|
96
95
|
export const putArgConstraint = (constraints: Map<string, number>, key: string, level: number) =>
|
|
97
96
|
constraints.set(key, Math.max(level, constraints.get(key) ?? 0));
|
|
98
97
|
|
|
98
|
+
const mergeConstraints = (data: LevelData, part: LevelData) => {
|
|
99
|
+
part.constraints.forEach((value, key) => putConstraint(data.constraints, key, value));
|
|
100
|
+
part.argConstraints.forEach((value, key) => putArgConstraint(data.argConstraints, key, value));
|
|
101
|
+
part.argParams.forEach((key) => data.argParams.add(key));
|
|
102
|
+
};
|
|
103
|
+
|
|
99
104
|
const createSignature = (
|
|
100
105
|
name: string,
|
|
101
106
|
level: number,
|
|
@@ -193,8 +198,6 @@ const createLevelError = (message: string, expression: Expression) =>
|
|
|
193
198
|
|
|
194
199
|
const LOGICAL_OPERATORS = new Set(["/\\", "\\/", "=>", "<=>"]);
|
|
195
200
|
|
|
196
|
-
// SANY's OpApplNode.levelCheck rejects raw actions inside temporal formulas, but not inside a LET
|
|
197
|
-
// or a label.
|
|
198
201
|
const isOperatorApplication = (expression: Expression) =>
|
|
199
202
|
expression.kind !== "Let" && expression.kind !== "Label";
|
|
200
203
|
|
|
@@ -214,7 +217,6 @@ export const createLevelAnalyzer = (context: LevelContext) => {
|
|
|
214
217
|
const definition = context.getDefinition(name);
|
|
215
218
|
if (definition) {
|
|
216
219
|
const levels = analyzeDefinition(definition, new Map());
|
|
217
|
-
// SANY names a definition of an instance by its qualified name, as in I!Foo.
|
|
218
220
|
const qualifiedName = context.getQualifiedName?.(name);
|
|
219
221
|
return {
|
|
220
222
|
kind: "Defined",
|
|
@@ -234,12 +236,8 @@ export const createLevelAnalyzer = (context: LevelContext) => {
|
|
|
234
236
|
data.params.add(param);
|
|
235
237
|
data.argParams.add(getArgumentParamKey(name, index, param));
|
|
236
238
|
});
|
|
237
|
-
operand.data.constraints.forEach((value, key) => putConstraint(data.constraints, key, value));
|
|
238
239
|
putArgConstraint(data.argConstraints, getArgumentKey(name, index), operand.data.level);
|
|
239
|
-
operand.data
|
|
240
|
-
putArgConstraint(data.argConstraints, key, value),
|
|
241
|
-
);
|
|
242
|
-
operand.data.argParams.forEach((key) => data.argParams.add(key));
|
|
240
|
+
mergeConstraints(data, operand.data);
|
|
243
241
|
});
|
|
244
242
|
return data;
|
|
245
243
|
};
|
|
@@ -252,7 +250,7 @@ export const createLevelAnalyzer = (context: LevelContext) => {
|
|
|
252
250
|
) => {
|
|
253
251
|
const isBound = (name: string) => bound.includes(name);
|
|
254
252
|
operands.forEach((operand, index) => {
|
|
255
|
-
if (operand.
|
|
253
|
+
if (operand.kind !== "Value") return;
|
|
256
254
|
if (operand.data.level > getMaxLevel(operator, index)) {
|
|
257
255
|
throw new TlaSyntaxError(
|
|
258
256
|
`Level error in applying operator ${operator.name}:\nThe level of argument ${index + 1} exceeds the maximum level allowed by the operator`,
|
|
@@ -274,7 +272,7 @@ export const createLevelAnalyzer = (context: LevelContext) => {
|
|
|
274
272
|
Math.max(
|
|
275
273
|
operator.level,
|
|
276
274
|
...operands
|
|
277
|
-
.filter((
|
|
275
|
+
.filter((_operand, index) => getWeight(operator, index) === 1)
|
|
278
276
|
.map((operand) => operand.data.level),
|
|
279
277
|
...ranges.map((range) => range.level),
|
|
280
278
|
),
|
|
@@ -303,10 +301,10 @@ export const createLevelAnalyzer = (context: LevelContext) => {
|
|
|
303
301
|
}),
|
|
304
302
|
);
|
|
305
303
|
operands.forEach((operand, operandIndex) => {
|
|
306
|
-
|
|
307
|
-
|
|
304
|
+
if (operand.kind !== "Operator") return;
|
|
305
|
+
const argument = operand.data;
|
|
308
306
|
operands.forEach((other, otherIndex) =>
|
|
309
|
-
argument.formals.forEach((
|
|
307
|
+
argument.formals.forEach((_formal, argumentIndex) => {
|
|
310
308
|
if (!hasCondition(operandIndex, otherIndex, argumentIndex)) return;
|
|
311
309
|
other.data.params.forEach((param) =>
|
|
312
310
|
putConstraint(data.constraints, param, getMaxLevel(argument, argumentIndex)),
|
|
@@ -316,9 +314,13 @@ export const createLevelAnalyzer = (context: LevelContext) => {
|
|
|
316
314
|
});
|
|
317
315
|
operator.argParams.forEach((key) => {
|
|
318
316
|
const parameter = parseArgumentParamKey(key);
|
|
319
|
-
const argument = getOperand(parameter.operator)
|
|
320
|
-
if (argument) {
|
|
321
|
-
putConstraint(
|
|
317
|
+
const argument = getOperand(parameter.operator);
|
|
318
|
+
if (argument?.kind === "Operator") {
|
|
319
|
+
putConstraint(
|
|
320
|
+
data.constraints,
|
|
321
|
+
parameter.param,
|
|
322
|
+
getMaxLevel(argument.data, parameter.index),
|
|
323
|
+
);
|
|
322
324
|
}
|
|
323
325
|
});
|
|
324
326
|
|
|
@@ -331,9 +333,9 @@ export const createLevelAnalyzer = (context: LevelContext) => {
|
|
|
331
333
|
constraints.forEach((value, key) => putArgConstraint(data.argConstraints, key, value)),
|
|
332
334
|
);
|
|
333
335
|
operands.forEach((operand, operandIndex) => {
|
|
336
|
+
if (operand.kind !== "Declared") return;
|
|
334
337
|
const declared = operand.declared;
|
|
335
|
-
|
|
336
|
-
Array.from({ length: declared.arity }, (_, argumentIndex) =>
|
|
338
|
+
Array.from({ length: declared.arity }, (_value, argumentIndex) =>
|
|
337
339
|
putArgConstraint(
|
|
338
340
|
data.argConstraints,
|
|
339
341
|
getArgumentKey(declared.name, argumentIndex),
|
|
@@ -341,7 +343,7 @@ export const createLevelAnalyzer = (context: LevelContext) => {
|
|
|
341
343
|
),
|
|
342
344
|
);
|
|
343
345
|
operands.forEach((other, otherIndex) =>
|
|
344
|
-
Array.from({ length: declared.arity }, (
|
|
346
|
+
Array.from({ length: declared.arity }, (_value, argumentIndex) => {
|
|
345
347
|
if (hasCondition(operandIndex, otherIndex, argumentIndex)) {
|
|
346
348
|
putArgConstraint(
|
|
347
349
|
data.argConstraints,
|
|
@@ -384,17 +386,17 @@ export const createLevelAnalyzer = (context: LevelContext) => {
|
|
|
384
386
|
);
|
|
385
387
|
return;
|
|
386
388
|
}
|
|
387
|
-
if (argument.
|
|
389
|
+
if (argument.kind === "Declared") {
|
|
388
390
|
data.argParams.add(
|
|
389
391
|
getArgumentParamKey(argument.declared.name, parameter.index, parameter.param),
|
|
390
392
|
);
|
|
391
393
|
}
|
|
392
394
|
});
|
|
393
395
|
operands.forEach((operand, operandIndex) => {
|
|
396
|
+
if (operand.kind !== "Declared") return;
|
|
394
397
|
const declared = operand.declared;
|
|
395
|
-
if (!declared) return;
|
|
396
398
|
operands.forEach((other, otherIndex) =>
|
|
397
|
-
Array.from({ length: declared.arity }, (
|
|
399
|
+
Array.from({ length: declared.arity }, (_value, argumentIndex) => {
|
|
398
400
|
if (!hasCondition(operandIndex, otherIndex, argumentIndex)) return;
|
|
399
401
|
other.data.params.forEach((param) =>
|
|
400
402
|
data.argParams.add(getArgumentParamKey(declared.name, argumentIndex, param)),
|
|
@@ -413,7 +415,7 @@ export const createLevelAnalyzer = (context: LevelContext) => {
|
|
|
413
415
|
expression.body,
|
|
414
416
|
scope,
|
|
415
417
|
);
|
|
416
|
-
return {
|
|
418
|
+
return { kind: "Operator", data: operator };
|
|
417
419
|
}
|
|
418
420
|
const name =
|
|
419
421
|
expression.kind === "OperatorReference"
|
|
@@ -427,16 +429,16 @@ export const createLevelAnalyzer = (context: LevelContext) => {
|
|
|
427
429
|
resolved.kind === "Defined" &&
|
|
428
430
|
(resolved.levels.formals.length > 0 || expression.kind === "OperatorReference")
|
|
429
431
|
) {
|
|
430
|
-
return {
|
|
432
|
+
return { kind: "Operator", data: resolved.levels };
|
|
431
433
|
}
|
|
432
434
|
if (resolved.kind === "Declared" && resolved.arity > 0) {
|
|
433
435
|
const data = createData();
|
|
434
436
|
data.params.add(name);
|
|
435
|
-
return { data, declared: { name, arity: resolved.arity } };
|
|
437
|
+
return { kind: "Declared", data, declared: { name, arity: resolved.arity } };
|
|
436
438
|
}
|
|
437
|
-
if (expression.kind === "OperatorReference") return { data: createData() };
|
|
439
|
+
if (expression.kind === "OperatorReference") return { kind: "Value", data: createData() };
|
|
438
440
|
}
|
|
439
|
-
return { data: analyze(expression, scope) };
|
|
441
|
+
return { kind: "Value", data: analyze(expression, scope) };
|
|
440
442
|
};
|
|
441
443
|
|
|
442
444
|
const toOperands = (expressions: Expression[], scope: Scope) =>
|
|
@@ -512,18 +514,12 @@ export const createLevelAnalyzer = (context: LevelContext) => {
|
|
|
512
514
|
argConstraints: new Map(body.argConstraints),
|
|
513
515
|
argParams: new Set(body.argParams),
|
|
514
516
|
};
|
|
515
|
-
expression.definitions.forEach((definition) =>
|
|
516
|
-
|
|
517
|
-
|
|
518
|
-
levels.argConstraints.forEach((value, key) =>
|
|
519
|
-
putArgConstraint(data.argConstraints, key, value),
|
|
520
|
-
);
|
|
521
|
-
levels.argParams.forEach((key) => data.argParams.add(key));
|
|
522
|
-
});
|
|
517
|
+
expression.definitions.forEach((definition) =>
|
|
518
|
+
mergeConstraints(data, analyzeDefinition(definition, inner)),
|
|
519
|
+
);
|
|
523
520
|
return data;
|
|
524
521
|
};
|
|
525
522
|
|
|
526
|
-
// SANY reports a level error of an operator's arguments at the application.
|
|
527
523
|
const analyze = (expression: Expression, scope: Scope): LevelData => {
|
|
528
524
|
try {
|
|
529
525
|
return analyzeNode(expression, scope);
|
|
@@ -687,15 +683,14 @@ export const createLevelAnalyzer = (context: LevelContext) => {
|
|
|
687
683
|
toOperand(expression.function, scope),
|
|
688
684
|
expression.args.length === 1
|
|
689
685
|
? toOperand(expression.args[0], scope)
|
|
690
|
-
: { data: applyBuiltin(SET_LEVELS, expression.args, scope) },
|
|
686
|
+
: { kind: "Value", data: applyBuiltin(SET_LEVELS, expression.args, scope) },
|
|
691
687
|
]);
|
|
692
|
-
// SANY's semantic checker rejects the expression without computing its level.
|
|
693
688
|
case "Bracket":
|
|
694
689
|
return createData();
|
|
695
690
|
case "FieldAccess":
|
|
696
691
|
return applyDefined(SELECT_LEVELS, [
|
|
697
692
|
toOperand(expression.record, scope),
|
|
698
|
-
{ data: createData() },
|
|
693
|
+
{ kind: "Value", data: createData() },
|
|
699
694
|
]);
|
|
700
695
|
case "BoxAction":
|
|
701
696
|
case "AngleAction":
|
|
@@ -736,7 +731,6 @@ export const createLevelAnalyzer = (context: LevelContext) => {
|
|
|
736
731
|
case "Apply":
|
|
737
732
|
visitOperator(expression.operator, expression.args);
|
|
738
733
|
return names;
|
|
739
|
-
// SANY's LetInNode and OpArgNode don't carry the non-Leibniz parameters of their bodies.
|
|
740
734
|
case "Lambda":
|
|
741
735
|
case "Let":
|
|
742
736
|
return names;
|
|
@@ -759,10 +753,9 @@ export const createLevelAnalyzer = (context: LevelContext) => {
|
|
|
759
753
|
);
|
|
760
754
|
return names;
|
|
761
755
|
default:
|
|
762
|
-
|
|
763
|
-
visit(child, isNonLeibniz, bindFormals(scope, toFormals(bound)))
|
|
764
|
-
|
|
765
|
-
});
|
|
756
|
+
forEachChild(expression, (child, bound) =>
|
|
757
|
+
visit(child, isNonLeibniz, bindFormals(scope, toFormals(bound))),
|
|
758
|
+
);
|
|
766
759
|
return names;
|
|
767
760
|
}
|
|
768
761
|
};
|
|
@@ -791,13 +784,13 @@ export const createLevelAnalyzer = (context: LevelContext) => {
|
|
|
791
784
|
minMaxLevels: formals.map((formal) =>
|
|
792
785
|
Array.from(
|
|
793
786
|
{ length: formal.arity },
|
|
794
|
-
(
|
|
787
|
+
(_value, index) => data.argConstraints.get(getArgumentKey(formal.name, index)) ?? 0,
|
|
795
788
|
),
|
|
796
789
|
),
|
|
797
790
|
conditions: new Set(
|
|
798
791
|
formals.flatMap((operator, operatorIndex) =>
|
|
799
792
|
formals.flatMap((param, paramIndex) =>
|
|
800
|
-
Array.from({ length: operator.arity }, (
|
|
793
|
+
Array.from({ length: operator.arity }, (_value, argumentIndex) => argumentIndex)
|
|
801
794
|
.filter((argumentIndex) =>
|
|
802
795
|
data.argParams.has(getArgumentParamKey(operator.name, argumentIndex, param.name)),
|
|
803
796
|
)
|
|
@@ -875,9 +868,7 @@ export const analyzeAssumeProve = (
|
|
|
875
868
|
const data = createData(Math.max(...parts.map((part) => part.level)));
|
|
876
869
|
parts.forEach((part) => {
|
|
877
870
|
part.params.forEach((param) => data.params.add(param));
|
|
878
|
-
|
|
879
|
-
part.argConstraints.forEach((value, key) => putArgConstraint(data.argConstraints, key, value));
|
|
880
|
-
part.argParams.forEach((key) => data.argParams.add(key));
|
|
871
|
+
mergeConstraints(data, part);
|
|
881
872
|
});
|
|
882
873
|
return data;
|
|
883
874
|
};
|
|
@@ -904,7 +895,6 @@ export const checkModuleLevels = (
|
|
|
904
895
|
? analyzeAssumeProve(body.statement, new Map(), analyzer).level
|
|
905
896
|
: getLevel([body.statement]);
|
|
906
897
|
};
|
|
907
|
-
// The proof of a temporal goal may only assume constants.
|
|
908
898
|
const checkTemporalGoal = (proof: Proof | undefined): SanyError[] =>
|
|
909
899
|
proof?.kind !== "Steps"
|
|
910
900
|
? []
|
|
@@ -930,7 +920,6 @@ export const checkModuleLevels = (
|
|
|
930
920
|
}
|
|
931
921
|
return step.body.kind === "Qed" ? checkTemporalGoal(step.proof) : [];
|
|
932
922
|
});
|
|
933
|
-
// SANY checks each step as a theorem of its own after the steps of its proof.
|
|
934
923
|
const checkProof = (proof: Proof | undefined): SanyError[] =>
|
|
935
924
|
proof?.kind !== "Steps"
|
|
936
925
|
? []
|