tla-ts 0.0.4-dev.0be9567 → 0.0.4-dev.43f28be
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 +27 -141
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +35 -1
- package/dist/index.d.ts +35 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +996 -0
- package/dist/prove.js +996 -0
- package/dist/run-cli.cjs +517 -47
- package/dist/run-cli.js +517 -47
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +38 -44
- package/dist/transfer.js +38 -44
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +21 -12
- package/src/check.ts +1 -0
- package/src/errors.ts +86 -0
- package/src/evaluate.ts +54 -19
- package/src/index.ts +10 -0
- package/src/{obligation-action.ts → obligations/action.ts} +258 -37
- package/src/{obligation-anon.ts → obligations/anon.ts} +13 -7
- package/src/obligations/ctx.ts +64 -0
- package/src/{obligation-deref.ts → obligations/deref.ts} +2 -2
- package/src/{obligation-expression.ts → obligations/expression.ts} +54 -8
- package/src/{obligation-format.ts → obligations/format.ts} +6 -5
- package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
- package/src/{obligations.ts → obligations/index.ts} +28 -12
- package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
- package/src/{obligation-module.ts → obligations/module.ts} +46 -20
- package/src/obligations/pickle.ts +100 -0
- package/src/obligations/pragma.ts +189 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +9 -63
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
- package/src/{obligation-source.ts → obligations/source.ts} +91 -35
- package/src/obligations/temporal.ts +319 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
- package/src/ocaml-marshal.ts +166 -0
- package/src/parallel-worker.ts +2 -18
- package/src/parallel.ts +10 -43
- package/src/prove/decide-pool.ts +100 -0
- package/src/prove/deciders.ts +33 -0
- package/src/prove/isabelle/LICENSE +36 -0
- package/src/prove/isabelle/LICENSE-tlapm +26 -0
- package/src/prove/isabelle/decide.ts +47 -0
- package/src/prove/isabelle/encode.ts +508 -0
- package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prove/isabelle/isar/method.ts +367 -0
- package/src/prove/isabelle/isar/proof.ts +28 -0
- package/src/prove/isabelle/isar/statement.ts +57 -0
- package/src/prove/isabelle/isar/theory.ts +192 -0
- package/src/prove/isabelle/isar/type-check.ts +278 -0
- package/src/prove/isabelle/provers/blast/blast.ts +258 -0
- package/src/prove/isabelle/provers/blast/branch.ts +322 -0
- package/src/prove/isabelle/provers/blast/prove.ts +347 -0
- package/src/prove/isabelle/provers/blast/rules.ts +330 -0
- package/src/prove/isabelle/provers/blast/state.ts +180 -0
- package/src/prove/isabelle/provers/blast/term.ts +547 -0
- package/src/prove/isabelle/provers/clasimp.ts +150 -0
- package/src/prove/isabelle/provers/classical.ts +389 -0
- package/src/prove/isabelle/provers/hypsubst.ts +441 -0
- package/src/prove/isabelle/pure/bicompose.ts +174 -0
- package/src/prove/isabelle/pure/consts.ts +32 -0
- package/src/prove/isabelle/pure/conv.ts +79 -0
- package/src/prove/isabelle/pure/drule.ts +264 -0
- package/src/prove/isabelle/pure/envir.ts +363 -0
- package/src/prove/isabelle/pure/goal.ts +53 -0
- package/src/prove/isabelle/pure/interrupt.ts +16 -0
- package/src/prove/isabelle/pure/list.ts +12 -0
- package/src/prove/isabelle/pure/logic.ts +402 -0
- package/src/prove/isabelle/pure/name.ts +110 -0
- package/src/prove/isabelle/pure/net.ts +262 -0
- package/src/prove/isabelle/pure/object-logic.ts +41 -0
- package/src/prove/isabelle/pure/pattern.ts +650 -0
- package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
- package/src/prove/isabelle/pure/rewriter.ts +602 -0
- package/src/prove/isabelle/pure/search.ts +68 -0
- package/src/prove/isabelle/pure/seq.ts +156 -0
- package/src/prove/isabelle/pure/simplifier.ts +112 -0
- package/src/prove/isabelle/pure/table.ts +208 -0
- package/src/prove/isabelle/pure/tactic.ts +276 -0
- package/src/prove/isabelle/pure/tactical.ts +347 -0
- package/src/prove/isabelle/pure/term-ord.ts +159 -0
- package/src/prove/isabelle/pure/term.ts +808 -0
- package/src/prove/isabelle/pure/thm.ts +806 -0
- package/src/prove/isabelle/pure/type.ts +133 -0
- package/src/prove/isabelle/pure/unify.ts +753 -0
- package/src/prove/isabelle/pure/variable.ts +25 -0
- package/src/prove/isabelle/tla/classical-setup.ts +101 -0
- package/src/prove/isabelle/tla/context.ts +74 -0
- package/src/prove/isabelle/tla/logic-data.ts +5 -0
- package/src/prove/isabelle/tla/logic.ts +215 -0
- package/src/prove/isabelle/tla/simpdata.ts +241 -0
- package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prove/ocaml.ts +22 -0
- package/src/prove/prep/action.ts +520 -0
- package/src/prove/prep/defs.ts +33 -0
- package/src/prove/prep/elab.ts +156 -0
- package/src/prove/prep/enabled-axioms.ts +189 -0
- package/src/prove/prep/enabled.ts +43 -0
- package/src/prove/prep/fingerprint.ts +388 -0
- package/src/prove/prep/flatten.ts +70 -0
- package/src/prove/prep/level-comparison.ts +552 -0
- package/src/prove/prep/md5.ts +67 -0
- package/src/prove/prep/pragma.ts +221 -0
- package/src/prove/prep/trivial.ts +22 -0
- package/src/prove/prove-worker.ts +27 -0
- package/src/prove/prove.ts +518 -0
- package/src/prove/ptl/decide.ts +68 -0
- package/src/prove/ptl/encode.ts +256 -0
- package/src/prove/ptl/sat.ts +151 -0
- package/src/prove/ptl/tableau.ts +276 -0
- package/src/prove/smt/axiomatize.ts +69 -0
- package/src/prove/smt/axioms.ts +210 -0
- package/src/prove/smt/context.ts +108 -0
- package/src/prove/smt/data.ts +665 -0
- package/src/prove/smt/encode.ts +169 -0
- package/src/prove/smt/extensionality.ts +63 -0
- package/src/prove/smt/flatten.ts +127 -0
- package/src/prove/smt/format.ts +143 -0
- package/src/prove/smt/instances.ts +182 -0
- package/src/prove/smt/rewrite.ts +784 -0
- package/src/prove/smt/simplify.ts +57 -0
- package/src/prove/smt/solver/act-cache.ts +265 -0
- package/src/prove/smt/solver/arith-rewriter.ts +962 -0
- package/src/prove/smt/solver/array.ts +22 -0
- package/src/prove/smt/solver/asserted-formulas.ts +469 -0
- package/src/prove/smt/solver/ast-lt.ts +157 -0
- package/src/prove/smt/solver/ast-util.ts +147 -0
- package/src/prove/smt/solver/ast.ts +1315 -0
- package/src/prove/smt/solver/auf-solver.ts +572 -0
- package/src/prove/smt/solver/case-split-queue.ts +178 -0
- package/src/prove/smt/solver/cg-table.ts +175 -0
- package/src/prove/smt/solver/clause.ts +276 -0
- package/src/prove/smt/solver/conflict-resolution.ts +343 -0
- package/src/prove/smt/solver/context.ts +1292 -0
- package/src/prove/smt/solver/ctx-simplify.ts +334 -0
- package/src/prove/smt/solver/der.ts +224 -0
- package/src/prove/smt/solver/dyn-ack.ts +141 -0
- package/src/prove/smt/solver/e-matching.ts +659 -0
- package/src/prove/smt/solver/enode.ts +259 -0
- package/src/prove/smt/solver/expr-ref.ts +21 -0
- package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prove/smt/solver/fingerprints.ts +92 -0
- package/src/prove/smt/solver/flat-literals.ts +51 -0
- package/src/prove/smt/solver/goal.ts +138 -0
- package/src/prove/smt/solver/hash.ts +173 -0
- package/src/prove/smt/solver/hashtable.ts +166 -0
- package/src/prove/smt/solver/internalizer.ts +1381 -0
- package/src/prove/smt/solver/lbool.ts +5 -0
- package/src/prove/smt/solver/literal.ts +24 -0
- package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prove/smt/solver/lp/constraints.ts +78 -0
- package/src/prove/smt/solver/lp/containers.ts +296 -0
- package/src/prove/smt/solver/lp/core-solver.ts +504 -0
- package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
- package/src/prove/smt/solver/lp/dependency.ts +51 -0
- package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prove/smt/solver/lp/explanation.ts +46 -0
- package/src/prove/smt/solver/lp/gomory.ts +255 -0
- package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prove/smt/solver/lp/hnf.ts +281 -0
- package/src/prove/smt/solver/lp/int-cube.ts +295 -0
- package/src/prove/smt/solver/lp/int-solver.ts +514 -0
- package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prove/smt/solver/lp/lar-term.ts +62 -0
- package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prove/smt/solver/lp/nex.ts +120 -0
- package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prove/smt/solver/lp/nla-core.ts +968 -0
- package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prove/smt/solver/lp/nla-order.ts +307 -0
- package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prove/smt/solver/lp/nla-types.ts +124 -0
- package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prove/smt/solver/lp/pdd.ts +971 -0
- package/src/prove/smt/solver/lp/random-updater.ts +138 -0
- package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prove/smt/solver/lp/union-find.ts +96 -0
- package/src/prove/smt/solver/mam-compiler.ts +847 -0
- package/src/prove/smt/solver/mam-interpreter.ts +400 -0
- package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prove/smt/solver/model-checker.ts +347 -0
- package/src/prove/smt/solver/model-evaluator.ts +262 -0
- package/src/prove/smt/solver/model-finder.ts +155 -0
- package/src/prove/smt/solver/model-generator.ts +97 -0
- package/src/prove/smt/solver/model-macro-solver.ts +728 -0
- package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prove/smt/solver/nlsat/explain.ts +607 -0
- package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
- package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prove/smt/solver/nlsat/solver.ts +911 -0
- package/src/prove/smt/solver/nlsat/types.ts +43 -0
- package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prove/smt/solver/nnf.ts +469 -0
- package/src/prove/smt/solver/pattern-inference.ts +351 -0
- package/src/prove/smt/solver/poly-rewriter.ts +477 -0
- package/src/prove/smt/solver/propagate-values.ts +83 -0
- package/src/prove/smt/solver/proto-model.ts +551 -0
- package/src/prove/smt/solver/pull-quant.ts +139 -0
- package/src/prove/smt/solver/qe-lite-der.ts +526 -0
- package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prove/smt/solver/qe-lite.ts +381 -0
- package/src/prove/smt/solver/qi-queue.ts +362 -0
- package/src/prove/smt/solver/quant-tactics.ts +117 -0
- package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prove/smt/solver/quantifier-manager.ts +186 -0
- package/src/prove/smt/solver/random-gen.ts +10 -0
- package/src/prove/smt/solver/rational.ts +165 -0
- package/src/prove/smt/solver/ref-vector.ts +62 -0
- package/src/prove/smt/solver/relevancy.ts +247 -0
- package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prove/smt/solver/rewriter.ts +843 -0
- package/src/prove/smt/solver/rlimit.ts +79 -0
- package/src/prove/smt/solver/smtlib-parser.ts +526 -0
- package/src/prove/smt/solver/solver.ts +71 -0
- package/src/prove/smt/solver/sort.ts +35 -0
- package/src/prove/smt/solver/sticky-generations.ts +69 -0
- package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prove/smt/solver/theory-lra-model.ts +243 -0
- package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prove/smt/solver/theory-lra-state.ts +43 -0
- package/src/prove/smt/solver/theory-lra.ts +56 -0
- package/src/prove/smt/solver/var-subst.ts +258 -0
- package/src/prove/smt/solver/z3-license.txt +10 -0
- package/src/prove/smt/table.ts +170 -0
- package/src/prove/tlapm/tlapm.ts +97 -0
- package/src/prove/tlaps-module.ts +510 -0
- package/src/prove/verdict.ts +18 -0
- package/src/prove/zenon/LICENSE +32 -0
- package/src/prove/zenon/check/check.ts +105 -0
- package/src/prove/zenon/check/definitions.ts +144 -0
- package/src/prove/zenon/check/equality.ts +182 -0
- package/src/prove/zenon/check/functions.ts +62 -0
- package/src/prove/zenon/check/keys.ts +125 -0
- package/src/prove/zenon/check/propositional.ts +104 -0
- package/src/prove/zenon/check/records.ts +188 -0
- package/src/prove/zenon/check/relations.ts +121 -0
- package/src/prove/zenon/check/rewrites.ts +224 -0
- package/src/prove/zenon/check/sets.ts +302 -0
- package/src/prove/zenon/check/terms.ts +127 -0
- package/src/prove/zenon/check/tla.ts +126 -0
- package/src/prove/zenon/decide.ts +113 -0
- package/src/prove/zenon/encode.ts +444 -0
- package/src/prove/zenon/eqrel.ts +300 -0
- package/src/prove/zenon/equality-rules.ts +435 -0
- package/src/prove/zenon/expr.ts +551 -0
- package/src/prove/zenon/index-table.ts +350 -0
- package/src/prove/zenon/isar-case.ts +513 -0
- package/src/prove/zenon/isar.ts +1249 -0
- package/src/prove/zenon/limits.ts +15 -0
- package/src/prove/zenon/llproof.ts +173 -0
- package/src/prove/zenon/mltoll.ts +1566 -0
- package/src/prove/zenon/node.ts +297 -0
- package/src/prove/zenon/ocaml.ts +169 -0
- package/src/prove/zenon/parse.ts +247 -0
- package/src/prove/zenon/phrase.ts +191 -0
- package/src/prove/zenon/proof.ts +198 -0
- package/src/prove/zenon/propositional-rules.ts +387 -0
- package/src/prove/zenon/rules.ts +94 -0
- package/src/prove/zenon/search.ts +288 -0
- package/src/prove/zenon/tla/functions.ts +151 -0
- package/src/prove/zenon/tla/llproof.ts +480 -0
- package/src/prove/zenon/tla/records.ts +225 -0
- package/src/prove/zenon/tla/rewrites.ts +447 -0
- package/src/prove/zenon/tla/sets.ts +304 -0
- package/src/prove/zenon/tla/terms.ts +181 -0
- package/src/prove/zenon/tla/tla.ts +506 -0
- package/src/run-cli.ts +338 -62
- package/src/successors.ts +24 -5
- package/src/tlapm-cache.ts +244 -0
- package/src/tlc-random.ts +55 -32
- package/src/tlc-version.ts +8 -7
- package/src/values.ts +47 -4
- package/src/worker.ts +65 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
|
@@ -0,0 +1,166 @@
|
|
|
1
|
+
// OCaml's Marshal format, ported from runtime/intern.c and runtime/extern.c, for the values in
|
|
2
|
+
// tlapm's fingerprints file. It writes no sharing, which OCaml reads the same.
|
|
3
|
+
|
|
4
|
+
import { TlaProofError } from "./errors";
|
|
5
|
+
|
|
6
|
+
interface OcamlBlock {
|
|
7
|
+
tag: number;
|
|
8
|
+
fields: OcamlValue[];
|
|
9
|
+
}
|
|
10
|
+
|
|
11
|
+
interface OcamlFloat {
|
|
12
|
+
float: number;
|
|
13
|
+
}
|
|
14
|
+
|
|
15
|
+
export type OcamlValue = number | string | OcamlBlock | OcamlFloat;
|
|
16
|
+
|
|
17
|
+
const MAGIC_NUMBER_SMALL = 0x8495a6be;
|
|
18
|
+
|
|
19
|
+
const CODE = {
|
|
20
|
+
int8: 0x0,
|
|
21
|
+
int16: 0x1,
|
|
22
|
+
int32: 0x2,
|
|
23
|
+
shared8: 0x4,
|
|
24
|
+
shared16: 0x5,
|
|
25
|
+
shared32: 0x6,
|
|
26
|
+
block32: 0x8,
|
|
27
|
+
string8: 0x9,
|
|
28
|
+
string32: 0xa,
|
|
29
|
+
doubleLittle: 0xc,
|
|
30
|
+
};
|
|
31
|
+
|
|
32
|
+
const PREFIX = { smallInt: 0x40, smallString: 0x20, smallBlock: 0x80 };
|
|
33
|
+
|
|
34
|
+
const HEADER_SIZE = 20;
|
|
35
|
+
|
|
36
|
+
export const block = (tag: number, ...fields: OcamlValue[]): OcamlBlock => ({ tag, fields });
|
|
37
|
+
|
|
38
|
+
export const isBlock = (value: OcamlValue): value is OcamlBlock =>
|
|
39
|
+
typeof value === "object" && "tag" in value;
|
|
40
|
+
|
|
41
|
+
// Returns the value marshaled at offset, and where the next one starts.
|
|
42
|
+
export const readMarshaled = (bytes: Uint8Array, offset: number) => {
|
|
43
|
+
const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);
|
|
44
|
+
if (bytes.length < offset + HEADER_SIZE || view.getUint32(offset) !== MAGIC_NUMBER_SMALL)
|
|
45
|
+
throw new TlaProofError("corrupted fingerprint file");
|
|
46
|
+
const end = offset + HEADER_SIZE + view.getUint32(offset + 4);
|
|
47
|
+
const objects: OcamlValue[] = [];
|
|
48
|
+
const state = { position: offset + HEADER_SIZE };
|
|
49
|
+
const take = (length: number) => {
|
|
50
|
+
const start = state.position;
|
|
51
|
+
state.position += length;
|
|
52
|
+
if (state.position > end) throw new TlaProofError("corrupted fingerprint file");
|
|
53
|
+
return start;
|
|
54
|
+
};
|
|
55
|
+
const decoder = new TextDecoder();
|
|
56
|
+
const readString = (length: number) => {
|
|
57
|
+
const start = take(length);
|
|
58
|
+
const value = decoder.decode(bytes.subarray(start, start + length));
|
|
59
|
+
objects.push(value);
|
|
60
|
+
return value;
|
|
61
|
+
};
|
|
62
|
+
const readBlock = (tag: number, size: number): OcamlBlock => {
|
|
63
|
+
const value = block(tag);
|
|
64
|
+
if (size > 0) objects.push(value);
|
|
65
|
+
for (let index = 0; index < size; index++) value.fields.push(read());
|
|
66
|
+
return value;
|
|
67
|
+
};
|
|
68
|
+
const readShared = (distance: number) => objects[objects.length - distance];
|
|
69
|
+
const read = (): OcamlValue => {
|
|
70
|
+
const code = bytes[take(1)];
|
|
71
|
+
if (code >= PREFIX.smallBlock) return readBlock(code & 0xf, (code >> 4) & 0x7);
|
|
72
|
+
if (code >= PREFIX.smallInt) return code & 0x3f;
|
|
73
|
+
if (code >= PREFIX.smallString) return readString(code & 0x1f);
|
|
74
|
+
switch (code) {
|
|
75
|
+
case CODE.int8:
|
|
76
|
+
return view.getInt8(take(1));
|
|
77
|
+
case CODE.int16:
|
|
78
|
+
return view.getInt16(take(2));
|
|
79
|
+
case CODE.int32:
|
|
80
|
+
return view.getInt32(take(4));
|
|
81
|
+
case CODE.shared8:
|
|
82
|
+
return readShared(view.getUint8(take(1)));
|
|
83
|
+
case CODE.shared16:
|
|
84
|
+
return readShared(view.getUint16(take(2)));
|
|
85
|
+
case CODE.shared32:
|
|
86
|
+
return readShared(view.getUint32(take(4)));
|
|
87
|
+
case CODE.block32: {
|
|
88
|
+
const header = view.getUint32(take(4));
|
|
89
|
+
return readBlock(header & 0xff, header >>> 10);
|
|
90
|
+
}
|
|
91
|
+
case CODE.string8:
|
|
92
|
+
return readString(view.getUint8(take(1)));
|
|
93
|
+
case CODE.string32:
|
|
94
|
+
return readString(view.getUint32(take(4)));
|
|
95
|
+
case CODE.doubleLittle: {
|
|
96
|
+
const value = { float: view.getFloat64(take(8), true) };
|
|
97
|
+
objects.push(value);
|
|
98
|
+
return value;
|
|
99
|
+
}
|
|
100
|
+
}
|
|
101
|
+
throw new TlaProofError("corrupted fingerprint file");
|
|
102
|
+
};
|
|
103
|
+
return { value: read(), next: end };
|
|
104
|
+
};
|
|
105
|
+
|
|
106
|
+
export const writeMarshaled = (value: OcamlValue) => {
|
|
107
|
+
const bytes: number[] = [];
|
|
108
|
+
const sizes = { objects: 0, words32: 0, words64: 0 };
|
|
109
|
+
const pushInteger = (integer: number, length: number) => {
|
|
110
|
+
for (let shift = (length - 1) * 8; shift >= 0; shift -= 8)
|
|
111
|
+
bytes.push((integer >>> shift) & 0xff);
|
|
112
|
+
};
|
|
113
|
+
const encoder = new TextEncoder();
|
|
114
|
+
const write = (inner: OcamlValue) => {
|
|
115
|
+
if (typeof inner === "number") {
|
|
116
|
+
if (inner >= 0 && inner < 0x40) return bytes.push(PREFIX.smallInt + inner);
|
|
117
|
+
if (inner >= -0x80 && inner < 0x80) return bytes.push(CODE.int8, inner & 0xff);
|
|
118
|
+
if (inner >= -0x8000 && inner < 0x8000) {
|
|
119
|
+
bytes.push(CODE.int16);
|
|
120
|
+
return pushInteger(inner, 2);
|
|
121
|
+
}
|
|
122
|
+
bytes.push(CODE.int32);
|
|
123
|
+
return pushInteger(inner, 4);
|
|
124
|
+
}
|
|
125
|
+
sizes.objects++;
|
|
126
|
+
if (typeof inner === "string") {
|
|
127
|
+
const encoded = encoder.encode(inner);
|
|
128
|
+
if (encoded.length < 0x20) bytes.push(PREFIX.smallString + encoded.length);
|
|
129
|
+
else if (encoded.length < 0x100) bytes.push(CODE.string8, encoded.length);
|
|
130
|
+
else {
|
|
131
|
+
bytes.push(CODE.string32);
|
|
132
|
+
pushInteger(encoded.length, 4);
|
|
133
|
+
}
|
|
134
|
+
bytes.push(...encoded);
|
|
135
|
+
sizes.words32 += 1 + Math.floor((encoded.length + 4) / 4);
|
|
136
|
+
sizes.words64 += 1 + Math.floor((encoded.length + 8) / 8);
|
|
137
|
+
return;
|
|
138
|
+
}
|
|
139
|
+
if (!isBlock(inner)) {
|
|
140
|
+
const float = new DataView(new ArrayBuffer(8));
|
|
141
|
+
float.setFloat64(0, inner.float, true);
|
|
142
|
+
bytes.push(CODE.doubleLittle, ...new Uint8Array(float.buffer));
|
|
143
|
+
sizes.words32 += 3;
|
|
144
|
+
sizes.words64 += 2;
|
|
145
|
+
return;
|
|
146
|
+
}
|
|
147
|
+
const size = inner.fields.length;
|
|
148
|
+
if (size === 0) sizes.objects--;
|
|
149
|
+
else {
|
|
150
|
+
sizes.words32 += 1 + size;
|
|
151
|
+
sizes.words64 += 1 + size;
|
|
152
|
+
}
|
|
153
|
+
if (inner.tag < 16 && size < 8) bytes.push(PREFIX.smallBlock + inner.tag + (size << 4));
|
|
154
|
+
else {
|
|
155
|
+
bytes.push(CODE.block32);
|
|
156
|
+
pushInteger(size * 1024 + inner.tag, 4);
|
|
157
|
+
}
|
|
158
|
+
inner.fields.forEach(write);
|
|
159
|
+
};
|
|
160
|
+
write(value);
|
|
161
|
+
const header = new DataView(new ArrayBuffer(HEADER_SIZE));
|
|
162
|
+
[MAGIC_NUMBER_SMALL, bytes.length, sizes.objects, sizes.words32, sizes.words64].forEach(
|
|
163
|
+
(field, index) => header.setUint32(index * 4, field),
|
|
164
|
+
);
|
|
165
|
+
return new Uint8Array([...new Uint8Array(header.buffer), ...bytes]);
|
|
166
|
+
};
|
package/src/parallel-worker.ts
CHANGED
|
@@ -7,20 +7,14 @@ import {
|
|
|
7
7
|
isSharedFingerprintsFull,
|
|
8
8
|
writeStateFingerprint,
|
|
9
9
|
} from "./fingerprints";
|
|
10
|
-
import type {
|
|
11
|
-
CoordinatorMessage,
|
|
12
|
-
LevelMessage,
|
|
13
|
-
Port,
|
|
14
|
-
StartMessage,
|
|
15
|
-
WorkerMessage,
|
|
16
|
-
} from "./parallel";
|
|
10
|
+
import type { CoordinatorMessage, LevelMessage, StartMessage, WorkerMessage } from "./parallel";
|
|
17
11
|
import { getSuccessors, type Successor } from "./successors";
|
|
18
12
|
import { getTlcStringOrder, getTlcDeclarationOrder } from "./tlc-order";
|
|
19
13
|
import { OUT_DEGREE_BUCKETS } from "./tlc-summary";
|
|
20
14
|
import { createStateDecoder, createStateEncoder, type EncodedStates } from "./transfer";
|
|
21
15
|
import { getRankedStringCount, setStringOrder, setValueVersion, type Value } from "./values";
|
|
16
|
+
import { getParentPort, type Port } from "./worker";
|
|
22
17
|
|
|
23
|
-
const WORKER_THREADS_MODULE = "node:worker_threads";
|
|
24
18
|
const LOCKED = -1;
|
|
25
19
|
|
|
26
20
|
interface Expansion {
|
|
@@ -36,16 +30,6 @@ interface Expansion {
|
|
|
36
30
|
fingerprintStates: Value[][];
|
|
37
31
|
}
|
|
38
32
|
|
|
39
|
-
const getParentPort = async () => {
|
|
40
|
-
if (typeof (globalThis as { postMessage?: unknown }).postMessage === "function") {
|
|
41
|
-
return globalThis as unknown as Port;
|
|
42
|
-
}
|
|
43
|
-
const threads: typeof import("node:worker_threads") = await import(
|
|
44
|
-
/* @vite-ignore */ /* webpackIgnore: true */ WORKER_THREADS_MODULE
|
|
45
|
-
);
|
|
46
|
-
return threads.parentPort as unknown as Port;
|
|
47
|
-
};
|
|
48
|
-
|
|
49
33
|
const run = (start: StartMessage, parent: Port) => {
|
|
50
34
|
const modules = new Map(start.modules);
|
|
51
35
|
const loadModule = (name: string) => modules.get(name);
|
package/src/parallel.ts
CHANGED
|
@@ -29,15 +29,7 @@ import { getFingerprintDistance, OUT_DEGREE_BUCKETS } from "./tlc-summary";
|
|
|
29
29
|
import { createStateEncoder, type EncodedStates } from "./transfer";
|
|
30
30
|
import type { TlcVersion } from "./tlc-version";
|
|
31
31
|
import { getRankedStringCount, setStringOrder, setValueVersion, type Value } from "./values";
|
|
32
|
-
|
|
33
|
-
const WORKER_THREADS_MODULE = "node:worker_threads";
|
|
34
|
-
|
|
35
|
-
export interface Port {
|
|
36
|
-
postMessage: (message: unknown, transfer?: unknown[]) => void;
|
|
37
|
-
addEventListener: (type: "message", listener: (event: { data: unknown }) => void) => void;
|
|
38
|
-
removeEventListener?: (type: "message", listener: (event: { data: unknown }) => void) => void;
|
|
39
|
-
start?: () => void;
|
|
40
|
-
}
|
|
32
|
+
import { spawnWorker, type Port } from "./worker";
|
|
41
33
|
|
|
42
34
|
export interface StartMessage {
|
|
43
35
|
type: "start";
|
|
@@ -76,39 +68,6 @@ export type CoordinatorMessage =
|
|
|
76
68
|
| { type: "level"; level: number }
|
|
77
69
|
| { type: "resize"; fingerprints: SharedFingerprints };
|
|
78
70
|
|
|
79
|
-
interface WorkerHandle {
|
|
80
|
-
postMessage: (message: unknown, transfer?: unknown[]) => void;
|
|
81
|
-
terminate: () => void;
|
|
82
|
-
}
|
|
83
|
-
|
|
84
|
-
interface WebWorker {
|
|
85
|
-
postMessage: (message: unknown, transfer?: unknown[]) => void;
|
|
86
|
-
addEventListener: (type: string, listener: (event: { data: unknown }) => void) => void;
|
|
87
|
-
terminate: () => void;
|
|
88
|
-
}
|
|
89
|
-
|
|
90
|
-
declare const Worker: new (url: URL, options: { type: "module" }) => WebWorker;
|
|
91
|
-
|
|
92
|
-
const spawnWorker = async (onMessage: (message: WorkerMessage) => void): Promise<WorkerHandle> => {
|
|
93
|
-
if (typeof Worker === "function") {
|
|
94
|
-
const worker = new Worker(new URL("./parallel-worker.js", import.meta.url), { type: "module" });
|
|
95
|
-
worker.addEventListener("message", (event) => onMessage(event.data as WorkerMessage));
|
|
96
|
-
worker.addEventListener("error", () => onMessage({ type: "abort" }));
|
|
97
|
-
return worker;
|
|
98
|
-
}
|
|
99
|
-
const threads: typeof import("node:worker_threads") = await import(
|
|
100
|
-
/* @vite-ignore */ /* webpackIgnore: true */ WORKER_THREADS_MODULE
|
|
101
|
-
);
|
|
102
|
-
const worker = new threads.Worker(new URL("./parallel-worker.js", import.meta.url));
|
|
103
|
-
worker.on("message", onMessage);
|
|
104
|
-
worker.on("error", () => onMessage({ type: "abort" }));
|
|
105
|
-
return {
|
|
106
|
-
postMessage: (message, transfer) =>
|
|
107
|
-
worker.postMessage(message, transfer as Parameters<typeof worker.postMessage>[1]),
|
|
108
|
-
terminate: () => void worker.terminate(),
|
|
109
|
-
};
|
|
110
|
-
};
|
|
111
|
-
|
|
112
71
|
export const check = async (options: CheckOptions): Promise<CheckResult> => {
|
|
113
72
|
const config =
|
|
114
73
|
typeof options.config === "string"
|
|
@@ -290,7 +249,15 @@ export const check = async (options: CheckOptions): Promise<CheckResult> => {
|
|
|
290
249
|
const ready = waitForReports(count);
|
|
291
250
|
const requests = new Int32Array(new SharedArrayBuffer(count * 4));
|
|
292
251
|
const remaining = new Int32Array(new SharedArrayBuffer(count * 4));
|
|
293
|
-
const workers = await Promise.all(
|
|
252
|
+
const workers = await Promise.all(
|
|
253
|
+
Array.from({ length: count }, () =>
|
|
254
|
+
spawnWorker(
|
|
255
|
+
new URL("./parallel-worker.js", import.meta.url),
|
|
256
|
+
(message) => onMessage(message as WorkerMessage),
|
|
257
|
+
() => onMessage({ type: "abort" }),
|
|
258
|
+
),
|
|
259
|
+
),
|
|
260
|
+
);
|
|
294
261
|
const terminate = () => workers.forEach((worker) => worker.terminate());
|
|
295
262
|
const channels = new Map<string, MessageChannel>();
|
|
296
263
|
const getPort = (from: number, to: number) => {
|
|
@@ -0,0 +1,100 @@
|
|
|
1
|
+
// Worker threads that decide the obligations prove sends them, the earliest obligation first.
|
|
2
|
+
|
|
3
|
+
import { TlaProverError, TlaUnsupportedError } from "../errors";
|
|
4
|
+
import { spawnWorker, type WorkerHandle } from "../worker";
|
|
5
|
+
import type { DecideOptions, Decision } from "./verdict";
|
|
6
|
+
|
|
7
|
+
export interface DecideRequest {
|
|
8
|
+
prover: string;
|
|
9
|
+
text: string;
|
|
10
|
+
timeLimitMs: number;
|
|
11
|
+
}
|
|
12
|
+
|
|
13
|
+
// A backend's decision, or the error that prove turns into a result.
|
|
14
|
+
export type DecideResponse =
|
|
15
|
+
| Decision
|
|
16
|
+
| { error: { name: "TlaProverError" | "TlaUnsupportedError"; message: string } };
|
|
17
|
+
|
|
18
|
+
interface PendingDecision {
|
|
19
|
+
request: DecideRequest;
|
|
20
|
+
priority: number;
|
|
21
|
+
resolve: (decision: Decision) => void;
|
|
22
|
+
reject: (error: unknown) => void;
|
|
23
|
+
}
|
|
24
|
+
|
|
25
|
+
export interface DecidePool {
|
|
26
|
+
decide: (
|
|
27
|
+
prover: string,
|
|
28
|
+
text: string,
|
|
29
|
+
options: DecideOptions,
|
|
30
|
+
priority: number,
|
|
31
|
+
) => Promise<Decision>;
|
|
32
|
+
// Rejects every decision not yet made with reason, and stops the workers.
|
|
33
|
+
terminate: (reason: unknown) => void;
|
|
34
|
+
}
|
|
35
|
+
|
|
36
|
+
export const createDecidePool = async (count: number): Promise<DecidePool> => {
|
|
37
|
+
const workers: WorkerHandle[] = [];
|
|
38
|
+
const queue: PendingDecision[] = [];
|
|
39
|
+
const running = new Map<number, PendingDecision>();
|
|
40
|
+
const idle: number[] = [];
|
|
41
|
+
const state: { failure: { reason: unknown } | undefined } = { failure: undefined };
|
|
42
|
+
const dispatch = () => {
|
|
43
|
+
while (idle.length > 0 && queue.length > 0) {
|
|
44
|
+
const earliest = queue.reduce(
|
|
45
|
+
(best, decision, position) => (decision.priority < queue[best].priority ? position : best),
|
|
46
|
+
0,
|
|
47
|
+
);
|
|
48
|
+
const [decision] = queue.splice(earliest, 1);
|
|
49
|
+
const index = idle.pop() ?? 0;
|
|
50
|
+
running.set(index, decision);
|
|
51
|
+
workers[index].postMessage(decision.request);
|
|
52
|
+
}
|
|
53
|
+
};
|
|
54
|
+
const onResponse = (index: number, message: unknown) => {
|
|
55
|
+
const response = message as DecideResponse;
|
|
56
|
+
const decision = running.get(index);
|
|
57
|
+
running.delete(index);
|
|
58
|
+
idle.push(index);
|
|
59
|
+
if ("verdict" in response) decision?.resolve(response);
|
|
60
|
+
else {
|
|
61
|
+
const ErrorClass =
|
|
62
|
+
response.error.name === "TlaProverError" ? TlaProverError : TlaUnsupportedError;
|
|
63
|
+
decision?.reject(new ErrorClass(response.error.message));
|
|
64
|
+
}
|
|
65
|
+
dispatch();
|
|
66
|
+
};
|
|
67
|
+
const terminate = (reason: unknown) => {
|
|
68
|
+
if (state.failure) return;
|
|
69
|
+
state.failure = { reason };
|
|
70
|
+
[...queue.splice(0), ...running.values()].forEach((decision) => decision.reject(reason));
|
|
71
|
+
running.clear();
|
|
72
|
+
workers.forEach((worker) => worker.terminate());
|
|
73
|
+
};
|
|
74
|
+
workers.push(
|
|
75
|
+
...(await Promise.all(
|
|
76
|
+
Array.from({ length: count }, (_, index) =>
|
|
77
|
+
spawnWorker(
|
|
78
|
+
new URL("./prove-worker.js", import.meta.url),
|
|
79
|
+
(message) => onResponse(index, message),
|
|
80
|
+
terminate,
|
|
81
|
+
),
|
|
82
|
+
),
|
|
83
|
+
)),
|
|
84
|
+
);
|
|
85
|
+
idle.push(...workers.keys());
|
|
86
|
+
return {
|
|
87
|
+
decide: (prover, text, options, priority) =>
|
|
88
|
+
new Promise((resolve, reject) => {
|
|
89
|
+
if (state.failure) return reject(state.failure.reason);
|
|
90
|
+
queue.push({
|
|
91
|
+
request: { prover, text, timeLimitMs: options.timeLimitMs },
|
|
92
|
+
priority,
|
|
93
|
+
resolve,
|
|
94
|
+
reject,
|
|
95
|
+
});
|
|
96
|
+
dispatch();
|
|
97
|
+
}),
|
|
98
|
+
terminate,
|
|
99
|
+
};
|
|
100
|
+
};
|
|
@@ -0,0 +1,33 @@
|
|
|
1
|
+
// How each of tla-ts's backends decides the text tlapm would send its prover, by the prover of the
|
|
2
|
+
// method that selects it.
|
|
3
|
+
|
|
4
|
+
import { SmtParseError, TlaProverError } from "../errors";
|
|
5
|
+
import { decideIsabelle } from "./isabelle/decide";
|
|
6
|
+
import { decidePtl } from "./ptl/decide";
|
|
7
|
+
import { decideSmt } from "./smt/solver/solver";
|
|
8
|
+
import type { DecideOptions, Decision, Verdict } from "./verdict";
|
|
9
|
+
import { decideZenon } from "./zenon/decide";
|
|
10
|
+
|
|
11
|
+
// Z3 rejects malformed input with an error, and tlapm counts that as a failure.
|
|
12
|
+
const decideZ3 = (text: string, options: DecideOptions) => {
|
|
13
|
+
try {
|
|
14
|
+
return decideSmt(text, options);
|
|
15
|
+
} catch (error) {
|
|
16
|
+
if (error instanceof SmtParseError) throw new TlaProverError(error.message, error);
|
|
17
|
+
throw error;
|
|
18
|
+
}
|
|
19
|
+
};
|
|
20
|
+
|
|
21
|
+
export const DECIDERS: Record<string, (text: string, options: DecideOptions) => Verdict> = {
|
|
22
|
+
smt: decideZ3,
|
|
23
|
+
z3: decideZ3,
|
|
24
|
+
zenon: (text, options) => decideZenon(text, options).verdict,
|
|
25
|
+
isabelle: decideIsabelle,
|
|
26
|
+
ls4: decidePtl,
|
|
27
|
+
};
|
|
28
|
+
|
|
29
|
+
export const decide = (prover: string, text: string, options: DecideOptions): Decision => {
|
|
30
|
+
const start = performance.now();
|
|
31
|
+
const verdict = DECIDERS[prover](text, options);
|
|
32
|
+
return { verdict, timeUsedMs: performance.now() - start };
|
|
33
|
+
};
|
|
@@ -0,0 +1,36 @@
|
|
|
1
|
+
ISABELLE COPYRIGHT NOTICE, LICENCE AND DISCLAIMER.
|
|
2
|
+
|
|
3
|
+
Copyright (c) 1986-2025,
|
|
4
|
+
University of Cambridge,
|
|
5
|
+
Technische Universitaet Muenchen,
|
|
6
|
+
and contributors.
|
|
7
|
+
|
|
8
|
+
All rights reserved.
|
|
9
|
+
|
|
10
|
+
Redistribution and use in source and binary forms, with or without
|
|
11
|
+
modification, are permitted provided that the following conditions are
|
|
12
|
+
met:
|
|
13
|
+
|
|
14
|
+
* Redistributions of source code must retain the above copyright
|
|
15
|
+
notice, this list of conditions and the following disclaimer.
|
|
16
|
+
|
|
17
|
+
* Redistributions in binary form must reproduce the above copyright
|
|
18
|
+
notice, this list of conditions and the following disclaimer in the
|
|
19
|
+
documentation and/or other materials provided with the distribution.
|
|
20
|
+
|
|
21
|
+
* Neither the name of the University of Cambridge or the Technische
|
|
22
|
+
Universitaet Muenchen nor the names of their contributors may be used
|
|
23
|
+
to endorse or promote products derived from this software without
|
|
24
|
+
specific prior written permission.
|
|
25
|
+
|
|
26
|
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
|
|
27
|
+
IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
|
|
28
|
+
TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
|
|
29
|
+
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
30
|
+
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
31
|
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
32
|
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
33
|
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
34
|
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
35
|
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
36
|
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
@@ -0,0 +1,26 @@
|
|
|
1
|
+
Copyright (c) 2008 INRIA and Microsoft Corporation
|
|
2
|
+
Copyright (c) 2023 Linux Foundation
|
|
3
|
+
|
|
4
|
+
Redistribution and use in source and binary forms, with or without
|
|
5
|
+
modification, are permitted provided that the following conditions are
|
|
6
|
+
met:
|
|
7
|
+
|
|
8
|
+
* Redistributions of source code must retain the above copyright
|
|
9
|
+
notice, this list of conditions and the following disclaimer.
|
|
10
|
+
|
|
11
|
+
* Redistributions in binary form must reproduce the above copyright
|
|
12
|
+
notice, this list of conditions and the following disclaimer in
|
|
13
|
+
the documentation and/or other materials provided with the
|
|
14
|
+
distribution.
|
|
15
|
+
|
|
16
|
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
17
|
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
18
|
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
19
|
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
20
|
+
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
21
|
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
22
|
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
23
|
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
24
|
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
25
|
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
26
|
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
@@ -0,0 +1,47 @@
|
|
|
1
|
+
// Decides a theory tlapm writes for Isabelle, as tlapm's Isabelle backend runs it: use_thy on the
|
|
2
|
+
// heap of Isabelle/TLA+ succeeds or fails.
|
|
3
|
+
|
|
4
|
+
import { TlaIsabelleError } from "../../errors";
|
|
5
|
+
import type { DecideOptions, Verdict } from "../verdict";
|
|
6
|
+
import { parseProofText, terminalProof } from "./isar/method";
|
|
7
|
+
import { getFacts, initGoal } from "./isar/proof";
|
|
8
|
+
import { readStatement } from "./isar/statement";
|
|
9
|
+
import { parseTheory } from "./isar/theory";
|
|
10
|
+
import { protect } from "./pure/logic";
|
|
11
|
+
import { seqHead } from "./pure/seq";
|
|
12
|
+
import { aconv } from "./pure/term";
|
|
13
|
+
import { getProofContext } from "./tla/context";
|
|
14
|
+
import { loadLogic } from "./tla/logic";
|
|
15
|
+
|
|
16
|
+
// V8's error when a recursion runs out of stack. Poly/ML grows its stack instead, until the
|
|
17
|
+
// recursion ends or Isabelle breaks down for lack of memory, which tlapm counts as a failure.
|
|
18
|
+
const isStackOverflow = (error: unknown) =>
|
|
19
|
+
error instanceof RangeError && error.message === "Maximum call stack size exceeded";
|
|
20
|
+
|
|
21
|
+
export const decideIsabelle = (text: string, options: DecideOptions): Exclude<Verdict, "sat"> => {
|
|
22
|
+
const limits = { deadline: Date.now() + options.timeLimitMs, signal: options.signal };
|
|
23
|
+
try {
|
|
24
|
+
const theory = parseTheory(text);
|
|
25
|
+
const logic = loadLogic();
|
|
26
|
+
const statement = readStatement(logic, theory);
|
|
27
|
+
const facts = theory.isUsingAssms ? getFacts(limits, statement) : [];
|
|
28
|
+
const result = seqHead(
|
|
29
|
+
terminalProof(
|
|
30
|
+
getProofContext(logic, limits),
|
|
31
|
+
parseProofText(theory.method),
|
|
32
|
+
facts,
|
|
33
|
+
initGoal(statement),
|
|
34
|
+
),
|
|
35
|
+
);
|
|
36
|
+
// Proof.conclude_goal: the theorem must be the statement, from its assumptions only.
|
|
37
|
+
return result !== undefined &&
|
|
38
|
+
result.tpairs.length === 0 &&
|
|
39
|
+
aconv(result.prop, protect(statement.conclusion)) &&
|
|
40
|
+
result.hyps.every((hyp) => statement.assumptions.some((assumption) => aconv(hyp, assumption)))
|
|
41
|
+
? "unsat"
|
|
42
|
+
: "unknown";
|
|
43
|
+
} catch (error) {
|
|
44
|
+
if (error instanceof TlaIsabelleError || isStackOverflow(error)) return "unknown";
|
|
45
|
+
throw error;
|
|
46
|
+
}
|
|
47
|
+
};
|