tla-ts 0.0.4-dev.6dec595 → 0.0.4-dev.7b5087a
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/errors.ts +86 -0
- package/src/evaluate.ts +28 -7
- 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 +172 -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 +512 -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 +528 -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 +19 -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 -52
- package/src/tlapm-cache.ts +250 -0
- package/src/values.ts +8 -3
- package/src/worker.ts +65 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
|
@@ -0,0 +1,69 @@
|
|
|
1
|
+
// encode/n_axiomatize.ml: the symbols and axioms an encoding needs.
|
|
2
|
+
|
|
3
|
+
import { compareStrings } from "../ocaml";
|
|
4
|
+
import { getSymbolSpec, type CollectState, type SymbolSpec } from "./data";
|
|
5
|
+
import type { Entry, Flattened } from "./flatten";
|
|
6
|
+
import { getTlaName } from "./format";
|
|
7
|
+
import { getAxiomKey, type Axiom } from "./table";
|
|
8
|
+
|
|
9
|
+
// N_axiomatize.collect: each symbol the obligation uses, in the order tlapm visits them, brings
|
|
10
|
+
// the symbols and axioms it depends on, smallest name first.
|
|
11
|
+
export const collectSymbols = (
|
|
12
|
+
entries: Entry[],
|
|
13
|
+
flattened: Map<string, Flattened>,
|
|
14
|
+
anonymous: Map<string, number>,
|
|
15
|
+
recordFields: Map<string, string[]>,
|
|
16
|
+
) => {
|
|
17
|
+
const state: CollectState = {
|
|
18
|
+
recordFields,
|
|
19
|
+
strings: [],
|
|
20
|
+
isFunConstr: false,
|
|
21
|
+
isFunSet: false,
|
|
22
|
+
isExcept: false,
|
|
23
|
+
tuples: [],
|
|
24
|
+
records: [],
|
|
25
|
+
anonymous,
|
|
26
|
+
};
|
|
27
|
+
const symbols = new Map<string, SymbolSpec>();
|
|
28
|
+
const axioms = new Map<string, Axiom>();
|
|
29
|
+
const add = (name: string) => {
|
|
30
|
+
const work = new Set([name]);
|
|
31
|
+
while (work.size > 0) {
|
|
32
|
+
const next = [...work].toSorted(compareStrings)[0];
|
|
33
|
+
work.delete(next);
|
|
34
|
+
if (symbols.has(next)) continue;
|
|
35
|
+
const spec = getSymbolSpec(next, state);
|
|
36
|
+
symbols.set(next, spec);
|
|
37
|
+
spec.deps.forEach((dep) => work.add(dep));
|
|
38
|
+
spec.axioms.forEach((entry) => axioms.set(getAxiomKey(entry), entry));
|
|
39
|
+
}
|
|
40
|
+
};
|
|
41
|
+
// A flattened symbol stands for a builtin applied to its first-order arguments and then its
|
|
42
|
+
// higher-order ones, so its higher-order text is visited after its arguments.
|
|
43
|
+
const visit = (text: string) => {
|
|
44
|
+
const tokens = text.match(/[()]|[^\s()]+/g) ?? [];
|
|
45
|
+
const pending: { depth: number; text: string }[] = [];
|
|
46
|
+
tokens.reduce((depth, token, index) => {
|
|
47
|
+
if (token === "(") return depth + 1;
|
|
48
|
+
if (token === ")") {
|
|
49
|
+
if (pending.at(-1)?.depth === depth) visit(pending.pop()?.text ?? "");
|
|
50
|
+
return depth - 1;
|
|
51
|
+
}
|
|
52
|
+
const flat = flattened.get(token);
|
|
53
|
+
if (!flat) {
|
|
54
|
+
const builtin = getTlaName(token);
|
|
55
|
+
if (builtin !== undefined) add(builtin);
|
|
56
|
+
return depth;
|
|
57
|
+
}
|
|
58
|
+
if (flat.kind !== "") add(flat.kind);
|
|
59
|
+
if (tokens[index - 1] === "(") pending.push({ depth, text: flat.visit });
|
|
60
|
+
else visit(flat.visit);
|
|
61
|
+
return depth;
|
|
62
|
+
}, 0);
|
|
63
|
+
};
|
|
64
|
+
entries.forEach((entry) => {
|
|
65
|
+
if (typeof entry === "string") visit(entry);
|
|
66
|
+
else if ("omitted" in entry) visit(entry.omitted);
|
|
67
|
+
});
|
|
68
|
+
return { symbols, axioms };
|
|
69
|
+
};
|
|
@@ -0,0 +1,210 @@
|
|
|
1
|
+
// encode/n_axioms.ml: the formulas of the axioms that depend on a count or on fields.
|
|
2
|
+
|
|
3
|
+
import {
|
|
4
|
+
call,
|
|
5
|
+
CAST_INT,
|
|
6
|
+
conjoin,
|
|
7
|
+
disjoin,
|
|
8
|
+
forall,
|
|
9
|
+
FUN_APP,
|
|
10
|
+
FUN_DOM,
|
|
11
|
+
FUN_EXCEPT,
|
|
12
|
+
FUN_ISAFCN,
|
|
13
|
+
getNames,
|
|
14
|
+
LEN,
|
|
15
|
+
MEM,
|
|
16
|
+
SEQ,
|
|
17
|
+
tla,
|
|
18
|
+
} from "./format";
|
|
19
|
+
import { axiom, TYPED_SYMBOLS, type Axiom, type AxiomArgument } from "./table";
|
|
20
|
+
|
|
21
|
+
export const getTyping = (name: string, operator: string, arity: number, isGuarded = false) => {
|
|
22
|
+
const symbol = tla(name);
|
|
23
|
+
const variables = arity === 1 ? ["x1"] : isGuarded ? ["x", "y"] : ["x1", "x2"];
|
|
24
|
+
const left = call(
|
|
25
|
+
symbol,
|
|
26
|
+
variables.map((variable) => `(${CAST_INT} ${variable})`),
|
|
27
|
+
);
|
|
28
|
+
const right =
|
|
29
|
+
operator === "<="
|
|
30
|
+
? `(<= ${variables.join(" ")})`
|
|
31
|
+
: `(${CAST_INT} (${operator} ${variables.join(" ")}))`;
|
|
32
|
+
const equality = `(= ${left} ${right})`;
|
|
33
|
+
return axiom(
|
|
34
|
+
"Typing",
|
|
35
|
+
[TYPED_SYMBOLS.indexOf(`T${name}`)],
|
|
36
|
+
forall(variables, isGuarded ? `(=> (> y 0) ${equality})` : equality, [[left]], "Int"),
|
|
37
|
+
`Typing T${name}`,
|
|
38
|
+
);
|
|
39
|
+
};
|
|
40
|
+
|
|
41
|
+
export const TYPINGS: Record<string, () => Axiom> = {
|
|
42
|
+
IntPlus: () => getTyping("IntPlus", "+", 2),
|
|
43
|
+
IntMinus: () => getTyping("IntMinus", "-", 2),
|
|
44
|
+
IntTimes: () => getTyping("IntTimes", "*", 2),
|
|
45
|
+
IntUminus: () => getTyping("IntUminus", "-", 1),
|
|
46
|
+
IntQuotient: () => getTyping("IntQuotient", "div", 2, true),
|
|
47
|
+
IntRemainder: () => getTyping("IntRemainder", "mod", 2, true),
|
|
48
|
+
IntLteq: () => getTyping("IntLteq", "<=", 2),
|
|
49
|
+
};
|
|
50
|
+
|
|
51
|
+
export const getEnumeration = (count: number) => {
|
|
52
|
+
const symbol = tla(`SetEnum_${count}`);
|
|
53
|
+
const elements = getNames("a", count);
|
|
54
|
+
const set = call(symbol, elements);
|
|
55
|
+
const elim = axiom(
|
|
56
|
+
"EnumDefElim",
|
|
57
|
+
[count],
|
|
58
|
+
forall(
|
|
59
|
+
[...elements, "x"],
|
|
60
|
+
count === 0
|
|
61
|
+
? `(not (${MEM} x ${set}))`
|
|
62
|
+
: `(=> (${MEM} x ${set}) ${disjoin(elements.map((element) => `(= x ${element})`))})`,
|
|
63
|
+
[[`(${MEM} x ${set})`]],
|
|
64
|
+
),
|
|
65
|
+
);
|
|
66
|
+
if (count === 0) return [elim];
|
|
67
|
+
const intro = axiom(
|
|
68
|
+
"EnumDefIntro",
|
|
69
|
+
[count],
|
|
70
|
+
forall(elements, conjoin(elements.map((element) => `(${MEM} ${element} ${set})`)), [[set]]),
|
|
71
|
+
);
|
|
72
|
+
return [intro, elim];
|
|
73
|
+
};
|
|
74
|
+
|
|
75
|
+
export const getIntegers = (count: number) =>
|
|
76
|
+
Array.from({ length: count }, (_value, index) => `(${CAST_INT} ${index + 1})`);
|
|
77
|
+
|
|
78
|
+
// TupExcept and RecExcept: updating one component of a tuple or record.
|
|
79
|
+
export const getComponentExcept = (
|
|
80
|
+
name: string,
|
|
81
|
+
args: AxiomArgument[],
|
|
82
|
+
symbol: string,
|
|
83
|
+
keys: string[],
|
|
84
|
+
index: number,
|
|
85
|
+
) => {
|
|
86
|
+
const elements = getNames("x", keys.length);
|
|
87
|
+
const updated = `(${FUN_EXCEPT} ${call(symbol, elements)} ${keys[index]} x)`;
|
|
88
|
+
const replaced = elements.map((element, position) => (position === index ? "x" : element));
|
|
89
|
+
return axiom(
|
|
90
|
+
name,
|
|
91
|
+
[...args, index + 1],
|
|
92
|
+
forall([...elements, "x"], `(= ${updated} ${call(symbol, replaced)})`, [[updated]]),
|
|
93
|
+
);
|
|
94
|
+
};
|
|
95
|
+
|
|
96
|
+
export const getTupleAxioms = (count: number, isExcept: boolean) => {
|
|
97
|
+
const symbol = tla(`Tuple_${count}`);
|
|
98
|
+
const elements = getNames("x", count);
|
|
99
|
+
const value = call(symbol, elements);
|
|
100
|
+
const keys = getIntegers(count);
|
|
101
|
+
return [
|
|
102
|
+
axiom("TupIsafcn", [count], forall(elements, `(${FUN_ISAFCN} ${value})`, [[value]])),
|
|
103
|
+
...(count === 0
|
|
104
|
+
? []
|
|
105
|
+
: [
|
|
106
|
+
axiom(
|
|
107
|
+
"TupDomDef",
|
|
108
|
+
[count],
|
|
109
|
+
forall(elements, `(= (${FUN_DOM} ${value}) ${call(tla(`SetEnum_${count}`), keys)})`, [
|
|
110
|
+
[value],
|
|
111
|
+
]),
|
|
112
|
+
),
|
|
113
|
+
axiom(
|
|
114
|
+
"TupAppDef",
|
|
115
|
+
[count],
|
|
116
|
+
forall(
|
|
117
|
+
elements,
|
|
118
|
+
conjoin(
|
|
119
|
+
keys.map((key, index) => `(= (${FUN_APP} ${value} ${key}) ${elements[index]})`),
|
|
120
|
+
),
|
|
121
|
+
[[value]],
|
|
122
|
+
),
|
|
123
|
+
),
|
|
124
|
+
]),
|
|
125
|
+
axiom(
|
|
126
|
+
"SeqTupTyping",
|
|
127
|
+
[count],
|
|
128
|
+
forall(
|
|
129
|
+
["a", ...elements],
|
|
130
|
+
count === 0
|
|
131
|
+
? `(${MEM} ${value} (${SEQ} a))`
|
|
132
|
+
: `(=> ${conjoin(elements.map((element) => `(${MEM} ${element} a)`))} (${MEM} ${value} (${SEQ} a)))`,
|
|
133
|
+
[[...elements.map((element) => `(${MEM} ${element} a)`), value]],
|
|
134
|
+
),
|
|
135
|
+
),
|
|
136
|
+
axiom(
|
|
137
|
+
"SeqTupLen",
|
|
138
|
+
[count],
|
|
139
|
+
forall(elements, `(= (${LEN} ${value}) (${CAST_INT} ${count}))`, [[value]]),
|
|
140
|
+
),
|
|
141
|
+
...(isExcept
|
|
142
|
+
? keys.map((_key, index) => getComponentExcept("TupExcept", [count], symbol, keys, index))
|
|
143
|
+
: []),
|
|
144
|
+
];
|
|
145
|
+
};
|
|
146
|
+
|
|
147
|
+
export const getRecordAxioms = (fields: string[], isExcept: boolean) => {
|
|
148
|
+
const symbol = tla(`Record_${fields.join("_")}`);
|
|
149
|
+
const keys = fields.map((field) => tla(`StrLit_${field}`));
|
|
150
|
+
const elements = getNames("x", fields.length);
|
|
151
|
+
const value = call(symbol, elements);
|
|
152
|
+
return [
|
|
153
|
+
axiom("RecIsafcn", [fields], forall(elements, `(${FUN_ISAFCN} ${value})`, [[value]])),
|
|
154
|
+
axiom(
|
|
155
|
+
"RecDomDef",
|
|
156
|
+
[fields],
|
|
157
|
+
forall(elements, `(= (${FUN_DOM} ${value}) ${call(tla(`SetEnum_${fields.length}`), keys)})`, [
|
|
158
|
+
[value],
|
|
159
|
+
]),
|
|
160
|
+
),
|
|
161
|
+
axiom(
|
|
162
|
+
"RecAppDef",
|
|
163
|
+
[fields],
|
|
164
|
+
forall(
|
|
165
|
+
elements,
|
|
166
|
+
conjoin(keys.map((key, index) => `(= (${FUN_APP} ${value} ${key}) ${elements[index]})`)),
|
|
167
|
+
[[value]],
|
|
168
|
+
),
|
|
169
|
+
),
|
|
170
|
+
...(isExcept
|
|
171
|
+
? keys.map((_key, index) => getComponentExcept("RecExcept", [fields], symbol, keys, index))
|
|
172
|
+
: []),
|
|
173
|
+
];
|
|
174
|
+
};
|
|
175
|
+
|
|
176
|
+
// The set of tuples or records whose components are in the given sets.
|
|
177
|
+
export const getComponentSet = (
|
|
178
|
+
name: string,
|
|
179
|
+
args: AxiomArgument[],
|
|
180
|
+
set: string,
|
|
181
|
+
value: string,
|
|
182
|
+
keys: string[],
|
|
183
|
+
variable: string,
|
|
184
|
+
) => {
|
|
185
|
+
const sets = getNames("s", keys.length);
|
|
186
|
+
const elements = getNames("x", keys.length);
|
|
187
|
+
const members = call(set, sets);
|
|
188
|
+
const built = call(value, elements);
|
|
189
|
+
const projections = keys.map((key) => `(${FUN_APP} ${variable} ${key})`);
|
|
190
|
+
return [
|
|
191
|
+
axiom(
|
|
192
|
+
`${name}Intro`,
|
|
193
|
+
args,
|
|
194
|
+
forall(
|
|
195
|
+
[...sets, ...elements],
|
|
196
|
+
`(=> ${conjoin(elements.map((element, index) => `(${MEM} ${element} ${sets[index]})`))} (${MEM} ${built} ${members}))`,
|
|
197
|
+
[[built, members]],
|
|
198
|
+
),
|
|
199
|
+
),
|
|
200
|
+
axiom(
|
|
201
|
+
`${name}Elim`,
|
|
202
|
+
args,
|
|
203
|
+
forall(
|
|
204
|
+
[...sets, variable],
|
|
205
|
+
`(=> (${MEM} ${variable} ${members}) ${conjoin([`(= ${variable} ${call(value, projections)})`, ...projections.map((projection, index) => `(${MEM} ${projection} ${sets[index]})`)])})`,
|
|
206
|
+
[[`(${MEM} ${variable} ${members})`]],
|
|
207
|
+
),
|
|
208
|
+
),
|
|
209
|
+
];
|
|
210
|
+
};
|
|
@@ -0,0 +1,108 @@
|
|
|
1
|
+
// ctx.ml and backend/smtlib.ml's naming: each name is salted past the names in scope.
|
|
2
|
+
|
|
3
|
+
import { formatName } from "./format";
|
|
4
|
+
|
|
5
|
+
// A quantifier's variables, in scope until the quantifier's closing parenthesis.
|
|
6
|
+
interface QuantifierScope {
|
|
7
|
+
depth: number;
|
|
8
|
+
exits: (() => void)[];
|
|
9
|
+
}
|
|
10
|
+
|
|
11
|
+
export interface Identifier {
|
|
12
|
+
base: string;
|
|
13
|
+
salt: number;
|
|
14
|
+
name: string;
|
|
15
|
+
}
|
|
16
|
+
|
|
17
|
+
const getSaltedName = (base: string, salt: number) => (salt === 0 ? base : `${base}_${salt}`);
|
|
18
|
+
|
|
19
|
+
// Ctx.maybe_adj: a name is its formatted base, salted past the last one with that base and past
|
|
20
|
+
// every name in scope.
|
|
21
|
+
export const createContext = () => {
|
|
22
|
+
const salts = new Map<string, number>();
|
|
23
|
+
const names = new Set<string>();
|
|
24
|
+
const adjoin = (raw: string): Identifier => {
|
|
25
|
+
const base = formatName(raw);
|
|
26
|
+
const start = (salts.get(base) ?? -1) + 1;
|
|
27
|
+
const salt =
|
|
28
|
+
Array.from({ length: names.size + 1 }, (_value, index) => start + index).find(
|
|
29
|
+
(candidate) => !names.has(getSaltedName(base, candidate)),
|
|
30
|
+
) ?? start;
|
|
31
|
+
return { base, salt, name: getSaltedName(base, salt) };
|
|
32
|
+
};
|
|
33
|
+
// Brings an identifier into scope and returns how to take it out again.
|
|
34
|
+
const enter = (identifier: Identifier) => {
|
|
35
|
+
const previous = salts.get(identifier.base);
|
|
36
|
+
salts.set(identifier.base, identifier.salt);
|
|
37
|
+
names.add(identifier.name);
|
|
38
|
+
return () => {
|
|
39
|
+
names.delete(identifier.name);
|
|
40
|
+
if (previous === undefined) salts.delete(identifier.base);
|
|
41
|
+
else salts.set(identifier.base, previous);
|
|
42
|
+
};
|
|
43
|
+
};
|
|
44
|
+
return { names, adjoin, enter };
|
|
45
|
+
};
|
|
46
|
+
|
|
47
|
+
// Smtlib.pp_print_obligation names each declaration for the rest of the obligation, and each
|
|
48
|
+
// quantifier's variables within it, so a variable's name depends on the names in scope.
|
|
49
|
+
export const createPrinter = (declared: Map<string, Identifier>) => {
|
|
50
|
+
const context = createContext();
|
|
51
|
+
const resolve = (line: string) => {
|
|
52
|
+
const declaration = /^\(declare-fun (\S+)/.exec(line)?.[1];
|
|
53
|
+
if (declaration !== undefined) {
|
|
54
|
+
const identifier = declared.get(declaration);
|
|
55
|
+
if (identifier) context.enter(identifier);
|
|
56
|
+
else context.names.add(declaration);
|
|
57
|
+
return line;
|
|
58
|
+
}
|
|
59
|
+
const tokens = [...line.matchAll(/\|[^|]*\||[()]|[^\s()|]+/g)];
|
|
60
|
+
const replacements = new Map<number, string>();
|
|
61
|
+
const renames = new Map<string, string[]>();
|
|
62
|
+
const scopes: QuantifierScope[] = [];
|
|
63
|
+
const state = { index: 0, depth: 0 };
|
|
64
|
+
while (state.index < tokens.length) {
|
|
65
|
+
const token = tokens[state.index][0];
|
|
66
|
+
const isQuantifier =
|
|
67
|
+
token === "(" &&
|
|
68
|
+
(tokens[state.index + 1]?.[0] === "forall" || tokens[state.index + 1]?.[0] === "exists") &&
|
|
69
|
+
tokens[state.index + 2]?.[0] === "(";
|
|
70
|
+
if (isQuantifier) {
|
|
71
|
+
state.depth++;
|
|
72
|
+
const scope: QuantifierScope = { depth: state.depth, exits: [] };
|
|
73
|
+
scopes.push(scope);
|
|
74
|
+
state.index += 3;
|
|
75
|
+
while (tokens[state.index]?.[0] === "(") {
|
|
76
|
+
const raw = tokens[state.index + 1][0];
|
|
77
|
+
const identifier = context.adjoin(raw.replace(/#\d+$/, ""));
|
|
78
|
+
const stack = renames.get(raw) ?? [];
|
|
79
|
+
renames.set(raw, [...stack, identifier.name]);
|
|
80
|
+
scope.exits.push(context.enter(identifier), () => renames.set(raw, stack));
|
|
81
|
+
replacements.set(state.index + 1, identifier.name);
|
|
82
|
+
state.index += 4;
|
|
83
|
+
}
|
|
84
|
+
state.index++;
|
|
85
|
+
continue;
|
|
86
|
+
}
|
|
87
|
+
if (token === "(") state.depth++;
|
|
88
|
+
if (token === ")") {
|
|
89
|
+
if (scopes.at(-1)?.depth === state.depth)
|
|
90
|
+
scopes
|
|
91
|
+
.pop()
|
|
92
|
+
?.exits.toReversed()
|
|
93
|
+
.forEach((exit) => exit());
|
|
94
|
+
state.depth--;
|
|
95
|
+
}
|
|
96
|
+
const name = renames.get(token)?.at(-1);
|
|
97
|
+
if (name !== undefined) replacements.set(state.index, name);
|
|
98
|
+
state.index++;
|
|
99
|
+
}
|
|
100
|
+
return tokens
|
|
101
|
+
.map((match, index) => {
|
|
102
|
+
const end = tokens[index + 1]?.index ?? line.length;
|
|
103
|
+
return `${replacements.get(index) ?? match[0]}${line.slice(match.index + match[0].length, end)}`;
|
|
104
|
+
})
|
|
105
|
+
.join("");
|
|
106
|
+
};
|
|
107
|
+
return { resolve };
|
|
108
|
+
};
|